research
∙
10/21/2022
Blocking Delaunay Triangulations from the Exterior
Given two distinct point sets P and Q in the plane, we say that Q blocks...
share
research
∙
09/28/2022
Dynamic Embeddings of Dynamic Single-Source Upward Planar Graphs
A directed graph G is upward planar if it admits a planar embedding such...
research
∙
09/02/2022
Shooting Stars in Simple Drawings of K_m,n
Simple drawings are drawings of graphs in which two edges have at most o...
research
∙
05/26/2021
Crossing Numbers of Beyond-Planar Graphs Revisited
Graph drawing beyond planarity focuses on drawings of high visual qualit...
research
∙
05/17/2021
Compacting Squares
Edge-connected configurations of squares are a common model for modular ...
research
∙
01/11/2021
On Compatible Matchings
A matching is compatible to two or more labeled point sets of size n wit...
research
∙
12/21/2020
Efficient Segment Folding is Hard
We introduce a computational origami problem which we call the segment f...
research
∙
12/18/2020
Upward Point Set Embeddings of Paths and Trees
We study upward planar straight-line embeddings (UPSE) of directed trees...
research
∙
12/14/2020
Characterizing Universal Reconfigurability of Modular Pivoting Robots
We give both efficient algorithms and hardness results for reconfiguring...
research
∙
12/14/2020
Crossing-Optimal Extension of Simple Drawings
In extension problems of partial graph drawings one is given an incomple...
research
∙
12/03/2020
Saturated k-Plane Drawings with Few Edges
A drawing of a graph is k-plane if no edge is crossed more than k times....
research
∙
08/25/2020
On the Maximum Number of Crossings in Star-Simple Drawings of K_n with No Empty Lens
A star-simple drawing of a graph is a drawing in which adjacent edges do...
research
∙
07/31/2020
New Results in Sona Drawing: Hardness and TSP Separation
Given a set of point sites, a sona drawing is a single closed curve, dis...
research
∙
09/16/2019
Extending simple drawings with one edge is hard
A simple drawing D(G) of a graph G = (V,E) is a drawing in which two edg...
research
∙
08/21/2019
Extending Simple Drawings
Simple drawings of graphs are those in which each pair of edges share at...
research
∙
08/21/2019
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers
We present the first universal reconfiguration algorithm for transformin...
research
∙
08/18/2019
Graphs with large total angular resolution
The total angular resolution of a straight-line drawing is the minimum a...
research
∙
08/18/2019
On the 2-colored crossing number
Let D be a straight-line drawing of a graph. The rectilinear 2-colored c...
research
∙
08/14/2019
Minimal Representations of Order Types by Geometric Graphs
In order to have a compact visualization of the order type of a given po...
research
∙
08/31/2018
