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

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)

Fan-Planar Graphs: Combinatorial Properties and Complexity Results. - Carla Binucci; Emilio Di Giacomo; Walter Didimo; Fabrizio Montecchiani; Maurizio Patrignani; Ioannis G. Tollis (GD, 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)

The Planar Slope Number of Subcubic Graphs. - Emilio Di Giacomo; Giuseppe Liotta; Fabrizio Montecchiani (LATIN, 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)

1-Bend Orthogonal Partial Edge Drawing. - Till Bruckdorfer; Michael Kaufmann 001; Fabrizio Montecchiani (J. Graph Algorithms Appl., 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)

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

Network visualization retargeting. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Fabrizio Montecchiani (IISA, 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)

On Partitioning the Edges of 1-Planar Graphs. - William J. Lenhart; Giuseppe Liotta; Fabrizio Montecchiani (CoRR, 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)

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)

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)

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

L-visibility drawings of IC-planar graphs. - Giuseppe Liotta; Fabrizio Montecchiani (Inf. Process. Lett., 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)

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

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

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

On Guarding Orthogonal Polygons with Sliding Cameras. - Therese Biedl; Timothy M. Chan; Stephanie Lee; Saeed Mehrabi 001; Fabrizio Montecchiani; Hamideh Vosoughpour (WALCOM, 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)

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)

Progress on Partial Edge Drawings. - Till Bruckdorfer; Sabine Cornelsen; Carsten Gutwenger; Michael Kaufmann 001; Fabrizio Montecchiani; Martin Nöllenburg; Alexander Wolff 001 (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)

On partitioning the edges of 1-plane graphs. - William J. Lenhart; Giuseppe Liotta; Fabrizio Montecchiani (Theor. Comput. Sci., 2017)

Bounded Stub Resolution for Some Maximal 1-Planar Graphs. - Michael Kaufmann 001; Jan Kratochvíl; Fabian Lipp; Fabrizio Montecchiani; Chrysanthi N. Raftopoulou; Pavel Valtr 001 (CALDAM, 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)

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)

Planar Graphs of Bounded Degree have Constant Queue Number. - Michael A. Bekos; Henry Förster; Martin Gronemann; Tamara Mchedlidze; Fabrizio Montecchiani; Chrysanthi N. Raftopoulou; Torsten Ueckerdt (CoRR, 2018)

Embedding-Preserving Rectangle Visibility Representations of Nonplanar Graphs. - Therese Biedl; Giuseppe Liotta; Fabrizio Montecchiani (Discret. Comput. Geom., 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)

Guest Editors' Foreword and Overview. - Michael A. Bekos; Michael Kaufmann 001; Fabrizio Montecchiani (J. Graph Algorithms Appl., 2018)

Gap-planar graphs. - Sang Won Bae 001; Jean-François Baffier; Jinhee Chun; Peter Eades; Kord Eickmeyer; Luca Grilli 001; Seok-Hee Hong 001; Matias Korman; Fabrizio Montecchiani; Ignaz Rutter; Csaba D. Tóth (Theor. Comput. Sci., 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)

ChordLink: A New Hybrid Visualization Model. - Lorenzo Angori; Walter Didimo; Fabrizio Montecchiani; Daniele Pagliuca; Alessandra Tappini (GD, 2019)

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

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

Guarding Orthogonal Art Galleries with Sliding k-Transmitters: Hardness and Approximation. - Therese Biedl; Timothy M. Chan; Stephanie Lee; Saeed Mehrabi 001; Fabrizio Montecchiani; Hamideh Vosoughpour; Ziting Yu (Algorithmica, 2019)

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

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)

Planar Graphs of Bounded Degree Have Bounded Queue Number. - Michael A. Bekos; Henry Förster; Martin Gronemann; Tamara Mchedlidze; Fabrizio Montecchiani; Chrysanthi N. Raftopoulou; Torsten Ueckerdt (SIAM J. Comput., 2019)

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

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)

Book Embeddings of Nonplanar Graphs with Small Faces in Few Pages. - Michael A. Bekos; Giordano Da Lozzo; Svenja Griesbach; Martin Gronemann; Fabrizio Montecchiani; Chrysanthi N. Raftopoulou (SoCG, 2020)

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

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

Layered Fan-Planar Graph Drawings. - Therese Biedl; Steven Chaplick; Michael Kaufmann 001; Fabrizio Montecchiani; Martin Nöllenburg; Chrysanthi N. Raftopoulou (MFCS, 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)

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

On Layered Fan-Planar Graph Drawings. - Therese Biedl; Steven Chaplick; Jirí Fiala 001; Michael Kaufmann 001; Fabrizio Montecchiani; Martin Nöllenburg; Chrysanthi N. Raftopoulou (CoRR, 2020)

Grid Drawings of Graphs with Constant Edge-Vertex Resolution. - Michael A. Bekos; Martin Gronemann; Fabrizio Montecchiani; Antonios Symvonis; Leonidas Theocharous (CoRR, 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)

Parameterized Algorithms for Book Embedding Problems. - Sujoy Bhore; Robert Ganian; Fabrizio Montecchiani; Martin Nöllenburg (J. Graph Algorithms Appl., 2020)

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

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

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

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

