Contraction bidimensionality of geometric intersection graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5764900 (Why is no real title available?)
- scientific article; zbMATH DE number 6783430 (Why is no real title available?)
- scientific article; zbMATH DE number 7053376 (Why is no real title available?)
- A new proof of the flat wall theorem
- Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs
- Bidimensional Parameters and Local Treewidth
- Bidimensionality and kernels
- Bidimensionality and parameterized algorithms (invited talk)
- Bidimensionality of geometric intersection graphs
- Bidimensionality: new connections between FPT algorithms and PTASs
- Contraction Bidimensionality: The Accurate Picture
- Contraction obstructions for treewidth
- Contraction-bidimensionality of geometric intersection graphs
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- Dynamic Programming for H-minor-free Graphs
- Dynamic programming for graphs on surfaces
- Easy problems for tree-decomposable graphs
- Efficient computation of representative sets with applications in parameterized and exact algorithms
- Excluded grid minors and efficient polynomial-time approximation schemes
- Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus
- Graph Drawing
- Graph minors and parameterized algorithm design
- Graph minors. II. Algorithmic aspects of tree-width
- Graph minors. V. Excluding a planar graph
- Highly connected sets and the excluded grid theorem
- Linear min-max relation between the treewidth of \(H\)-minor-free graphs and its largest grid
- Linearity of grid minors in treewidth with applications through bidimensionality
- Optimizing the graph minors weak structure theorem
- Problems Parameterized by Treewidth Tractable in Single Exponential Time: A Logical Approach
- Quickly excluding a planar graph
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- String graphs and separators
- Subexponential parameterized algorithms on bounded-genus graphs and \(H\)-minor-free graphs
- The Bidimensional Theory of Bounded-Genus Graphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Towards tight(er) bounds for the excluded grid theorem
- Tree-width and planar minors
Cited in
(5)- scientific article; zbMATH DE number 6438523 (Why is no real title available?)
- Bidimensionality of geometric intersection graphs
- Contraction-bidimensionality of geometric intersection graphs
- Contraction Bidimensionality of Geometric Intersection Graphs
- scientific article; zbMATH DE number 7053376 (Why is no real title available?)
This page was built for publication: Contraction bidimensionality of geometric intersection graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832527)
