WAVE. - Emilio Di Giacomo; Giuseppe Liotta (GD, 2001)

Drawing series-parallel graphs on a box. - Emilio Di Giacomo; Giuseppe Liotta; Stephen K. Wismath (CCCG, 2002)

Book Embeddings and Point-Set Embeddings of Series-Parallel Digraphs. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Stephen K. Wismath (GD, 2002)

Orthogonal 3D Shapes of Theta Graphs. - Emilio Di Giacomo; Giuseppe Liotta; Maurizio Patrignani (GD, 2002)

Drawing Series-Parallel Graphs on Restricted Integer 3D Grids. - Emilio Di Giacomo (GD, 2003)

Straight-Line Drawings of 2-Outerplanar Graphs on Two Curves. - Emilio Di Giacomo; Walter Didimo (GD, 2003)

Track Drawings of Graphs with Constant Queue Number. - Emilio Di Giacomo; Henk Meijer (GD, 2003)

Drawing Planar Graphs on a Curve. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Stephen K. Wismath (WG, 2003)

Hamiltonian-with-Handles Graphs and the k-Spine Drawability Problem. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Matthew Suderman (GD, 2004)

A note on 3D orthogonal drawings with direction constrained edges. - Emilio Di Giacomo; Giuseppe Liotta; Maurizio Patrignani (Inf. Process. Lett., 2004)

A note on simultaneous embedding of planar graphs. - Emilio Di Giacomo; Giuseppe Liotta (EuroCG, 2005)

WhatsOnWeb: Using Graph Drawing to Search the Web. - Emilio Di Giacomo; Walter Didimo; Luca Grilli 001; Giuseppe Liotta (GD, 2005)

How to Embed a Path onto Two Sets of Points. - Emilio Di Giacomo; Giuseppe Liotta; Francesco Trotta (GD, 2005)

A Topology-Driven Approach to the Design of Web Meta-search Clustering Engines. - Emilio Di Giacomo; Walter Didimo; Luca Grilli 001; Giuseppe Liotta (SOFSEM, 2005)

Curve-constrained drawings of planar graphs. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Stephen K. Wismath (Comput. Geom., 2005)

Computing straight-line 3D grid drawings of graphs in linear volume. - Emilio Di Giacomo; Giuseppe Liotta; Henk Meijer (Comput. Geom., 2005)

Computing Radial Drawings on the Minimum Number of Circles. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Henk Meijer (J. Graph Algorithms Appl., 2005)

k -Colored Point-Set Embeddability of Outerplanar Graphs. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Henk Meijer; Francesco Trotta; Stephen K. Wismath (GD, 2006)

Drawing Bipartite Graphs on Two Curves. - Emilio Di Giacomo; Luca Grilli 001; Giuseppe Liotta (GD, 2006)

Book Embeddability of Series-Parallel Digraphs. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Stephen K. Wismath (Algorithmica, 2006)

On Embedding a Graph on Two Sets of Points. - Emilio Di Giacomo; Giuseppe Liotta; Francesco Trotta (Int. J. Found. Comput. Sci., 2006)

k-Spine, 1-bend planarity. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Matthew Suderman (Theor. Comput. Sci., 2006)

Homothetic Triangle Contact Representations of Planar Graphs. - Melanie Badent; Carla Binucci; Emilio Di Giacomo; Walter Didimo; Stefan Felsner; Francesco Giordano; Jan Kratochvíl; Pietro Palladino; Maurizio Patrignani; Francesco Trotta (CCCG, 2007)

Point-Set Embedding of Trees with Edge Constraints. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Henk Meijer; Stephen K. Wismath (GD, 2007)

Simultaneous Embedding of Outerplanar Graphs, Paths, and Cycles. - Emilio Di Giacomo; Giuseppe Liotta (Int. J. Comput. Geom. Appl., 2007)

Graph Visualization Techniques for Web Clustering Engines. - Emilio Di Giacomo; Walter Didimo; Luca Grilli 001; Giuseppe Liotta (IEEE Trans. Vis. Comput. Graph., 2007)

WhatsOnWeb+ : An Enhanced Visual Search Clustering Engine. - Emilio Di Giacomo; Walter Didimo; Luca Grilli 001; Giuseppe Liotta; Pietro Palladino (PacificVis, 2008)

Radial drawings of graphs: Geometric constraints and trade-offs. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta (J. Discrete Algorithms, 2008)

k-colored Point-set Embeddability of Outerplanar Graphs. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Henk Meijer; Francesco Trotta; Stephen K. Wismath (J. Graph Algorithms Appl., 2008)

