Giacomo Ortali

Orcid: 0000-0002-4481-698X

According to our database1, Giacomo Ortali authored at least 24 papers between 2018 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Optimal Orthogonal Drawings in Linear Time.
CoRR, February, 2025

Outer-(ap)RAC Graphs.
Proceedings of the SOFSEM 2025: Theory and Practice of Computer Science, 2025

2024
On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity.
Algorithmica, October, 2024

A fixed-parameter algorithm for dominance drawings of DAGs.
Theor. Comput. Sci., 2024

Partial Temporal Vertex Cover with Bounded Activity Intervals.
Proceedings of the 3rd Symposium on Algorithmic Foundations of Dynamic Networks, 2024

2023
Computing Bend-Minimum Orthogonal Drawings of Plane Series-Parallel Graphs in Linear Time.
Algorithmica, September, 2023

On the parameterized complexity of s-club cluster deletion problems.
Theor. Comput. Sci., August, 2023

Rectilinear Planarity of Partial 2-Trees.
J. Graph Algorithms Appl., 2023

Small Point-Sets Supporting Graph Stories.
J. Graph Algorithms Appl., 2023

Dominance Drawings for DAGs with Bounded Modular Width.
Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Rectilinear-Upward Planarity Testing of Digraphs.
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).
Proceedings of the 24th Italian Conference on Theoretical Computer Science, 2023

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

Computing Weak Dominance Drawings with Minimum Number of Fips.
CoRR, 2022

On the Parametrized Complexity of the s-Club Cluster Edge Deletion Problem.
Proceedings of the 23rd Italian Conference on Theoretical Computer Science, 2022

2021
Constant-Time Reachability in DAGs Using Multidimensional Dominance Drawings.
SN Comput. Sci., 2021

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

2020
Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time.
Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

2019
A New Framework for Hierarchical Drawings.
J. Graph Algorithms Appl., 2019

Adventures in Abstraction: Reachability in Hierarchical Drawings.
CoRR, 2019

Multidimensional Dominance Drawings.
CoRR, 2019

2018
Algorithms and Bounds for Drawing Directed Graphs.
Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018


  Loading...