A Tailorable and Extensible Automatic Layout Facility. - Massimiliano Beccaria; Paola Bertolazzi; Giuseppe Di Battista; Giuseppe Liotta (VL, 1991)

Diagram Server. - Giuseppe Di Battista; Giuseppe Liotta; M. Strani; Francesco Vargiu (Advanced Visual Interfaces, 1992)

Spirality of Orthogonal Representations and Optimal Drawings of Series-Parallel Graphs and 3-Planar Graphs (Extended Abstract). - Giuseppe Di Battista; Giuseppe Liotta; Francesco Vargiu (WADS, 1993)

An automatic layout facility (abstract). - Giuseppe Liotta (SIGACT News, 1993)

Orthogonal Drawings with the Minimum Number of Bends. - Giuseppe Liotta; Francesco Vargiu; Giuseppe Di Battista (CCCG, 1994)

Proximity Drawability: a Survey. - Giuseppe Di Battista; William J. Lenhart; Giuseppe Liotta (GD, 1994)

Proximity Constraints and Representable Trees. - Prosenjit Bose; Giuseppe Di Battista; William J. Lenhart; Giuseppe Liotta (GD, 1994)

Recognizing Rectangle of Influence Drawable Graphs. - Hossam A. ElGindy; Giuseppe Liotta; Anna Lubiw; Henk Meijer; Sue Whitesides (GD, 1994)

Upward Drawings of Triconnected Digraphs. - Paola Bertolazzi; Giuseppe Di Battista; Giuseppe Liotta; Carlo Mannino (Algorithmica, 1994)

An Experimental Comparison of Three Graph Drawing Algorithms (Extended Abstract). - Giuseppe Di Battista; Ashim Garg; Giuseppe Liotta; Roberto Tamassia; Emanuele Tassinari; Francesco Vargiu (SCG, 1995)

GD-Workbench: A System for Prototyping and Testing Graph Drawing Algorithms. - Luciano Buti; Giuseppe Di Battista; Giuseppe Liotta; Emanuele Tassinari; Francesco Vargiu; Luca Vismara (GD, 1995)

How to Draw Outerplanar Minimum Weight Triangulations. - William J. Lenhart; Giuseppe Liotta (GD, 1995)

Computing Proximity Drawings of Trees in the 3-Dimemsional Space. - Giuseppe Liotta; Giuseppe Di Battista (WADS, 1995)

A New Model for Algorithm Animation Over the WWW. - James E. Baker; Isabel F. Cruz; Giuseppe Liotta; Roberto Tamassia (ACM Comput. Surv., 1995)

Parametric Graph Drawing. - Paola Bertolazzi; Giuseppe Di Battista; Giuseppe Liotta (IEEE Trans. Software Eng., 1995)

Diagram Server. - Giuseppe Di Battista; Giuseppe Liotta; Francesco Vargiu (J. Vis. Lang. Comput., 1995)

Algorithm animation over the World Wide Web. - James E. Baker; Isabel F. Cruz; Giuseppe Liotta; Roberto Tamassia (AVI, 1996)

The Mocha algorithm animation system. - James E. Baker; Isabel F. Cruz; Giuseppe Liotta; Roberto Tamassia (AVI, 1996)

Robust Proximity Queries in Implicit Voronoi Diagrams. - Roberto Tamassia; Giuseppe Liotta; Franco P. Preparata (CCCG, 1996)

Animating Geometric Algorithms Over the Web. - James E. Baker; Isabel F. Cruz; Giuseppe Liotta; Roberto Tamassia (SCG, 1996)

Proximity Drawings of Outerplanar Graphs. - William J. Lenhart; Giuseppe Liotta (GD, 1996)

Characterizing Proximity Trees. - Prosenjit Bose; William J. Lenhart; Giuseppe Liotta (Algorithmica, 1996)

Drawing Outerplanar Minimum Weight Triangulations. - William J. Lenhart; Giuseppe Liotta (Inf. Process. Lett., 1996)

Area Requirement of Gabriel Drawings. - Giuseppe Liotta; Roberto Tamassia; Ioannis G. Tollis; Paola Vocca (CIAC, 1997)

Drawable and Forbidden Minimum Weight Triangulations. - William J. Lenhart; Giuseppe Liotta (GD, 1997)

Checking the Convexity of Polytopes and the Planarity of Subdivisions (Extended Abstract). - Olivier Devillers; Giuseppe Liotta; Franco P. Preparata; Roberto Tamassia (WADS, 1997)

An Experimental Comparison of Four Graph Drawing Algorithms. - Giuseppe Di Battista; Ashim Garg; Giuseppe Liotta; Roberto Tamassia; Emanuele Tassinari; Francesco Vargiu (Comput. Geom., 1997)

Area Requirement of Visibility Representations of Trees. - Goos Kant; Giuseppe Liotta; Roberto Tamassia; Ioannis G. Tollis (Inf. Process. Lett., 1997)

A note on checking proximity graphs. - Giuseppe Liotta (CCCG, 1998)

Robust Region Approach to the Computation of Geometric Graphs (Extended Abstract). - Fabrizio d'Amore; Paolo Giulio Franciosa; Giuseppe Liotta (ESA, 1998)

