#### Filter Results:

- Full text PDF available (16)

#### Publication Year

2012

2018

- This year (2)
- Last 5 years (15)
- Last 10 years (17)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Roman Prutkin, Anton Kaplanyan, Carsten Dachsbacher
- Eurographics
- 2012

We present a method for real-time clustering of VPLs obtained from Reflective Shadow Maps (RSM). The clusters are treated as area light sources and used to approximate indirect illumination. Theâ€¦ (More)

- Martin NÃ¶llenburg, Roman Prutkin, Ignaz Rutter
- Graph Drawing
- 2014

An st-path in a drawing of a graph is self-approaching if during a traversal of the corresponding curve from s to any point tâ€² on the curve the distance to tâ€² is non-increasing. A path has increasingâ€¦ (More)

- Moritz von Looz, Henning Meyerhenke, Roman Prutkin
- ISAAC
- 2015

Complex networks have become increasingly popular for modeling various real-world phenomena. Realistic generative network models are important in this context as they simplify complex networkâ€¦ (More)

Complex networks have become increasingly popular for modeling real-world phenomena, ranging from web hyperlinks to interactions between people. Realistic generative network models are important inâ€¦ (More)

- Therese C. Biedl, Thomas BlÃ¤sius, Benjamin Niedermann, Martin NÃ¶llenburg, Roman Prutkin, Ignaz Rutter
- Graph Drawing
- 2013

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 representation verticesâ€¦ (More)

- Martin NÃ¶llenburg, Roman Prutkin
- ESA
- 2013

Greedy embedding (or drawing) is a simple and efficient strategy to route messages in wireless sensor networks. For each sourcedestination pair of nodes s, t in a greedy embedding there is always aâ€¦ (More)

- Lev Nachmanson, Roman Prutkin, Bongshin Lee, Nathalie Henry Riche, Alexander E. Holroyd, Xiaoji Chen
- Graph Drawing
- 2015

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 elements at once oftenâ€¦ (More)

- Fabian Fuchs, Roman Prutkin
- ArXiv
- 2015

In wireless ad hoc or sensor networks, distributed node coloring is a fundamental problem closely related to establishing efficient communication through TDMA schedules. For networks with maximumâ€¦ (More)

- Fabian Fuchs, Roman Prutkin
- SIROCCO
- 2015

In wireless ad hoc networks, distributed node coloring is a fundamental problem closely related to establishing efficient communication through TDMA schedules. For networks with maximum degree âˆ†, aâ€¦ (More)

- Martin NÃ¶llenburg, Roman Prutkin, Ignaz Rutter
- ISAAC
- 2015

A greedily routable region (GRR) is a closed subset of R, in which any destination point can be reached from any starting point by always moving in the direction with maximum reduction of theâ€¦ (More)