ORTALI, GIACOMO
ORTALI, GIACOMO
DIPARTIMENTO DI INGEGNERIA
Computing Bend-Minimum Orthogonal Drawings of Plane Series–Parallel Graphs in Linear Time
2023 Didimo, W.; Kaufmann, M.; Liotta, G.; Ortali, G.
On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges
2023 Binucci, C.; Liotta, G.; Montecchiani, F.; Ortali, G.; Piselli, T.
On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges (short paper)
2023 Binucci, C.; Liotta, G.; Montecchiani, F.; Ortali, G.; Piselli, T.
On the parameterized complexity of s-club cluster deletion problems
2023 Montecchiani, F; Ortali, G; Piselli, T; Tappini, A
On the Parameterized Complexity of s-club Cluster Deletion Problems
2023 Montecchiani, F; Ortali, G; Piselli, T; Tappini, A
On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity
2023 Di Giacomo, E.; Didimo, W.; Liotta, G.; Montecchiani, F.; Ortali, G.
Optimal orthogonal drawings of planar 3-graphs in linear time
2020 Didimo, W.; Liotta, G.; Ortali, G.; Patrignani, M.
Rectilinear Planarity of Partial 2-Trees
2023 Didimo, W.; Kaufmann, M.; Liotta, G.; Ortali, G.
Rectilinear Planarity of Partial 2-Trees
2023 Didimo, W.; Kaufmann, M.; Liotta, G.; Ortali, G.
Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time
2020 Didimo, Walter; Kaufmann, Michael; Liotta, Giuseppe; Ortali, Giacomo
Rectilinear-Upward Planarity Testing of Digraphs
2023 Didimo, W.; Kaufmann, M.; Liotta, G.; Ortali, G.; Patrignani, M.
Small Point-Sets Supporting Graph Stories
2023 Di Battista, G.; Didimo, W.; Grilli, L.; Grosso, F.; Ortali, G.; Patrignani, M.; Tappini, A.
Small Point-Sets Supporting Graph Stories
2023 Di Battista, G.; Didimo, W.; Grilli, L.; Grosso, F.; Ortali, G.; Patrignani, M.; Tappini, A.
Titolo | Data di pubblicazione | Autore(i) | File |
---|---|---|---|
Computing Bend-Minimum Orthogonal Drawings of Plane Series–Parallel Graphs in Linear Time | 2023 | Didimo, W.; Kaufmann, M.; Liotta, G.; Ortali, G. | |
On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges | 2023 | Binucci, C.; Liotta, G.; Montecchiani, F.; Ortali, G.; Piselli, T. | |
On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges (short paper) | 2023 | Binucci, C.; Liotta, G.; Montecchiani, F.; Ortali, G.; Piselli, T. | |
On the parameterized complexity of s-club cluster deletion problems | 2023 | Montecchiani, F; Ortali, G; Piselli, T; Tappini, A | |
On the Parameterized Complexity of s-club Cluster Deletion Problems | 2023 | Montecchiani, F; Ortali, G; Piselli, T; Tappini, A | |
On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity | 2023 | Di Giacomo, E.; Didimo, W.; Liotta, G.; Montecchiani, F.; Ortali, G. | |
Optimal orthogonal drawings of planar 3-graphs in linear time | 2020 | Didimo, W.; Liotta, G.; Ortali, G.; Patrignani, M. | |
Rectilinear Planarity of Partial 2-Trees | 2023 | Didimo, W.; Kaufmann, M.; Liotta, G.; Ortali, G. | |
Rectilinear Planarity of Partial 2-Trees | 2023 | Didimo, W.; Kaufmann, M.; Liotta, G.; Ortali, G. | |
Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time | 2020 | Didimo, Walter; Kaufmann, Michael; Liotta, Giuseppe; Ortali, Giacomo | |
Rectilinear-Upward Planarity Testing of Digraphs | 2023 | Didimo, W.; Kaufmann, M.; Liotta, G.; Ortali, G.; Patrignani, M. | |
Small Point-Sets Supporting Graph Stories | 2023 | Di Battista, G.; Didimo, W.; Grilli, L.; Grosso, F.; Ortali, G.; Patrignani, M.; Tappini, A. | |
Small Point-Sets Supporting Graph Stories | 2023 | Di Battista, G.; Didimo, W.; Grilli, L.; Grosso, F.; Ortali, G.; Patrignani, M.; Tappini, A. |