The Complexity of Multiterminal Cuts
SIAM Journal on Computing
Parameterizing above guaranteed values: MaxSat and MaxCut
Journal of Algorithms
Multiway cuts in node weighted graphs
Journal of Algorithms
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
A fixed-parameter algorithm for the directed feedback vertex set problem
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
On the parameterized complexity of multiple-interval graph problems
Theoretical Computer Science
Almost 2-SAT is fixed-parameter tractable
Journal of Computer and System Sciences
Simple and Improved Parameterized Algorithms for Multiterminal Cuts
Theory of Computing Systems - Special Issue: Symposium on Computer Science; Guest Editors: Sergei Artemov, Volker Diekert and Alexander Razborov
FPT algorithms for path-transversals and cycle-transversals problems in graphs
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Vertex Cover Problem Parameterized Above and Below Tight Bounds
Theory of Computing Systems
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
Paths, flowers and vertex cover
ESA'11 Proceedings of the 19th European conference on Algorithms
Important separators and parameterized algorithms
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Generalized above guarantee vertex cover and r-partization
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Parameterized complexity of maxsat above average
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
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
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
Deterministic parameterized connected vertex cover
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
New races in parameterized algorithmics
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
European Journal of Combinatorics
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)
Solving min ones 2-sat as fast as vertex cover
Theoretical Computer Science
Parameterized complexity of MaxSat Above Average
Theoretical Computer Science
| Hi-index | 0.00 |
In this paper we consider two above lower bound parameterizations of the NodeMultiway Cut problem -- above the maximum separating cut and above a natural LP-relaxation -- and prove them to be fixed-parameter tractable. Our results imply O*(4k) algorithms for Vertex Coverabove Maximum Matching and Almost 2-SAT as well as an O*(2k) algorithm for NodeMultiway Cut with a standard parameterization by the solution size, improving previous bounds for these problems.