On the complexity of H-coloring
Journal of Combinatorial Theory Series B
Graph rewriting: an algebraic and logic approach
Handbook of theoretical computer science (vol. B)
Graph searching and a min-max theorem for tree-width
Journal of Combinatorial Theory Series B
Fixed-parameter tractability of graph modification problems for hereditary properties
Information Processing Letters
The complexity of restricted graph homomorphisms
Discrete Mathematics
The complexity of H-colouring of bounded degree graphs
Discrete Mathematics
(H, C, K)-Coloring: Fast, Easy, and Hard Cases
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Acyclic Homomorphisms and Circular Colorings of Digraphs
SIAM Journal on Discrete Mathematics
Machine Learning
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Finding small balanced separators
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Parameterized graph separation problems
Theoretical Computer Science - Parameterized and exact computation
Correlation clustering in general weighted graphs
Theoretical Computer Science - Approximation and online algorithms
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
Journal of Computer and System Sciences
A logical approach to multicut problems
Information Processing Letters
Fourier meets möbius: fast subset convolution
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
A dichotomy for minimum cost graph homomorphisms
European Journal of Combinatorics
Efficient algorithms for counting parameterized list H-colorings
Journal of Computer and System Sciences
A fixed-parameter algorithm for the directed feedback vertex set problem
Journal of the ACM (JACM)
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
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
Simpler Parameterized Algorithm for OCT
Combinatorial Algorithms
On Contracting Graphs to Fixed Pattern Graphs
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
The restrictive H-coloring problem
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Clustering with partial information
Theoretical Computer Science
Fixed-Parameter Algorithms for Cluster Vertex Deletion
Theory of Computing Systems - Special Section: Algorithmic Game Theory; Guest Editors: Burkhard Monien and Ulf-Peter Schroeder
Chordal Deletion is Fixed-Parameter Tractable
Algorithmica
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
Wheel-free deletion is W[2]-hard
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Minimum cost homomorphisms to reflexive digraphs
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Saving space by algebraization
Proceedings of the forty-second ACM symposium on Theory of computing
An (almost) linear time algorithm for odd cycles transversal
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Contractions of planar graphs in polynomial time
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
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
Edge contractions in subclasses of chordal graphs
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Treewidth: characterizations, applications, and computations
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Finding contractions and induced minors in chordal graphs via disjoint paths
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
On multiway cut parameterized above lower bounds
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Contracting graphs to paths and trees
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Increasing the minimum degree of a graph by contractions
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
FPT algorithms for path-transversal and cycle-transversal problems
Discrete Optimization
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
Parameterized Complexity
An Overview of Techniques for Designing Parameterized Algorithms
The Computer Journal
A faster FPT algorithm for Bipartite Contraction
Information Processing Letters
Hi-index | 0.00 |
We present a method for reducing the treewidth of a graph while preserving all of its minimal s-t separators up to a certain fixed size k. This technique allows us to solve s-t Cut and Multicut problems with various additional restrictions (e.g., the vertices being removed from the graph form an independent set or induce a connected graph) in linear time for every fixed number k of removed vertices. Our results have applications for problems that are not directly defined by separators, but the known solution methods depend on some variant of separation. For example, we can solve similarly restricted generalizations of Bipartization (delete at most k vertices from G to make it bipartite) in almost linear time for every fixed number k of removed vertices. These results answer a number of open questions in the area of parameterized complexity. Furthermore, our technique turns out to be relevant for (H, C, K)- and (H, C,≤K)-coloring problems as well, which are cardinality constrained variants of the classical H-coloring problem. We make progress in the classification of the parameterized complexity of these problems by identifying new cases that can be solved in almost linear time for every fixed cardinality bound.