Drawing Bipartite Graphs on Two Parallel Convex Curves. - Emilio Di Giacomo; Luca Grilli 001; Giuseppe Liotta (J. Graph Algorithms Appl., 2008)

Drawing colored graphs on colored points. - Melanie Badent; Emilio Di Giacomo; Giuseppe Liotta (Theor. Comput. Sci., 2008)

On Directed Graphs with an Upward Straight-line. - Carla Binucci; Emilio Di Giacomo; Walter Didimo; Alejandro Estrella-Balderrama; Fabrizio Frati; Stephen G. Kobourov; Giuseppe Liotta (CCCG, 2009)

Point-set embeddings of trees with given partial drawings. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Henk Meijer; Stephen K. Wismath (Comput. Geom., 2009)

Volume requirements of 3D upward drawings. - Emilio Di Giacomo; Giuseppe Liotta; Henk Meijer; Stephen K. Wismath (Discret. Math., 2009)

Matched Drawings of Planar Graphs. - Emilio Di Giacomo; Walter Didimo; Marc J. van Kreveld; Giuseppe Liotta; Bettina Speckmann (J. Graph Algorithms Appl., 2009)

Visual analysis of financial crimes: [system paper]. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Pietro Palladino (AVI, 2010)

Information Visualization Techniques for Motion Impaired People. - Emilio Di Giacomo; Giuseppe Liotta; Stefano Federici (HEALTHINF, 2010)

Switch-Regular Upward Planar Embeddings of Trees. - Carla Binucci; Emilio Di Giacomo; Walter Didimo; Aimal Rextin (WALCOM, 2010)

The Hamiltonian Augmentation Problem and Its Applications to Graph Drawing. - Emilio Di Giacomo; Giuseppe Liotta (WALCOM, 2010)

Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge. - Emilio Di Giacomo; Giuseppe Liotta; Francesco Trotta (Algorithmica, 2010)

Upward straight-line embeddings of directed graphs into point sets. - Carla Binucci; Emilio Di Giacomo; Walter Didimo; Alejandro Estrella-Balderrama; Fabrizio Frati; Stephen G. Kobourov; Giuseppe Liotta (Comput. Geom., 2010)

Constrained Point-Set Embeddability of Planar Graphs. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Henk Meijer; Stephen K. Wismath (Int. J. Comput. Geom. Appl., 2010)

Visual Analysis of One-To-Many Matched Graphs. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Pietro Palladino (J. Graph Algorithms Appl., 2010)

Switch-Regular Upward Planarity Testing of Directed Trees. - Carla Binucci; Emilio Di Giacomo; Walter Didimo; Aimal Rextin (J. Graph Algorithms Appl., 2011)

Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Henk Meijer (Theory Comput. Syst., 2011)

Upward Topological Book Embeddings of DAGs. - Emilio Di Giacomo; Francesco Giordano; Giuseppe Liotta (SIAM J. Discret. Math., 2011)

h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Fabrizio Montecchiani (WG, 2012)

How many vertex locations can be arbitrarily chosen when drawing planar graphs? - Emilio Di Giacomo; Giuseppe Liotta; Tamara Mchedlidze (CoRR, 2012)

Bounds on the crossing resolution of complete geometric graphs. - Emilio Di Giacomo; Walter Didimo; Peter Eades; Seok-Hee Hong 001; Giuseppe Liotta (Discret. Appl. Math., 2012)

Drawing a tree as a minimum spanning tree approximation. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Henk Meijer (J. Comput. Syst. Sci., 2012)

Hamiltonian orthogeodesic alternating paths. - Emilio Di Giacomo; Luca Grilli 001; Marcus Krug; Giuseppe Liotta; Ignaz Rutter (J. Discrete Algorithms, 2012)

Exploring Complex Drawings via Edge Stratification. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Fabrizio Montecchiani; Ioannis G. Tollis (GD, 2013)

Area requirement of graph drawings with few crossings per edge. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Fabrizio Montecchiani (Comput. Geom., 2013)

Orthogeodesic point-set embedding of trees. - Emilio Di Giacomo; Fabrizio Frati; Radoslav Fulek; Luca Grilli 001; Marcus Krug (Comput. Geom., 2013)

Spine and Radial Drawings. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta (Handbook of Graph Drawing and Visualization, 2013)

Fan-Planar Graphs: Combinatorial Properties and Complexity Results. - Carla Binucci; Emilio Di Giacomo; Walter Didimo; Fabrizio Montecchiani; Maurizio Patrignani; Ioannis G. Tollis (GD, 2014)

Upward-rightward planar drawings. - Emilio Di Giacomo; Walter Didimo; Michael Kaufmann 001; Giuseppe Liotta; Fabrizio Montecchiani (IISA, 2014)