Grid drawings of graphs with constant edge-vertex resolution. - Michael A. Bekos; Martin Gronemann; Fabrizio Montecchiani; Dömötör Pálvölgyi; Antonios Symvonis; Leonidas Theocharous (Comput. Geom., 2021)

Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293). - Robert Ganian; Fabrizio Montecchiani; Martin Nöllenburg; Meirav Zehavi (Dagstuhl Reports, 2021)

The Stub Resolution of 1-planar Graphs. - Michael Kaufmann 001; Jan Kratochvíl; Fabian Lipp; Fabrizio Montecchiani; Chrysanthi N. Raftopoulou; Pavel Valtr 001 (J. Graph Algorithms Appl., 2021)

Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles. - Philipp Kindermann; Fabrizio Montecchiani; Lena Schlipf; André Schulz 001 (J. Graph Algorithms Appl., 2021)

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

On the Parametrized Complexity of the s-Club Cluster Edge Deletion Problem. - Fabrizio Montecchiani; Giacomo Ortali; Tommaso Piselli; Alessandra Tappini (ICTCS, 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 the Parameterized Complexity of the s-Club Cluster Edge Deletion Problem. - Fabrizio Montecchiani; Giacomo Ortali; Tommaso Piselli; Alessandra Tappini (CoRR, 2022)

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

Parameterized Algorithms for Queue Layouts. - Sujoy Bhore; Robert Ganian; Fabrizio Montecchiani; Martin Nöllenburg (J. Graph Algorithms Appl., 2022)

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

Crossing numbers of beyond-planar graphs. - Markus Chimani; Philipp Kindermann; Fabrizio Montecchiani; Pavel Valtr 001 (Theor. Comput. Sci., 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)

Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable. - Sujoy Bhore; Robert Ganian; Liana Khazaliya; Fabrizio Montecchiani; Martin Nöllenburg (SoCG, 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)

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)

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

Dataspaces: Concepts, Architectures and Initiatives. - Maurizio Atzori; Angelo Ciaramella; Claudia Diamantini; Beniamino Di Martino; Salvatore Distefano; Tullio Facchinetti; Fabrizio Montecchiani; Antonino Nocera; Giancarlo Ruffo; Roberto Trasarti (itaDATA, 2023)

Large-scale Computing Frameworks: Experiments and Guidelines. - Michele Baglioni; Fabrizio Montecchiani; Mario Rosati (itaDATA, 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)

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

Geodesic obstacle representation of graphs. - Prosenjit Bose; Paz Carmi; Vida Dujmovic; Saeed Mehrabi 001; Fabrizio Montecchiani; Pat Morin; Luís Fernando Schultz Xavier da Silveira (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)

New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162). - Robert Ganian; Fabrizio Montecchiani; Martin Nöllenburg; Meirav Zehavi; Liana Khazaliya (Dagstuhl Reports, 2023)

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

On the upward book thickness problem: Combinatorial and complexity results. - Sujoy Bhore; Giordano Da Lozzo; Fabrizio Montecchiani; Martin Nöllenburg (Eur. J. Comb., 2023)

On the parameterized complexity of s-club cluster deletion problems. - Fabrizio Montecchiani; Giacomo Ortali; Tommaso Piselli; Alessandra Tappini (Theor. Comput. Sci., 2023)

Introducing Fairness in Graph Visualization (Poster Abstract). - Seok-Hee Hong 001; Giuseppe Liotta; Fabrizio Montecchiani; Martin Nöllenburg; Tommaso Piselli (GD, 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)

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)

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

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

Partial Temporal Vertex Cover with Bounded Activity Intervals. - Riccardo Dondi; Fabrizio Montecchiani; Giacomo Ortali; Tommaso Piselli; Alessandra Tappini (SAND, 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)

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)

Strictly-convex drawings of 3-connected planar graphs. - Michael A. Bekos; Martin Gronemann; Fabrizio Montecchiani; Antonios Symvonis (J. Comput. Geom., 2024)

Optimal-area visibility representations of outer-1-plane graphs. - Therese Biedl; Giuseppe Liotta; Jayson Lynch; Fabrizio Montecchiani (J. Comput. Geom., 2024)

Book embeddings of k-framed graphs and k-map graphs. - Michael A. Bekos; Giordano Da Lozzo; Svenja M. Griesbach; Martin Gronemann; Fabrizio Montecchiani; Chrysanthi N. Raftopoulou (Discret. Math., 2024)

Convex grid drawings of planar graphs with constant edge-vertex resolution. - Michael A. Bekos; Martin Gronemann; Fabrizio Montecchiani; Antonios Symvonis (Theor. Comput. Sci., 2024)

Recognizing Map Graphs of Bounded Treewidth. - Patrizio Angelini; Michael A. Bekos; Giordano Da Lozzo; Martin Gronemann; Fabrizio Montecchiani; Alessandra Tappini (Algorithmica, 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)

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

The influence of dimensions on the complexity of computing decision trees. - Stephen G. Kobourov; Maarten Löffler; Fabrizio Montecchiani; Marcin Pilipczuk; Ignaz Rutter; Raimund Seidel; Manuel Sorge; Jules Wulms (Artif. Intell., 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)

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)

Flipping Matchings is Hard. - Carla Binucci; Fabrizio Montecchiani; Daniel Perz; Alessandra Tappini (CoRR, 2025)

Graph Drawing for LLMs: An Empirical Evaluation. - Walter Didimo; Fabrizio Montecchiani; Tommaso Piselli (CoRR, 2025)