38 citations · 77 across the 28 of their papers we have counts for
1 paper · 1 filter
Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani +3
We study the algorithmic problem of computing drawings of graphs in which (i) each vertex is a disk with fixed radius ρ, (ii) each edge is a straight-line segment connecting…