The Planar Slope Number of Subcubic Graphs. - Emilio Di Giacomo; Giuseppe Liotta; Fabrizio Montecchiani (LATIN, 2014)

2-Layer Right Angle Crossing Drawings. - Emilio Di Giacomo; Walter Didimo; Peter Eades; Giuseppe Liotta (Algorithmica, 2014)

Properties and Complexity of Fan-Planarity. - Carla Binucci; Emilio Di Giacomo; Walter Didimo; Fabrizio Montecchiani; Maurizio Patrignani; Ioannis G. Tollis (CoRR, 2014)

Techniques for Edge Stratification of Complex Graph Drawings. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Fabrizio Montecchiani; Ioannis G. Tollis (J. Vis. Lang. Comput., 2014)

VisFLOWer: Visual analysis of touristic flows. - Carla Binucci; Felice De Luca; Emilio Di Giacomo; Giuseppe Liotta; Fabrizio Montecchiani (IISA, 2015)

Low ply graph drawing. - Emilio Di Giacomo; Walter Didimo; Seok-Hee Hong 001; Michael Kaufmann 001; Stephen G. Kobourov; Giuseppe Liotta; Kazuo Misue; Antonios Symvonis; Hsu-Chun Yen (IISA, 2015)

Network visualization retargeting. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Fabrizio Montecchiani (IISA, 2015)

The Approximate Rectangle of Influence Drawability Problem. - Emilio Di Giacomo; Giuseppe Liotta; Henk Meijer (Algorithmica, 2015)

Heuristics for the Maximum 2-Layer RAC Subgraph Problem. - Emilio Di Giacomo; Walter Didimo; Luca Grilli 001; Giuseppe Liotta; Salvatore Agostino Romeo (Comput. J., 2015)

Planar and Quasi-Planar Simultaneous Geometric Embedding. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Henk Meijer; Stephen K. Wismath (Comput. J., 2015)

Drawing Outer 1-planar Graphs with Few Slopes. - Emilio Di Giacomo; Giuseppe Liotta; Fabrizio Montecchiani (J. Graph Algorithms Appl., 2015)

Fan-planarity: Properties and complexity. - Carla Binucci; Emilio Di Giacomo; Walter Didimo; Fabrizio Montecchiani; Maurizio Patrignani; Antonios Symvonis; Ioannis G. Tollis (Theor. Comput. Sci., 2015)

1-Bend Upward Planar Drawings of SP-Digraphs. - Emilio Di Giacomo; Giuseppe Liotta; Fabrizio Montecchiani (GD, 2016)

Lower and upper bounds for long induced paths in 3-connected planar graphs. - Emilio Di Giacomo; Giuseppe Liotta; Tamara Mchedlidze (Theor. Comput. Sci., 2016)

Colored Point-Set Embeddings of Acyclic Graphs. - Emilio Di Giacomo; Leszek Gasieniec; Giuseppe Liotta; Alfredo Navarra (GD, 2017)

NodeTrix Planarity Testing with Small Clusters. - Emilio Di Giacomo; Giuseppe Liotta; Maurizio Patrignani; Alessandra Tappini (GD, 2017)

Area-Thickness Trade-Offs for Straight-Line Drawings of Planar Graphs. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Fabrizio Montecchiani (Comput. J., 2017)

Designing the Content Analyzer of a Travel Recommender System. - Carla Binucci; Felice De Luca; Emilio Di Giacomo; Giuseppe Liotta; Fabrizio Montecchiani (Expert Syst. Appl., 2017)

Guest Editors' Foreword. - Emilio Di Giacomo; Anna Lubiw (J. Graph Algorithms Appl., 2017)

Ortho-polygon Visibility Representations of Embedded Graphs. - Emilio Di Giacomo; Walter Didimo; William S. Evans; Giuseppe Liotta; Henk Meijer; Fabrizio Montecchiani; Stephen K. Wismath (Algorithmica, 2018)

Visibility representations of boxes in 2.5 dimensions. - Alessio Arleo; Carla Binucci; Emilio Di Giacomo; William S. Evans; Luca Grilli 001; Giuseppe Liotta; Henk Meijer; Fabrizio Montecchiani; Sue Whitesides; Stephen K. Wismath (Comput. Geom., 2018)

(k, p)-Planarity: A Generalization of Hybrid Planarity. - Emilio Di Giacomo; William J. Lenhart; Giuseppe Liotta; Timothy W. Randolph 001; Alessandra Tappini (CoRR, 2018)