Upward Planarity Checking: "Faces Are More than Polygons". - Giuseppe Di Battista; Giuseppe Liotta (GD, 1998)

Computing Orthogonal Drawings in a Variable Embedding Setting. - Walter Didimo; Giuseppe Liotta (ISAAC, 1998)

Checking the convexity of polytopes and the planarity of subdivisions. - Olivier Devillers; Giuseppe Liotta; Franco P. Preparata; Roberto Tamassia (Comput. Geom., 1998)

The rectangle of influence drawability problem. - Giuseppe Liotta; Anna Lubiw; Henk Meijer; Sue Whitesides (Comput. Geom., 1998)

Spirality and Optimal Orthogonal Drawings. - Giuseppe Di Battista; Giuseppe Liotta; Francesco Vargiu (SIAM J. Comput., 1998)

Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design. - Giuseppe Liotta; Franco P. Preparata; Roberto Tamassia (SIAM J. Comput., 1998)

Turn-Regularity and Planar Orthogonal Drawings. - Stina S. Bridgeman; Giuseppe Di Battista; Walter Didimo; Giuseppe Liotta; Roberto Tamassia; Luca Vismara (GD, 1999)

Infinite Trees and the Future. - Camil Demetrescu; Giuseppe Di Battista; Irene Finocchi; Giuseppe Liotta; Maurizio Patrignani; Maurizio Pizzonia (GD, 1999)

Almost Bend-Optimal Planar Orthogonal Drawings of Biconnected Degree-3 Planar Graphs in Quadratic Time. - Ashim Garg; Giuseppe Liotta (GD, 1999)

Visualizing geometric algorithms over the Web. - James E. Baker; Isabel F. Cruz; Giuseppe Liotta; Roberto Tamassia (Comput. Geom., 1999)

Orthogonal Drawings of Cycles in 3D Space (Extended Abstract). - Giuseppe Di Battista; Giuseppe Liotta; Anna Lubiw; Sue Whitesides (GD, 2000)

Minimum Weight Drawings of Maximal Triangulations (Extended Abstract). - William J. Lenhart; Giuseppe Liotta (GD, 2000)

Visualizing Algorithms over the Web with the Publication-Driven Approach. - Camil Demetrescu; Irene Finocchi; Giuseppe Liotta (WAE, 2000)

Turn-regularity and optimal area drawings of orthogonal representations. - Stina S. Bridgeman; Giuseppe Di Battista; Walter Didimo; Giuseppe Liotta; Roberto Tamassia; Luca Vismara (Comput. Geom., 2000)

Drawing Directed Acyclic Graphs: An Experimental Study. - Giuseppe Di Battista; Ashim Garg; Giuseppe Liotta; Armando Parise; Roberto Tamassia; Emanuele Tassinari; Francesco Vargiu; Luca Vismara (Int. J. Comput. Geom. Appl., 2000)

Guest Editors' Foreword. - Giuseppe Liotta; Sue Whitesides (J. Graph Algorithms Appl., 2000)

Experimental studies on graph drawing algorithms. - Luca Vismara; Giuseppe Di Battista; Ashim Garg; Giuseppe Liotta; Roberto Tamassia; Francesco Vargiu (Softw. Pract. Exp., 2000)

On the Parameterized Complexity of Layered Graph Drawing. - Vida Dujmovic; Michael R. Fellows; Michael T. Hallett; Matthew Kitching; Giuseppe Liotta; Catherine McCartin; Naomi Nishimura; Prabhakar Ragde; Frances A. Rosamond; Matthew Suderman; Sue Whitesides; David R. Wood (ESA, 2001)

Labeling Heuristics for Orthogonal Drawings. - Carla Binucci; Walter Didimo; Giuseppe Liotta; Maddalena Nonato (GD, 2001)

A Fixed-Parameter Approach to Two-Layer Planarization. - Vida Dujmovic; Michael R. Fellows; Michael T. Hallett; Matthew Kitching; Giuseppe Liotta; Catherine McCartin; Naomi Nishimura; Prabhakar Ragde; Frances A. Rosamond; Matthew Suderman; Sue Whitesides; David R. Wood (GD, 2001)

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

Optimal, Suboptimal, and Robust Algorithms for Proximity Graphs. - Ferran Hurtado; Giuseppe Liotta; Henk Meijer (WADS, 2001)

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

Computing Labeled Orthogonal Drawings. - Carla Binucci; Walter Didimo; Giuseppe Liotta; Maddalena Nonato (GD, 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)

Embedding problems for paths with direction constrained edges. - Giuseppe Di Battista; Giuseppe Liotta; Anna Lubiw; Sue Whitesides (Theor. Comput. Sci., 2002)

The drawability problem for minimum weight triangulations. - William J. Lenhart; Giuseppe Liotta (Theor. Comput. Sci., 2002)

Graphs in Computer Science. - Harold N. Gabow; Camil Demetrescu; Irene Finocchi; Giuseppe Francesco Italiano; Giuseppe Liotta; Roberto Tamassia; Richard B. Borie; R. Gary Parker; Craig A. Tovey (Handbook of Graph Theory, 2003)

Selected Open Problems in Graph Drawing. - Franz-Josef Brandenburg; David Eppstein; Michael T. Goodrich; Stephen G. Kobourov; Giuseppe Liotta; Petra Mutzel (GD, 2003)

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

