2 citations · 2 across the 2 of their papers we have counts for
4 papers
Greedy Rectilinear Drawings
Patrizio Angelini, Michael A. Bekos, Walter Didimo +6
A drawing of a graph is greedy if for each ordered pair of vertices u and v, there is a path from u to v such that the Euclidean distance to v decreases monotonically at every vert…
A Note on the Area Requirement of Euclidean Greedy Embeddings of Christmas Cactus Graphs
Roman Prutkin
An Euclidean greedy embedding of a graph is a straight-line embedding in the plane, such that for every pair of vertices and , the vertex has a neighbor with smaller…
GraphMaps: Browsing Large Graphs as Interactive Maps
Lev Nachmanson, Roman Prutkin, Bongshin Lee +3
Algorithms for laying out large graphs have seen significant progress in the past decade. However, browsing large graphs remains a challenge. Rendering thousands of graphical eleme…
Simple Distributed Delta + 1 Coloring in the SINR Model
Fabian Fuchs, Roman Prutkin
In wireless ad hoc or sensor networks, distributed node coloring is a fundamental problem closely related to establishing efficient communication through TDMA schedules. For networ…