Introduction to mathematical logic (3rd ed.)
Introduction to mathematical logic (3rd ed.)
Nonconstructive tools for proving polynomial-time decidability
Journal of the ACM (JACM)
Easy problems for tree-decomposable graphs
Journal of Algorithms
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
Graph minors. XIII: the disjoint paths problem
Journal of Combinatorial Theory Series B
SIAM Journal on Discrete Mathematics
On computing graph minor obstruction sets
Theoretical Computer Science
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Graph minors. XVI. excluding a non-planar graph
Journal of Combinatorial Theory Series B
Graph Minors. XX. Wagner's conjecture
Journal of Combinatorial Theory Series B - Special issue dedicated to professor W. T. Tutte
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)
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Graph minors. XXI. Graphs with unique linkages
Journal of Combinatorial Theory Series B
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
On problems without polynomial kernels
Journal of Computer and System Sciences
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
A shorter proof of the graph minor algorithm: the unique linkage theorem
Proceedings of the forty-second ACM symposium on Theory of computing
Finding topological subgraphs is fixed-parameter tractable
Proceedings of the forty-third annual ACM symposium on Theory of computing
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
Graph Minors. XXII. Irrelevant vertices in linkage problems
Journal of Combinatorial Theory Series B
Forbidden graphs for tree-depth
European Journal of Combinatorics
Effective computation of immersion obstructions for unions of graph classes
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Characterizing graphs of small carving-width
Discrete Applied Mathematics
Hi-index | 0.00 |
In the final paper of the Graph Minors series Robertson and Seymour proved that graphs are well-quasi-ordered under the immersion ordering. A direct implication of this theorem is that each class of graphs that is closed under taking immersions can be fully characterized by forbidding a finite set of graphs (immersion obstruction set). However, as the proof of the well-quasi-ordering theorem is non-constructive, there is no generic procedure for computing such a set. Moreover, it remains an open issue to identify for which immersion-closed graph classes the computation of those sets can become effective. By adapting the tools that were introduced by Adler, Grohe and Kreutzer, for the effective computation of minor obstruction sets, we expand the horizon of computability to immersion obstruction sets. In particular, our results propagate the computability of immersion obstruction sets of immersion-closed graph classes to immersion obstruction sets of finite unions of immersion-closed graph classes.