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

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

A Matrix Approach for Weighted Argumentation Frameworks. - Stefano Bistarelli; Alessandra Tappini; Carlo Taticchi (FLAIRS, 2018)

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)

A Matrix Approach for Weighted Argumentation Frameworks: a Preliminary Report. - Stefano Bistarelli; Alessandra Tappini; Carlo Taticchi (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)

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

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

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

Graph Planarity Testing with Hierarchical Embedding Constraints. - Giuseppe Liotta; Ignaz Rutter; Alessandra Tappini (CoRR, 2019)

Coloring outerplanar graphs and planar 3-trees with small monochromatic components. - Michael A. Bekos; Carla Binucci; Michael Kaufmann 001; Chrysanthi N. Raftopoulou; Antonios Symvonis; Alessandra Tappini (CoRR, 2019)

Pole Dancing: 3D Morphs for Tree Drawings. - Elena Arseneva; Prosenjit Bose; Pilar Cano; Anthony D'Angelo; Vida Dujmovic; Fabrizio Frati; Stefan Langerman; Alessandra Tappini (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)

Storyline Visualizations with Ubiquitous Actors. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Fabrizio Montecchiani; Alessandra Tappini (GD, 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)

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

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

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)

(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)

On the Parametrized Complexity of the s-Club Cluster Edge Deletion Problem. - Fabrizio Montecchiani; Giacomo Ortali; Tommaso Piselli; Alessandra Tappini (ICTCS, 2022)

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

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)

Evaluating Animation Parameters for Morphing Edge Drawings. - Carla Binucci; Henry Förster; Julia Katheder; Alessandra Tappini (GD (1), 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)

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)

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

On the parameterized complexity of s-club cluster deletion problems. - Fabrizio Montecchiani; Giacomo Ortali; Tommaso Piselli; Alessandra Tappini (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)

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

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

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)

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

Time-Dependent Route Planning on Maps: A User Study. - Annika Bonerath; Claus-Christian Carbon; Silvia Miksch; Maurizio Patrignani; Alessandra Tappini (J. Percept. Imaging, 2025)

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