default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPatrizio Angelini
Person information
- affiliation: John Cabot University, Rome, Italy
- affiliation (former): Universität Tübingen, Germany
- affiliation (former): Roma Tre University, Rome, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j53]Patrizio Angelini, Michael A. Bekos, Giordano Da Lozzo, Martin Gronemann, Fabrizio Montecchiani, Alessandra Tappini:
Recognizing Map Graphs of Bounded Treewidth. Algorithmica 86(2): 613-637 (2024)- [j52]Patrizio Angelini
, Giordano Da Lozzo, Henry Förster, Thomas Schneck:
2-Layer k-Planar Graphs Density, Crossing Lemma, Relationships And Pathwidth. Comput. J. 67(3): 1005-1016 (2024) - [c71]Patrizio Angelini, Therese Biedl, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Seok-Hee Hong, Giuseppe Liotta, Maurizio Patrignani, Sergey Pupyrev, Ignaz Rutter, Alexander Wolff:
The Price of Upwardness. GD 2024: 13:1-13:20 - [i51]Patrizio Angelini, Therese Biedl, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Seok-Hee Hong, Giuseppe Liotta, Maurizio Patrignani, Sergey Pupyrev, Ignaz Rutter, Alexander Wolff:
The Price of Upwardness. CoRR abs/2409.01475 (2024) - 2023
- [j51]Patrizio Angelini, Michael A. Bekos, Henry Förster, Martin Gronemann:
Bitonic st-Orderings for Upward Planar Graphs: Splits and Bends in the Variable Embedding Scenario. Algorithmica 85(9): 2667-2692 (2023) - [j50]Abu Reyan Ahmed, Patrizio Angelini, Michael A. Bekos, Giuseppe Di Battista, Michael Kaufmann, Philipp Kindermann, Stephen G. Kobourov, Martin Nöllenburg, Antonios Symvonis, Anaïs Villedieu, Markus Wallinger:
Splitting Vertices in 2-Layer Graph Drawings. IEEE Computer Graphics and Applications 43(3): 24-35 (2023) - [j49]Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Vincenzo Roselli:
Morphing Triangle Contact Representations of Triangulations. Discret. Comput. Geom. 70(3): 991-1024 (2023) - [j48]Patrizio Angelini, Reinhard von Hanxleden:
Guest Editors' Foreword. J. Graph Algorithms Appl. 27(8): 621-623 (2023) - [c70]Patrizio Angelini, Michael A. Bekos, Julia Katheder, Michael Kaufmann, Maximilian Pfister, Torsten Ueckerdt:
Axis-Parallel Right Angle Crossing Graphs. ESA 2023: 9:1-9:15 - [e1]Patrizio Angelini, Reinhard von Hanxleden:
Graph Drawing and Network Visualization - 30th International Symposium, GD 2022, Tokyo, Japan, September 13-16, 2022, Revised Selected Papers. Lecture Notes in Computer Science 13764, Springer 2023, ISBN 978-3-031-22202-3 [contents] - [i50]Abu Reyan Ahmed, Patrizio Angelini, Michael A. Bekos, Giuseppe Di Battista, Michael Kaufmann, Philipp Kindermann, Stephen G. Kobourov, Martin Nöllenburg, Antonios Symvonis, Anaïs Villedieu, Markus Wallinger:
Splitting Vertices in 2-Layer Graph Drawings. CoRR abs/2301.10872 (2023) - [i49]Patrizio Angelini, Michael A. Bekos, Julia Katheder, Michael Kaufmann, Maximilian Pfister, Torsten Ueckerdt:
Axis-Parallel Right Angle Crossing Graphs. CoRR abs/2306.17073 (2023) - 2022
- [j47]Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo:
Planar L-Drawings of Bimodal Graphs. J. Graph Algorithms Appl. 26(3): 307-334 (2022) - [j46]Patrizio Angelini, Michael A. Bekos, Fabrizio Montecchiani, Maximilian Pfister:
On morphs of 1-plane graphs. J. Comput. Geom. 13(1) (2022) - [j45]Patrizio Angelini, Michael A. Bekos, Philipp Kindermann, Tamara Mchedlidze:
On mixed linear layouts of series-parallel graphs. Theor. Comput. Sci. 936: 129-138 (2022) - [c69]Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo:
On Upward-Planar L-Drawings of Graphs. MFCS 2022: 10:1-10:15 - [c68]Patrizio Angelini, Michael A. Bekos, Julia Katheder, Michael Kaufmann, Maximilian Pfister:
RAC Drawings of Graphs with Low Degree. MFCS 2022: 11:1-11:15 - [c67]Patrizio Angelini, Michael A. Bekos, Giordano Da Lozzo, Martin Gronemann, Fabrizio Montecchiani, Alessandra Tappini:
Recognizing Map Graphs of Bounded Treewidth. SWAT 2022: 8:1-8:18 - [i48]Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo:
On Upward-Planar L-Drawings of Graphs. CoRR abs/2205.05627 (2022) - [i47]Patrizio Angelini, Michael A. Bekos, Giordano Da Lozzo, Martin Gronemann, Fabrizio Montecchiani, Alessandra Tappini:
Recognizing Map Graphs of Bounded Treewidth. CoRR abs/2206.14898 (2022) - [i46]Patrizio Angelini, Michael A. Bekos, Julia Katheder, Michael Kaufmann, Maximilian Pfister:
RAC Drawings of Graphs with Low Degree. CoRR abs/2206.14909 (2022) - [i45]Patrizio Angelini, Reinhard von Hanxleden:
Proceedings of the 30th International Symposium on Graph Drawing and Network Visualization (GD 2022). CoRR abs/2209.04402 (2022) - 2021
- [j44]Patrizio Angelini, Ignaz Rutter, T. P. Sandhya:
Extending Partial Orthogonal Drawings. J. Graph Algorithms Appl. 25(1): 581-602 (2021) - [c66]Patrizio Angelini, Philipp Kindermann, Andre Löffler, Lena Schlipf, Antonios Symvonis:
One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons. GD 2021: 184-192 - [c65]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees. SODA 2021: 2779-2798 - [c64]Patrizio Angelini, Michael A. Bekos, Fabrizio Montecchiani, Maximilian Pfister:
On Morphing 1-Planar Drawings. WG 2021: 270-282 - [i44]Patrizio Angelini, Michael A. Bekos, Fabrizio Montecchiani, Maximilian Pfister:
On Morphing 1-Planar Drawings. CoRR abs/2105.13040 (2021) - [i43]Patrizio Angelini, Philipp Kindermann, Andre Löffler, Lena Schlipf, Antonios Symvonis:
One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons. CoRR abs/2108.12321 (2021) - 2020
- [j43]Patrizio Angelini, Peter Eades, Seok-Hee Hong, Karsten Klein, Stephen G. Kobourov, Giuseppe Liotta, Alfredo Navarra, Alessandra Tappini:
Graph Planarity by Replacing Cliques with Paths. Algorithms 13(8): 194 (2020) - [j42]Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg, Giordano Da Lozzo, Giuseppe Di Battista, Walter Didimo, Michael Hoffmann, Giuseppe Liotta, Fabrizio Montecchiani, Ignaz Rutter, Csaba D. Tóth:
Simple k-planar graphs are simple (k + 1)-quasiplanar. J. Comb. Theory B 142: 1-35 (2020) - [j41]Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Thomas Schneck:
Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity. J. Graph Algorithms Appl. 24(4): 573-601 (2020) - [j40]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Beyond level planarity: Cyclic, torus, and simultaneous level planarity. Theor. Comput. Sci. 804: 161-170 (2020) - [j39]Patrizio Angelini, Michael A. Bekos, Henry Förster, Michael Kaufmann:
On RAC drawings of graphs with one bend per edge. Theor. Comput. Sci. 828-829: 42-54 (2020) - [c63]Patrizio Angelini, Michael A. Bekos, Philipp Kindermann, Tamara Mchedlidze:
On Mixed Linear Layouts of Series-Parallel Graphs. GD 2020: 151-159 - [c62]Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo:
Planar L-Drawings of Bimodal Graphs. GD 2020: 205-219 - [c61]Patrizio Angelini, Ignaz Rutter, Sandhya T. P.:
Extending Partial Orthogonal Drawings. GD 2020: 265-278 - [c60]Patrizio Angelini, Giordano Da Lozzo, Henry Förster, Thomas Schneck:
2-Layer k-Planar Graphs - Density, Crossing Lemma, Relationships, and Pathwidth. GD 2020: 403-419 - [c59]Patrizio Angelini, Michael A. Bekos, Henry Förster, Martin Gronemann:
Bitonic st-Orderings for Upward Planar Graphs: The Variable Embedding Setting. WG 2020: 339-351 - [p1]Patrizio Angelini, Giordano Da Lozzo:
Beyond Clustered Planar Graphs. Beyond Planar Graphs 2020: 211-235 - [i42]Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo:
Planar L-Drawings of Bimodal Graphs. CoRR abs/2008.07834 (2020) - [i41]Patrizio Angelini, Giordano Da Lozzo, Henry Förster, Thomas Schneck:
2-Layer k-Planar Graphs: Density, Crossing Lemma, Relationships, and Pathwidth. CoRR abs/2008.09329 (2020) - [i40]Patrizio Angelini, Ignaz Rutter, Sandhya T. P.:
Extending Partial Orthogonal Drawings. CoRR abs/2008.10280 (2020) - [i39]Patrizio Angelini, Michael A. Bekos, Philipp Kindermann, Tamara Mchedlidze:
On Mixed Linear Layouts of Series-Parallel Graphs. CoRR abs/2008.10475 (2020) - [i38]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees. CoRR abs/2011.02431 (2020)
2010 – 2019
- 2019
- [j38]Patrizio Angelini, Michael A. Bekos:
Hierarchical Partial Planarity. Algorithmica 81(6): 2196-2221 (2019) - [j37]Patrizio Angelini, Giordano Da Lozzo:
Clustered Planarity with Pipes. Algorithmica 81(6): 2484-2526 (2019) - [j36]Patrizio Angelini, Michael A. Bekos, Giuseppe Liotta, Fabrizio Montecchiani:
Universal Slope Sets for 1-Bend Planar Drawings. Algorithmica 81(6): 2527-2556 (2019) - [j35]Abu Reyan Ahmed, Patrizio Angelini, Faryad Darabi Sahneh, Alon Efrat, David Glickenstein, Martin Gronemann, Niklas Heinsohn, Stephen G. Kobourov, Richard Spence, Joseph Watkins, Alexander Wolff:
Multi-level Steiner Trees. ACM J. Exp. Algorithmics 24(1): 2.5:1-2.5:22 (2019) - [j34]Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Fabrizio Montecchiani:
On 3D visibility representations of graphs with few crossings per edge. Theor. Comput. Sci. 784: 11-20 (2019) - [j33]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) - [c58]Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Vincenzo Roselli:
Morphing Contact Representations of Graphs. SoCG 2019: 10:1-10:16 - [c57]Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Thomas Schneck:
Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity. GD 2019: 253-267 - [c56]Patrizio Angelini, Henry Förster, Michael Hoffmann, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Maurizio Patrignani:
The QuaSEFE Problem. GD 2019: 268-275 - [c55]Patrizio Angelini, Michael A. Bekos, Martin Gronemann, Antonios Symvonis:
Geometric Representations of Dichotomous Ordinal Data. WG 2019: 205-217 - [i37]Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Vincenzo Roselli:
Morphing Contact Representations of Graphs. CoRR abs/1903.07595 (2019) - [i36]Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Thomas Schneck:
Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity. CoRR abs/1908.03042 (2019) - [i35]Patrizio Angelini, Henry Förster, Michael Hoffmann, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Maurizio Patrignani:
The QuaSEFE Problem. CoRR abs/1908.08708 (2019) - [i34]Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg, Giordano Da Lozzo, Giuseppe Di Battista, Walter Didimo, Michael Hoffmann, Giuseppe Liotta, Fabrizio Montecchiani, Ignaz Rutter, Csaba D. Tóth:
Simple k-Planar Graphs are Simple (k+1)-Quasiplanar. CoRR abs/1909.00223 (2019) - 2018
- [j32]Patrizio Angelini, Till Bruckdorfer, Giuseppe Di Battista, Michael Kaufmann, Tamara Mchedlidze, Vincenzo Roselli, Claudio Squarcella:
Small Universal Point Sets for k-Outerplanar Graphs. Discret. Comput. Geom. 60(2): 430-470 (2018) - [j31]Patrizio Angelini, Giordano Da Lozzo, Marco Di Bartolomeo, Valentino Di Donato, Maurizio Patrignani, Vincenzo Roselli, Ioannis G. Tollis:
Algorithms and Bounds for L-Drawings of Directed Graphs. Int. J. Found. Comput. Sci. 29(4): 461-480 (2018) - [j30]Patrizio Angelini, Giordano Da Lozzo:
3-coloring arrangements of line segments with 4 slopes is hard. Inf. Process. Lett. 137: 47-50 (2018) - [j29]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Valentino Di Donato, Philipp Kindermann, Günter Rote, Ignaz Rutter:
Windrose Planarity: Embedding Graphs with Direction-Constrained Edges. ACM Trans. Algorithms 14(4): 54:1-54:24 (2018) - [j28]Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Philipp Kindermann, Thomas Schneck:
1-Fan-bundle-planar drawings of graphs. Theor. Comput. Sci. 723: 23-50 (2018) - [c54]Patrizio Angelini, Peter Eades, Seok-Hee Hong, Karsten Klein, Stephen G. Kobourov, Giuseppe Liotta, Alfredo Navarra, Alessandra Tappini:
Turning Cliques into Paths to Achieve Planarity. GD 2018: 67-74 - [c53]Patrizio Angelini, Michael A. Bekos, Henry Förster, Michael Kaufmann:
On RAC Drawings of Graphs with One Bend per Edge. GD 2018: 123-136 - [c52]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 - [c51]Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Maximilian Pfister, Torsten Ueckerdt:
Beyond-Planarity: Turán-Type Results for Non-Planar Bipartite Graphs. ISAAC 2018: 28:1-28:13 - [c50]Abu Reyan Ahmed, Patrizio Angelini, Faryad Darabi Sahneh, Alon Efrat, David Glickenstein, Martin Gronemann, Niklas Heinsohn, Stephen G. Kobourov, Richard Spence, Joseph Watkins, Alexander Wolff:
Multi-Level Steiner Trees. SEA 2018: 15:1-15:14 - [i33]Abu Reyan Ahmed, Patrizio Angelini, Faryad Darabi Sahneh, Alon Efrat, David Glickenstein, Martin Gronemann, Niklas Heinsohn, Stephen G. Kobourov, Richard Spence, Joseph Watkins, Alexander Wolff:
Multi-Level Steiner Trees. CoRR abs/1804.02627 (2018) - [i32]Patrizio Angelini, Peter Eades, Seok-Hee Hong, Karsten Klein, Stephen G. Kobourov, Giuseppe Liotta, Alfredo Navarra, Alessandra Tappini:
Turning Cliques into Paths to Achieve Planarity. CoRR abs/1808.08925 (2018) - [i31]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) - [i30]Patrizio Angelini, Michael A. Bekos, Henry Förster, Michael Kaufmann:
On RAC Drawings of Graphs with one Bend per Edge. CoRR abs/1808.10470 (2018) - 2017
- [j27]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati:
Strip Planarity Testing for Embedded Planar Graphs. Algorithmica 77(4): 1022-1059 (2017) - [j26]Patrizio Angelini:
Monotone drawings of graphs with few directions. Inf. Process. Lett. 120: 16-22 (2017) - [j25]Patrizio Angelini, Michael A. Bekos, Felice De Luca, Walter Didimo, Michael Kaufmann, Stephen G. Kobourov, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Vincenzo Roselli, Antonios Symvonis:
Vertex-Coloring with Defects. J. Graph Algorithms Appl. 21(3): 313-340 (2017) - [j24]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Intersection-Link Representations of Graphs. J. Graph Algorithms Appl. 21(4): 731-755 (2017) - [j23]Soroush Alamdari, Patrizio Angelini, Fidel Barrera-Cruz, Timothy M. Chan, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Penny Haxell, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli, Sahil Singla, Bryan T. Wilkinson:
How to Morph Planar Graph Drawings. SIAM J. Comput. 46(2): 824-852 (2017) - [c49]Patrizio Angelini, Michael A. Bekos, Giuseppe Liotta, Fabrizio Montecchiani:
A Universal Slope Set for 1-Bend Planar Drawings. SoCG 2017: 9:1-9:16 - [c48]Patrizio Angelini, Steven Chaplick, Felice De Luca, Jirí Fiala, Jaroslav Hancl Jr., Niklas Heinsohn, Michael Kaufmann, Stephen G. Kobourov, Jan Kratochvíl, Pavel Valtr:
On Vertex- and Empty-Ply Proximity Drawings. GD 2017: 24-37 - [c47]Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Fabrizio Montecchiani:
3D Visibility Representations of 1-planar Graphs. GD 2017: 102-109 - [c46]Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Philipp Kindermann, Thomas Schneck:
1-Fan-Bundle-Planar Drawings of Graphs. GD 2017: 517-530 - [c45]Patrizio Angelini, Michael A. Bekos:
Hierarchical Partial Planarity. WG 2017: 45-58 - [c44]Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg, Giordano Da Lozzo, Giuseppe Di Battista, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Ignaz Rutter:
On the Relationship Between k-Planar and k-Quasi-Planar Graphs. WG 2017: 59-74 - [i29]Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Philipp Kindermann, Thomas Schneck:
1-Fan-Bundle-Planar Drawings of Graphs. CoRR abs/1702.06163 (2017) - [i28]Patrizio Angelini, Michael A. Bekos, Giuseppe Liotta, Fabrizio Montecchiani:
Universal Slope Sets for 1-Bend Planar Drawings. CoRR abs/1703.04283 (2017) - [i27]Patrizio Angelini, Michael A. Bekos:
Hierarchical Partial Planarity. CoRR abs/1707.06844 (2017) - [i26]Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Fabrizio Montecchiani:
3D Visibility Representations of 1-planar Graphs. CoRR abs/1708.06196 (2017) - [i25]Patrizio Angelini, Steven Chaplick, Felice De Luca, Jirí Fiala, Jan Hancl Jr., Niklas Heinsohn, Michael Kaufmann, Stephen G. Kobourov, Jan Kratochvíl, Pavel Valtr:
On Vertex- and Empty-Ply Proximity Drawings. CoRR abs/1708.09233 (2017) - [i24]Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Maximilian Pfister, Torsten Ueckerdt:
Beyond-Planarity: Density Results for Bipartite Graphs. CoRR abs/1712.09855 (2017) - 2016
- [j22]Patrizio Angelini, Giordano Da Lozzo:
SEFE = C-Planarity? Comput. J. 59(12): 1831-1838 (2016) - [j21]Patrizio Angelini, William S. Evans, Fabrizio Frati, Joachim Gudmundsson:
SEFE without Mapping via Large Induced Outerplane Graphs in Plane Graphs. J. Graph Theory 82(1): 45-64 (2016) - [c43]Patrizio Angelini, Michael A. Bekos, Till Bruckdorfer, Jaroslav Hancl Jr., Michael Kaufmann, Stephen G. Kobourov, Antonios Symvonis, Pavel Valtr:
Low Ply Drawings of Trees. GD 2016: 236-248 - [c42]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Beyond Level Planarity. GD 2016: 482-495 - [c41]Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Giuseppe Di Battista, Peter Eades, Philipp Kindermann, Jan Kratochvíl, Fabian Lipp, Ignaz Rutter:
Simultaneous Orthogonal Planarity. GD 2016: 532-545 - [c40]Patrizio Angelini, Giordano Da Lozzo:
Clustered Planarity with Pipes. ISAAC 2016: 13:1-13:13 - [c39]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Valentino Di Donato, Philipp Kindermann, Günter Rote, Ignaz Rutter:
Windrose Planarity: Embedding Graphs with Direction-Constrained Edges. SODA 2016: 985-996 - [c38]Patrizio Angelini, Giordano Da Lozzo, Marco Di Bartolomeo, Valentino Di Donato, Maurizio Patrignani, Vincenzo Roselli, Ioannis G. Tollis:
L-Drawings of Directed Graphs. SOFSEM 2016: 134-147 - [c37]Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Vincenzo Roselli:
Vertex-Coloring with Star-Defects. WALCOM 2016: 40-51 - [i23]Soroush Alamdari, Patrizio Angelini, Fidel Barrera-Cruz, Timothy M. Chan, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Penny Haxell, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli, Sahil Singla, Bryan T. Wilkinson:
How to morph planar graph drawings. CoRR abs/1606.00425 (2016) - [i22]Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Giuseppe Di Battista, Peter Eades, Philipp Kindermann, Jan Kratochvíl, Fabian Lipp, Ignaz Rutter:
Simultaneous Orthogonal Planarity. CoRR abs/1608.08427 (2016) - [i21]Patrizio Angelini, Michael A. Bekos, Till Bruckdorfer, Jaroslav Hancl, Michael Kaufmann, Stephen G. Kobourov, Antonios Symvonis, Pavel Valtr:
Low Ply Drawings of Trees. CoRR abs/1608.08538 (2016) - [i20]Patrizio Angelini, Giordano Da Lozzo:
Clustered Planarity with Pipes. CoRR abs/1609.09679 (2016) - 2015
- [j20]Patrizio Angelini, Walter Didimo, Stephen G. Kobourov, Tamara Mchedlidze, Vincenzo Roselli, Antonios Symvonis, Stephen K. Wismath:
Monotone Drawings of Graphs with Fixed Embedding. Algorithmica 71(2): 233-257 (2015) - [j19]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
Relaxing the constraints of clustered planarity. Comput. Geom. 48(2): 42-75 (2015) - [j18]Patrizio Angelini, Carla Binucci, Giordano Da Lozzo, Walter Didimo, Luca Grilli, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis G. Tollis:
Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs. Comput. Geom. 50: 34-48 (2015) - [j17]Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Vít Jelínek, Jan Kratochvíl, Maurizio Patrignani, Ignaz Rutter:
Testing Planarity of Partially Embedded Graphs. ACM Trans. Algorithms 11(4): 32:1-32:42 (2015) - [j16]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Vincenzo Roselli:
The importance of being proper: (In clustered-level planarity and T-level planarity). Theor. Comput. Sci. 571: 1-9 (2015) - [j15]Patrizio Angelini, Giordano Da Lozzo, Daniel Neuwirth:
Advancements on SEFE and Partitioned Book Embedding problems. Theor. Comput. Sci. 575: 71-89 (2015) - [c36]Patrizio Angelini, Giordano Da Lozzo, Fabrizio Frati, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli:
Optimal Morphs of Convex Drawings. SoCG 2015: 126-140 - [c35]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Intersection-Link Representations of Graphs. GD 2015: 217-230 - [c34]Patrizio Angelini, Till Bruckdorfer, Michael Kaufmann, Tamara Mchedlidze:
A Universal Point Set for 2-Outerplanar Graphs. GD 2015: 409-422 - [c33]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
On the Relationship Between Map Graphs and Clique Planar Graphs. GD 2015: 548-550 - [c32]Patrizio Angelini:
Monotone drawings of graphs with few directions. IISA 2015: 1-6 - [i19]Patrizio Angelini, Giordano Da Lozzo, Fabrizio Frati, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli:
Optimal Morphs of Convex Drawings. CoRR abs/1503.09021 (2015) - [i18]Patrizio Angelini, Till Bruckdorfer, Michael Kaufmann, Tamara Mchedlidze:
A Universal Point Set for 2-Outerplanar Graphs. CoRR abs/1508.05784 (2015) - [i17]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Intersection-Link Representations of Graphs. CoRR abs/1508.07557 (2015) - [i16]Patrizio Angelini, Giordano Da Lozzo, Marco Di Bartolomeo, Valentino Di Donato, Maurizio Patrignani, Vincenzo Roselli, Ioannis G. Tollis:
L-Drawings of Directed Graphs. CoRR abs/1509.00684 (2015) - [i15]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Valentino Di Donato, Philipp Kindermann, Günter Rote, Ignaz Rutter:
Windrose Planarity: Embedding Graphs with Direction-Constrained Edges. CoRR abs/1510.02659 (2015) - [i14]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Testing Cyclic Level and Simultaneous Level Planarity. CoRR abs/1510.08274 (2015) - [i13]Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Vincenzo Roselli:
Vertex-Coloring with Star-Defects. CoRR abs/1512.02505 (2015) - 2014
- [j14]Patrizio Angelini, Till Bruckdorfer, Marco Chiesa, Fabrizio Frati, Michael Kaufmann, Claudio Squarcella:
On the area requirements of Euclidean minimum spanning trees. Comput. Geom. 47(2): 200-213 (2014) - [j13]Patrizio Angelini, Thomas Bläsius, Ignaz Rutter:
Testing Mutual duality of Planar graphs. Int. J. Comput. Geom. Appl. 24(4): 325-346 (2014) - [j12]Patrizio Angelini, David Eppstein, Fabrizio Frati, Michael Kaufmann, Sylvain Lazard, Tamara Mchedlidze, Monique Teillaud, Alexander Wolff:
Universal Point Sets for Drawing Planar Graphs with Circular Arcs. J. Graph Algorithms Appl. 18(3): 313-324 (2014) - [c31]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Vincenzo Roselli:
The Importance of Being Proper - (In Clustered-Level Planarity and T-Level Planarity). GD 2014: 246-258 - [c30]Patrizio Angelini, Giordano Da Lozzo, Marco Di Bartolomeo, Giuseppe Di Battista, Seok-Hee Hong, Maurizio Patrignani, Vincenzo Roselli:
Anchored Drawings of Planar Graphs. GD 2014: 404-415 - [c29]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
Morphing Planar Graph Drawings Optimally. ICALP (1) 2014: 126-137 - [c28]Patrizio Angelini, Giordano Da Lozzo, Daniel Neuwirth:
On Some $\mathcal{NP}$ -complete SEFE Problems. WALCOM 2014: 200-212 - [i12]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
Morphing Planar Graph Drawings Optimally. CoRR abs/1402.4364 (2014) - [i11]Patrizio Angelini, Giordano Da Lozzo:
Deepening the Relationship between SEFE and C-Planarity. CoRR abs/1404.6175 (2014) - [i10]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Vincenzo Roselli:
On the Complexity of Clustered-Level Planarity and T-Level Planarity. CoRR abs/1406.6533 (2014) - 2013
- [j11]Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati:
Simultaneous Embedding of Embedded Planar graphs. Int. J. Comput. Geom. Appl. 23(2): 93-126 (2013) - [j10]Patrizio Angelini, Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani:
Topological morphing of planar graphs. Theor. Comput. Sci. 514: 2-20 (2013) - [c27]Patrizio Angelini, David Eppstein, Fabrizio Frati, Michael Kaufmann, Sylvain Lazard, Tamara Mchedlidze, Monique Teillaud, Alexander Wolff:
Universal Point Sets for Planar Graph Drawings with Circular Arcs. CCCG 2013 - [c26]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati:
Strip Planarity Testing. GD 2013: 37-48 - [c25]Patrizio Angelini, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
Morphing Planar Graph Drawings Efficiently. GD 2013: 49-60 - [c24]Patrizio Angelini, Carla Binucci, Giordano Da Lozzo, Walter Didimo, Luca Grilli, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis G. Tollis:
Drawing Non-Planar Graphs with Crossing-Free Subgraphs. GD 2013: 292-303 - [c23]Patrizio Angelini, William S. Evans, Fabrizio Frati, Joachim Gudmundsson:
SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs. ISAAC 2013: 185-195 - [c22]Patrizio Angelini, Thomas Bläsius, Ignaz Rutter:
Testing Mutual Duality of Planar Graphs. ISAAC 2013: 350-360 - [c21]Soroush Alamdari, Patrizio Angelini, Timothy M. Chan, Giuseppe Di Battista, Fabrizio Frati, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli, Sahil Singla, Bryan T. Wilkinson:
Morphing Planar Graph Drawings with a Polynomial Number of Steps. SODA 2013: 1656-1667 - [i9]Patrizio Angelini, Thomas Bläsius, Ignaz Rutter:
Testing Mutual Duality of Planar Graphs. CoRR abs/1303.1640 (2013) - [i8]Patrizio Angelini, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
Morphing Planar Graphs Drawings Efficiently. CoRR abs/1308.4291 (2013) - [i7]Patrizio Angelini, Carla Binucci, Giordano Da Lozzo, Walter Didimo, Luca Grilli, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis G. Tollis:
Drawings of Non-planar Graphs with Crossing-free Subgraphs. CoRR abs/1308.6706 (2013) - [i6]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati:
Strip Planarity Testing of Embedded Planar Graphs. CoRR abs/1309.0683 (2013) - [i5]Patrizio Angelini, William S. Evans, Fabrizio Frati, Joachim Gudmundsson:
SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs. CoRR abs/1309.4713 (2013) - [i4]Patrizio Angelini, Giordano Da Lozzo, Daniel Neuwirth:
On the Complexity of Some Problems Related to SEFE. CoRR abs/1311.3607 (2013) - 2012
- [j9]Patrizio Angelini, Fabrizio Frati:
Acyclically 3-colorable planar graphs. J. Comb. Optim. 24(2): 116-130 (2012) - [j8]Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph. J. Discrete Algorithms 14: 150-172 (2012) - [j7]Patrizio Angelini, Enrico Colasante, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Monotone Drawings of Graphs. J. Graph Algorithms Appl. 16(1): 5-35 (2012) - [j6]Patrizio Angelini, Markus Geyer, Michael Kaufmann, Daniel Neuwirth:
On a Tree and a Path with no Geometric Simultaneous Embedding. J. Graph Algorithms Appl. 16(1): 37-83 (2012) - [j5]Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati:
Succinct greedy drawings do not always exist. Networks 59(3): 267-274 (2012) - [c20]Patrizio Angelini, Marco Di Bartolomeo, Giuseppe Di Battista:
Implementing a Partitioned 2-Page Book Embedding Testing Algorithm. GD 2012: 79-89 - [c19]Patrizio Angelini, Carla Binucci, William S. Evans, Ferran Hurtado, Giuseppe Liotta, Tamara Mchedlidze, Henk Meijer, Yoshio Okamoto:
Universal Point Subsets for Planar Graphs. ISAAC 2012: 423-432 - [i3]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Vincenzo Roselli:
Beyond Clustered Planarity. CoRR abs/1207.3934 (2012) - [i2]Patrizio Angelini, Marco Di Bartolomeo, Giuseppe Di Battista:
Implementing a Partitioned 2-page Book Embedding Testing Algorithm. CoRR abs/1209.0598 (2012) - 2011
- [j4]Patrizio Angelini, Giuseppe Di Battista, Maurizio Patrignani:
Finding a Minimum-depth Embedding of a Planar Graph in O(n4) Time. Algorithmica 60(4): 890-937 (2011) - [j3]Patrizio Angelini, Fabrizio Frati, Michael Kaufmann:
Straight-Line Rectangular Drawings of Clustered Graphs. Discret. Comput. Geom. 45(1): 88-140 (2011) - [j2]Patrizio Angelini, Luca Cittadini, Walter Didimo, Fabrizio Frati, Giuseppe Di Battista, Michael Kaufmann, Antonios Symvonis:
On the Perspectives Opened by Right Angle Crossing Drawings. J. Graph Algorithms Appl. 15(1): 53-78 (2011) - [c18]Patrizio Angelini, Giuseppe Di Battista, Michael Kaufmann, Tamara Mchedlidze, Vincenzo Roselli, Claudio Squarcella:
Small Point Sets for Simply-Nested Planar Graphs. GD 2011: 75-85 - [c17]Patrizio Angelini, Walter Didimo, Stephen G. Kobourov, Tamara Mchedlidze, Vincenzo Roselli, Antonios Symvonis, Stephen K. Wismath:
Monotone Drawings of Graphs with Fixed Embedding. GD 2011: 379-390 - [c16]Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati:
Simultaneous Embedding of Embedded Planar Graphs. ISAAC 2011: 271-280 - [c15]Patrizio Angelini, Giuseppe Di Battista, Walter Didimo, Fabrizio Frati, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Anna Lubiw:
Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area. EGC 2011: 200-209 - [c14]Patrizio Angelini, Till Bruckdorfer, Marco Chiesa, Fabrizio Frati, Michael Kaufmann, Claudio Squarcella:
On the Area Requirements of Euclidean Minimum Spanning Trees. WADS 2011: 25-36 - 2010
- [j1]Patrizio Angelini, Fabrizio Frati, Luca Grilli:
An Algorithm to Construct Greedy Drawings of Triangulations. J. Graph Algorithms Appl. 14(1): 19-51 (2010) - [c13]Patrizio Angelini, Enrico Colasante, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Monotone Drawings of Graphs. GD 2010: 13-24 - [c12]Patrizio Angelini, Fabrizio Frati, Markus Geyer, Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis:
Upward Geometric Graph Embeddings into Point Sets. GD 2010: 25-37 - [c11]Patrizio Angelini, Markus Geyer, Michael Kaufmann, Daniel Neuwirth:
On a Tree and a Path with No Geometric Simultaneous Embedding. GD 2010: 38-49 - [c10]Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree. IWOCA 2010: 212-225 - [c9]Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Vít Jelínek, Jan Kratochvíl, Maurizio Patrignani, Ignaz Rutter:
Testing Planarity of Partially Embedded Graphs. SODA 2010: 202-221 - [c8]Patrizio Angelini, Fabrizio Frati:
Acyclically 3-Colorable Planar Graphs. WALCOM 2010: 113-124 - [i1]Patrizio Angelini, Markus Geyer, Michael Kaufmann, Daniel Neuwirth:
On a Tree and a Path with no Geometric Simultaneous Embedding. CoRR abs/1001.0555 (2010)
2000 – 2009
- 2009
- [c7]Patrizio Angelini, Luca Cittadini, Giuseppe Di Battista, Walter Didimo, Fabrizio Frati, Michael Kaufmann, Antonios Symvonis:
On the Perspectives Opened by Right Angle Crossing Drawings. GD 2009: 21-32 - [c6]Patrizio Angelini, Fabrizio Frati, Maurizio Patrignani:
Splitting Clusters to Get C-Planarity. GD 2009: 57-68 - [c5]Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati:
Succinct Greedy Drawings Do Not Always Exist. GD 2009: 171-182 - [c4]Patrizio Angelini, Fabrizio Frati, Michael Kaufmann:
Straight-Line Rectangular Drawings of Clustered Graphs. WADS 2009: 25-36 - 2008
- [c3]Patrizio Angelini, Fabrizio Frati, Luca Grilli:
An Algorithm to Construct Greedy Drawings of Triangulations. GD 2008: 26-37 - [c2]Patrizio Angelini, Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani:
Topological Morphing of Planar Graphs. GD 2008: 145-156 - 2007
- [c1]Patrizio Angelini, Giuseppe Di Battista, Maurizio Patrignani:
Computing a Minimum-Depth Planar Graph Embedding in O ( n 4) Time. WADS 2007: 287-299
Coauthor Index
[j50] [i50] [c65] [j42] [j40] [i38] [i34] [j32] [j29] [j27] [j24] [j23] [c44] [c42] [c41] [c39] [i23] [i22] [j19] [j17] [j16] [c35] [c33] [i17] [i15] [i14] [c31] [c30] [c29] [i12] [i10] [j11] [j10] [c26] [c21] [i6] [j8] [j7] [j5] [c20] [i3] [i2] [j4] [j2] [c18] [c16] [c15] [c13] [c10] [c9] [c7] [c5] [c2] [c1]
[c65] [j40] [i38] [j27] [j24] [j23] [j21] [c42] [i23] [j19] [j17] [j16] [c36] [c35] [c33] [i19] [i17] [i14] [j14] [j12] [c31] [c29] [i12] [i10] [j11] [c27] [c26] [c25] [c23] [c21] [i8] [i6] [i5] [j9] [j8] [j7] [j5] [i3] [j3] [j2] [c16] [c15] [c14] [j1] [c13] [c12] [c10] [c9] [c8] [c7] [c6] [c5] [c4] [c3]
[j53] [j52] [c71] [i51] [j49] [j47] [c69] [c67] [i48] [i47] [c65] [j42] [j40] [c62] [c60] [p1] [i42] [i41] [i38] [j37] [c58] [i37] [i34] [j31] [j30] [j29] [j27] [j24] [j23] [c44] [j22] [c42] [c41] [c40] [c39] [c38] [i23] [i22] [i20] [j19] [j18] [j16] [j15] [c36] [c35] [c33] [i19] [i17] [i16] [i15] [i14] [c31] [c30] [c29] [c28] [i12] [i11] [i10] [c26] [c24] [i7] [i6] [i4] [i3]
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 2024-10-30 21:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
