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
Finding odd cycle transversals
Operations Research Letters
An improved parameterized algorithm for the minimum node multiway cut problem
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Proceedings of the forty-third annual ACM symposium on Theory of computing
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
Compression via matroids: a randomized polynomial kernel for odd cycle transversal
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
On multiway cut parameterized above lower bounds
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
On the parameterized complexity of finding separators with non-hereditary properties
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.00 |
In this article, we consider problems on graphs of the followingform: given a graph, remove p edges/vertices to achieve some property.The first kind of problems are separation problems on undirectedgraphs, where we aim at separating distinguished vertices in an graph.The second kind of problems are feedback set problems on group-labelled graphs, where we aim at breaking nonnull cycles in a group-labelled graph. We obtain new FPT algorithms for these different problems. Abuilding stone for our algorithms is a general O*(4p) algorithm for a classof problems aiming at breaking a set of paths in a graph, provided thatthe set of paths has a special property called homogeneity.