Finding good approximate vertex and edge partitions is NP-hard
Information Processing Letters
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
The Complexity of Multiterminal Cuts
SIAM Journal on Computing
Multiway cuts in node weighted graphs
Journal of Algorithms
Tight Lower Bounds for Certain Parameterized NP-Hard Problems
CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
Parameterized Complexity
A logical approach to multicut problems
Information Processing Letters
Constant ratio fixed-parameter approximation of the edge multicut problem
Information Processing Letters
Almost 2-SAT is fixed-parameter tractable
Journal of Computer and System Sciences
FPT algorithms for path-transversals and cycle-transversals problems in graphs
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Algorithms for multiterminal cuts
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Proceedings of the forty-third annual ACM symposium on Theory of computing
Fixed-parameter tractability of multicut parameterized by the size of the cutset
Proceedings of the forty-third annual ACM symposium on Theory of computing
How to cut a graph into many pieces
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
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
Clustering with local restrictions
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Multicut in trees viewed through the eyes of vertex cover
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Paths, flowers and vertex cover
ESA'11 Proceedings of the 19th European conference on Algorithms
Compression via matroids: a randomized polynomial kernel for odd cycle transversal
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
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
Multicut algorithms via tree decompositions
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Important separators and parameterized algorithms
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Restricted vertex multicut on permutation graphs
Discrete Applied Mathematics
On multiway cut parameterized above lower bounds
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
On polynomial kernels for structural parameterizations of odd cycle transversal
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Multicut in trees viewed through the eyes of vertex cover
Journal of Computer and System Sciences
FPT algorithms for path-transversal and cycle-transversal problems
Discrete Optimization
Fixed-Parameter tractability of almost CSP problem with decisive relations
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Efficient and secure decentralized network size estimation
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part I
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
Clique cover and graph separation: new incompressibility results
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
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
Parameterized tractability of multiway cut with parity constraints
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
An improved parameterized algorithm for the minimum node multiway cut problem
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Clustering with local restrictions
Information and Computation
FPTASs for trimming weighted trees
Theoretical Computer Science
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 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
On multiway cut parameterized above lower bounds
ACM Transactions on Computation Theory (TOCT)
Testing subdivision-freeness: property testing meets structural graph theory
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Finding small separators in linear time via treewidth reduction
ACM Transactions on Algorithms (TALG)
An o *(1.84 k) parameterized algorithm for the multiterminal cut problem
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
A faster FPT algorithm for Bipartite Contraction
Information Processing Letters
An O*(1.84k) parameterized algorithm for the multiterminal cut problem
Information Processing Letters
| Hi-index | 0.02 |
We consider parameterized problems where some separation property has to be achieved by deleting as few vertices as possible. The following five problems are studied: delete k vertices such that (a) each of the given l terminals is separated from the others, (b) each of the given l pairs of terminals is separated, (c) exactly l vertices are cut away from the graph, (d) exactly l connected vertices are cut away from the graph, (e) the graph is separated into at least l components. We show that if both k and l are parameters, then (a), (b) and (d) are fixed-parameter tractable, while (c) and (e) are W[1]-hard.