31 citations · 55 across the 10 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2017★ 1 cited
On Vertex- and Empty-Ply Proximity Drawings
Patrizio Angelini, Steven Chaplick, Felice De Luca +7
We initiate the study of the vertex-ply of straight-line drawings, as a relaxation of the recently introduced ply number. Consider the disks centered at each vertex with radius equ…
cs.DS2013
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs
Hajo Broersma, Jiří Fiala, Petr A. Golovach +3
Hung and Chang showed that for all k>=1 an interval graph has a path cover of size at most k if and only if its scattering number is at most k. They also showed that an interval gr…