Optimal and suboptimal robust algorithms for proximity graphs. - Ferran Hurtado; Giuseppe Liotta; Henk Meijer (Comput. Geom., 2003)

Voronoi drawings of trees. - Giuseppe Liotta; Henk Meijer (Comput. Geom., 2003)

Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions. - Stefan Felsner; Giuseppe Liotta; Stephen K. Wismath (J. Graph Algorithms Appl., 2003)

Guest Editors' Foreword. - Giuseppe Liotta; Ioannis G. Tollis (J. Graph Algorithms Appl., 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)

Graph drawing. - Roberto Tamassia; Giuseppe Liotta (Handbook of Discrete and Computational Geometry, 2nd Ed., 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)

Orthogonal drawings of graphs with vertex and edge labels. - Carla Binucci; Walter Didimo; Giuseppe Liotta; Maddalena Nonato (Comput. Geom., 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)

Guest Editor's Foreword. - Giuseppe Liotta (J. Graph Algorithms Appl., 2005)

On the Topologies of Local Minimum Spanning Trees. - Pier Francesco Cortese; Giuseppe Di Battista; Fabrizio Frati; Luca Grilli 001; Katharina Anna Lehmann; Giuseppe Liotta; Maurizio Patrignani; Ioannis G. Tollis; Francesco Trotta (CAAN, 2006)

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)

A Fixed-Parameter Approach to 2-Layer Planarization. - Vida Dujmovic; Michael R. Fellows; Michael T. Hallett; Matthew Kitching; Giuseppe Liotta; Catherine McCartin; Naomi Nishimura; Prabhakar Ragde; Frances A. Rosamond; Matthew Suderman; Sue Whitesides; David R. Wood (Algorithmica, 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)

The strength of weak proximity. - Giuseppe Di Battista; Giuseppe Liotta; Sue Whitesides (J. Discrete Algorithms, 2006)

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

A Note on Drawing Direction-constrained Paths in 3D. - Ethan Kim; Sue Whitesides; Giuseppe Liotta (CCCG, 2007)

Colored Simultaneous Geometric Embeddings. - Ulrik Brandes; Cesim Erten; J. Joseph Fowler; Fabrizio Frati; Markus Geyer; Carsten Gutwenger; Seok-Hee Hong 001; Michael Kaufmann 001; Stephen G. Kobourov; Giuseppe Liotta; Petra Mutzel; Antonios Symvonis (COCOON, 2007)

Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices. - Hazel Everett; Sylvain Lazard; Giuseppe Liotta; Stephen K. Wismath (GD, 2007)

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

Computing Upward Topological Book Embeddings of Upward Planar Digraphs. - Francesco Giordano; Giuseppe Liotta; Tamara Mchedlidze; Antonios Symvonis (ISAAC, 2007)

Advances in graph drawing: The 11th International Symposium on Graph Drawing. - Giuseppe Liotta; Henk Meijer (Discret. Appl. Math., 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)

A note on alpha-drawable k-trees. - Svetlana Stolpner; Jonathan Lenchner; Giuseppe Liotta; David Bremner; Christophe Paul; Marc Pouget; Stephen K. Wismath (CCCG, 2008)

08191 Working Group Report - X-graphs of Y-graphs and their Representations. - Vladimir Batagelj; Franz J. Brandenburg; Walter Didimo; Giuseppe Liotta; Maurizio Patrignani (Graph Drawing with Applications to Bioinformatics and Social Sciences, 2008)

Embeddability Problems for Upward Planar Digraphs. - Francesco Giordano; Giuseppe Liotta; Sue Whitesides (GD, 2008)

On the Parameterized Complexity of Layered Graph Drawing. - Vida Dujmovic; Michael R. Fellows; Matthew Kitching; Giuseppe Liotta; Catherine McCartin; Naomi Nishimura; Prabhakar Ragde; Frances A. Rosamond; Sue Whitesides; David R. Wood (Algorithmica, 2008)

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

Overlapping Cluster Planarity. - Walter Didimo; Francesco Giordano; Giuseppe Liotta (J. Graph Algorithms Appl., 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)

Upward Spirality and Upward Planarity Testing. - Walter Didimo; Francesco Giordano; Giuseppe Liotta (SIAM J. Discret. Math., 2009)

Visual analysis of large graphs using (X, Y)-clustering and hybrid visualizations. - Vladimir Batagelj; Walter Didimo; Giuseppe Liotta; Pietro Palladino; Maurizio Patrignani (PacificVis, 2010)

Graph visualization techniques for conceptual Web site traffic analysis. - Walter Didimo; Giuseppe Liotta; Salvatore Agostino Romeo (PacificVis, 2010)

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)

Topology-Driven Force-Directed Algorithms. - Walter Didimo; Giuseppe Liotta; Salvatore Agostino Romeo (GD, 2010)

On Graphs Supported by Line Sets. - Vida Dujmovic; William S. Evans; Stephen G. Kobourov; Giuseppe Liotta; Christophe Weibel; Stephen K. Wismath (GD, 2010)

Universal Pointsets for 2-Coloured Trees. - Mereke van Garderen; Giuseppe Liotta; Henk Meijer (GD, 2010)