1-page and 2-page drawings with bounded number of crossings per edge. - Carla Binucci; Emilio Di Giacomo; Md. Iqbal Hossain 001; Giuseppe Liotta (Eur. J. Comb., 2018)

New results on edge partitions of 1-plane graphs. - Emilio Di Giacomo; Walter Didimo; William S. Evans; Giuseppe Liotta; Henk Meijer; Fabrizio Montecchiani; Stephen K. Wismath (Theor. Comput. Sci., 2018)

Drawing subcubic planar graphs with four slopes and optimal angular resolution. - Emilio Di Giacomo; Giuseppe Liotta; Fabrizio Montecchiani (Theor. Comput. Sci., 2018)

Upward Book Embeddings of st-Graphs. - Carla Binucci; Giordano Da Lozzo; Emilio Di Giacomo; Walter Didimo; Tamara Mchedlidze; Maurizio Patrignani (SoCG, 2019)

Sketched Representations and Orthogonal Planarity of Bounded Treewidth Graphs. - Emilio Di Giacomo; Giuseppe Liotta; Fabrizio Montecchiani (GD, 2019)

(k, p)-Planarity: A Relaxation of Hybrid Planarity. - Emilio Di Giacomo; William J. Lenhart; Giuseppe Liotta; Timothy W. Randolph 001; Alessandra Tappini (WALCOM, 2019)

NodeTrix Planarity Testing with Small Clusters. - Emilio Di Giacomo; Giuseppe Liotta; Maurizio Patrignani; Ignaz Rutter; Alessandra Tappini (Algorithmica, 2019)

Edge partitions of optimal 2-plane and 3-plane graphs. - Michael A. Bekos; Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Fabrizio Montecchiani; Chrysanthi N. Raftopoulou (Discret. Math., 2019)

An Experimental Study on the Ply Number of Straight-line Drawings. - Felice De Luca; Emilio Di Giacomo; Walter Didimo; Stephen G. Kobourov; Giuseppe Liotta (J. Graph Algorithms Appl., 2019)

Visual Analytics for Financial Crime Detection at the University of Perugia. - Emilio Di Giacomo; Walter Didimo; Luca Grilli 001; Giuseppe Liotta; Fabrizio Montecchiani (AVI-BDA/ITAVIS@AVI, 2020)

Storyline Visualizations with Ubiquitous Actors. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Fabrizio Montecchiani; Alessandra Tappini (GD, 2020)

Colored anchored visibility representations in 2D and 3D space. - Carla Binucci; Emilio Di Giacomo; Seok-Hee Hong 001; Giuseppe Liotta; Henk Meijer; Vera Sacristán; Stephen K. Wismath (Comput. Geom., 2020)

1-bend upward planar slope number of SP-digraphs. - Emilio Di Giacomo; Giuseppe Liotta; Fabrizio Montecchiani (Comput. Geom., 2020)

Polyline drawings with topological constraints. - Emilio Di Giacomo; Peter Eades; Giuseppe Liotta; Henk Meijer; Fabrizio Montecchiani (Theor. Comput. Sci., 2020)

On the curve complexity of 3-colored point-set embeddings. - Emilio Di Giacomo; Leszek Gasieniec; Giuseppe Liotta; Alfredo Navarra (Theor. Comput. Sci., 2020)

Quasi-upward Planar Drawings with Minimum Curve Complexity. - Carla Binucci; Emilio Di Giacomo; Giuseppe Liotta; Alessandra Tappini (GD, 2021)

A User Study on Hybrid Graph Visualizations. - Emilio Di Giacomo; Walter Didimo; Fabrizio Montecchiani; Alessandra Tappini (GD, 2021)

Stable visualization of connected components in dynamic graphs. - Emilio Di Giacomo; Walter Didimo; Michael Kaufmann 001; Giuseppe Liotta (Inf. Vis., 2021)

Packing Trees into 1-planar Graphs. - Felice De Luca; Emilio Di Giacomo; Seok-Hee Hong 001; Stephen G. Kobourov; William J. Lenhart; Giuseppe Liotta; Henk Meijer; Alessandra Tappini; Stephen K. Wismath (J. Graph Algorithms Appl., 2021)

2-colored point-set embeddings of partial 2-trees. - Emilio Di Giacomo; Jaroslav Hancl Jr.; Giuseppe Liotta (Theor. Comput. Sci., 2021)

(k, p)-planarity: A relaxation of hybrid planarity. - Emilio Di Giacomo; William J. Lenhart; Giuseppe Liotta; Timothy W. Randolph 001; Alessandra Tappini (Theor. Comput. Sci., 2021)

