default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGiacomo Ortali
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali:
On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity. Algorithmica 86(10): 3231-3251 (2024)- [j7]Giacomo Ortali, Ioannis G. Tollis:
A fixed-parameter algorithm for dominance drawings of DAGs. Theor. Comput. Sci. 1020: 114819 (2024) - [c13]Riccardo Dondi, Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini:
Partial Temporal Vertex Cover with Bounded Activity Intervals. SAND 2024: 11:1-11:14 - 2023
- [j6]Walter Didimo
, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali:
Computing Bend-Minimum Orthogonal Drawings of Plane Series-Parallel Graphs in Linear Time. Algorithmica 85(9): 2605-2666 (2023) - [j5]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): 651-677 (2023) - [j4]Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali:
Rectilinear Planarity of Partial 2-Trees. J. Graph Algorithms Appl. 27(8): 679-719 (2023) - [j3]Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini:
On the parameterized complexity of s-club cluster deletion problems. Theor. Comput. Sci. 969: 114041 (2023) - [c12]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali:
On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity. GD (2) 2023: 53-65 - [c11]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: 98-103 - [c10]Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali, Maurizio Patrignani:
Rectilinear-Upward Planarity Testing of Digraphs. ISAAC 2023: 26:1-26:20 - [c9]Carla Binucci, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli:
On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges. MFCS 2023: 18:1-18:15 - [c8]Giacomo Ortali, Ioannis G. Tollis:
Dominance Drawings for DAGs with Bounded Modular Width. SOFSEM 2023: 65-79 - [c7]Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini:
On the Parameterized Complexity of s-club Cluster Deletion Problems. SOFSEM 2023: 159-173 - [i13]Carla Binucci, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli:
On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges. CoRR abs/2306.03196 (2023) - [i12]Walter Didimo, Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali:
On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity. CoRR abs/2308.13665 (2023) - 2022
- [c6]Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali:
Rectilinear Planarity of Partial 2-Trees. GD 2022: 157-172 - [c5]Giuseppe Di Battista, Walter Didimo, Luca Grilli, Fabrizio Grosso, Giacomo Ortali, Maurizio Patrignani, Alessandra Tappini:
Small Point-Sets Supporting Graph Stories. GD 2022: 289-303 - [c4]Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini:
On the Parametrized Complexity of the s-Club Cluster Edge Deletion Problem. ICTCS 2022: 14-20 - [i11]Giacomo Ortali, Ioannis G. Tollis:
Computing Weak Dominance Drawings with Minimum Number of Fips. CoRR abs/2201.10201 (2022) - [i10]Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali:
Computing Bend-Minimum Orthogonal Drawings of Plane Series-Parallel Graphs in Linear Time. CoRR abs/2205.07500 (2022) - [i9]Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini:
On the Parameterized Complexity of the s-Club Cluster Edge Deletion Problem. CoRR abs/2205.10834 (2022) - [i8]Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali:
Rectilinear Planarity of Partial 2-Trees. CoRR abs/2208.12558 (2022) - [i7]Giuseppe Di Battista, Walter Didimo, Luca Grilli, Fabrizio Grosso, Giacomo Ortali, Maurizio Patrignani, Alessandra Tappini:
Small Point-Sets Supporting Graph Stories. CoRR abs/2208.14126 (2022) - 2021
- [j2]Panagiotis Lionakis, Giacomo Ortali, Ioannis G. Tollis:
Constant-Time Reachability in DAGs Using Multidimensional Dominance Drawings. SN Comput. Sci. 2(4): 320 (2021) - [i6]Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali:
Spirality and Rectilinear Planarity Testing of Independent-Parallel SP-Graphs. CoRR abs/2110.00548 (2021) - 2020
- [c3]Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali:
Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time. GD 2020: 436-449 - [c2]Walter Didimo, Giuseppe Liotta, Giacomo Ortali, Maurizio Patrignani:
Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time. SODA 2020: 806-825 - [i5]Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali:
Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time. CoRR abs/2008.03784 (2020)
2010 – 2019
- 2019
- [j1]Giacomo Ortali, Ioannis G. Tollis:
A New Framework for Hierarchical Drawings. J. Graph Algorithms Appl. 23(3): 553-578 (2019) - [i4]Giacomo Ortali, Ioannis G. Tollis:
Multidimensional Dominance Drawings. CoRR abs/1906.09224 (2019) - [i3]Panagiotis Lionakis, Giacomo Ortali, Ioannis G. Tollis:
Adventures in Abstraction: Reachability in Hierarchical Drawings. CoRR abs/1907.11662 (2019) - [i2]Walter Didimo, Giuseppe Liotta, Giacomo Ortali, Maurizio Patrignani:
Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time. CoRR abs/1910.11782 (2019) - 2018
- [c1]Giacomo Ortali, Ioannis G. Tollis:
Algorithms and Bounds for Drawing Directed Graphs. GD 2018: 579-592 - [i1]Giacomo Ortali, Ioannis G. Tollis:
Algorithms and Bounds for Drawing Directed Graphs. CoRR abs/1808.10364 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-08 21:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
