9 citations · 10 across the 2 of their papers we have counts for
3 papers
cs.DS2018★ 9 cited
Multi-Level Steiner Trees
Reyan Ahmed, Patrizio Angelini, Faryad Darabi Sahneh +8
In the classical Steiner tree problem, given an undirected, connected graph with non-negative edge costs and a set of \emph{terminals} , the objective is to…
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.DS2017
An Interactive Tool to Explore and Improve the Ply Number of Drawings
Niklas Heinsohn, Michael Kaufmann
Given a straight-line drawing of a graph , for every vertex the ply disk is defined as a disk centered at where the radius of the disk is half the length…