Beyond a Visuocentric Way of a Visual Web Search Clustering Engine: The Sonification of WhatsOnWeb. - Maria Laura Mele; Stefano Federici; Simone Borsci; Giuseppe Liotta (ICCHP (1), 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)

Matched drawability of graph pairs and of graph triples. - Luca Grilli 001; Seok-Hee Hong 001; Giuseppe Liotta; Henk Meijer; Stephen K. Wismath (Comput. Geom., 2010)

Universal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices. - Hazel Everett; Sylvain Lazard; Giuseppe Liotta; Stephen K. Wismath (Discret. 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)

A characterization of complete bipartite RAC graphs. - Walter Didimo; Peter Eades; Giuseppe Liotta (Inf. Process. Lett., 2010)

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

An advanced network visualization system for financial crime detection. - Walter Didimo; Giuseppe Liotta; Fabrizio Montecchiani; Pietro Palladino (PacificVis, 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)

Colored Simultaneous Geometric Embeddings and Universal Pointsets. - Ulrik Brandes; Cesim Erten; Alejandro Estrella-Balderrama; J. Joseph Fowler; Fabrizio Frati; Markus Geyer; Carsten Gutwenger; Seok-Hee Hong 001; Michael Kaufmann 001; Stephen G. Kobourov; Giuseppe Liotta; Petra Mutzel; et al. (Algorithmica, 2011)

Geometric Simultaneous Embeddings of a Graph and a Matching. - Sergio Cabello; Marc J. van Kreveld; Giuseppe Liotta; Henk Meijer; Bettina Speckmann; Kevin Verbeek (J. Graph Algorithms Appl., 2011)

A Graph Drawing Application to Web Site Traffic Analysis. - Walter Didimo; Giuseppe Liotta; Salvatore Agostino Romeo (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)

Drawing graphs with right angle crossings. - Walter Didimo; Peter Eades; Giuseppe Liotta (Theor. Comput. Sci., 2011)

Visual Analysis of Large Graphs Using (X, Y)-Clustering and Hybrid Visualizations. - Vladimir Batagelj; Franz-Josef Brandenburg; Walter Didimo; Giuseppe Liotta; Pietro Palladino; Maurizio Patrignani (IEEE Trans. Vis. Comput. Graph., 2011)

Fáry's Theorem for 1-Planar Graphs. - Seok-Hee Hong 001; Peter Eades; Giuseppe Liotta; Sheung-Hung Poon (COCOON, 2012)

On Representing Graphs by Touching Cuboids. - David Bremner; William S. Evans; Fabrizio Frati; Laurie J. Heyer; Stephen G. Kobourov; William J. Lenhart; Giuseppe Liotta; David Rappaport; Sue Whitesides (GD, 2012)

Testing Maximal 1-Planarity of Graphs with a Rotation System in Linear Time - (Extended Abstract). - Peter Eades; Seok-Hee Hong 001; Naoki Katoh; Giuseppe Liotta; Pascal Schweitzer; Yusuke Suzuki (GD, 2012)

Point-Set Embeddability of 2-Colored Trees. - Fabrizio Frati; Marc Glisse; William J. Lenhart; Giuseppe Liotta; Tamara Mchedlidze; Rahnuma Islam Nishat (GD, 2012)

Vis4AUI: Visual Analysis of Banking Activity Networks. - Walter Didimo; Giuseppe Liotta; Fabrizio Montecchiani (GRAPP/IVAPP, 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)

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)

The Shape of Orthogonal Cycles in Three Dimensions. - Giuseppe Di Battista; Ethan Kim; Giuseppe Liotta; Anna Lubiw; Sue Whitesides (Discret. Comput. Geom., 2012)

Vertex angle and crossing angle resolution of leveled tree drawings. - Walter Didimo; Michael Kaufmann 001; Giuseppe Liotta; Yoshio Okamoto; Andreas Spillner 001 (Inf. Process. Lett., 2012)

Universal point sets for 2-coloured trees. - Mereke van Garderen; Giuseppe Liotta; Henk Meijer (Inf. Process. Lett., 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)

Planar and Plane Slope Number of Partial 2-Trees. - William J. Lenhart; Giuseppe Liotta; Debajyoti Mondal; Rahnuma Islam Nishat (GD, 2013)

TRART: A system to support territorial policies. - Carla Binucci; Walter Didimo; Giuseppe Liotta; Fabrizio Montecchiani; Mariano Sartore (Intelligent Environments (Workshops), 2013)

On the robustness of the Drosophila neural network. - Hsiu-Ming Chang 002; Ann-Shyn Chiang; Walter Didimo; Ching-Yao Lin; Giuseppe Liotta; Fabrizio Montecchiani (NSW, 2013)

On point-sets that support planar graphs. - Vida Dujmovic; William S. Evans; Sylvain Lazard; William J. Lenhart; Giuseppe Liotta; David Rappaport; Stephen K. Wismath (Comput. Geom., 2013)

Approximate proximity drawings. - William S. Evans; Emden R. Gansner; Michael Kaufmann 001; Giuseppe Liotta; Henk Meijer; Andreas Spillner 001 (Comput. Geom., 2013)

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

Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs. - William S. Evans; Michael Kaufmann 001; William J. Lenhart; Giuseppe Liotta; Tamara Mchedlidze; Stephen K. Wismath (CoRR, 2013)

Right angle crossing graphs and 1-planarity. - Peter Eades; Giuseppe Liotta (Discret. Appl. Math., 2013)

Proximity Drawings of High-Degree Trees. - Ferran Hurtado; Giuseppe Liotta; David R. Wood (Int. J. Comput. Geom. Appl., 2013)

A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system. - Peter Eades; Seok-Hee Hong 001; Naoki Katoh; Giuseppe Liotta; Pascal Schweitzer; Yusuke Suzuki (Theor. Comput. Sci., 2013)

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

Proximity Drawings. - Giuseppe Liotta (Handbook of Graph Drawing and Visualization, 2013)

On the Complexity of HV-rectilinear Planarity Testing. - Walter Didimo; Giuseppe Liotta; Maurizio Patrignani (GD, 2014)

A Model of Web-Based Follow-Up to Reduce Assistive Technology Abandonment. - Stefano Federici; Maria Laura Mele; Salvatore Agostino Romeo; Walter Didimo; Giuseppe Liotta; Simone Borsci; Fabio Meloni (HCI (3), 2014)

Graph drawing beyond planarity: some results and open problems. - Giuseppe Liotta (ICTCS, 2014)

3D proportional contact representations of graphs. - Md. Jawaherul Alam; Stephen G. Kobourov; Giuseppe Liotta; Sergey Pupyrev; Sankar Veeramoni (IISA, 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)

Special Issue on the 28th European Workshop on Computational Geometry, Guest Editors' Foreword. - Walter Didimo; Giuseppe Liotta (Comput. Geom., 2014)

Network visualization for financial crime detection. - Walter Didimo; Giuseppe Liotta; Fabrizio Montecchiani (J. Vis. Lang. Comput., 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)

A Million Edge Drawing for a Fistful of Dollars. - Alessio Arleo; Walter Didimo; Giuseppe Liotta; Fabrizio Montecchiani (GD, 2015)

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)

Straight-Line Drawability of a Planar Graph Plus an Edge. - Peter Eades; Seok-Hee Hong 001; Giuseppe Liotta; Naoki Katoh; Sheung-Hung Poon (WADS, 2015)

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

A Linear-Time Algorithm for Testing Outer-1-Planarity. - Seok-Hee Hong 001; Peter Eades; Naoki Katoh; Giuseppe Liotta; Pascal Schweitzer; Yusuke Suzuki (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)

On Partitioning the Edges of 1-Planar Graphs. - William J. Lenhart; Giuseppe Liotta; Fabrizio Montecchiani (CoRR, 2015)

Computing upward topological book embeddings of upward planar digraphs. - Francesco Giordano; Giuseppe Liotta; Tamara Mchedlidze; Antonios Symvonis; Sue Whitesides (J. Discrete Algorithms, 2015)

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

Big Graph Drawing: Metrics and Methods (NII Shonan Meeting 2015-1). - Takayuki Itoh; Karsten Klein 001; Giuseppe Liotta (NII Shonan Meet. Rep., 2015)

On Visibility Representations of Non-Planar Graphs. - Therese Biedl; Giuseppe Liotta; Fabrizio Montecchiani (SoCG, 2016)

Placing Arrows in Directed Graph Drawings. - Carla Binucci; Markus Chimani; Walter Didimo; Giuseppe Liotta; Fabrizio Montecchiani (GD, 2016)

Monotone Simultaneous Embeddings of Paths in d Dimensions. - David Bremner; Olivier Devillers; Marc Glisse; Sylvain Lazard; Giuseppe Liotta; Tamara Mchedlidze; Sue Whitesides; Stephen K. Wismath (GD, 2016)

1-Bend RAC Drawings of 1-Planar Graphs. - Walter Didimo; Giuseppe Liotta; Saeed Mehrabi 001; Fabrizio Montecchiani (GD, 2016)

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

Partial edge drawing: Homogeneity is more important than crossings and ink. - Carla Binucci; Giuseppe Liotta; Fabrizio Montecchiani; Alessandra Tappini (IISA, 2016)

Alternating paths and cycles of minimum length. - William S. Evans; Giuseppe Liotta; Henk Meijer; Stephen K. Wismath (Comput. Geom., 2016)

A Distributed Force-Directed Algorithm on Giraph: Design and Experiments. - Alessio Arleo; Walter Didimo; Giuseppe Liotta; Fabrizio Montecchiani (CoRR, 2016)

Monotone Simultaneous Embeddings of Paths in R^d. - David Bremner; Olivier Devillers; Marc Glisse; Sylvain Lazard; Giuseppe Liotta; Tamara Mchedlidze; Sue Whitesides; Stephen K. Wismath (CoRR, 2016)

L-visibility drawings of IC-planar graphs. - Giuseppe Liotta; Fabrizio Montecchiani (Inf. Process. Lett., 2016)

Dynamic Networks Visual Analytics: Approaches to facilitate visual analysis of complex and dynamic network data (NII Shonan Meeting 2016-11). - Takayuki Itoh; Karsten Klein 001; Giuseppe Liotta (NII Shonan Meet. Rep., 2016)

