Fast algorithms for hard graph problems: bidimensionality, minors, and local treewidth

Authors:
Erik D. Demaine;MohammadTaghi Hajiaghayi
Affiliations:
MIT Computer Science and Artificial Intelligence Laboratory, Cambridge, MA;MIT Computer Science and Artificial Intelligence Laboratory, Cambridge, MA
Venue:
GD'04 Proceedings of the 12th international conference on Graph Drawing
Year:
2004

Citing 30
Cited 9

Graph minors. V. Excluding a planar graph

Journal of Combinatorial Theory Series B
Nonconstructive tools for proving polynomial-time decidability

Journal of the ACM (JACM)
Approximation algorithms for NP-complete problems on planar graphs

Journal of the ACM (JACM)
Quickly excluding a planar graph

Journal of Combinatorial Theory Series B
Graph minors. XII: distance on a surface

Journal of Combinatorial Theory Series B
Highly connected sets and the excluded grid theorem

Journal of Combinatorial Theory Series B
Subgraph isomorphism in planar graphs and related problems

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A polynomial-time approximation scheme for weighted planar graph TSP

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Deciding first-order properties of locally tree-decomposable structures

Journal of the ACM (JACM)
Map graphs

Journal of the ACM (JACM)
An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem

SIAM Journal on Computing
Dominating sets in planar graphs: branch-width and exponential speed-up

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Refined Search Tree Technique for DOMINATING SET on Planar Graphs

MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Improved Parameterized Algorithms for Planar Dominating Set

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of (Locally) Bounded Treewidth

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Maximum Clique Transversals

WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k -Disjoint Cycles on Plane and Planar Graphs

WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Exponential Speedup of Fixed-Parameter Algorithms on K3, 3-Minor-Free or K5-Minor-Free Graphs

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Map Graphs In Polynomial Time

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Graph minors. XVI. excluding a non-planar graph

Journal of Combinatorial Theory Series B
Graph separators: a parameterized view

Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Equivalence of local treewidth and linear local treewidth and its algorithmic applications

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Local Tree-Width, Excluded Minors, and Approximation Algorithms

Combinatorica
Parameterized complexity: exponential speed-up for planar graph problems

Journal of Algorithms
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors

Journal of Computer and System Sciences
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
Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Fixed-parameter algorithms for the (k, r)-center in planar graphs and map graphs

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming

Bidimensionality: new connections between FPT algorithms and PTASs

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A nearly linear time algorithm for the half integral disjoint paths packing

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs

MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
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
A simpler algorithm and shorter proof for the graph minor decomposition

Proceedings of the forty-third annual ACM symposium on Theory of computing
Slightly superexponential parameterized problems

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Algorithmic graph minor theory: improved grid minor bounds and wagner's contraction

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Exact algorithms for the Hamiltonian cycle problem in planar graphs

Operations Research Letters
Minimum weight 2-edge-connected spanning subgraphs in planar graphs

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper surveys the theory of bidimensional graph problems. We summarize the known combinatorial and algorithmic results of this theory, the foundational Graph Minor results on which this theory is based, and the remaining open problems.