Giacomo Ortali

According to our database, Giacomo Ortali authored at least 20 papers between 2018 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2023

Computing Bend-Minimum Orthogonal Drawings of Plane Series-Parallel Graphs in Linear Time.

Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali

Algorithmica, September, 2023

On the parameterized complexity of s-club cluster deletion problems.

Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini

Theor. Comput. Sci., August, 2023

Rectilinear Planarity of Partial 2-Trees.

Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali

J. Graph Algorithms Appl., 2023

Small Point-Sets Supporting Graph Stories.

Giuseppe Di Battista, Walter Didimo, Luca Grilli, Fabrizio Grosso, Giacomo Ortali, Maurizio Patrignani, Alessandra Tappini

J. Graph Algorithms Appl., 2023

Dominance Drawings for DAGs with Bounded Modular Width.

Giacomo Ortali, Ioannis G. Tollis

Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges.

Carla Binucci, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Rectilinear-Upward Planarity Testing of Digraphs.

Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali, Maurizio Patrignani

Proceedings of the 34th International Symposium on Algorithms and Computation, 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

Proceedings of the 24th Italian Conference on Theoretical Computer Science, 2023

On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity.

Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali

Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

2022

On the Parameterized Complexity of the s-Club Cluster Edge Deletion Problem.

Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini

CoRR, 2022

Computing Weak Dominance Drawings with Minimum Number of Fips.

Giacomo Ortali, Ioannis G. Tollis

CoRR, 2022

On the Parametrized Complexity of the s-Club Cluster Edge Deletion Problem.

Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini

Proceedings of the 23rd Italian Conference on Theoretical Computer Science, 2022

2021

Constant-Time Reachability in DAGs Using Multidimensional Dominance Drawings.

Panagiotis Lionakis, Giacomo Ortali, Ioannis G. Tollis

SN Comput. Sci., 2021

Spirality and Rectilinear Planarity Testing of Independent-Parallel SP-Graphs.

Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali

CoRR, 2021

2020

Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time.

Walter Didimo, Giuseppe Liotta, Giacomo Ortali, Maurizio Patrignani

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time.

Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali

Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

2019

A New Framework for Hierarchical Drawings.

Giacomo Ortali, Ioannis G. Tollis

J. Graph Algorithms Appl., 2019

Adventures in Abstraction: Reachability in Hierarchical Drawings.

Panagiotis Lionakis, Giacomo Ortali, Ioannis G. Tollis

CoRR, 2019

Multidimensional Dominance Drawings.

Giacomo Ortali, Ioannis G. Tollis

CoRR, 2019

2018

Algorithms and Bounds for Drawing Directed Graphs.

Giacomo Ortali, Ioannis G. Tollis

Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018