Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Daniel Lokshtanov
Parameterized Complexity and Approximability of Directed Odd Cycle Transversal
2-Approximating Feedback Vertex Set in Tournaments
Linear Kernels for (Connected) Dominating Set onH-minor-free Graphs
‹
1
2
Related publications
Parameterized Complexity and Approximability of Coverability Problems in Weighted Petri Nets
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Parameterized Proof Complexity
Computational Complexity
Mathematics
Computational Mathematics
Theoretical Computer Science
Computational Theory
Minimum-Weight Cycle Covers and Their Approximability
Discrete Applied Mathematics
Combinatorics
Applied Mathematics
Discrete Mathematics
Correction To: Weighted Upper Edge Cover: Complexity and Approximability
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Approximation and Parameterized Complexity of Minimax Approval Voting
Journal of Artificial Intelligence Research
Artificial Intelligence
On the Space Complexity of Parameterized Problems
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Parameterized Complexity of Cardinality Constrained Optimization Problems
Computer Journal
Computer Science
The Quadratic Shortest Path Problem: Complexity, Approximability, and Solution Methods
European Journal of Operational Research
Information Systems
Simulation
Management Science
Management
Computer Science
Modeling
Operations Research
Parameterized Complexity of Generalized Vertex Cover Problems
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
