Computing a Minimum-Depth Planar Graph Embedding in O ( n 4) Time. - Patrizio Angelini; Giuseppe Di Battista; Maurizio Patrignani (WADS, 2007)

Splitting Clusters to Get C-Planarity. - Patrizio Angelini; Fabrizio Frati; Maurizio Patrignani (GD, 2009)

Upward Geometric Graph Embeddings into Point Sets. - Patrizio Angelini; Fabrizio Frati; Markus Geyer; Michael Kaufmann 001; Tamara Mchedlidze; Antonios Symvonis (GD, 2010)

Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree. - Patrizio Angelini; Giuseppe Di Battista; Fabrizio Frati; Maurizio Patrignani; Ignaz Rutter (IWOCA, 2010)

An Algorithm to Construct Greedy Drawings of Triangulations. - Patrizio Angelini; Fabrizio Frati; Luca Grilli 001 (J. Graph Algorithms Appl., 2010)

Small Point Sets for Simply-Nested Planar Graphs. - Patrizio Angelini; Giuseppe Di Battista; Michael Kaufmann 001; Tamara Mchedlidze; Vincenzo Roselli; Claudio Squarcella (GD, 2011)

Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area. - Patrizio Angelini; Giuseppe Di Battista; Walter Didimo; Fabrizio Frati; Seok-Hee Hong 001; Michael Kaufmann 001; Giuseppe Liotta; Anna Lubiw (EGC, 2011)

Finding a Minimum-depth Embedding of a Planar Graph in O(n4) Time. - Patrizio Angelini; Giuseppe Di Battista; Maurizio Patrignani (Algorithmica, 2011)

Straight-Line Rectangular Drawings of Clustered Graphs. - Patrizio Angelini; Fabrizio Frati; Michael Kaufmann 001 (Discret. Comput. Geom., 2011)

On the Perspectives Opened by Right Angle Crossing Drawings. - Patrizio Angelini; Luca Cittadini; Walter Didimo; Fabrizio Frati; Giuseppe Di Battista; Michael Kaufmann 001; Antonios Symvonis (J. Graph Algorithms Appl., 2011)

Implementing a Partitioned 2-Page Book Embedding Testing Algorithm. - Patrizio Angelini; Marco Di Bartolomeo; Giuseppe Di Battista (GD, 2012)

Universal Point Subsets for Planar Graphs. - Patrizio Angelini; Carla Binucci; William S. Evans; Ferran Hurtado; Giuseppe Liotta; Tamara Mchedlidze; Henk Meijer; Yoshio Okamoto (ISAAC, 2012)

Beyond Clustered Planarity - Patrizio Angelini; Giordano Da Lozzo; Giuseppe Di Battista; Fabrizio Frati; Vincenzo Roselli (CoRR, 2012)

Acyclically 3-colorable planar graphs. - Patrizio Angelini; Fabrizio Frati (J. Comb. Optim., 2012)

Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph. - Patrizio Angelini; Giuseppe Di Battista; Fabrizio Frati; Maurizio Patrignani; Ignaz Rutter (J. Discrete Algorithms, 2012)

Monotone Drawings of Graphs. - Patrizio Angelini; Enrico Colasante; Giuseppe Di Battista; Fabrizio Frati; Maurizio Patrignani (J. Graph Algorithms Appl., 2012)

On a Tree and a Path with no Geometric Simultaneous Embedding. - Patrizio Angelini; Markus Geyer; Michael Kaufmann 001; Daniel Neuwirth (J. Graph Algorithms Appl., 2012)

Succinct greedy drawings do not always exist. - Patrizio Angelini; Giuseppe Di Battista; Fabrizio Frati (Networks, 2012)

Universal Point Sets for Planar Graph Drawings with Circular Arcs. - Patrizio Angelini; David Eppstein; Fabrizio Frati; Michael Kaufmann 001; Sylvain Lazard; Tamara Mchedlidze; Monique Teillaud; Alexander Wolff 001 (CCCG, 2013)

Drawing Non-Planar Graphs with Crossing-Free Subgraphs. - Patrizio Angelini; Carla Binucci; Giordano Da Lozzo; Walter Didimo; Luca Grilli 001; Fabrizio Montecchiani; Maurizio Patrignani; Ioannis G. Tollis (GD, 2013)

Morphing Planar Graph Drawings Efficiently. - Patrizio Angelini; Fabrizio Frati; Maurizio Patrignani; Vincenzo Roselli (GD, 2013)

Strip Planarity Testing. - Patrizio Angelini; Giordano Da Lozzo; Giuseppe Di Battista; Fabrizio Frati (GD, 2013)

SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs. - Patrizio Angelini; William S. Evans; Fabrizio Frati; Joachim Gudmundsson (ISAAC, 2013)

Morphing Planar Graph Drawings with a Polynomial Number of Steps. - Soroush Alamdari; Patrizio Angelini; Timothy M. Chan; Giuseppe Di Battista; Fabrizio Frati; Anna Lubiw; Maurizio Patrignani; Vincenzo Roselli; Sahil Singla 001; Bryan T. Wilkinson (SODA, 2013)

Drawings of Non-planar Graphs with Crossing-free Subgraphs. - Patrizio Angelini; Carla Binucci; Giordano Da Lozzo; Walter Didimo; Luca Grilli 001; Fabrizio Montecchiani; Maurizio Patrignani; Ioannis G. Tollis (CoRR, 2013)

Morphing Planar Graphs Drawings Efficiently. - Patrizio Angelini; Fabrizio Frati; Maurizio Patrignani; Vincenzo Roselli (CoRR, 2013)

On the Complexity of Some Problems Related to SEFE. - Patrizio Angelini; Giordano Da Lozzo; Daniel Neuwirth (CoRR, 2013)

Simultaneous Embedding of Embedded Planar graphs. - Patrizio Angelini; Giuseppe Di Battista; Fabrizio Frati (Int. J. Comput. Geom. Appl., 2013)

Topological morphing of planar graphs. - Patrizio Angelini; Pier Francesco Cortese; Giuseppe Di Battista; Maurizio Patrignani (Theor. Comput. Sci., 2013)

Anchored Drawings of Planar Graphs. - Patrizio Angelini; Giordano Da Lozzo; Marco Di Bartolomeo; Giuseppe Di Battista; Seok-Hee Hong 001; Maurizio Patrignani; Vincenzo Roselli (GD, 2014)

Morphing Planar Graph Drawings Optimally. - Patrizio Angelini; Giordano Da Lozzo; Giuseppe Di Battista; Fabrizio Frati; Maurizio Patrignani; Vincenzo Roselli (ICALP (1), 2014)

On Some $ mathcal{NP}$ -complete SEFE Problems. - Patrizio Angelini; Giordano Da Lozzo; Daniel Neuwirth (WALCOM, 2014)

On the area requirements of Euclidean minimum spanning trees. - Patrizio Angelini; Till Bruckdorfer; Marco Chiesa; Fabrizio Frati; Michael Kaufmann 001; Claudio Squarcella (Comput. Geom., 2014)

Deepening the Relationship between SEFE and C-Planarity. - Patrizio Angelini; Giordano Da Lozzo (CoRR, 2014)

On the Complexity of Clustered-Level Planarity and T-Level Planarity. - Patrizio Angelini; Giordano Da Lozzo; Giuseppe Di Battista; Fabrizio Frati; Vincenzo Roselli (CoRR, 2014)

Testing Mutual duality of Planar graphs. - Patrizio Angelini; Thomas Bläsius; Ignaz Rutter (Int. J. Comput. Geom. Appl., 2014)

Universal Point Sets for Drawing Planar Graphs with Circular Arcs. - Patrizio Angelini; David Eppstein; Fabrizio Frati; Michael Kaufmann 001; Sylvain Lazard; Tamara Mchedlidze; Monique Teillaud; Alexander Wolff 001 (J. Graph Algorithms Appl., 2014)

Optimal Morphs of Convex Drawings. - Patrizio Angelini; Giordano Da Lozzo; Fabrizio Frati; Anna Lubiw; Maurizio Patrignani; Vincenzo Roselli (SoCG, 2015)

A Universal Point Set for 2-Outerplanar Graphs. - Patrizio Angelini; Till Bruckdorfer; Michael Kaufmann 001; Tamara Mchedlidze (GD, 2015)

On the Relationship Between Map Graphs and Clique Planar Graphs. - Patrizio Angelini; Giordano Da Lozzo; Giuseppe Di Battista; Fabrizio Frati; Maurizio Patrignani; Ignaz Rutter (GD, 2015)

Monotone Drawings of Graphs with Fixed Embedding. - Patrizio Angelini; Walter Didimo; Stephen G. Kobourov; Tamara Mchedlidze; Vincenzo Roselli; Antonios Symvonis; Stephen K. Wismath (Algorithmica, 2015)

Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs. - Patrizio Angelini; Carla Binucci; Giordano Da Lozzo; Walter Didimo; Luca Grilli 001; Fabrizio Montecchiani; Maurizio Patrignani; Ioannis G. Tollis (Comput. Geom., 2015)

Relaxing the constraints of clustered planarity. - Patrizio Angelini; Giordano Da Lozzo; Giuseppe Di Battista; Fabrizio Frati; Maurizio Patrignani; Vincenzo Roselli (Comput. Geom., 2015)

Testing Cyclic Level and Simultaneous Level Planarity. - Patrizio Angelini; Giordano Da Lozzo; Giuseppe Di Battista; Fabrizio Frati; Maurizio Patrignani; Ignaz Rutter (CoRR, 2015)

Testing Planarity of Partially Embedded Graphs. - Patrizio Angelini; Giuseppe Di Battista; Fabrizio Frati; Vít Jelínek; Jan Kratochvíl; Maurizio Patrignani; Ignaz Rutter (ACM Trans. Algorithms, 2015)

The importance of being proper: (In clustered-level planarity and T-level planarity). - Patrizio Angelini; Giordano Da Lozzo; Giuseppe Di Battista; Fabrizio Frati; Vincenzo Roselli (Theor. Comput. Sci., 2015)

Advancements on SEFE and Partitioned Book Embedding problems. - Patrizio Angelini; Giordano Da Lozzo; Daniel Neuwirth (Theor. Comput. Sci., 2015)

Low Ply Drawings of Trees. - Patrizio Angelini; Michael A. Bekos; Till Bruckdorfer; Jaroslav Hancl Jr.; Michael Kaufmann 001; Stephen G. Kobourov; Antonios Symvonis; Pavel Valtr 001 (GD, 2016)

Simultaneous Orthogonal Planarity. - Patrizio Angelini; Steven Chaplick; Sabine Cornelsen; Giordano Da Lozzo; Giuseppe Di Battista; Peter Eades; Philipp Kindermann; Jan Kratochvíl; Fabian Lipp; Ignaz Rutter (GD, 2016)

Beyond Level Planarity. - Patrizio Angelini; Giordano Da Lozzo; Giuseppe Di Battista; Fabrizio Frati; Maurizio Patrignani; Ignaz Rutter (GD, 2016)

L-Drawings of Directed Graphs. - Patrizio Angelini; Giordano Da Lozzo; Marco Di Bartolomeo; Valentino Di Donato; Maurizio Patrignani; Vincenzo Roselli; Ioannis G. Tollis (SOFSEM, 2016)

Vertex-Coloring with Star-Defects. - Patrizio Angelini; Michael A. Bekos; Michael Kaufmann 001; Vincenzo Roselli (WALCOM, 2016)

SEFE = C-Planarity? - Patrizio Angelini; Giordano Da Lozzo (Comput. J., 2016)

SEFE without Mapping via Large Induced Outerplane Graphs in Plane Graphs. - Patrizio Angelini; William S. Evans; Fabrizio Frati; Joachim Gudmundsson (J. Graph Theory, 2016)

A Universal Slope Set for 1-Bend Planar Drawings. - Patrizio Angelini; Michael A. Bekos; Giuseppe Liotta; Fabrizio Montecchiani (SoCG, 2017)

3D Visibility Representations of 1-planar Graphs. - Patrizio Angelini; Michael A. Bekos; Michael Kaufmann 001; Fabrizio Montecchiani (GD, 2017)

On Vertex- and Empty-Ply Proximity Drawings. - Patrizio Angelini; Steven Chaplick; Felice De Luca; Jirí Fiala 001; Jaroslav Hancl Jr.; Niklas Heinsohn; Michael Kaufmann 001; Stephen G. Kobourov; Jan Kratochvíl; Pavel Valtr 001 (GD, 2017)

On the Relationship Between k-Planar and k-Quasi-Planar Graphs. - Patrizio Angelini; Michael A. Bekos; Franz J. Brandenburg; Giordano Da Lozzo; Giuseppe Di Battista; Walter Didimo; Giuseppe Liotta; Fabrizio Montecchiani; Ignaz Rutter (WG, 2017)

Strip Planarity Testing for Embedded Planar Graphs. - Patrizio Angelini; Giordano Da Lozzo; Giuseppe Di Battista; Fabrizio Frati (Algorithmica, 2017)

Beyond-Planarity: Density Results for Bipartite Graphs. - Patrizio Angelini; Michael A. Bekos; Michael Kaufmann 001; Maximilian Pfister 002; Torsten Ueckerdt (CoRR, 2017)

Monotone drawings of graphs with few directions. - Patrizio Angelini (Inf. Process. Lett., 2017)

Vertex-Coloring with Defects. - Patrizio Angelini; Michael A. Bekos; Felice De Luca; Walter Didimo; Michael Kaufmann 001; Stephen G. Kobourov; Fabrizio Montecchiani; Chrysanthi N. Raftopoulou; Vincenzo Roselli; Antonios Symvonis (J. Graph Algorithms Appl., 2017)

Intersection-Link Representations of Graphs. - Patrizio Angelini; Giordano Da Lozzo; Giuseppe Di Battista; Fabrizio Frati; Maurizio Patrignani; Ignaz Rutter (J. Graph Algorithms Appl., 2017)

How to Morph Planar Graph Drawings. - 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 001; et al. (SIAM J. Comput., 2017)

Turning Cliques into Paths to Achieve Planarity. - Patrizio Angelini; Peter Eades; Seok-Hee Hong 001; Karsten Klein 001; Stephen G. Kobourov; Giuseppe Liotta; Alfredo Navarra; Alessandra Tappini (GD, 2018)

Beyond-Planarity: Turán-Type Results for Non-Planar Bipartite Graphs. - Patrizio Angelini; Michael A. Bekos; Michael Kaufmann 001; Maximilian Pfister 002; Torsten Ueckerdt (ISAAC, 2018)

Small Universal Point Sets for k-Outerplanar Graphs. - Patrizio Angelini; Till Bruckdorfer; Giuseppe Di Battista; Michael Kaufmann 001; Tamara Mchedlidze; Vincenzo Roselli; Claudio Squarcella (Discret. Comput. Geom., 2018)

Algorithms and Bounds for L-Drawings of Directed Graphs. - Patrizio Angelini; Giordano Da Lozzo; Marco Di Bartolomeo; Valentino Di Donato; Maurizio Patrignani; Vincenzo Roselli; Ioannis G. Tollis (Int. J. Found. Comput. Sci., 2018)

3-coloring arrangements of line segments with 4 slopes is hard. - Patrizio Angelini; Giordano Da Lozzo (Inf. Process. Lett., 2018)

Windrose Planarity: Embedding Graphs with Direction-Constrained Edges. - Patrizio Angelini; Giordano Da Lozzo; Giuseppe Di Battista; Valentino Di Donato; Philipp Kindermann; Günter Rote; Ignaz Rutter (ACM Trans. Algorithms, 2018)

1-Fan-bundle-planar drawings of graphs. - Patrizio Angelini; Michael A. Bekos; Michael Kaufmann 001; Philipp Kindermann; Thomas Schneck (Theor. Comput. Sci., 2018)

Morphing Contact Representations of Graphs. - Patrizio Angelini; Steven Chaplick; Sabine Cornelsen; Giordano Da Lozzo; Vincenzo Roselli (SoCG, 2019)

The QuaSEFE Problem. - Patrizio Angelini; Henry Förster; Michael Hoffmann 001; Michael Kaufmann 001; Stephen G. Kobourov; Giuseppe Liotta; Maurizio Patrignani (GD, 2019)

Geometric Representations of Dichotomous Ordinal Data. - Patrizio Angelini; Michael A. Bekos; Martin Gronemann; Antonios Symvonis (WG, 2019)

Hierarchical Partial Planarity. - Patrizio Angelini; Michael A. Bekos (Algorithmica, 2019)

Universal Slope Sets for 1-Bend Planar Drawings. - Patrizio Angelini; Michael A. Bekos; Giuseppe Liotta; Fabrizio Montecchiani (Algorithmica, 2019)

Clustered Planarity with Pipes. - Patrizio Angelini; Giordano Da Lozzo (Algorithmica, 2019)

Simple k-Planar Graphs are Simple (k+1)-Quasiplanar. - Patrizio Angelini; Michael A. Bekos; Franz J. Brandenburg; Giordano Da Lozzo; Giuseppe Di Battista; Walter Didimo; Michael Hoffmann 001; Giuseppe Liotta; Fabrizio Montecchiani; Ignaz Rutter; Csaba D. Tóth (CoRR, 2019)

Multi-level Steiner Trees. - 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 001 (ACM J. Exp. Algorithmics, 2019)

Greedy rectilinear drawings. - Patrizio Angelini; Michael A. Bekos; Walter Didimo; Luca Grilli 001; Philipp Kindermann; Tamara Mchedlidze; Roman Prutkin; Antonios Symvonis; Alessandra Tappini (Theor. Comput. Sci., 2019)

On 3D visibility representations of graphs with few crossings per edge. - Patrizio Angelini; Michael A. Bekos; Michael Kaufmann 001; Fabrizio Montecchiani (Theor. Comput. Sci., 2019)

Beyond Clustered Planar Graphs. - Patrizio Angelini; Giordano Da Lozzo (Beyond Planar Graphs, 2020)

2-Layer k-Planar Graphs - Density, Crossing Lemma, Relationships, and Pathwidth. - Patrizio Angelini; Giordano Da Lozzo; Henry Förster; Thomas Schneck (GD, 2020)

Bitonic st-Orderings for Upward Planar Graphs: The Variable Embedding Setting. - Patrizio Angelini; Michael A. Bekos; Henry Förster; Martin Gronemann (WG, 2020)

Graph Planarity by Replacing Cliques with Paths. - Patrizio Angelini; Peter Eades; Seok-Hee Hong 001; Karsten Klein 001; Stephen G. Kobourov; Giuseppe Liotta; Alfredo Navarra; Alessandra Tappini (Algorithms, 2020)

Simple k-planar graphs are simple (k + 1)-quasiplanar. - Patrizio Angelini; Michael A. Bekos; Franz J. Brandenburg; Giordano Da Lozzo; Giuseppe Di Battista; Walter Didimo; Michael Hoffmann 001; Giuseppe Liotta; Fabrizio Montecchiani; Ignaz Rutter; Csaba D. Tóth (J. Comb. Theory B, 2020)

Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity. - Patrizio Angelini; Michael A. Bekos; Michael Kaufmann 001; Thomas Schneck (J. Graph Algorithms Appl., 2020)

On RAC drawings of graphs with one bend per edge. - Patrizio Angelini; Michael A. Bekos; Henry Förster; Michael Kaufmann 001 (Theor. Comput. Sci., 2020)

Beyond level planarity: Cyclic, torus, and simultaneous level planarity. - Patrizio Angelini; Giordano Da Lozzo; Giuseppe Di Battista; Fabrizio Frati; Maurizio Patrignani; Ignaz Rutter (Theor. Comput. Sci., 2020)

One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons. - Patrizio Angelini; Philipp Kindermann; Andre Löffler; Lena Schlipf; Antonios Symvonis (GD, 2021)

2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees. - Patrizio Angelini; Giordano Da Lozzo; Giuseppe Di Battista; Fabrizio Frati; Maurizio Patrignani (SODA, 2021)

On Morphing 1-Planar Drawings. - Patrizio Angelini; Michael A. Bekos; Fabrizio Montecchiani; Maximilian Pfister 002 (WG, 2021)

Extending Partial Orthogonal Drawings. - Patrizio Angelini; Ignaz Rutter; T. P. Sandhya 001 (J. Graph Algorithms Appl., 2021)

RAC Drawings of Graphs with Low Degree. - Patrizio Angelini; Michael A. Bekos; Julia Katheder; Michael Kaufmann 001; Maximilian Pfister 002 (MFCS, 2022)

Proceedings of the 30th International Symposium on Graph Drawing and Network Visualization (GD 2022). - Patrizio Angelini; Reinhard von Hanxleden (CoRR, 2022)

Planar L-Drawings of Bimodal Graphs. - Patrizio Angelini; Steven Chaplick; Sabine Cornelsen; Giordano Da Lozzo (J. Graph Algorithms Appl., 2022)

On morphs of 1-plane graphs. - Patrizio Angelini; Michael A. Bekos; Fabrizio Montecchiani; Maximilian Pfister 002 (J. Comput. Geom., 2022)

On mixed linear layouts of series-parallel graphs. - Patrizio Angelini; Michael A. Bekos; Philipp Kindermann; Tamara Mchedlidze (Theor. Comput. Sci., 2022)

Axis-Parallel Right Angle Crossing Graphs. - Patrizio Angelini; Michael A. Bekos; Julia Katheder; Michael Kaufmann 001; Maximilian Pfister 002; Torsten Ueckerdt (ESA, 2023)

Splitting Vertices in 2-Layer Graph Drawings. - Abu Reyan Ahmed; Patrizio Angelini; Michael A. Bekos; Giuseppe Di Battista; Michael Kaufmann 001; Philipp Kindermann; Stephen G. Kobourov; Martin Nöllenburg; Antonios Symvonis; Anaïs Villedieu; Markus Wallinger (IEEE Computer Graphics and Applications, 2023)

Guest Editors' Foreword. - Patrizio Angelini; Reinhard von Hanxleden (J. Graph Algorithms Appl., 2023)

Bitonic st-Orderings for Upward Planar Graphs: Splits and Bends in the Variable Embedding Scenario. - Patrizio Angelini; Michael A. Bekos; Henry Förster; Martin Gronemann (Algorithmica, 2023)

Morphing Triangle Contact Representations of Triangulations. - Patrizio Angelini; Steven Chaplick; Sabine Cornelsen; Giordano Da Lozzo; Vincenzo Roselli (Discret. Comput. Geom., 2023)

The Price of Upwardness. - Patrizio Angelini; Therese Biedl; Markus Chimani; Sabine Cornelsen; Giordano Da Lozzo; Seok-Hee Hong 001; Giuseppe Liotta; Maurizio Patrignani; Sergey Pupyrev; Ignaz Rutter; Alexander Wolff 001 (GD, 2024)

2-Layer k-Planar Graphs Density, Crossing Lemma, Relationships And Pathwidth. - Patrizio Angelini; Giordano Da Lozzo; Henry Förster; Thomas Schneck (Comput. J., 2024)

On Upward-Planar L-Drawings of Graphs. - Patrizio Angelini; Steven Chaplick; Sabine Cornelsen; Giordano Da Lozzo (J. Graph Algorithms Appl., 2024)

Recognizing Map Graphs of Bounded Treewidth. - Patrizio Angelini; Michael A. Bekos; Giordano Da Lozzo; Martin Gronemann; Fabrizio Montecchiani; Alessandra Tappini (Algorithmica, 2024)

Geometric Realizations of Dichotomous Ordinal Graphs. - Patrizio Angelini; Sabine Cornelsen; Carolina Haase; Michael Hoffmann 001; Eleni Katsanou; Fabrizio Montecchiani; Raphael Steiner; Antonios Symvonis (SoCG, 2025)

On Planar Straight-Line Dominance Drawings. - Patrizio Angelini; Michael A. Bekos; Giuseppe Di Battista; Fabrizio Frati; Luca Grilli 001; Giacomo Ortali (WADS, 2025)

The Price of Upwardness. - Patrizio Angelini; Therese Biedl; Markus Chimani; Sabine Cornelsen; Giordano Da Lozzo; Seok-Hee Hong 001; Giuseppe Liotta; Maurizio Patrignani; Sergey Pupyrev; Ignaz Rutter (Discret. Math. Theor. Comput. Sci., 2025)

Unit Edge-Length Rectilinear Drawings with Crossings and Rectangular Faces. - Patrizio Angelini; Carla Binucci; Giuseppe Di Battista; Emilio Di Giacomo; Walter Didimo; Fabrizio Grosso; Giacomo Ortali; Ioannis G. Tollis (CoRR, 2025)