scientific article

zbMath1192.05155MaRDI QIDQ3579494

Dimitrios M. Thilikos, Fedor V. Fomin, Frederic Dorn

Publication date: 6 August 2010

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph minors (05C83) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (20)

Contraction bidimensionality of geometric intersection graphs ⋮ Graph Minors and Parameterized Algorithm Design ⋮ Improved bounds on the planar branchwidth with respect to the largest grid minor size ⋮ Exact algorithms for finding longest cycles in claw-free graphs ⋮ Catalan structures and dynamic programming in \(H\)-minor-free graphs ⋮ Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions ⋮ Subexponential parameterized algorithms ⋮ Faster parameterized algorithms for minor containment ⋮ Confronting intractability via parameters ⋮ Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms ⋮ Dynamic programming and planarity: improved tree-decomposition based algorithms ⋮ Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in \(O(n^{1+\epsilon})\) time ⋮ Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs ⋮ Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs ⋮ Induced packing of odd cycles in planar graphs ⋮ Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs ⋮ Computational study on planar dominating set problem ⋮ Contraction-Bidimensionality of Geometric Intersection Graphs ⋮ Dynamic programming for graphs on surfaces ⋮ Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs

This page was built for publication: