Giacomo Ortali

Publication Activity (10 Years)

Years Active: 2018-2024
Publications (10 Years): 32

Top Topics

Tree Decomposition

Parameterized Complexity

Global Constraints

Top Venues

J. Graph Algorithms Appl.

Publications

Riccardo Dondi, Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini
Partial Temporal Vertex Cover with Bounded Activity Intervals. SAND (2024)
Carla Binucci, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli
On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges. MFCS (2023)
Giacomo Ortali, Ioannis G. Tollis
Dominance Drawings for DAGs with Bounded Modular Width. SOFSEM (2023)
Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali, Maurizio Patrignani
Rectilinear-Upward Planarity Testing of Digraphs. ISAAC (2023)
Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini
On the parameterized complexity of s-club cluster deletion problems. Theor. Comput. Sci. 969 (2023)
Walter Didimo, Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali
On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity. CoRR (2023)
Giuseppe Di Battista, Walter Didimo, Luca Grilli, Fabrizio Grosso, Giacomo Ortali, Maurizio Patrignani, Alessandra Tappini
Small Point-Sets Supporting Graph Stories. J. Graph Algorithms Appl. 27 (8) (2023)
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali
On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity. GD (2) (2023)
Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali
Rectilinear Planarity of Partial 2-Trees. J. Graph Algorithms Appl. 27 (8) (2023)
Carla Binucci, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli
On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges (short paper). ICTCS (2023)
Carla Binucci, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli
On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges. CoRR (2023)
Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali
Computing Bend-Minimum Orthogonal Drawings of Plane Series-Parallel Graphs in Linear Time. Algorithmica 85 (9) (2023)
Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini
On the Parameterized Complexity of s-club Cluster Deletion Problems. SOFSEM (2023)
Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali
Rectilinear Planarity of Partial 2-Trees. CoRR (2022)
Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini
On the Parametrized Complexity of the s-Club Cluster Edge Deletion Problem. ICTCS (2022)
Giacomo Ortali, Ioannis G. Tollis
Computing Weak Dominance Drawings with Minimum Number of Fips. CoRR (2022)
Giuseppe Di Battista, Walter Didimo, Luca Grilli, Fabrizio Grosso, Giacomo Ortali, Maurizio Patrignani, Alessandra Tappini
Small Point-Sets Supporting Graph Stories. CoRR (2022)
Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali
Computing Bend-Minimum Orthogonal Drawings of Plane Series-Parallel Graphs in Linear Time. CoRR (2022)
Giuseppe Di Battista, Walter Didimo, Luca Grilli, Fabrizio Grosso, Giacomo Ortali, Maurizio Patrignani, Alessandra Tappini
Small Point-Sets Supporting Graph Stories. GD (2022)
Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali
Rectilinear Planarity of Partial 2-Trees. GD (2022)
Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini
On the Parameterized Complexity of the s-Club Cluster Edge Deletion Problem. CoRR (2022)
Panagiotis Lionakis, Giacomo Ortali, Ioannis G. Tollis
Constant-Time Reachability in DAGs Using Multidimensional Dominance Drawings. SN Comput. Sci. 2 (4) (2021)
Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali
Spirality and Rectilinear Planarity Testing of Independent-Parallel SP-Graphs. CoRR (2021)
Walter Didimo, Giuseppe Liotta, Giacomo Ortali, Maurizio Patrignani
Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time. SODA (2020)
Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali
Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time. CoRR (2020)
Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali
Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time. Graph Drawing (2020)
Giacomo Ortali, Ioannis G. Tollis
A New Framework for Hierarchical Drawings. J. Graph Algorithms Appl. 23 (3) (2019)
Giacomo Ortali, Ioannis G. Tollis
Multidimensional Dominance Drawings. CoRR (2019)
Panagiotis Lionakis, Giacomo Ortali, Ioannis G. Tollis
Adventures in Abstraction: Reachability in Hierarchical Drawings. CoRR (2019)
Walter Didimo, Giuseppe Liotta, Giacomo Ortali, Maurizio Patrignani
Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time. CoRR (2019)
Giacomo Ortali, Ioannis G. Tollis
Algorithms and Bounds for Drawing Directed Graphs. Graph Drawing (2018)
Giacomo Ortali, Ioannis G. Tollis
Algorithms and Bounds for Drawing Directed Graphs. CoRR (2018)