Recognizing and drawing IC-planar graphs. - Franz J. Brandenburg; Walter Didimo; William S. Evans; Philipp Kindermann; Giuseppe Liotta; Fabrizio Montecchiani (Theor. Comput. Sci., 2016)

Simultaneous visibility representations of plane st-graphs using L-shapes. - William S. Evans; Giuseppe Liotta; Fabrizio Montecchiani (Theor. Comput. Sci., 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)

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

GiViP: A Visual Profiler for Distributed Graph Processing Systems. - Alessio Arleo; Walter Didimo; Giuseppe Liotta; Fabrizio Montecchiani (GD, 2017)

Beyond Outerplanarity. - Steven Chaplick; Myroslav Kryven; Giuseppe Liotta; Andre Löffler; Alexander Wolff 001 (GD, 2017)

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)

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)

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

An annotated bibliography on 1-planarity. - Stephen G. Kobourov; Giuseppe Liotta; Fabrizio Montecchiani (Comput. Sci. Rev., 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)

Large graph visualizations using a distributed computing platform. - Alessio Arleo; Walter Didimo; Giuseppe Liotta; Fabrizio Montecchiani (Inf. Sci., 2017)

On RAC drawings of 1-planar graphs. - Michael A. Bekos; Walter Didimo; Giuseppe Liotta; Saeed Mehrabi 001; Fabrizio Montecchiani (Theor. Comput. Sci., 2017)

On partitioning the edges of 1-plane graphs. - William J. Lenhart; Giuseppe Liotta; Fabrizio Montecchiani (Theor. Comput. Sci., 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)

Bend-Minimum Orthogonal Drawings in Quadratic Time. - Walter Didimo; Giuseppe Liotta; Maurizio Patrignani (GD, 2018)

The Partial Visibility Representation Extension Problem. - Steven Chaplick; Grzegorz Guspiel; Grzegorz Gutowski; Tomasz Krawczyk; Giuseppe Liotta (Algorithmica, 2018)

On the Planar Split Thickness of Graphs. - David Eppstein; Philipp Kindermann; Stephen G. Kobourov; Giuseppe Liotta; Anna Lubiw; Aude Maignan; Debajyoti Mondal; Hamideh Vosoughpour; Sue Whitesides; Stephen K. Wismath (Algorithmica, 2018)

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)

Efficient Algorithms for Bend-minimum Orthogonal Drawings of Planar 3-Graphs. - Walter Didimo; Giuseppe Liotta; Maurizio Patrignani (CoRR, 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)

Embedding-Preserving Rectangle Visibility Representations of Nonplanar Graphs. - Therese Biedl; Giuseppe Liotta; Fabrizio Montecchiani (Discret. Comput. Geom., 2018)

Monotone Simultaneous Paths Embeddings in ℝd. - David Bremner; Olivier Devillers; Marc Glisse; Sylvain Lazard; Giuseppe Liotta; Tamara Mchedlidze; Guillaume Moroz; Sue Whitesides; Stephen K. Wismath (Discret. Math. Theor. Comput. Sci., 2018)

A visual analytics system to support tax evasion discovery. - Walter Didimo; Luca Giamminonni; Giuseppe Liotta; Fabrizio Montecchiani; Daniele Pagliuca (Decis. Support Syst., 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)

Profiling distributed graph processing systems through visual analytics. - Alessio Arleo; Walter Didimo; Giuseppe Liotta; Fabrizio Montecchiani (Future Gener. Comput. Syst., 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)

The QuaSEFE Problem. - Patrizio Angelini; Henry Förster; Michael Hoffmann 001; Michael Kaufmann 001; Stephen G. Kobourov; Giuseppe Liotta; Maurizio Patrignani (GD, 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)

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

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

Graph Planarity Testing with Hierarchical Embedding Constraints. - Giuseppe Liotta; Ignaz Rutter; Alessandra Tappini (CoRR, 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)

On the edge-length ratio of 2-trees. - Václav Blazej; Jirí Fiala 001; Giuseppe Liotta; Simon Lomic (CoRR, 2019)

A Survey on Graph Drawing Beyond Planarity. - Walter Didimo; Giuseppe Liotta; Fabrizio Montecchiani (ACM Comput. Surv., 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)

Visual querying and analysis of temporal fiscal networks. - Walter Didimo; Luca Grilli 001; Giuseppe Liotta; Fabrizio Montecchiani; Daniele Pagliuca (Inf. Sci., 2019)

HV-planarity: Algorithms and complexity. - Walter Didimo; Giuseppe Liotta; Maurizio Patrignani (J. Comput. Syst. Sci., 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)

On the edge-length ratio of outerplanar graphs. - Sylvain Lazard; William J. Lenhart; Giuseppe Liotta (Theor. Comput. Sci., 2019)

A Distributed Multilevel Force-Directed Algorithm. - Alessio Arleo; Walter Didimo; Giuseppe Liotta; Fabrizio Montecchiani (IEEE Trans. Parallel Distributed Syst., 2019)

Edge Partitions and Visibility Representations of 1-planar Graphs. - Giuseppe Liotta; Fabrizio Montecchiani (Beyond Planar Graphs, 2020)

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)

VAIM: Visual Analytics for Influence Maximization. - Alessio Arleo; Walter Didimo; Giuseppe Liotta; Silvia Miksch; Fabrizio Montecchiani (GD, 2020)