Parameterized Algorithms for Upward Planarity. - Steven Chaplick; Emilio Di Giacomo; Fabrizio Frati; Robert Ganian; Chrysanthi N. Raftopoulou; Kirill Simonov (SoCG, 2022)

Testing Upward Planarity of Partial 2-Trees. - Steven Chaplick; Emilio Di Giacomo; Fabrizio Frati; Robert Ganian; Chrysanthi N. Raftopoulou; Kirill Simonov (GD, 2022)

Universal Slope Sets for Upward Planar Drawings. - Michael A. Bekos; Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Fabrizio Montecchiani (Algorithmica, 2022)

Orthogonal planarity testing of bounded treewidth graphs. - Emilio Di Giacomo; Giuseppe Liotta; Fabrizio Montecchiani (J. Comput. Syst. Sci., 2022)

Design of a Process and a Container-Based Cloud Architecture for the Automatic Generation of Storyline Visualizations. - Emilio Di Giacomo; Beniamino Di Martino; Walter Didimo; Antonio Esposito 001; Giuseppe Liotta; Fabrizio Montecchiani (AINA (3), 2023)

New Bounds on the Local and Global Edge-length Ratio of Planar Graphs. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Henk Meijer; Fabrizio Montecchiani; Stephen K. Wismath (CoRR, 2023)

Editorial. - Emilio Di Giacomo; Fabrizio Montecchiani (Comput. Geom., 2023)

k-Planar Placement and Packing of Δ-Regular Caterpillars. - Carla Binucci; Emilio Di Giacomo; Michael Kaufmann 001; Giuseppe Liotta; Alessandra Tappini (Int. J. Found. Comput. Sci., 2023)

Upward Book Embeddability of st-Graphs: Complexity and Algorithms. - Carla Binucci; Giordano Da Lozzo; Emilio Di Giacomo; Walter Didimo; Tamara Mchedlidze; Maurizio Patrignani (Algorithmica, 2023)

CHIP: a Recommender System and a Travel Planner for Cultural Tourism (short paper). - Carla Binucci; Giulio Biondi; Emilio Di Giacomo; Walter Didimo; Alice Fortuni; Giuseppe Liotta (IAI4CH@AI*IA, 2024)

On the Complexity of Recognizing k^+-Real Face Graphs. - Michael A. Bekos; Giuseppe Di Battista; Emilio Di Giacomo; Walter Didimo; Michael Kaufmann 001; Fabrizio Montecchiani (GD, 2024)

On 1-Bend Upward Point-Set Embeddings of st-Digraphs. - Emilio Di Giacomo; Henry Förster; Daria Kokhovich; Tamara Mchedlidze; Fabrizio Montecchiani; Antonios Symvonis; Anaïs Villedieu (LATIN (1), 2024)

Collaborative Problem Solving in Mixed Reality: A Study on Visual Graph Analysis. - Dimitar Garkov; Tommaso Piselli; Emilio Di Giacomo; Karsten Klein 001; Giuseppe Liotta; Fabrizio Montecchiani; Falk Schreiber (CoRR, 2024)

On the complexity of the storyplan problem. - Carla Binucci; Emilio Di Giacomo; William J. Lenhart; Giuseppe Liotta; Fabrizio Montecchiani; Martin Nöllenburg; Antonios Symvonis (J. Comput. Syst. Sci., 2024)

Comparative Study and Evaluation of Hybrid Visualizations of Graphs. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Fabrizio Montecchiani; Alessandra Tappini (IEEE Trans. Vis. Comput. Graph., 2024)

Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees. - Steven Chaplick; Giordano Da Lozzo; Emilio Di Giacomo; Giuseppe Liotta; Fabrizio Montecchiani (Algorithmica, 2024)

On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Fabrizio Montecchiani; Giacomo Ortali (Algorithmica, 2024)

Collaborative Problem Solving in Mixed Reality: A Study on Visual Graph Analysis - Replication data. - Dimitar Garkov; Tommaso Piselli; Emilio Di Giacomo; Karsten Klein 001; Giuseppe Liotta; Fabrizio Montecchiani; Falk Schreiber (DaRUS, 2024)

Minimum Monotone Spanning Trees. - Emilio Di Giacomo; Walter Didimo; Eleni Katsanou; Lena Schlipf; Antonios Symvonis; Alexander Wolff 001 (SOFSEM (1), 2025)

Linear Layouts of Graphs with Priority Queues. - Emilio Di Giacomo; Walter Didimo; Henry Förster; Torsten Ueckerdt; Johannes Zink 001 (WADS, 2025)

Bounds on the edge-length ratio of 2-outerplanar graphs. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Henk Meijer; Fabrizio Montecchiani; Stephen K. Wismath (Comput. Geom., 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)