activity
20172023
most citedA Nearly-Linear Time Algorithm for Linear Programs with Small Treewidth: A Multiscale Representation of Robust Central Path

2 citations · 3 across the 7 of their papers we have counts for

collaborators
Showing 2019Show all

1 paper · 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…