scientific article; zbMATH DE number 7053376
From MaRDI portal
Publication:5743499
Recommendations
- Bidimensionality of geometric intersection graphs
- Contraction-bidimensionality of geometric intersection graphs
- Contraction bidimensionality of geometric intersection graphs
- scientific article; zbMATH DE number 1342089
- Geometric representations of graphs
- Geometric representations of graphs
- scientific article; zbMATH DE number 1943970
- Geometrical embeddings of graphs
- Bilinear maps and graphs
- Geometric graphs
Cites work
- scientific article; zbMATH DE number 3633251 (Why is no real title available?)
- scientific article; zbMATH DE number 1303597 (Why is no real title available?)
- scientific article; zbMATH DE number 1775439 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- scientific article; zbMATH DE number 7053376 (Why is no real title available?)
- A partial k-arboretum of graphs with bounded treewidth
- Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction
- Algorithms – ESA 2005
- Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
- Approximation algorithms for NP-complete problems on planar graphs
- Approximation algorithms for independent sets in map graphs
- Approximation schemes for covering and packing problems in image processing and VLSI
- Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
- Bidimensionality and kernels
- Bidimensionality: new connections between FPT algorithms and PTASs
- Easy problems for tree-decomposable graphs
- Fast and accurate algorithms for protein side-chain packing
- Fixed-parameter algorithms for ( k , r )-center in planar graphs and map graphs
- Geometric separation and exact solutions for the parameterized independent set problem on disk graphs
- Graph searching and a min-max theorem for tree-width
- Handbook of Graph Grammars and Computing by Graph Transformation
- Improved Approximation Algorithms for Minimum Weight Vertex Separators
- Label placement by maximum independent set in rectangles
- Linearity of grid minors in treewidth with applications through bidimensionality
- Map graphs
- Minimum clique partition in unit disk graphs
- NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
- Polynomial kernels for hard problems on disk graphs
- Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
- Polynomial-time approximation schemes for packing and piercing fat objects
- Quickly excluding a planar graph
- Robust algorithms for restricted domains
- Separators for sphere-packings and nearest neighbor graphs
- Simple heuristics for unit disk graphs
- Some APX-completeness results for cubic graphs
- Subexponential parameterized algorithms on bounded-genus graphs and \(H\)-minor-free graphs
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Three-dimensional orthogonal graph drawing algorithms
- Unit disk graphs
- Which problems have strongly exponential complexity?
Cited in
(33)- Coverability and sub-exponential parameterized algorithms in planar graphs
- Contraction bidimensionality of geometric intersection graphs
- A Retrospective on (Meta) Kernelization
- Faster algorithms for cycle hitting problems on disk graphs
- Finding, hitting and packing cycles in subexponential time on unit disk graphs
- Orthogonal tree decompositions of graphs
- Clustered 3-colouring graphs of bounded degree
- Computing list homomorphisms in geometric intersection graphs
- Optimality program in segment and string graphs
- Graph product structure for non-minor-closed classes
- Bidimensionality of geometric intersection graphs
- On embeddability of unit disk graphs onto straight lines
- Excluded grid minors and efficient polynomial-time approximation schemes
- Contraction-bidimensionality of geometric intersection graphs
- Map graphs having witnesses of large girth
- Contraction decomposition in unit disk graphs and algorithmic applications in parameterized complexity
- Tree densities in sparse graph classes
- Polylogarithmic approximation algorithms for weighted-\(\mathcal{F}\)-deletion problems
- scientific article; zbMATH DE number 6783430 (Why is no real title available?)
- A framework for exponential-time-hypothesis-tight algorithms and lower bounds in geometric intersection graphs
- Clustered coloring of graphs with bounded layered treewidth and bounded degree
- Recognizing map graphs of bounded treewidth
- Constrained representations of map graphs and half-squares
- Bidimensionality and kernels
- Linear-time recognition of map graphs with outerplanar witness
- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths
- Structure of graphs with locally restricted crossings
- Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering
- Notes on graph product structure theory
- Finding, hitting and packing cycles in subexponential time on unit disk graphs
- Decomposition of Map Graphs with Applications.
- scientific article; zbMATH DE number 7053376 (Why is no real title available?)
- A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs
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 Q5743499)
