GRID: An Interactive Tool for Computing Orthogonal Drawings With the Minimum Number of Bends. - Walter Didimo; Antonio Leonforte (GD, 1997)

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

Orthogonal and Quasi-upward Drawings with Vertices of Prescribed Size. - Giuseppe Di Battista; Walter Didimo; Maurizio Patrignani; Maurizio Pizzonia (GD, 1999)

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

Visualization of the Autonomous Systems Interconnections with HERMES. - Andrea Carmignani; Giuseppe Di Battista; Walter Didimo; Francesco Matera; Maurizio Pizzonia (GD, 2000)

Drawing Relational Schemas. - Giuseppe Di Battista; Walter Didimo; Maurizio Patrignani; Maurizio Pizzonia (VisSym, 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)

Computing Orthogonal Drawings with the Minimum Number of Bends. - Paola Bertolazzi; Giuseppe Di Battista; Walter Didimo (IEEE Trans. Computers, 2000)

Exploration and Visualization of Computer Networks: Polyphemus and Hermes. - Gabriele Barbagallo; Andrea Carmignani; Giuseppe Di Battista; Walter Didimo; Maurizio Pizzonia (GD, 2001)

Planarization of Clustered Graphs. - Giuseppe Di Battista; Walter Didimo; A. Marcandalli (GD, 2001)

Drawing Database Schemas with DBdraw. - Giuseppe Di Battista; Walter Didimo; Maurizio Patrignani; Maurizio Pizzonia (GD, 2001)

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

Industrial Plant Drawer. - Walter Didimo; Maurizio Patrignani; Maurizio Pizzonia (GD, 2001)

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)

Quasi-Upward Planarity. - Paola Bertolazzi; Giuseppe Di Battista; Walter Didimo (Algorithmica, 2002)

A Software System for Computing Labeled Orthogonal Drawings of Graphs. - Carla Binucci; Walter Didimo (GraBaTs, 2002)

Visualization of the High Level Structure of the Internet with HERMES. - Andrea Carmignani; Giuseppe Di Battista; Walter Didimo; Francesco Matera; Maurizio Pizzonia (J. Graph Algorithms Appl., 2002)

Drawing database schemas. - Giuseppe Di Battista; Walter Didimo; Maurizio Patrignani; Maurizio Pizzonia (Softw. Pract. Exp., 2002)

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

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

Upward Embeddings and Orientations of Undirected Planar Graphs. - Walter Didimo; Maurizio Pizzonia (J. Graph Algorithms Appl., 2003)

Polyphemus and Hermes - Exploration and Visualization of Computer Networks. - Gabriele Barbagallo; Andrea Carmignani; Giuseppe Di Battista; Walter Didimo; Maurizio Pizzonia (Graph Drawing Software, 2004)

DBdraw - Automatic Layout of Relational Database Schemas. - Giuseppe Di Battista; Walter Didimo; Maurizio Patrignani; Maurizio Pizzonia (Graph Drawing Software, 2004)

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

Experiments on Area Compaction Algorithms for Orthogonal Drawings. - Carla Binucci; Walter Didimo (CCCG, 2005)

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

Computing Upward Planar Drawings Using Switch-Regularity Heuristics. - Walter Didimo (SOFSEM, 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 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)

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

Upward Planar Drawings and Switch-regularity Heuristics. - Walter Didimo (J. Graph Algorithms Appl., 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)

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)

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)

Maximum upward planar subgraphs of embedded planar digraphs. - Carla Binucci; Walter Didimo; Francesco Giordano (Comput. Geom., 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)

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)

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)

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

Switch-Regular Upward Planar Embeddings of Trees. - Carla Binucci; Emilio Di Giacomo; Walter Didimo; Aimal Rextin (WALCOM, 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)

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)

Upward Planarity Testing of Embedded Mixed Graphs. - Carla Binucci; Walter Didimo (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)

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)

Switch-Regular Upward Planarity Testing of Directed Trees. - Carla Binucci; Emilio Di Giacomo; Walter Didimo; Aimal Rextin (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)

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)

