research
∙
08/17/2023
Weakly and Strongly Fan-Planar Graphs
We study two notions of fan-planarity introduced by (Cheong et al., GD22...
share
research
∙
08/25/2022
The thickness of fan-planar graphs is at most three
We prove that in any strongly fan-planar drawing of a graph G the edges ...
research
∙
03/03/2022
Efficient Fréchet distance queries for segments
We study the problem of constructing a data structure that can store a t...
research
∙
08/27/2021
One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons
We consider the problem of drawing an outerplanar graph with n vertices ...
research
∙
08/19/2020
Augmenting Geometric Graphs with Matchings
We study noncrossing geometric graphs and their disjoint compatible geom...
research
∙
06/03/2019
On Romeo and Juliet Problems: Minimizing Distance-to-Sight
We introduce a variant of the watchman route problem, which we call the ...
research
∙
08/26/2018
