Contraction-Bidimensionality of Geometric Intersection Graphs

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth
Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms
The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
Graph minors. V. Excluding a planar graph
Highly connected sets and the excluded grid theorem
Quickly excluding a planar graph
The intersection graphs of subtrees in trees are exactly the chordal graphs
Linear min-max relation between the treewidth of \(H\)-minor-free graphs and its largest grid
Graph minors. II. Algorithmic aspects of tree-width
Bidimensionality and Geometric Graphs
Tree-width and planar minors
Subexponential parameterized algorithms on bounded-genus graphs and H -minor-free graphs
Bidimensionality: new connections between FPT algorithms and PTASs
Contraction Bidimensionality: The Accurate Picture
Contraction obstructions for treewidth
Linearity of grid minors in treewidth with applications through bidimensionality
Problems Parameterized by Treewidth Tractable in Single Exponential Time: A Logical Approach
Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus
The Bidimensional Theory of Bounded-Genus Graphs
LATIN 2004: Theoretical Informatics
Graph Drawing
Optimizing the graph minors weak structure theorem
A new proof of the flat wall theorem
Graph Minors and Parameterized Algorithm Design
Dynamic Programming for H-minor-free Graphs
Bidimensionality of Geometric Intersection Graphs
String graphs and separators
Dynamic programming for graphs on surfaces
Polynomial Bounds for the Grid-Minor Theorem

Cited In (7)

A Retrospective on (Meta) Kernelization
Title not available (Why is that?)
Contraction bidimensionality of geometric intersection graphs
Bidimensionality and Kernels
Tractabilities and intractabilities on geometric intersection graphs
A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs
Title not available (Why is that?)

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 Q5111864)