Generalized disk graphs
From MaRDI portal
Publication:832849
DOI10.1007/978-3-030-83508-8_9OpenAlexW3029216897MaRDI QIDQ832849
Steven Chaplick, Tigran Tonoyan, Ívar Marrow Arnþórsson, Magnús M. Halldórsson, Jökull Máni Reynisson, Jökull Snær Gylfason
Publication date: 25 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-83508-8_9
Cites Work
- Unnamed Item
- Unnamed Item
- Max point-tolerance graphs
- Approximation algorithms for maximum independent set of pseudo-disks
- Approximation algorithms for intersection graphs
- An algorithm for the maximum weight independent set problem on outerstring graphs
- String graphs. I: The number of critical nonstring graphs is infinite
- Unit disk graphs
- Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
- On fat partitioning, fat covering and the union size of polygons
- Computing depth orders for fat objects and related problems
- Tolerance intersection graphs on binary trees with constant tolerance 3
- Dynamic data structures for fat objects and their applications
- How Well Can Graphs Represent Wireless Interference?
- The Topology of Wireless Communication
- Elimination graphs
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Polynomial-time approximation schemes for packing and piercing fat objects
- (c-)AND: A new graph model
- Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
- Independence and Coloring Problems on Intersection Graphs of Disks
This page was built for publication: Generalized disk graphs
