scientific article

zbMath1192.68810MaRDI QIDQ3579375

Martin Grohe, Isolde Adler, Stephan Kreutzer

Publication date: 6 August 2010

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph minors (05C83)

Related Items (25)

A polynomial excluded-minor approximation of treedepth ⋮ Uniform Kernelization Complexity of Hitting Forbidden Minors ⋮ A Basic Parameterized Complexity Primer ⋮ Graph Minors and Parameterized Algorithm Design ⋮ Sparse obstructions for minor-covering parameters ⋮ Fixed-parameter tractable distances to sparse graph classes ⋮ Parameterized complexity of vertex deletion into perfect graph classes ⋮ Effective computation of immersion obstructions for unions of graph classes ⋮ \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions ⋮ Combing a Linkage in an Annulus ⋮ A survey of parameterized algorithms and the complexity of edge modification ⋮ Obtaining a planar graph by vertex deletion ⋮ Unnamed Item ⋮ Faster parameterized algorithms for minor containment ⋮ Confronting intractability via parameters ⋮ Unnamed Item ⋮ All minor-minimal apex obstructions with connectivity two ⋮ Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications ⋮ Chordal deletion is fixed-parameter tractable ⋮ Hitting Forbidden Minors: Approximation and Kernelization ⋮ Minor obstructions for apex-pseudoforests ⋮ Block elimination distance ⋮ Block elimination distance ⋮ Minor-obstructions for apex sub-unicyclic graphs ⋮ Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable

This page was built for publication: