Graph minors and parameterized algorithm design

Authors:
Dimitrios M. Thilikos
Affiliations:
Department of Mathematics, National and Kapodistrian University of Athens, Athens, Greece
Venue:
The Multivariate Algorithmic Revolution and Beyond
Year:
2012

Citing 83
Cited 2

Graph minors. V. Excluding a planar graph

Journal of Combinatorial Theory Series B
The NP-completeness column: an ongoing guide

Journal of Algorithms
Easy problems for tree-decomposable graphs

Journal of Algorithms
Graph minors: X. obstructions to tree-decomposition

Journal of Combinatorial Theory Series B
Graph algorithms

Handbook of theoretical computer science (vol. A)
Finding approximate separators and computing tree width quickly

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On obstructions to small face covers in planar graphs

Journal of Combinatorial Theory Series B
Minimal acyclic forbidden minors for the family of graphs with bounded path-width

Discrete Mathematics - Special issue on graph theory and applications
The vertex separation and search number of a graph

Information and Computation
Quickly excluding a planar graph

Journal of Combinatorial Theory Series B
Regular Article: On search, decision, and the efficiency of polynomial-time algorithms

Proceedings of the 30th IEEE symposium on Foundations of computer science
Beyond NP-completeness for problems of bounded width (extended abstract): hardness for the W hierarchy

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Graph minors. XIII: the disjoint paths problem

Journal of Combinatorial Theory Series B
Efficient parallel algorithms for graphs of bounded tree-width

Journal of Algorithms
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

SIAM Journal on Computing
The Structure and Number of Obstructions to Treewidth

SIAM Journal on Discrete Mathematics
Upper bounds on the size of obstructions and intertwines

Journal of Combinatorial Theory Series B
A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface

SIAM Journal on Discrete Mathematics
Highly connected sets and the excluded grid theorem

Journal of Combinatorial Theory Series B
On computing graph minor obstruction sets

Theoretical Computer Science
Graph minors

Journal of Combinatorial Theory Series B
Algorithms and obstructions for linear-width and related search parameters

Discrete Applied Mathematics
The Complexity of First-Order and Monadic Second-Order Logic Revisited

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Dynamic Programming on Graphs with Bounded Treewidth

ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
Improved Tree Decomposition Based Algorithms for Domination-like Problems

LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
The structure of obstructions to treewidth and pathwidth

Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
On the excluded minors for the matroids of branch-width k

Journal of Combinatorial Theory Series B
On the existence of subexponential parameterized algorithms

Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Bidimensional Parameters and Local Treewidth

SIAM Journal on Discrete Mathematics
Space-efficient construction variants of dynamic programming

Nordic Journal of Computing
Graph Minors. XX. Wagner's conjecture

Journal of Combinatorial Theory Series B - Special issue dedicated to professor W. T. Tutte
Bidimensionality: new connections between FPT algorithms and PTASs

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs

Journal of the ACM (JACM)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
The Bidimensional Theory of Bounded-Genus Graphs

SIAM Journal on Discrete Mathematics
Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up

SIAM Journal on Computing
Fourier meets möbius: fast subset convolution

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Locally Excluding a Minor

LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Dynamic programming and fast matrix multiplication

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Half integral packing, Erdős-Posá-property and graph minors

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Catalan structures and dynamic programming in H-minor-free graphs

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Computing excluded minors

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Linearity of grid minors in treewidth with applications through bidimensionality

Combinatorica
A Simpler Linear Time Algorithm for Embedding Graphs into an Arbitrary Surface and the Genus of Graphs of Bounded Tree-Width

FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Algorithms for finding an induced cycle in planar graphs and bounded genus graphs

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Graph minors. XXI. Graphs with unique linkages

Journal of Combinatorial Theory Series B
Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner’s Contraction

Algorithmica
Hadwiger's conjecture is decidable

Proceedings of the forty-first annual ACM symposium on Theory of computing
A Practical Approach to Courcelle's Theorem

Electronic Notes in Theoretical Computer Science (ENTCS)
Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology

Combinatorial Algorithms
Induced Packing of Odd Cycles in a Planar Graph

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs

Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Approximation Algorithms for Treewidth

Algorithmica
(Meta) Kernelization

FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Planarity Allowing Few Error Vertices in Linear Time

FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Graph minors XXIII. Nash-Williams' immersion conjecture

Journal of Combinatorial Theory Series B
Chordal Deletion is Fixed-Parameter Tractable

Algorithmica
Odd cycle packing

Proceedings of the forty-second ACM symposium on Theory of computing
Linkless and flat embeddings in 3-space and the unknot problem

Proceedings of the twenty-sixth annual symposium on Computational geometry
Recognizing a totally odd K4-subdivision, parity 2-disjoint rooted paths and a parity cycle through specified elements

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
The edge disjoint paths problem in Eulerian graphs and 4-edge-connected graphs

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
On brambles, grid-like minors, and parameterized intractability of monadic second-order logic

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Bidimensionality and kernels

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Dynamic programming for graphs on surfaces

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Fast minor testing in planar graphs

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Contraction obstructions for treewidth

Journal of Combinatorial Theory Series B
Finding topological subgraphs is fixed-parameter tractable

Proceedings of the forty-third annual ACM symposium on Theory of computing
Subexponential algorithms for partial cover problems

Information Processing Letters
Tight bounds for linkages in planar graphs

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Parameterized complexity of vertex deletion into perfect graph classes

FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Parameterizing cut sets in a graph by the number of their components

Theoretical Computer Science
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time

FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
Linear kernels for (connected) dominating set on H-minor-free graphs

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Finding an induced path of given parity in planar graphs in polynomial time

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Bidimensionality and geometric graphs

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Fast subexponential algorithm for non-local problems on graphs of bounded genus

SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Polynomial treewidth forces a large grid-like-minor

European Journal of Combinatorics
Bidimensionality and EPTAS

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Slightly superexponential parameterized problems

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The disjoint paths problem in quadratic time

Journal of Combinatorial Theory Series B
Obtaining a Planar Graph by Vertex Deletion

Algorithmica
Tree decompositions of graphs: Saving memory in dynamic programming

Discrete Optimization
Parameterized Complexity

Parameterized Complexity

A basic parameterized complexity primer

The Multivariate Algorithmic Revolution and Beyond
What's next? future directions in parameterized complexity

The Multivariate Algorithmic Revolution and Beyond

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Graph Minors Theory, developed by Robertson and Seymour, has been one of the most influential mathematical theories in parameterized algorithm design. We present some of the basic algorithmic techniques and methods that emerged from this theory. We discuss its direct meta-algorithmic consequences, we present the algorithmic applications of core theorems such as the grid-exclusion theorem, and we give a brief description of the irrelevant vertex technique.