research
∙
09/05/2022
Nearest-Neighbor Decompositions of Drawings
Let 𝒟 be a set of straight-line segments in the plane, potentially cross...
share
research
∙
10/05/2020
Weak Unit Disk Contact Representations for Graphs without Embedding
Weak unit disk contact graphs are graphs that admit representing nodes a...
research
∙
10/05/2020
Recognizing embedded caterpillars with weak unit disk contact representations is NP-hard
Weak unit disk contact graphs are graphs that admit a representation of ...
research
∙
04/05/2019
An Experimental Study of Algorithms for Geodesic Shortest Paths in the Constant-Workspace Model
We perform an experimental evaluation of algorithms for finding geodesic...
research
∙
02/18/2019
Routing in Histograms
Let P be an x-monotone orthogonal polygon with n vertices. We call P a s...
research
∙
12/20/2017