Vis4AUI: Visual Analysis of Banking Activity Networks. - Walter Didimo; Giuseppe Liotta; Fabrizio Montecchiani (GRAPP/IVAPP, 2012)

Fast Layout Computation of Hierarchically Clustered Networks: Algorithmic Advances and Experimental Analysis. - Walter Didimo; Fabrizio Montecchiani (IV, 2012)

h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Fabrizio Montecchiani (WG, 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 trees in a streaming model. - Carla Binucci; Ulrik Brandes; Giuseppe Di Battista; Walter Didimo; Marco Gaertler; Pietro Palladino; Maurizio Patrignani; Antonios Symvonis; Katharina Anna Zweig (Inf. Process. Lett., 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)

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

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)

Exploring Complex Drawings via Edge Stratification. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Fabrizio Montecchiani; Ioannis G. Tollis (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)

Area requirement of graph drawings with few crossings per edge. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Fabrizio Montecchiani (Comput. Geom., 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)

Density of straight-line 1-planar graph drawings. - Walter Didimo (Inf. Process. Lett., 2013)

Guest Editors' Foreword. - Walter Didimo; Maurizio Patrignani (J. Graph Algorithms Appl., 2013)

GDToolkit. - Giuseppe Di Battista; Walter Didimo (Handbook of Graph Drawing and Visualization, 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)

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)

How to visualize directed graphs: A user study. - Walter Didimo; Fabrizio Montecchiani; Evangelos Pallas; Ioannis G. Tollis (IISA, 2014)

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

Quasi-Upward Planar Drawings of Mixed Graphs with Few Bends: Heuristics and Exact Methods. - Carla Binucci; Walter Didimo (WALCOM, 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)

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

Fast layout computation of clustered networks: Algorithmic advances and experimental analysis. - Walter Didimo; Fabrizio Montecchiani (Inf. Sci., 2014)

Upward and quasi-upward planarity testing of embedded mixed graphs. - Carla Binucci; Walter Didimo; Maurizio Patrignani (Theor. Comput. Sci., 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)

2-Layer Fan-Planarity: From Caterpillar to Stegosaurus. - Carla Binucci; Markus Chimani; Walter Didimo; Martin Gronemann; Karsten Klein 001; Jan Kratochvíl; Fabrizio Montecchiani; Ioannis G. Tollis (GD, 2015)

Kojaph: Visual Definition and Exploration of Patterns in Graph Databases. - Walter Didimo; Francesco Giacchè; Fabrizio Montecchiani (GD, 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)

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)

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)

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)

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)

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

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

Fully dynamic semantic word clouds. - Carla Binucci; Walter Didimo; Enrico Spataro (IISA, 2016)

Computing Quasi-Upward Planar Drawings of Mixed Graphs. - Carla Binucci; Walter Didimo (Comput. J., 2016)

A Distributed Force-Directed Algorithm on Giraph: Design and Experiments. - Alessio Arleo; Walter Didimo; Giuseppe Liotta; Fabrizio Montecchiani (CoRR, 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)

Upward Graph Drawing. - Walter Didimo (Encyclopedia of Algorithms, 2016)

GiViP: A Visual Profiler for Distributed Graph Processing Systems. - Alessio Arleo; Walter Didimo; Giuseppe Liotta; Fabrizio Montecchiani (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)

Large graph visualizations using a distributed computing platform. - Alessio Arleo; Walter Didimo; Giuseppe Liotta; Fabrizio Montecchiani (Inf. Sci., 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)

Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus. - Carla Binucci; Markus Chimani; Walter Didimo; Martin Gronemann; Karsten Klein 001; Jan Kratochvíl; Fabrizio Montecchiani; Ioannis G. Tollis (J. Graph Algorithms Appl., 2017)

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

Bend-Minimum Orthogonal Drawings in Quadratic Time. - Walter Didimo; Giuseppe Liotta; Maurizio Patrignani (GD, 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)

A Visualization Framework and User Studies for Overloaded Orthogonal Drawings. - Walter Didimo; Evgenios M. Kornaropoulos; Fabrizio Montecchiani; Ioannis G. Tollis (Comput. Graph. Forum, 2018)

