Generalized disk graphs
From MaRDI portal
Publication:832849
Cites work
- An algorithm for the maximum weight independent set problem on outerstring graphs
- Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
- Approximation algorithms for intersection graphs
- Approximation algorithms for maximum independent set of pseudo-disks
- Computing depth orders for fat objects and related problems
- Dynamic data structures for fat objects and their applications
- Elimination graphs
- How well can graphs represent wireless interference?
- Independence and Coloring Problems on Intersection Graphs of Disks
- Max point-tolerance graphs
- On fat partitioning, fat covering and the union size of polygons
- Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
- Polynomial-time approximation schemes for packing and piercing fat objects
- Resolving SINR queries in a dynamic setting
- String graphs. I: The number of critical nonstring graphs is infinite
- The topology of wireless communication
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Tolerance intersection graphs on binary trees with constant tolerance 3
- Unit disk graphs
- Universal framework for wireless scheduling problems
- \(p\)-box: a new graph model
Cited in
(4)
This page was built for publication: Generalized disk graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832849)