On the Edge-Length Ratio of 2-Trees. - Václav Blazej; Jirí Fiala 001; Giuseppe Liotta (GD, 2020)

Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time. - Walter Didimo; Michael Kaufmann 001; Giuseppe Liotta; Giacomo Ortali (GD, 2020)

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

Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time. - Walter Didimo; Giuseppe Liotta; Giacomo Ortali; Maurizio Patrignani (SODA, 2020)

Combining Network Visualization and Data Mining for Tax Risk Assessment. - Walter Didimo; Luca Grilli 001; Giuseppe Liotta; Lorenzo Menconi; Fabrizio Montecchiani; Daniele Pagliuca (IEEE Access, 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)

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)

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)

Trends and Perspectives for Graph Drawing and Network Visualization (NII Shonan Meeting 171). - Steven Chaplick; Takayuki Itoh; Giuseppe Liotta; Kwan-Liu Ma; Ignaz Rutter (NII Shonan Meet. Rep., 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)

Corrigendum to "On the edge-length ratio of outerplanar graphs" [Theoret. Comput. Sci. 770 (2019) 88-94]. - Sylvain Lazard; William J. Lenhart; Giuseppe Liotta (Theor. Comput. Sci., 2020)

Generalized LR-Drawings of Trees. - Therese Biedl; Giuseppe Liotta; Jayson Lynch; Fabrizio Montecchiani (CCCG, 2021)

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

Long-Lasting Sequences of BGP Updates. - Lorenzo Ariemma; Giuseppe Liotta; Massimo Candela; Giuseppe Di Battista (PAM, 2021)

Spirality and Rectilinear Planarity Testing of Independent-Parallel SP-Graphs. - Walter Didimo; Michael Kaufmann 001; Giuseppe Liotta; Giacomo Ortali (CoRR, 2021)

On Edge-Length Ratios of Partial 2-Trees. - Václav Blazej; Jirí Fiala 001; Giuseppe Liotta (Int. J. Comput. Geom. Appl., 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)

Ortho-polygon visibility representations of 3-connected 1-plane graphs. - Giuseppe Liotta; Fabrizio Montecchiani; Alessandra Tappini (Theor. Comput. Sci., 2021)

Simultaneous FPQ-ordering and hybrid planarity testing. - Giuseppe Liotta; Ignaz Rutter; Alessandra Tappini (Theor. Comput. Sci., 2021)

In-browser Visualization of Large-scale Graphs. - Luca Consalvi; Walter Didimo; Giuseppe Liotta; Fabrizio Montecchiani (itaDATA, 2022)

BrowVis: Visualizing Large Graphs in the Browser. - Luca Consalvi; Walter Didimo; Giuseppe Liotta; Fabrizio Montecchiani (IEEE Access, 2022)

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

Placing Arrows in Directed Graph Layouts: Algorithms and Experiments. - Carla Binucci; Walter Didimo; Michael Kaufmann 001; Giuseppe Liotta; Fabrizio Montecchiani (Comput. Graph. Forum, 2022)

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

Editor in Chief's Foreword. - Giuseppe Liotta (J. Graph Algorithms Appl., 2022)

Influence Maximization With Visual Analytics. - Alessio Arleo; Walter Didimo; Giuseppe Liotta; Silvia Miksch; Fabrizio Montecchiani (IEEE Trans. Vis. Comput. Graph., 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)

Min-k-planar Drawings of Graphs. - Carla Binucci; Aaron Büngener; Giuseppe Di Battista; Walter Didimo; Vida Dujmovic; Seok-Hee Hong 001; Michael Kaufmann 001; Giuseppe Liotta; Pat Morin; Alessandra Tappini (GD (1), 2023)

Mutual Witness Proximity Drawings of Isomorphic Trees. - Carolina Haase; Philipp Kindermann; William J. Lenhart; Giuseppe Liotta (GD (1), 2023)

Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth. - Bart M. P. Jansen; Liana Khazaliya; Philipp Kindermann; Giuseppe Liotta; Fabrizio Montecchiani; Kirill Simonov (GD (2), 2023)

Three Edge-Disjoint Plane Spanning Paths in a Point Set. - Philipp Kindermann; Jan Kratochvíl; Giuseppe Liotta; Pavel Valtr 001 (GD (1), 2023)

On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges (short paper). - Carla Binucci; Giuseppe Liotta; Fabrizio Montecchiani; Giacomo Ortali; Tommaso Piselli (ICTCS, 2023)

Rectilinear-Upward Planarity Testing of Digraphs. - Walter Didimo; Michael Kaufmann 001; Giuseppe Liotta; Giacomo Ortali; Maurizio Patrignani (ISAAC, 2023)

The st-Planar Edge Completion Problem Is Fixed-Parameter Tractable. - Liana Khazaliya; Philipp Kindermann; Giuseppe Liotta; Fabrizio Montecchiani; Kirill Simonov (ISAAC, 2023)

On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges. - Carla Binucci; Giuseppe Liotta; Fabrizio Montecchiani; Giacomo Ortali; Tommaso Piselli (MFCS, 2023)

