Graph minors. V. Excluding a planar graph
Journal of Combinatorial Theory Series B
The NP-completeness column: An ongoing guide
Journal of Algorithms
Nonconstructive tools for proving polynomial-time decidability
Journal of the ACM (JACM)
Graph minors: X. obstructions to tree-decomposition
Journal of Combinatorial Theory Series B
Typical subgraphs of 3- and 4-connected graphs
Journal of Combinatorial Theory Series B
Connectivity, graph minors, and subgraph multiplicity
Journal of Graph Theory
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
Journal of the ACM (JACM)
Vertex cover: further observations and further improvements
Journal of Algorithms
Approximation algorithms for independent sets in map graphs
Journal of Algorithms
Ka,k minors in graphs of bounded tree-width
Journal of Combinatorial Theory Series B
Dominating sets in planar graphs: branch-width and exponential speed-up
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Improved Parameterized Algorithms for Planar Dominating Set
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
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
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
Bidimensional Parameters and Local Treewidth
SIAM Journal on Discrete Mathematics
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
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs
ACM Transactions on Algorithms (TALG)
Journal of Computer and System Sciences
Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs
Journal of the ACM (JACM)
The Bidimensional Theory of Bounded-Genus Graphs
SIAM Journal on Discrete Mathematics
Quickly deciding minor-closed parameters in general graphs
European Journal of Combinatorics
Fast algorithms for hard graph problems: bidimensionality, minors, and local treewidth
GD'04 Proceedings of the 12th international conference on Graph Drawing
Parameterized Complexity
Hi-index | 0.00 |
We explore the three main avenues of research still unsolved in the algorithmic graph-minor theory literature, which all stem from a key min-max relation between the treewidth of a graph and its largest grid minor. This min-max relation is a keystone of the Graph Minor Theory of Robertson and Seymour, which ultimately proves Wagner's Conjecture about the structure of minor-closed graph properties. First, we obtain the only known polynomial min-max relation for graphs that do not exclude any fixed minor, namely, map graphs and power graphs. Second, we obtain explicit (and improved) bounds on the min-max relation for an important class of graphs excluding a minor, namely, K3,k-minor-free graphs, using new techniques that do not rely on Graph Minor Theory. These two avenues lead to faster fixed-parameter algorithms for two families of graph problems, called minor-bidimensional and contraction-bidimensional parameters. Third, we disprove a variation of Wagner's Conjecture for the case of graph contractions in general graphs, and in a sense characterize which graphs satisfy the variation. This result demonstrates the limitations of a general theory of algorithms for the family of contraction-closed problems (which includes, for example, the celebrated dominating-set problem). If this conjecture had been true, we would have had an extremely powerful tool for proving the existence of efficient algorithms for any contraction-closed problem, like we do for minor-closed problems via Graph Minor Theory.