Efficient Algorithms for Bend-minimum Orthogonal Drawings of Planar 3-Graphs. - Walter Didimo; Giuseppe Liotta; Maurizio Patrignani (CoRR, 2018)

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

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

ChordLink: A New Hybrid Visualization Model. - Lorenzo Angori; Walter Didimo; Fabrizio Montecchiani; Daniele Pagliuca; Alessandra Tappini (GD, 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)

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)

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)

Planar drawings of fixed-mobile bigraphs. - Michael A. Bekos; Felice De Luca; Walter Didimo; Tamara Mchedlidze; Martin Nöllenburg; Antonios Symvonis; Ioannis G. Tollis (Theor. Comput. Sci., 2019)

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

Right Angle Crossing Drawings of Graphs. - Walter Didimo (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)

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)

An Experimental Study of a 1-Planarity Testing and Embedding Algorithm. - Carla Binucci; Walter Didimo; Fabrizio Montecchiani (WALCOM, 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)

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)

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

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

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

st-Orientations with Few Transitive Edges. - Carla Binucci; Walter Didimo; Maurizio Patrignani (GD, 2022)

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)

On Turn-Regular Orthogonal Representations. - Michael A. Bekos; Carla Binucci; Giuseppe Di Battista; Walter Didimo; Martin Gronemann; Karsten Klein 001; Maurizio Patrignani; Ignaz Rutter (J. Graph Algorithms Appl., 2022)

Hybrid Graph Visualizations With ChordLink: Algorithms, Experiments, and Applications. - Lorenzo Angori; Walter Didimo; Fabrizio Montecchiani; Daniele Pagliuca; Alessandra Tappini (IEEE Trans. Vis. Comput. Graph., 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)

Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem. - Walter Didimo; Fedor V. Fomin; Petr A. Golovach; Tanmay Inamdar 002; Stephen G. Kobourov; Marie Diana Sieper (GD (2), 2023)

Rectilinear-Upward Planarity Testing of Digraphs. - Walter Didimo; Michael Kaufmann 001; Giuseppe Liotta; Giacomo Ortali; Maurizio Patrignani (ISAAC, 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)

1-planarity testing and embedding: An experimental study. - Carla Binucci; Walter Didimo; Fabrizio Montecchiani (Comput. Geom., 2023)

Brand Network Booster: A New System for Improving Brand Connectivity. - Jacopo Cancellieri; Walter Didimo; Andrea Fronzetti Colladon; Fabrizio Montecchiani (CoRR, 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)

Small Point-Sets Supporting Graph Stories. - Giuseppe Di Battista; Walter Didimo; Luca Grilli 001; Fabrizio Grosso; Giacomo Ortali; Maurizio Patrignani; Alessandra Tappini (J. Graph Algorithms Appl., 2023)

st-Orientations with Few Transitive Edges. - Carla Binucci; Walter Didimo; Maurizio Patrignani (J. Graph Algorithms Appl., 2023)

Rectilinear Planarity of Partial 2-Trees. - Walter Didimo; Michael Kaufmann 001; Giuseppe Liotta; Giacomo Ortali (J. Graph Algorithms Appl., 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)

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)

Simple Realizability of Abstract Topological Graphs. - Giordano Da Lozzo; Walter Didimo; Fabrizio Montecchiani; Miriam Münch; Maurizio Patrignani; Ignaz Rutter (ISAAC, 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)

Brand Network Booster: A new system for improving brand connectivity. - Jacopo Cancellieri; Walter Didimo; Andrea Fronzetti Colladon; Fabrizio Montecchiani; Roberto Vestrelli (Comput. Ind. Eng., 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)

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)

On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Fabrizio Montecchiani; Giacomo Ortali (Algorithmica, 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)

Optimal Orthogonal Drawings in Linear Time. - Walter Didimo; Giuseppe Liotta; Giacomo Ortali; Maurizio Patrignani (CoRR, 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)

Graph Drawing for LLMs: An Empirical Evaluation. - Walter Didimo; Fabrizio Montecchiani; Tommaso Piselli (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)