Nonplanar Graph Drawings with k Vertices per Face. - Carla Binucci; Giuseppe Di Battista; Walter Didimo; Seok-Hee Hong 001; Michael Kaufmann 001; Giuseppe Liotta; Pat Morin; Alessandra Tappini (WG, 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)

Rectilinear Planarity of Partial 2-Trees. - Walter Didimo; Michael Kaufmann 001; Giuseppe Liotta; Giacomo Ortali (J. Graph Algorithms Appl., 2023)

Drawing Partial 2-Trees with Few Slopes. - William J. Lenhart; Giuseppe Liotta; Debajyoti Mondal; Rahnuma Islam Nishat (Algorithmica, 2023)

Parameterized complexity of graph planarity with restricted cyclic orders. - Giuseppe Liotta; Ignaz Rutter; Alessandra Tappini (J. Comput. Syst. Sci., 2023)

Computing Bend-Minimum Orthogonal Drawings of Plane Series-Parallel Graphs in Linear Time. - Walter Didimo; Michael Kaufmann 001; Giuseppe Liotta; Giacomo Ortali (Algorithmica, 2023)

Mutual witness Gabriel drawings of complete bipartite graphs. - William J. Lenhart; Giuseppe Liotta (Theor. Comput. Sci., 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)

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)

Introducing Fairness in Graph Visualization (Poster Abstract). - Seok-Hee Hong 001; Giuseppe Liotta; Fabrizio Montecchiani; Martin Nöllenburg; Tommaso Piselli (GD, 2024)

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)

Bundling-Aware Graph Drawing. - Daniel Archambault; Giuseppe Liotta; Martin Nöllenburg; Tommaso Piselli; Alessandra Tappini; Markus Wallinger (GD, 2024)

Weakly Leveled Planarity with Bounded Span. - Michael A. Bekos; Giordano Da Lozzo; Fabrizio Frati; Siddharth Gupta 002; Philipp Kindermann; Giuseppe Liotta; Ignaz Rutter; Ioannis G. Tollis (GD, 2024)

GraphTrials: Visual Proofs of Graph Properties. - Henry Förster; Felix Klesen; Tim Dwyer; Peter Eades; Seok-Hee Hong 001; Stephen G. Kobourov; Giuseppe Liotta; Kazuo Misue; Fabrizio Montecchiani; Alexander Pastukhov; Falk Schreiber (GD, 2024)

Introducing Fairness in Graph Visualization via Gradient Descent. - Seok-Hee Hong 001; Giuseppe Liotta; Fabrizio Montecchiani; Martin Nöllenburg; Tommaso Piselli (MLVis@EuroVis, 2024)

Outerplanar and Forest Storyplans. - Jirí Fiala 001; Oksana Firman; Giuseppe Liotta; Alexander Wolff 001; Johannes Zink 001 (SOFSEM, 2024)

Hybrid Multilayer Network Visualization of Bibliographic Data. - Éloi Durant; Alessandra Tappini; Walter Didimo; Giuseppe Liotta; Mohammad Ghoniem (EuroVis (Posters), 2024)

Graphs Drawn With Some Vertices per Face: Density and Relationships. - Carla Binucci; Giuseppe Di Battista; Walter Didimo; Vida Dujmovic; Seok-Hee Hong 001; Michael Kaufmann 001; Giuseppe Liotta; Pat Morin; Alessandra Tappini (IEEE Access, 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)

Min-k-planar Drawings of Graphs. - Carla Binucci; Aaron Büngener; Giuseppe Di Battista; Walter Didimo; Vida Dujmovic; Seok-Hee Hong 001; Michael Kaufmann 001; Giuseppe Liotta; Pat Morin; Alessandra Tappini (J. Graph Algorithms Appl., 2024)

Special Issue on WALCOM 2023: Guest Editors' Foreword. - Chun-Cheng Lin; Bertrand M. T. Lin; Giuseppe Liotta (J. Graph Algorithms Appl., 2024)

Optimal-area visibility representations of outer-1-plane graphs. - Therese Biedl; Giuseppe Liotta; Jayson Lynch; Fabrizio Montecchiani (J. Comput. Geom., 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)

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)

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)

Introducing fairness in network visualization. - Peter Eades; Seokhee Hong 001; Giuseppe Liotta; Fabrizio Montecchiani; Martin Nöllenburg; Tommaso Piselli; Stephen K. Wismath (Inf. Sci., 2025)

Optimal Orthogonal Drawings in Linear Time. - Walter Didimo; Giuseppe Liotta; Giacomo Ortali; Maurizio Patrignani (CoRR, 2025)

Unbent Collections of Orthogonal Drawings. - Todor Antic; Giuseppe Liotta; Tomás Masarík; Giacomo Ortali; Matthias Pfretzschner; Peter Stumpf; Alexander Wolff 001; Johannes Zink 001 (CoRR, 2025)

Investigating Crossing Perception in 3D Graph Visualisation. - Ying Zhang; Niklas Gröne; Karsten Klein 001; Giuseppe Liotta; Falk Schreiber (CoRR, 2025)

Parameterized approaches to orthogonal compaction. - Walter Didimo; Siddharth Gupta 002; Philipp Kindermann; Giuseppe Liotta; Alexander Wolff 001; Meirav Zehavi (J. Comput. Syst. Sci., 2026)