Algorithms and Bounds for Drawing Directed Graphs. - Giacomo Ortali; Ioannis G. Tollis (GD, 2018)

Multidimensional Dominance Drawings. - Giacomo Ortali; Ioannis G. Tollis (CoRR, 2019)

Adventures in Abstraction: Reachability in Hierarchical Drawings. - Panagiotis Lionakis; Giacomo Ortali; Ioannis G. Tollis (CoRR, 2019)

A New Framework for Hierarchical Drawings. - Giacomo Ortali; Ioannis G. Tollis (J. Graph Algorithms Appl., 2019)

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

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

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

Constant-Time Reachability in DAGs Using Multidimensional Dominance Drawings. - Panagiotis Lionakis; Giacomo Ortali; Ioannis G. Tollis (SN 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)

Computing Weak Dominance Drawings with Minimum Number of Fips. - Giacomo Ortali; Ioannis G. Tollis (CoRR, 2022)

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

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)

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

Dominance Drawings for DAGs with Bounded Modular Width. - Giacomo Ortali; Ioannis G. Tollis (SOFSEM, 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)

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

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

Partial Temporal Vertex Cover with Bounded Activity Intervals. - Riccardo Dondi; Fabrizio Montecchiani; Giacomo Ortali; Tommaso Piselli; Alessandra Tappini (SAND, 2024)

A fixed-parameter algorithm for dominance drawings of DAGs. - Giacomo Ortali; Ioannis G. Tollis (Theor. Comput. Sci., 2024)

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

Outer-(ap)RAC Graphs. - Henry Förster; Julia Katheder; Giacomo Ortali (SOFSEM (1), 2025)

On Planar Straight-Line Dominance Drawings. - Patrizio Angelini; Michael A. Bekos; Giuseppe Di Battista; Fabrizio Frati; Luca Grilli 001; Giacomo Ortali (WADS, 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)

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)