Fixed-parameter tractability and completeness II: on completeness for W[1]
Theoretical Computer Science
Fixed-Parameter Tractability and Completeness I: Basic Results
SIAM Journal on Computing
Checking that finite state concurrent programs satisfy their linear specification
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
SIAM Journal on Discrete Mathematics
Vertex cover: further observations and further improvements
Journal of Algorithms
Operating System Concepts, 4th Ed.
Operating System Concepts, 4th Ed.
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On Linear Time Minor Tests and Depth First Search
WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
Parameterized algorithms for feedback set problems and their duals in tournaments
Theoretical Computer Science - Parameterized and exact computation
Faster fixed parameter tractable algorithms for finding feedback vertex sets
ACM Transactions on Algorithms (TALG)
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
Journal of Computer and System Sciences
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
A cubic kernel for feedback vertex set
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
An O(2O(k)n3) FPT algorithm for the undirected feedback vertex set problem*
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Fixed-parameter tractability results for feedback set problems in tournaments
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Improved fixed-parameter algorithms for two feedback set problems
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Finding odd cycle transversals
Operations Research Letters
Improved algorithms for the feedback vertex set problems
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
An improved parameterized algorithm for the minimum node multiway cut problem
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Parameterized Complexity
Some Parameterized Problems On Digraphs
The Computer Journal
Fixed-Parameter Algorithms for Kemeny Scores
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Iterative Compression and Exact Algorithms
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Improved algorithms for feedback vertex set problems
Journal of Computer and System Sciences
A quadratic kernel for feedback vertex set
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Parameterized complexity of finding regular induced subgraphs
Journal of Discrete Algorithms
Iterative Compression for Exactly Solving NP-Hard Minimization Problems
Algorithmics of Large and Complex Networks
Almost 2-SAT is fixed-parameter tractable
Journal of Computer and System Sciences
A 4k2 kernel for feedback vertex set
ACM Transactions on Algorithms (TALG)
Parameterized complexity and approximability of the SLCS problem
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
A linear kernel for planar feedback vertex set
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
The parameterized complexity of editing graphs for bounded degeneracy
Theoretical Computer Science
Proceedings of the forty-third annual ACM symposium on Theory of computing
Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree
ACM Transactions on Algorithms (TALG)
Hardness of subgraph and supergraph problems in c-tournaments
Theoretical Computer Science
Subset feedback vertex set is fixed-parameter tractable
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
On multiway cut parameterized above lower bounds
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Parameterized complexity and approximability of the Longest Compatible Sequence problem
Discrete Optimization
FPT suspects and tough customers: open problems of downey and fellows
The Multivariate Algorithmic Revolution and Beyond
Directed subset feedback vertex set is fixed-parameter tractable
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
On multiway cut parameterized above lower bounds
ACM Transactions on Computation Theory (TOCT)
| Hi-index | 0.00 |
The (parameterized) feedback vertex set problem on directed graphs, which we refer to as the dfvs problem, is defined as follows: given a directed graph G and a parameter k, either construct a feedback vertex set of at most k vertices in G or report that no such set exists. Whether or not the dfvs problem is fixed-parameter tractable has been a well-known open problem in parameterized computation and complexity, i.e., whether the problem can be solved in time f(k)nO(1) for some function f. In this paper we develop new algorithmic techniques that result in an algorithm with running time 4k k! nO(1) for the dfvs problem, thus showing that this problem is fixed-parameter tractable.