Остановите войну!
for scientists:
default search action
Roman Prutkin
- > Home > Persons > Roman Prutkin
Publications
- 2022
- [j6]Boris Klemz, Martin Nöllenburg, Roman Prutkin:
Recognizing weighted and seeded disk graphs. J. Comput. Geom. 13(1) (2022) - 2019
- [j5]Patrizio Angelini, Michael A. Bekos, Walter Didimo, Luca Grilli, Philipp Kindermann, Tamara Mchedlidze, Roman Prutkin, Antonios Symvonis, Alessandra Tappini:
Greedy rectilinear drawings. Theor. Comput. Sci. 795: 375-397 (2019) - 2018
- [c12]Patrizio Angelini, Michael A. Bekos, Walter Didimo, Luca Grilli, Philipp Kindermann, Tamara Mchedlidze, Roman Prutkin, Antonios Symvonis, Alessandra Tappini:
Greedy Rectilinear Drawings. GD 2018: 495-508 - [i10]Patrizio Angelini, Michael A. Bekos, Walter Didimo, Luca Grilli, Philipp Kindermann, Tamara Mchedlidze, Roman Prutkin, Antonios Symvonis, Alessandra Tappini:
Greedy Rectilinear Drawings. CoRR abs/1808.09063 (2018) - 2017
- [j4]Martin Nöllenburg, Roman Prutkin:
Euclidean Greedy Drawings of Trees. Discret. Comput. Geom. 58(3): 543-579 (2017) - [j3]Martin Nöllenburg, Roman Prutkin, Ignaz Rutter:
Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions. Int. J. Comput. Geom. Appl. 27(1-2): 121- (2017) - 2016
- [j2]Martin Nöllenburg, Roman Prutkin, Ignaz Rutter:
On self-approaching and increasing-chord drawings of 3-connected planar graphs. J. Comput. Geom. 7(1): 47-69 (2016) - 2015
- [c11]Lev Nachmanson, Roman Prutkin, Bongshin Lee, Nathalie Henry Riche, Alexander E. Holroyd, Xiaoji Chen:
GraphMaps: Browsing Large Graphs as Interactive Maps. GD 2015: 3-15 - [c10]Boris Klemz, Martin Nöllenburg, Roman Prutkin:
Recognizing Weighted Disk Contact Graphs. GD 2015: 433-446 - [c9]Moritz von Looz, Henning Meyerhenke, Roman Prutkin:
Generating Random Hyperbolic Graphs in Subquadratic Time. ISAAC 2015: 467-478 - [c8]Martin Nöllenburg, Roman Prutkin, Ignaz Rutter:
Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions. ISAAC 2015: 637-649 - [i8]Moritz von Looz, Christian L. Staudt, Henning Meyerhenke, Roman Prutkin:
Fast generation of dynamic complex networks with underlying hyperbolic geometry. CoRR abs/1501.03545 (2015) - [i6]Lev Nachmanson, Roman Prutkin, Bongshin Lee, Nathalie Henry Riche, Alexander E. Holroyd, Xiaoji Chen:
GraphMaps: Browsing Large Graphs as Interactive Maps. CoRR abs/1506.06745 (2015) - [i5]Boris Klemz, Martin Nöllenburg, Roman Prutkin:
Recognizing Weighted Disk Contact Graphs. CoRR abs/1509.00720 (2015) - [i4]Martin Nöllenburg, Roman Prutkin, Ignaz Rutter:
Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions. CoRR abs/1509.05635 (2015) - 2014
- [c5]Martin Nöllenburg, Roman Prutkin, Ignaz Rutter:
On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs. GD 2014: 476-487 - [i3]Martin Nöllenburg, Roman Prutkin, Ignaz Rutter:
On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs. CoRR abs/1409.0315 (2014) - 2013
- [j1]Martin Nöllenburg, Roman Prutkin, Ignaz Rutter:
Edge-weighted contact representations of planar graphs. J. Graph Algorithms Appl. 17(4): 441-473 (2013) - [c4]Martin Nöllenburg, Roman Prutkin:
Euclidean Greedy Drawings of Trees. ESA 2013: 767-778 - [c3]Therese Biedl, Thomas Bläsius, Benjamin Niedermann, Martin Nöllenburg, Roman Prutkin, Ignaz Rutter:
Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings. GD 2013: 460-471 - [i2]Martin Nöllenburg, Roman Prutkin:
Euclidean Greedy Drawings of Trees. CoRR abs/1306.5224 (2013) - [i1]Therese Biedl, Thomas Bläsius, Benjamin Niedermann, Martin Nöllenburg, Roman Prutkin, Ignaz Rutter:
Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings. CoRR abs/1308.6778 (2013) - 2012
- [c1]Martin Nöllenburg, Roman Prutkin, Ignaz Rutter:
Edge-Weighted Contact Representations of Planar Graphs. GD 2012: 224-235
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-10-02 01:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint