Faster approximation schemes and parameterized algorithms on (odd-)H-minor-free graphs
From MaRDI portal
(Redirected from Publication:764332)
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
Cites work
- Title not available (Why is no real title available?)
- scientific article; zbMATH DE number 6381654 (Why is no real title available?)
- scientific article; zbMATH DE number 5764900 (Why is no real title available?)
- scientific article; zbMATH DE number 4060712 (Why is no real title available?)
- scientific article; zbMATH DE number 1142315 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- scientific article; zbMATH DE number 6297711 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- scientific article; zbMATH DE number 3102312 (Why is no real title available?)
- A Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights
- A Separator Theorem for Nonplanar Graphs
- A characterization of weakly bipartite graphs
- Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs
- Approximation algorithms for NP-complete problems on planar graphs
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs
- Bidimensionality: new connections between FPT algorithms and PTASs
- Deciding first-order properties of locally tree-decomposable structures
- Diameter and treewidth in minor-closed graph families
- Equivalence of local treewidth and linear local treewidth and its algorithmic applications
- Graph minors. XIII: The disjoint paths problem
- Graph minors. XVI: Excluding a non-planar graph
- Graph minors. XX: Wagner's conjecture
- Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality
- Improved Approximation Algorithms for Minimum Weight Vertex Separators
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Local tree-width, excluded minors, and approximation algorithms
- On the odd-minor variant of Hadwiger's conjecture
- Parameterized complexity: exponential speed-up for planar graph problems
- Parametrized complexity theory.
- Planar subgraph isomorphism revisited
- Recognizing a totally odd \(K_{4}\)-subdivision, parity 2-disjoint rooted paths and a parity cycle through specified elements
- Subexponential parameterized algorithms on bounded-genus graphs and \(H\)-minor-free graphs
- The extremal function for complete minors
Cited in
(9)- Efficient Approximation Schemes for Maximization Problems onK3,3-free orK5-free Graphs
- Subexponential parameterized algorithms on bounded-genus graphs and \(H\)-minor-free graphs
- Faster approximation schemes and parameterized algorithms on \(H\)-minor-free and odd-minor-free graphs
- Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering
- scientific article; zbMATH DE number 1979505 (Why is no real title available?)
- Simple PTAS's for families of graphs excluding a minor
- Subexponential parameterized algorithms on graphs of bounded-genus and \(H\)-minor-free graphs
- Dynamic Programming for H-minor-free Graphs
- Thin graph classes and polynomial-time approximation schemes
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)
