research
∙
06/27/2023
Insertion-Only Dynamic Connectivity in General Disk Graphs
Let S ⊆ℝ^2 be a set of n sites in the plane, so that every site s ∈ S ha...
share
research
∙
09/05/2022
Nearest-Neighbor Decompositions of Drawings
Let 𝒟 be a set of straight-line segments in the plane, potentially cross...
research
∙
02/22/2022
Flipping Plane Spanning Paths
Let S be a planar point set in general position, and let 𝒫(S) be the set...
research
∙
08/30/2021
Simplifying Non-Simple Fan-Planar Drawings
A drawing of a graph is fan-planar if the edges intersecting a common ed...
research
∙
06/28/2021
Dynamic Connectivity in Disk Graphs
Let S be a set of n sites, each associated with a point in ℝ^2 and a rad...
research
∙
08/25/2020