Roman Prutkin | AC Group | TU Wienhttps://ac.notready.eu/author/roman-prutkin/Roman PrutkinHugo Blox Builder (https://hugoblox.com)en-usSat, 01 Jan 2022 00:00:00 +0000https://ac.notready.eu/media/logo_hu10234977157890132473.pngRoman Prutkinhttps://ac.notready.eu/author/roman-prutkin/Recognizing Weighted and Seeded Disk Graphshttps://ac.notready.eu/publication/recognizing-weighted-and-seeded-disk-graphs/Sat, 01 Jan 2022 00:00:00 +0000https://ac.notready.eu/publication/recognizing-weighted-and-seeded-disk-graphs/Euclidean Greedy Drawings of Treeshttps://ac.notready.eu/publication/euclidean-greedy-drawings-of-trees-2/Sun, 01 Jan 2017 00:00:00 +0000https://ac.notready.eu/publication/euclidean-greedy-drawings-of-trees-2/Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regionshttps://ac.notready.eu/publication/partitioning-graph-drawings-and-triangulated-simple-polygons-into-greedily-routable-regions-2/Sun, 01 Jan 2017 00:00:00 +0000https://ac.notready.eu/publication/partitioning-graph-drawings-and-triangulated-simple-polygons-into-greedily-routable-regions-2/On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphshttps://ac.notready.eu/publication/on-self-approaching-and-increasing-chord-drawings-of-3-connected-planar-graphs-2/Fri, 01 Jan 2016 00:00:00 +0000https://ac.notready.eu/publication/on-self-approaching-and-increasing-chord-drawings-of-3-connected-planar-graphs-2/Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regionshttps://ac.notready.eu/publication/partitioning-graph-drawings-and-triangulated-simple-polygons-into-greedily-routable-regions/Thu, 01 Jan 2015 00:00:00 +0000https://ac.notready.eu/publication/partitioning-graph-drawings-and-triangulated-simple-polygons-into-greedily-routable-regions/Recognizing Weighted Disk Contact Graphshttps://ac.notready.eu/publication/recognizing-weighted-disk-contact-graphs/Thu, 01 Jan 2015 00:00:00 +0000https://ac.notready.eu/publication/recognizing-weighted-disk-contact-graphs/On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphshttps://ac.notready.eu/publication/on-self-approaching-and-increasing-chord-drawings-of-3-connected-planar-graphs/Wed, 01 Jan 2014 00:00:00 +0000https://ac.notready.eu/publication/on-self-approaching-and-increasing-chord-drawings-of-3-connected-planar-graphs/Edge-weighted contact representations of planar graphshttps://ac.notready.eu/publication/edge-weighted-contact-representations-of-planar-graphs-2/Tue, 01 Jan 2013 00:00:00 +0000https://ac.notready.eu/publication/edge-weighted-contact-representations-of-planar-graphs-2/Edge-weighted contact representations of planar graphshttps://ac.notready.eu/publication/edge-weighted-contact-representations-of-planar-graphs/Tue, 01 Jan 2013 00:00:00 +0000https://ac.notready.eu/publication/edge-weighted-contact-representations-of-planar-graphs/Euclidean Greedy Drawings of Treeshttps://ac.notready.eu/publication/euclidean-greedy-drawings-of-trees/Tue, 01 Jan 2013 00:00:00 +0000https://ac.notready.eu/publication/euclidean-greedy-drawings-of-trees/Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawingshttps://ac.notready.eu/publication/using-ilp-sat-to-determine-pathwidth-visibility-representations-and-other-grid-based-graph-drawings/Tue, 01 Jan 2013 00:00:00 +0000https://ac.notready.eu/publication/using-ilp-sat-to-determine-pathwidth-visibility-representations-and-other-grid-based-graph-drawings/