On the power of unique 2-prover 1-round games
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Multiway Cuts in Directed and Node Weighted Graphs
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized graph separation problems
Theoretical Computer Science - Parameterized and exact computation
Packing Non-Zero A-Paths In Group-Labelled Graphs
Combinatorica
Non-zero disjoint cycles in highly connected group labelled graphs
Journal of Combinatorial Theory Series B
A fixed-parameter algorithm for the directed feedback vertex set problem
Journal of the ACM (JACM)
Improved algorithms for feedback vertex set problems
Journal of Computer and System Sciences
Iterative Compression for Exactly Solving NP-Hard Minimization Problems
Algorithmics of Large and Complex Networks
Algorithms for multiterminal cuts
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Finding odd cycle transversals
Operations Research Letters
Parameterized Complexity
Fixed-parameter tractability of multicut parameterized by the size of the cutset
Proceedings of the forty-third annual ACM symposium on Theory of computing
Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
FPT suspects and tough customers: open problems of downey and fellows
The Multivariate Algorithmic Revolution and Beyond
What's next? future directions in parameterized complexity
The Multivariate Algorithmic Revolution and Beyond
Fixed-parameter tractability of multicut in directed acyclic graphs
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
On group feedback vertex set parameterized by the size of the cutset
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
On multiway cut parameterized above lower bounds
ACM Transactions on Computation Theory (TOCT)
Finding small separators in linear time via treewidth reduction
ACM Transactions on Algorithms (TALG)
A faster FPT algorithm for Bipartite Contraction
Information Processing Letters
| Hi-index | 0.00 |
We study the parameterized complexity of several vertex- and edge-deletion problems on graphs, parameterized by the number p of deletions. The first kind of problems are separation problems on undirected graphs, where we aim at separating distinguished vertices in a graph. The second kind of problems are feedback set problems on group-labelled graphs, where we aim at breaking nonnull cycles in a graph having its arcs labelled by elements of a group. We obtain new FPT algorithms for these different problems, relying on a generic O^*(4^p) algorithm for breaking paths of a homogeneous path system.