83 citations · 606 across the 54 of their papers we have counts for
22 papers · 1 filter
Free Sets in Planar Graphs: History and Applications
Vida Dujmović, Pat Morin
A subset of vertices in a planar graph is a free set if, for every set of points in the plane, there exists a straight-line crossing-free drawing of in which…
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The Musketeers
Hugo A. Akitaya, Esther M. Arkin, Mirela Damian +8
We present the first universal reconfiguration algorithm for transforming a modular robot between any two facet-connected square-grid configurations using pivot moves. More precise…
Near-Optimal -Robust Geometric Spanners
Prosenjit Bose, Paz Carmi, Vida Dujmovic +1
For any constants , , , and any -point set , we show that there is a geometric graph having edges with…
Pole Dancing: 3D Morphs for Tree Drawings
Elena Arseneva, Prosenjit Bose, Pilar Cano +5
We study the question whether a crossing-free 3D morph between two straight-line drawings of an -vertex tree can be constructed consisting of a small number of linear morphing s…
Geodesic Obstacle Representation of Graphs
Prosenjit Bose, Paz Carmi, Vida Dujmovic +4
An obstacle representation of a graph is a mapping of the vertices onto points in the plane and a set of connected regions of the plane (called obstacles) such that the straight-li…
EPG-representations with small grid-size
Therese Biedl, Martin Derka, Vida Dujmovic +1
In an EPG-representation of a graph each vertex is represented by a path in the rectangular grid, and is an edge in if and only if the paths representing an …