scientific article; zbMATH DE number 5764900
From MaRDI portal
Publication:3579494
zbMATH Open1192.05155MaRDI QIDQ3579494FDOQ3579494
Authors: Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos 
Publication date: 6 August 2010
Title of this publication is not available (Why is that?)
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph minors (05C83)
Cited In (20)
- Contraction bidimensionality of geometric intersection graphs
- Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms
- Graph minors and parameterized algorithm design
- Dynamic programming and planarity: improved tree-decomposition based algorithms
- Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
- Contraction-bidimensionality of geometric intersection graphs
- Exact algorithms for finding longest cycles in claw-free graphs
- Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions
- Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in \(O(n^{1+\epsilon})\) time
- Induced packing of odd cycles in planar graphs
- Catalan structures and dynamic programming in \(H\)-minor-free graphs
- Subexponential parameterized algorithms
- Confronting intractability via parameters
- Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs
- Faster parameterized algorithms for minor containment
- Subexponential parameterized algorithms for bounded-degree connected subgraph problems on planar graphs
- Computational study on planar dominating set problem
- Structure theorem and isomorphism test for graphs with excluded topological subgraphs
- Improved bounds on the planar branchwidth with respect to the largest grid minor size
- Dynamic programming for graphs on surfaces
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579494)
