Giacomo Ortali

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
On planar straight-line dominance drawings2026-08-11Paper
Unbent collections of orthogonal drawings2026-07-10Paper
Partial temporal vertex cover with bounded activity intervals
Theoretical Computer Science
2026-06-15Paper
On the parameterized complexity of computing st-orientations with few transitive edges
Journal of Graph Algorithms and Applications
2026-04-22Paper
Rectilinear-upward planarity testing of digraphs
Journal of Computer and System Sciences
2026-03-12Paper
Rectilinear-upward planarity testing of digraphs2025-07-24Paper
On the parameterized complexity of computing \(st\)-orientations with few transitive edges2024-12-03Paper
A fixed-parameter algorithm for dominance drawings of DAGs
Theoretical Computer Science
2024-11-07Paper
On the parameterized complexity of bend-minimum orthogonal planarity
Algorithmica
2024-10-24Paper
On the parameterized complexity of bend-minimum orthogonal planarity2024-10-14Paper
Small Point-Sets Supporting Graph Stories
Journal of Graph Algorithms and Applications
2023-12-20Paper
Rectilinear Planarity of Partial 2-Trees
Journal of Graph Algorithms and Applications
2023-12-20Paper
Computing bend-minimum orthogonal drawings of plane series-parallel graphs in linear time
Algorithmica
2023-09-27Paper
Rectilinear planarity of partial 2-trees
Lecture Notes in Computer Science
2023-08-16Paper
Small point-sets supporting graph stories
Lecture Notes in Computer Science
2023-08-16Paper
Dominance drawings for DAGs with bounded modular width
Lecture Notes in Computer Science
2023-08-14Paper
On the parameterized complexity of \(s\)-club cluster deletion problems
Lecture Notes in Computer Science
2023-08-14Paper
On the parameterized complexity of s-club cluster deletion problems
Theoretical Computer Science
2023-08-01Paper
Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time
Lecture Notes in Computer Science
2021-12-01Paper
Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms
2021-02-02Paper
A new framework for hierarchical drawings
Journal of Graph Algorithms and Applications
2019-09-16Paper
Algorithms and bounds for drawing directed graphs
(available as arXiv preprint)
2019-02-15Paper


Research outcomes over time


This page was built for person: Giacomo Ortali