17 citations · 45 across the 15 of their papers we have counts for
10 papers · 1 filter
Min--planar Drawings of Graphs
Carla Binucci, Aaron Büngener, Giuseppe Di Battista +7
The study of nonplanar drawings of graphs with restricted crossing configurations is a well-established topic in graph drawing, often referred to as beyond-planar graph drawing. On…
Packing Trees into 1-planar Graphs
Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong +6
We introduce and study the 1-planar packing problem: Given graphs with vertices , find a 1-planar graph that contains the given graphs as edge-disjoint spa…
Drawing Big Graphs using Spectral Sparsification
Peter Eades, Quan Nguyen, Seok-Hee Hong
Spectral sparsification is a general technique developed by Spielman et al. to reduce the number of edges in a graph while retaining its structural properties. We investigate the u…
Gap-planar Graphs
Sang Won Bae, Jean-Francois Baffier, Jinhee Chun +8
We introduce the family of -gap-planar graphs for , i.e., graphs that have a drawing in which each crossing is assigned to one of the two involved edges and each edge…
Towards Faithful Graph Visualizations
Quan Hoang Nguyen, Peter Eades
Readability criteria have been addressed as a measurement of the quality of graph visualizations. In this paper, we argue that readability criteria are necessary but not sufficient…
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…