Faster approximation schemes and parameterized algorithms on (odd-)H-minor-free graphs
DOI10.1016/J.TCS.2011.09.014zbMATH Open1241.05027OpenAlexW1966397930MaRDI QIDQ764332FDOQ764332
Authors: Siamak Tazari 
Publication date: 13 March 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.09.014
Recommendations
- Faster approximation schemes and parameterized algorithms on \(H\)-minor-free and odd-minor-free graphs
- Subexponential parameterized algorithms on graphs of bounded-genus and \(H\)-minor-free graphs
- Subexponential parameterized algorithms on bounded-genus graphs and \(H\)-minor-free graphs
- scientific article; zbMATH DE number 6297711
- scientific article; zbMATH DE number 1979505
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph minors (05C83)
Cites Work
- Graph minors. XX: Wagner's conjecture
- The extremal function for complete minors
- Graph minors. XIII: The disjoint paths problem
- Parametrized complexity theory.
- Approximation algorithms for NP-complete problems on planar graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- On the odd-minor variant of Hadwiger's conjecture
- A Separator Theorem for Nonplanar Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Subexponential parameterized algorithms on bounded-genus graphs and \(H\)-minor-free graphs
- A characterization of weakly bipartite graphs
- Deciding first-order properties of locally tree-decomposable structures
- Improved Approximation Algorithms for Minimum Weight Vertex Separators
- Bidimensionality: new connections between FPT algorithms and PTASs
- Diameter and treewidth in minor-closed graph families
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs
- Graph minors. XVI: Excluding a non-planar graph
- Local tree-width, excluded minors, and approximation algorithms
- Planar subgraph isomorphism revisited
- Title not available (Why is that?)
- Equivalence of local treewidth and linear local treewidth and its algorithmic applications
- Parameterized complexity: exponential speed-up for planar graph problems
- Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality
- Title not available (Why is that?)
- A Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights
- Title not available (Why is that?)
- Title not available (Why is that?)
- An O ( n log n ) approximation scheme for Steiner tree in planar graphs
- Recognizing a totally odd \(K_{4}\)-subdivision, parity 2-disjoint rooted paths and a parity cycle through specified elements
- Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs
Cited In (9)
- Subexponential parameterized algorithms on graphs of bounded-genus and \(H\)-minor-free graphs
- Thin graph classes and polynomial-time approximation schemes
- Efficient Approximation Schemes for Maximization Problems onK3,3-free orK5-free Graphs
- Simple PTAS's for families of graphs excluding a minor
- Dynamic Programming for H-minor-free Graphs
- Subexponential parameterized algorithms on bounded-genus graphs and \(H\)-minor-free graphs
- Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering
- Faster approximation schemes and parameterized algorithms on \(H\)-minor-free and odd-minor-free graphs
- Title not available (Why is that?)
This page was built for publication: Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q764332)
