default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGiordano Da Lozzo
Person information
- affiliation: University of California, Irvine, USA
- 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
[j41]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)- [j40]Steven Chaplick
, Giordano Da Lozzo, Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees. Algorithmica 86(8): 2413-2447 (2024) - [j39]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) - [j38]Michael A. Bekos, Giordano Da Lozzo, Petr Hlinený, Michael Kaufmann:
Graph Product Structure for $h$-Framed Graphs. Electron. J. Comb. 31(4) (2024) - [j37]Michael A. Bekos, Giordano Da Lozzo, Svenja M. Griesbach, Martin Gronemann, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou:
Book embeddings of k-framed graphs and k-map graphs. Discret. Math. 347(1): 113690 (2024) - [j36]Carlos Alegría, Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Testing the planar straight-line realizability of 2-trees with prescribed edge lengths. Eur. J. Comb. 119: 103806 (2024) - [j35]Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo:
On Upward-Planar L-Drawings of Graphs. J. Graph Algorithms Appl. 28(1): 275-299 (2024) - [j34]Carlos Alegría, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, Maurizio Patrignani:
Unit-length Rectangular Drawings of Graphs. J. Graph Algorithms Appl. 28(1): 403-437 (2024) - [c57]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 - [c56]Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Ignaz Rutter, Ioannis G. Tollis:
Weakly Leveled Planarity with Bounded Span. GD 2024: 19:1-19:19 - [c55]Susanna Caroppo, Giordano Da Lozzo, Giuseppe Di Battista:
Quantum Algorithms for One-Sided Crossing Minimization. GD 2024: 20:1-20:9 - [c54]Carlos Alegría, Susanna Caroppo, Giordano Da Lozzo, Marco D'Elia, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, Maurizio Patrignani:
Upward Pointset Embeddings of Planar st-Graphs. GD 2024: 24:1-24:18 - [c53]Giordano Da Lozzo, Walter Didimo, Fabrizio Montecchiani, Miriam Münch, Maurizio Patrignani, Ignaz Rutter:
Simple Realizability of Abstract Topological Graphs. ISAAC 2024: 23:1-23:15 - [c52]Giordano Da Lozzo, Robert Ganian, Siddharth Gupta, Bojan Mohar, Sebastian Ordyniak, Meirav Zehavi:
Exact Algorithms for Clustered Planarity with Linear Saturators. ISAAC 2024: 24:1-24:16 - [c51]Susanna Caroppo, Giordano Da Lozzo, Giuseppe Di Battista:
Quantum Graph Drawing. WALCOM 2024: 32-46 - [c50]Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, Maurizio Patrignani:
Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs. WALCOM 2024: 350-364 - [i57]Carlos Alegría, Susanna Caroppo, Giordano Da Lozzo, Marco D'Elia, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, Maurizio Patrignani:
Upward Pointset Embeddings of Planar st-Graphs. CoRR abs/2408.17369 (2024) - [i56]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) - [i55]Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Ignaz Rutter, Ioannis G. Tollis:
Weakly Leveled Planarity with Bounded Span. CoRR abs/2409.01889 (2024) - [i54]Susanna Caroppo, Giordano Da Lozzo, Giuseppe Di Battista:
Quantum Algorithms for One-Sided Crossing Minimization. CoRR abs/2409.01942 (2024) - [i53]Giordano Da Lozzo, Robert Ganian, Siddharth Gupta, Bojan Mohar, Sebastian Ordyniak, Meirav Zehavi:
Exact Algorithms for Clustered Planarity with Linear Saturators. CoRR abs/2409.19410 (2024) - [i52]Giordano Da Lozzo, Walter Didimo, Fabrizio Montecchiani, Miriam Münch, Maurizio Patrignani, Ignaz Rutter:
Simple Realizability of Abstract Topological Graphs. CoRR abs/2409.20108 (2024) - 2023
- [j33]Carla Binucci, Giordano Da Lozzo, Emilio Di Giacomo, Walter Didimo, Tamara Mchedlidze, Maurizio Patrignani:
Upward Book Embeddability of st-Graphs: Complexity and Algorithms. Algorithmica 85(12): 3521-3571 (2023) - [j32]Steven Chaplick, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Martin Nöllenburg, Maurizio Patrignani, Ioannis G. Tollis, Alexander Wolff:
Planar L-Drawings of Directed Graphs. Comput. Geom. Topol. 2(1): 7:1-7:15 (2023) - [j31]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) - [j30]Sujoy Bhore, Giordano Da Lozzo, Fabrizio Montecchiani, Martin Nöllenburg:
On the upward book thickness problem: Combinatorial and complexity results. Eur. J. Comb. 110: 103662 (2023) - [j29]Giordano Da Lozzo, Philipp Kindermann:
Guest Editors' Foreword. J. Graph Algorithms Appl. 27(6): 405-408 (2023) - [j28]Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Martin Gronemann, Tamara Mchedlidze, Chrysanthi N. Raftopoulou:
Recognizing DAGs with page-number 2 is NP-complete. Theor. Comput. Sci. 946: 113689 (2023) - [c49]Sabine Cornelsen, Giordano Da Lozzo, Luca Grilli, Siddharth Gupta, Jan Kratochvíl, Alexander Wolff:
The Parametrized Complexity of the Segment Number. GD (2) 2023: 97-113 - [i51]Susanna Caroppo, Giordano Da Lozzo, Giuseppe Di Battista:
Quantum Graph Drawing. CoRR abs/2307.08371 (2023) - [i50]Sabine Cornelsen, Giordano Da Lozzo, Luca Grilli, Siddharth Gupta, Jan Kratochvíl, Alexander Wolff:
The Parametrized Complexity of the Segment Number. CoRR abs/2308.15416 (2023) - [i49]Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, Maurizio Patrignani:
Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs. CoRR abs/2310.02247 (2023) - 2022
- [j27]Fidel Barrera-Cruz, Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
How to Morph a Tree on a Small Grid. Discret. Comput. Geom. 67(3): 743-786 (2022) - [j26]Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo:
Planar L-Drawings of Bimodal Graphs. J. Graph Algorithms Appl. 26(3): 307-334 (2022) - [c48]Carlos Alegría, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, Maurizio Patrignani:
Unit-length Rectangular Drawings of Graphs. GD 2022: 127-143 - [c47]Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Martin Gronemann, Tamara Mchedlidze, Chrysanthi N. Raftopoulou:
Recognizing DAGs with Page-Number 2 Is NP-complete. GD 2022: 361-370 - [c46]Michael A. Bekos, Giordano Da Lozzo, Petr Hlinený, Michael Kaufmann:
Graph Product Structure for h-Framed Graphs. ISAAC 2022: 23:1-23:15 - [c45]Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo:
On Upward-Planar L-Drawings of Graphs. MFCS 2022: 10:1-10:15 - [c44]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]Michael A. Bekos, Giordano Da Lozzo, Petr Hlinený, Michael Kaufmann:
Graph Product Structure for h-Framed Graphs. CoRR abs/2204.11495 (2022) - [i47]Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo:
On Upward-Planar L-Drawings of Graphs. CoRR abs/2205.05627 (2022) - [i46]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) - [i45]Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Martin Gronemann, Tamara Mchedlidze, Chrysanthi N. Raftopoulou:
Recognizing DAGs with Page-Number 2 is NP-complete. CoRR abs/2208.13615 (2022) - [i44]Carlos Alegría, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, Maurizio Patrignani:
Unit-length Rectangular Drawings of Graphs. CoRR abs/2208.14142 (2022) - 2021
- [j25]Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta:
C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width. Algorithmica 83(8): 2471-2502 (2021) - [c43]Carlos Alegría, Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Planar Straight-Line Realizations of 2-Trees with Prescribed Edge Lengths. GD 2021: 166-183 - [c42]Sujoy Bhore, Giordano Da Lozzo, Fabrizio Montecchiani, Martin Nöllenburg:
On the Upward Book Thickness Problem: Combinatorial and Complexity Results. GD 2021: 242-256 - [c41]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 - [c40]Steven Chaplick, Giordano Da Lozzo, Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees. WADS 2021: 271-285 - [i43]Steven Chaplick, Giordano Da Lozzo, Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees. CoRR abs/2105.08124 (2021) - [i42]Sujoy Bhore, Giordano Da Lozzo, Fabrizio Montecchiani, Martin Nöllenburg:
On the Upward Book Thickness Problem: Combinatorial and Complexity Results. CoRR abs/2108.12327 (2021) - [i41]Carlos Alegría, Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Planar Straight-line Realizations of 2-Trees with Prescribed Edge Lengths. CoRR abs/2108.12628 (2021) - 2020
- [j24]Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
Upward Planar Morphs. Algorithmica 82(10): 2985-3017 (2020) - [j23]Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati:
Extending upward planar graph drawings. Comput. Geom. 91: 101668 (2020) - [j22]Giordano Da Lozzo, Anthony D'Angelo, Fabrizio Frati:
On Planar Greedy Drawings of 3-Connected Planar Graphs. Discret. Comput. Geom. 63(1): 114-157 (2020) - [j21]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) - [j20]Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Graph Stories in Small Area. J. Graph Algorithms Appl. 24(3): 269-292 (2020) - [j19]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) - [c39]Giordano Da Lozzo, Anthony D'Angelo, Fabrizio Frati:
On the Area Requirements of Planar Greedy Drawings of Triconnected Planar Graphs. COCOON 2020: 435-447 - [c38]Michael A. Bekos, Giordano Da Lozzo, Svenja Griesbach, Martin Gronemann, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou:
Book Embeddings of Nonplanar Graphs with Small Faces in Few Pages. SoCG 2020: 16:1-16:17 - [c37]Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo:
Planar L-Drawings of Bimodal Graphs. GD 2020: 205-219 - [c36]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 - [p1]Patrizio Angelini, Giordano Da Lozzo:
Beyond Clustered Planar Graphs. Beyond Planar Graphs 2020: 211-235 - [i40]Giordano Da Lozzo, Anthony D'Angelo, Fabrizio Frati:
On the Area Requirements of Planar Greedy Drawings of Triconnected Planar Graphs. CoRR abs/2003.00556 (2020) - [i39]Michael A. Bekos, Giordano Da Lozzo, Svenja Griesbach, Martin Gronemann, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou:
Book Embeddings of Nonplanar Graphs with Small Faces in Few Pages. CoRR abs/2003.07655 (2020) - [i38]Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo:
Planar L-Drawings of Bimodal Graphs. CoRR abs/2008.07834 (2020) - [i37]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) - [i36]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
- [j18]Patrizio Angelini, Giordano Da Lozzo:
Clustered Planarity with Pipes. Algorithmica 81(6): 2484-2526 (2019) - [j17]Giordano Da Lozzo, Ignaz Rutter:
Planarity of streamed graphs. Theor. Comput. Sci. 799: 1-21 (2019) - [c35]Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Vincenzo Roselli:
Morphing Contact Representations of Graphs. SoCG 2019: 10:1-10:16 - [c34]Carla Binucci, Giordano Da Lozzo, Emilio Di Giacomo, Walter Didimo, Tamara Mchedlidze, Maurizio Patrignani:
Upward Book Embeddings of st-Graphs. SoCG 2019: 13:1-13:22 - [c33]Juan José Besa Vial, Giordano Da Lozzo, Michael T. Goodrich:
Computing k-Modal Embeddings of Planar Digraphs. ESA 2019: 19:1-19:16 - [c32]Manuel Borrazzo, Giordano Da Lozzo, Fabrizio Frati, Maurizio Patrignani:
Graph Stories in Small Area. GD 2019: 545-558 - [c31]Giordano Da Lozzo, Ignaz Rutter:
Reaching 3-Connectivity via Edge-Edge Additions. IWOCA 2019: 175-187 - [c30]Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta:
C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width. IPEC 2019: 9:1-9:17 - [c29]Fidel Barrera-Cruz, Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
How to Morph a Tree on a Small Grid. WADS 2019: 57-70 - [c28]Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati:
Extending Upward Planar Graph Drawings. WADS 2019: 339-352 - [i35]Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati:
Extending Upward Planar Graph Drawings. CoRR abs/1902.06575 (2019) - [i34]Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Vincenzo Roselli:
Morphing Contact Representations of Graphs. CoRR abs/1903.07595 (2019) - [i33]Carla Binucci, Giordano Da Lozzo, Emilio Di Giacomo, Walter Didimo, Tamara Mchedlidze, Maurizio Patrignani:
Upward Book Embeddings of st-Graphs. CoRR abs/1903.07966 (2019) - [i32]Juan José Besa Vial, Giordano Da Lozzo, Michael T. Goodrich:
Computing k-Modal Embeddings of Planar Digraphs. CoRR abs/1907.01630 (2019) - [i31]Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Graph Stories in Small Area. CoRR abs/1908.09318 (2019) - [i30]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) - [i29]Fidel Barrera-Cruz, Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
How to Morph a Tree on a Small Grid. CoRR abs/1909.07093 (2019) - [i28]Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta:
C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width. CoRR abs/1910.02057 (2019) - 2018
- [j16]Robin Anderson, Shuliang Bai, Fidel Barrera-Cruz, Éva Czabarka, Giordano Da Lozzo, Natalie L. F. Hobson, Jephian C.-H. Lin, Austin Mohr, Heather C. Smith, László A. Székely, Hays Whitlatch:
Analogies between the Crossing Number and the Tangle Crossing Number. Electron. J. Comb. 25(4): 4 (2018) - [j15]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) - [j14]Patrizio Angelini, Giordano Da Lozzo:
3-coloring arrangements of line segments with 4 slopes is hard. Inf. Process. Lett. 137: 47-50 (2018) - [j13]Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Computing NodeTrix Representations of Clustered Graphs. J. Graph Algorithms Appl. 22(2): 139-176 (2018) - [j12]Giordano Da Lozzo, Vida Dujmovic, Fabrizio Frati, Tamara Mchedlidze, Vincenzo Roselli:
Drawing planar graphs with many collinear vertices. J. Comput. Geom. 9(1): 94-130 (2018) - [j11]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) - [c27]Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
Upward Planar Morphs. GD 2018: 92-105 - [c26]Giordano Da Lozzo, Ignaz Rutter:
Approximation Algorithms for Facial Cycles in Planar Embeddings. ISAAC 2018: 41:1-41:13 - [c25]Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta:
Subexponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity. WG 2018: 111-124 - [i27]Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta:
Subexponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity. CoRR abs/1803.05465 (2018) - [i26]Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
Upward Planar Morphs. CoRR abs/1808.10826 (2018) - 2017
- [j10]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati:
Strip Planarity Testing for Embedded Planar Graphs. Algorithmica 77(4): 1022-1059 (2017) - [j9]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) - [j8]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) - [c24]Giordano Da Lozzo, Anthony D'Angelo, Fabrizio Frati:
On Planar Greedy Drawings of 3-Connected Planar Graphs. SoCG 2017: 33:1-33:16 - [c23]Steven Chaplick, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Martin Nöllenburg, Maurizio Patrignani, Ioannis G. Tollis, Alexander Wolff:
Planar L-Drawings of Directed Graphs. GD 2017: 465-478 - [c22]Giordano Da Lozzo, William E. Devanny, David Eppstein, Timothy Johnson:
Square-Contact Representations of Partial 2-Trees and Triconnected Simply-Nested Graphs. ISAAC 2017: 24:1-24:14 - [c21]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 - [i25]Steven Chaplick, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Martin Nöllenburg, Maurizio Patrignani, Ioannis G. Tollis, Alexander Wolff:
Planar L-Drawings of Directed Graphs. CoRR abs/1708.09107 (2017) - [i24]Robin Anderson, Shuliang Bai, Fidel Barrera-Cruz, Éva Czabarka, Giordano Da Lozzo, Natalie L. F. Hobson, Jephian C.-H. Lin, Austin Mohr, Heather C. Smith, László A. Székely, Hays Whitlatch:
Analogies between the crossing number and the tangle crossing number. CoRR abs/1709.08119 (2017) - [i23]Giordano Da Lozzo, William E. Devanny, David Eppstein, Timothy Johnson:
Square-Contact Representations of Partial 2-Trees and Triconnected Simply-Nested Graphs. CoRR abs/1710.00426 (2017) - 2016
- [j7]Patrizio Angelini, Giordano Da Lozzo:
SEFE = C-Planarity? Comput. J. 59(12): 1831-1838 (2016) - [c20]Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Computing NodeTrix Representations of Clustered Graphs. GD 2016: 107-120 - [c19]Giordano Da Lozzo, Vida Dujmovic, Fabrizio Frati, Tamara Mchedlidze, Vincenzo Roselli:
Drawing Planar Graphs with Many Collinear Vertices. GD 2016: 152-165 - [c18]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Beyond Level Planarity. GD 2016: 482-495 - [c17]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 - [c16]Patrizio Angelini, Giordano Da Lozzo:
Clustered Planarity with Pipes. ISAAC 2016: 13:1-13:13 - [c15]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 - [c14]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 - [i22]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) - [i21]Giordano Da Lozzo, Vida Dujmovic, Fabrizio Frati, Tamara Mchedlidze, Vincenzo Roselli:
Drawing Planar Graphs with Many Collinear Vertices. CoRR abs/1606.03890 (2016) - [i20]Giordano Da Lozzo, Ignaz Rutter:
Strengthening Hardness Results to 3-Connected Planar Graphs. CoRR abs/1607.02346 (2016) - [i19]Giordano Da Lozzo, Ignaz Rutter:
On the Complexity of Realizing Facial Cycles. CoRR abs/1607.02347 (2016) - [i18]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) - [i17]Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Computing NodeTrix Representations of Clustered Graphs. CoRR abs/1608.08952 (2016) - [i16]Patrizio Angelini, Giordano Da Lozzo:
Clustered Planarity with Pipes. CoRR abs/1609.09679 (2016) - [i15]Giordano Da Lozzo, Anthony D'Angelo, Fabrizio Frati:
On Planar Greedy Drawings of 3-Connected Planar Graphs. CoRR abs/1612.09277 (2016) - 2015
- [j6]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) - [j5]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) - [j4]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) - [j3]Patrizio Angelini, Giordano Da Lozzo, Daniel Neuwirth:
Advancements on SEFE and Partitioned Book Embedding problems. Theor. Comput. Sci. 575: 71-89 (2015) - [c13]Giordano Da Lozzo, Ignaz Rutter:
Planarity of Streamed Graphs. CIAC 2015: 153-166 - [c12]Patrizio Angelini, Giordano Da Lozzo, Fabrizio Frati, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli:
Optimal Morphs of Convex Drawings. SoCG 2015: 126-140 - [c11]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Intersection-Link Representations of Graphs. GD 2015: 217-230 - [c10]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 - [c9]Giordano Da Lozzo, Marco Di Bartolomeo, Maurizio Patrignani, Giuseppe Di Battista, Davide Cannone, Sergio Tortora:
Drawing Georeferenced Graphs - Combining Graph Drawing and Geographic Data. IVAPP 2015: 109-116 - [i14]Giordano Da Lozzo, Ignaz Rutter:
Planarity of Streamed Graphs. CoRR abs/1501.07106 (2015) - [i13]Patrizio Angelini, Giordano Da Lozzo, Fabrizio Frati, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli:
Optimal Morphs of Convex Drawings. CoRR abs/1503.09021 (2015) - [i12]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Intersection-Link Representations of Graphs. CoRR abs/1508.07557 (2015) - [i11]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) - [i10]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) - [i9]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) - 2014
- [j2]Giordano Da Lozzo, Giuseppe Di Battista, Claudio Squarcella:
Visual discovery of the correlation between BGP routing and round-trip delay active measurements. Computing 96(1): 67-77 (2014) - [c8]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 - [c7]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 - [c6]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
Morphing Planar Graph Drawings Optimally. ICALP (1) 2014: 126-137 - [c5]Giordano Da Lozzo, Vít Jelínek, Jan Kratochvíl, Ignaz Rutter:
Planar Embeddings with Small and Uniform Faces. ISAAC 2014: 633-645 - [c4]Patrizio Angelini, Giordano Da Lozzo, Daniel Neuwirth:
On Some $\mathcal{NP}$ -complete SEFE Problems. WALCOM 2014: 200-212 - [i8]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
Morphing Planar Graph Drawings Optimally. CoRR abs/1402.4364 (2014) - [i7]Patrizio Angelini, Giordano Da Lozzo:
Deepening the Relationship between SEFE and C-Planarity. CoRR abs/1404.6175 (2014) - [i6]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) - [i5]Giordano Da Lozzo, Vít Jelínek, Jan Kratochvíl, Ignaz Rutter:
Planar Embeddings with Small and Uniform Faces. CoRR abs/1409.4299 (2014) - 2013
- [c3]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati:
Strip Planarity Testing. GD 2013: 37-48 - [c2]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 - [i4]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) - [i3]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati:
Strip Planarity Testing of Embedded Planar Graphs. CoRR abs/1309.0683 (2013) - [i2]Patrizio Angelini, Giordano Da Lozzo, Daniel Neuwirth:
On the Complexity of Some Problems Related to SEFE. CoRR abs/1311.3607 (2013) - 2012
- [j1]Giordano Da Lozzo, Giuseppe Di Battista, Francesco Ingrassia:
Drawing Graphs on a Smartphone. J. Graph Algorithms Appl. 16(1): 109-126 (2012) - [i1]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Vincenzo Roselli:
Beyond Clustered Planarity. CoRR abs/1207.3934 (2012) - 2010
- [c1]Giordano Da Lozzo, Giuseppe Di Battista, Francesco Ingrassia:
Drawing Graphs on a Smartphone. GD 2010: 153-164
Coauthor Index
[j41] [j39] [j35] [c57] [i56] [j31] [j26] [c45] [c44] [i47] [i46] [c41] [j21] [j19] [c37] [c36] [p1] [i38] [i37] [i36] [j18] [c35] [i34] [i30] [j15] [j14] [j11] [j10] [j9] [j8] [c21] [j7] [c18] [c17] [c16] [c15] [c14] [i22] [i18] [i16] [j6] [j5] [j4] [j3] [c12] [c11] [c10] [i13] [i12] [i11] [i10] [i9] [c8] [c7] [c6] [c4] [i8] [i7] [i6] [c3] [c2] [i4] [i3] [i2] [i1]
[j36] [j34] [c55] [c54] [c51] [c50] [i57] [i54] [i51] [i49] [j27] [c48] [i44] [c43] [c41] [i41] [j24] [j23] [j21] [j20] [j19] [i36] [c29] [c28] [i35] [i31] [i30] [i29] [j13] [j11] [c27] [i26] [j10] [j9] [j8] [c21] [c20] [c18] [c17] [c15] [i22] [i18] [i17] [j6] [j4] [c11] [c10] [c9] [i12] [i10] [i9] [j2] [c8] [c7] [c6] [i8] [i6] [c3] [i3] [j1] [i1] [c1]
[j36] [j34] [c56] [c54] [c50] [i57] [i55] [j28] [i49] [j27] [c48] [c47] [i45] [i44] [c43] [c41] [i41] [j24] [j23] [j22] [j20] [j19] [c39] [i40] [i36] [c32] [c29] [c28] [i35] [i31] [i29] [j13] [j12] [c27] [i26] [j10] [j9] [j8] [c24] [c20] [c19] [c18] [i22] [i21] [i17] [i15] [j6] [j4] [c12] [c11] [c10] [i13] [i12] [i9] [c8] [c6] [i8] [i6] [c3] [i3] [i1]
[j36] [j34] [c57] [c54] [c53] [c50] [i57] [i56] [i52] [j33] [j32] [i49] [j27] [c48] [i44] [c43] [c41] [i41] [j24] [j20] [j19] [i36] [c34] [c32] [c29] [i33] [i31] [i29] [j15] [j13] [c27] [i26] [j9] [j8] [c23] [i25] [c20] [c18] [c14] [i22] [i17] [j6] [j5] [c12] [c11] [c10] [c9] [i13] [i12] [i11] [i9] [c7] [c6] [i8] [c2] [i4]
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 2025-01-21 00:00 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:
