18 citations · 45 across the 16 of their papers we have counts for
Showing cs.CGShow all
3 papers · 1 filter
cs.CG2019
Computing Circle Packing Representations of Planar Graphs
Sally Dong, Yin Tat Lee, Kent Quanrud
The Circle Packing Theorem states that every planar graph can be represented as the tangency graph of a family of internally-disjoint circles. A well-known generalization is the Pr…
cs.CG2016
Notes on Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs
Sariel Har-Peled, Kent Quanrud
This write-up contains some minor results and notes related to our work [HQ15] (some of them already known in the literature). In particular, it shows the following: - We show that…
cs.CG2015
Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs
Sariel Har-Peled, Kent Quanrud
We study the family of intersection graphs of low density objects in low dimensional Euclidean space. This family is quite general, and includes planar graphs. We prove that such g…