37 citations · 192 across the 51 of their papers we have counts for
8 papers · 2 filters
Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs
Hugo A. Akitaya, Rajasekhar Inkulu, Torrie L. Nichols +3
We consider edge insertion and deletion operations that increase the connectivity of a given planar straight-line graph (PSLG), while minimizing the total edge length of the output…
Arc diagrams, flip distances, and Hamiltonian triangulations
Jean Cardinal, Michael Hoffmann, Vincent Kusters +2
We show that every triangulation (maximal planar graph) on vertices can be flipped into a Hamiltonian triangulation using a sequence of less than combinatorial edge…
Reconstruction of weakly simple polygons from their edges
Hugo A. Akitaya, Csaba D. Tóth
Given line segments in the plane, do they form the edge set of a \emph{weakly simple polygon}; that is, can the segment endpoints be perturbed by at most , for any…
Multi-Colored Spanning Graphs
Hugo A. Akitaya, Maarten Löffler, Csaba D. Tóth
We study a problem proposed by Hurtado et al. (2016) motivated by sparse set visualization. Given points in the plane, each labeled with one or more primary colors, a \emph{col…
Monotone Paths in Geometric Triangulations
Adrian Dumitrescu, Ritankar Mandal, Csaba D. Tóth
(I) We prove that the (maximum) number of monotone paths in a geometric triangulation of points in the plane is . This improves an earlier upper bound of $O(1.8393…
The Planar Tree Packing Theorem
Markus Geyer, Michael Hoffmann, Michael Kaufmann +2
Packing graphs is a combinatorial problem where several given graphs are being mapped into a common host graph such that every edge is used at most once. In the planar tree packing…