29 citations · 92 across the 53 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2020
Grid Drawings of Graphs with Constant Edge-Vertex Resolution
Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani +3
We study the algorithmic problem of computing drawings of graphs in which each vertex is a disk with fixed radius , each edge is a straight-line segment connecting…
cs.DS2014★ 12 cited
On the Tree Search Problem with Non-uniform Costs
Ferdinando Cicalese, Balázs Keszegh, Bernard Lidický +2
Searching in partially ordered structures has been considered in the context of information retrieval and efficient tree-like indexes, as well as in hierarchy based knowledge repre…