3 citations · 8 across the 7 of their papers we have counts for
10 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…
Recognizing Weighted Disk Contact Graphs
Boris Klemz, Martin Nöllenburg, Roman Prutkin
Disk contact representations realize graphs by mapping vertices bijectively to interior-disjoint disks in the plane such that two disks touch each other if and only if the correspo…
Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions
Martin Nöllenburg, Roman Prutkin, Ignaz Rutter
A greedily routable region (GRR) is a closed subset of , in which each destination point can be reached from each starting point by choosing the direction with maximum…
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…
Fully non-linear elliptic equations on compact Hermitian manifolds
Gábor Székelyhidi
We derive a priori estimates for solutions of a general class of fully non-linear equations on compact Hermitian manifolds. Our method is based on ideas that have been used for dif…
On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs
Martin Nöllenburg, Roman Prutkin, Ignaz Rutter
An -path in a drawing of a graph is self-approaching if during the traversal of the corresponding curve from to any point on the curve the distance to is non-incr…
Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings
Therese Biedl, Thomas Bläsius, Benjamin Niedermann +3
We present a simple and versatile formulation of grid-based graph representation problems as an integer linear program (ILP) and a corresponding SAT instance. In a grid-based repre…
Euclidean Greedy Drawings of Trees
Martin Nöllenburg, Roman Prutkin
Greedy embedding (or drawing) is a simple and efficient strategy to route messages in wireless sensor networks. For each source-destination pair of nodes s, t in a greedy embedding…