Giuseppe Liotta

ORCID

Publication Activity (10 Years)

Years Active: 1991-2024
Publications (10 Years): 199

Top Venues

Publications

Carla Binucci, Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Antonios Symvonis
On the complexity of the storyplan problem. J. Comput. Syst. Sci. 139 (2024)
Jirí Fiala, Oksana Firman, Giuseppe Liotta, Alexander Wolff, Johannes Zink
Outerplanar and Forest Storyplans. SOFSEM (2024)
Bart M. P. Jansen, Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov
Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth. GD (2) (2023)
Carla Binucci, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli
On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges. MFCS (2023)
Jirí Fiala, Oksana Firman, Giuseppe Liotta, Alexander Wolff, Johannes Zink
Outerplanar and Forest Storyplans. CoRR (2023)
Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini
Parameterized complexity of graph planarity with restricted cyclic orders. J. Comput. Syst. Sci. 135 (2023)
William J. Lenhart, Giuseppe Liotta, Debajyoti Mondal, Rahnuma Islam Nishat
Drawing Partial 2-Trees with Few Slopes. Algorithmica 85 (5) (2023)
Carla Binucci, Emilio Di Giacomo, Michael Kaufmann, Giuseppe Liotta, Alessandra Tappini
k-planar Placement and Packing of Δ-regular Caterpillars. CoRR (2023)
Bart M. P. Jansen, Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov
Upward and Orthogonal Planarity are W[1]-hard Parameterized by Treewidth. CoRR (2023)
Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov
The st-Planar Edge Completion Problem is Fixed-Parameter Tractable. CoRR (2023)
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath
New Bounds on the Local and Global Edge-length Ratio of Planar Graphs. CoRR (2023)
Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali, Maurizio Patrignani
Rectilinear-Upward Planarity Testing of Digraphs. ISAAC (2023)
Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov
The st-Planar Edge Completion Problem Is Fixed-Parameter Tractable. ISAAC (2023)
Philipp Kindermann, Jan Kratochvíl, Giuseppe Liotta, Pavel Valtr
Three Edge-disjoint Plane Spanning Paths in a Point Set. CoRR (2023)
Walter Didimo, Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali
On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity. CoRR (2023)
Emilio Di Giacomo, Beniamino Di Martino, Walter Didimo, Antonio Esposito, Giuseppe Liotta, Fabrizio Montecchiani
Design of a Process and a Container-Based Cloud Architecture for the Automatic Generation of Storyline Visualizations. AINA (3) (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, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Alexander Wolff, Meirav Zehavi
Parameterized Approaches to Orthogonal Compaction. SOFSEM (2023)
Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali
Rectilinear Planarity of Partial 2-Trees. J. Graph Algorithms Appl. 27 (8) (2023)
Carolina Haase, Philipp Kindermann, William J. Lenhart, Giuseppe Liotta
Mutual Witness Proximity Drawings of Isomorphic Trees. GD (1) (2023)
Carla Binucci, Aaron Büngener, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini
Min-k-planar Drawings of Graphs. CoRR (2023)
Carla Binucci, Emilio Di Giacomo, Michael Kaufmann, Giuseppe Liotta, Alessandra Tappini
k-Planar Placement and Packing of Δ-Regular Caterpillars. Int. J. Found. Comput. Sci. 34 (7) (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 Di Battista, Walter Didimo, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini
Nonplanar Graph Drawings with k Vertices per Face. WG (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)
Philipp Kindermann, Jan Kratochvíl, Giuseppe Liotta, Pavel Valtr
Three Edge-Disjoint Plane Spanning Paths in a Point Set. GD (1) (2023)
Carla Binucci, Aaron Büngener, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini
Min-k-planar Drawings of Graphs. GD (1) (2023)
Carolina Haase, Philipp Kindermann, William J. Lenhart, Giuseppe Liotta
Mutual Witness Proximity Drawings of Isomorphic Trees. 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)
William J. Lenhart, Giuseppe Liotta
Mutual witness Gabriel drawings of complete bipartite graphs. Theor. Comput. Sci. 974 (2023)
Carla Binucci, Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Fabrizio Montecchiani
Placing Arrows in Directed Graph Layouts: Algorithms and Experiments. Comput. Graph. Forum 41 (1) (2022)
Luca Consalvi, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
In-browser Visualization of Large-scale Graphs. itaDATA (2022)
William J. Lenhart, Giuseppe Liotta
Mutual Witness Gabriel Drawings of Complete Bipartite Graphs. CoRR (2022)
Carla Binucci, Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Antonios Symvonis
On the Complexity of the Storyplan Problem. GD (2022)
Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali
Rectilinear Planarity of Partial 2-Trees. CoRR (2022)
Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini
Parameterized Complexity of Graph Planarity with Restricted Cyclic Orders. WG (2022)
Luca Consalvi, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
BrowVis: Visualizing Large Graphs in the Browser. IEEE Access 10 (2022)
William J. Lenhart, Giuseppe Liotta
Mutual Witness Gabriel Drawings of Complete Bipartite Graphs. GD (2022)
Walter Didimo, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Alexander Wolff, Meirav Zehavi
Parameterized Approaches to Orthogonal Compaction. CoRR (2022)
Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani
Orthogonal planarity testing of bounded treewidth graphs. J. Comput. Syst. Sci. 125 (2022)
Alessio Arleo, Walter Didimo, Giuseppe Liotta, Silvia Miksch, Fabrizio Montecchiani
Influence Maximization With Visual Analytics. IEEE Trans. Vis. Comput. Graph. 28 (10) (2022)
Carla Binucci, Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Antonios Symvonis
On the Complexity of the Storyplan Problem. CoRR (2022)
Michael A. Bekos, Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
Universal Slope Sets for Upward Planar Drawings. Algorithmica 84 (9) (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 Liotta
Editor in Chief's Foreword. J. Graph Algorithms Appl. 26 (3) (2022)
Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali
Rectilinear Planarity of Partial 2-Trees. GD (2022)
Emilio Di Giacomo, Jaroslav Hancl, Giuseppe Liotta
2-Colored Point-Set Embeddings of Partial 2-Trees. WALCOM (2021)
Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini
Simultaneous FPQ-ordering and hybrid planarity testing. Theor. Comput. Sci. 874 (2021)
Therese C. Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani
Optimal-area visibility representations of outer-1-plane graphs. CoRR (2021)
Steven Chaplick, Giordano Da Lozzo, Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani
Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees. CoRR (2021)
Therese C. Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani
Generalized LR-drawings of trees. CoRR (2021)
Steven Chaplick, Giordano Da Lozzo, Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani
Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees. WADS (2021)
Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Timothy W. Randolph, Alessandra Tappini
)-planarity: A relaxation of hybrid planarity. Theor. Comput. Sci. 896 (2021)
Carla Binucci, Emilio Di Giacomo, Giuseppe Liotta, Alessandra Tappini
Quasi-upward Planar Drawings with Minimum Curve Complexity. Graph Drawing (2021)
Václav Blazj, Jirí Fiala, Giuseppe Liotta
On Edge-Length Ratios of Partial 2-Trees. Int. J. Comput. Geom. Appl. 31 (2-3) (2021)
Emilio Di Giacomo, Walter Didimo, Michael Kaufmann, Giuseppe Liotta
Stable visualization of connected components in dynamic graphs. Inf. Vis. 20 (1) (2021)
Therese C. Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani
Generalized LR-Drawings of Trees. CCCG (2021)
Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini
Ortho-polygon visibility representations of 3-connected 1-plane graphs. Theor. Comput. Sci. 863 (2021)
Lorenzo Ariemma, Giuseppe Liotta, Massimo Candela, Giuseppe Di Battista
Long-Lasting Sequences of BGP Updates. PAM (2021)
Emilio Di Giacomo, Jaroslav Hancl Jr., Giuseppe Liotta
2-colored point-set embeddings of partial 2-trees. Theor. Comput. Sci. 896 (2021)
Therese C. Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani
Optimal-Area Visibility Representations of Outer-1-Plane Graphs. Graph Drawing (2021)
Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali
Spirality and Rectilinear Planarity Testing of Independent-Parallel SP-Graphs. CoRR (2021)
Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen G. Kobourov, William Lenhart, Giuseppe Liotta, Henk Meijer, Alessandra Tappini, Stephen K. Wismath
Packing Trees into 1-planar Graphs. J. Graph Algorithms Appl. 25 (2) (2021)
Carla Binucci, Emilio Di Giacomo, Giuseppe Liotta, Alessandra Tappini
Quasi-upward Planar Drawings with Minimum Curve Complexity. CoRR (2021)
Carla Binucci, Emilio Di Giacomo, Seok-Hee Hong, Giuseppe Liotta, Henk Meijer, Vera Sacristán, Stephen K. Wismath
Colored anchored visibility representations in 2D and 3D space. Comput. Geom. 89 (2020)
Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg, Giordano Da Lozzo, Giuseppe Di Battista, Walter Didimo, Michael Hoffmann, Giuseppe Liotta, Fabrizio Montecchiani, Ignaz Rutter, Csaba D. Tóth
 + 1)-quasiplanar. J. Comb. Theory, Ser. B 142 (2020)
Walter Didimo, Giuseppe Liotta, Giacomo Ortali, Maurizio Patrignani
Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time. SODA (2020)
Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani
1-bend upward planar slope number of SP-digraphs. Comput. Geom. 90 (2020)
Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali
Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time. CoRR (2020)
Alessio Arleo, Walter Didimo, Giuseppe Liotta, Silvia Miksch, Fabrizio Montecchiani
VAIM: Visual Analytics for Influence Maximization. CoRR (2020)
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini
Storyline Visualizations with Ubiquitous Actors. CoRR (2020)
Walter Didimo, Luca Grilli, Giuseppe Liotta, Lorenzo Menconi, Fabrizio Montecchiani, Daniele Pagliuca
Combining Network Visualization and Data Mining for Tax Risk Assessment. IEEE Access 8 (2020)
Steven Chaplick, Takayuki Itoh, Giuseppe Liotta, Kwan-Liu Ma, Ignaz Rutter
Trends and Perspectives for Graph Drawing and Network Visualization (NII Shonan Meeting 171). NII Shonan Meet. Rep. 2020 (2020)
Sylvain Lazard, William J. Lenhart, Giuseppe Liotta
Corrigendum to "On the edge-length ratio of outerplanar graphs" [Theoret. Comput. Sci. 770 (2019) 88-94]. Theor. Comput. Sci. 806 (2020)
Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen G. Kobourov, William Lenhart, Giuseppe Liotta, Henk Meijer, Alessandra Tappini, Stephen K. Wismath
Packing Trees into 1-Planar Graphs. WALCOM (2020)
Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini
Simultaneous FPQ-Ordering and Hybrid Planarity Testing. SOFSEM (2020)
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini
Storyline Visualizations with Ubiquitous Actors. Graph Drawing (2020)
Alessio Arleo, Walter Didimo, Giuseppe Liotta, Silvia Miksch, Fabrizio Montecchiani
VAIM: Visual Analytics for Influence Maximization. Graph Drawing (2020)
Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali
Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time. Graph Drawing (2020)
Václav Blazej, Jirí Fiala, Giuseppe Liotta
On the Edge-Length Ratio of 2-Trees. Graph Drawing (2020)
Emilio Di Giacomo, Peter Eades, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani
Polyline drawings with topological constraints. Theor. Comput. Sci. 809 (2020)
Emilio Di Giacomo, Walter Didimo, Luca Grilli, Giuseppe Liotta, Fabrizio Montecchiani
Visual Analytics for Financial Crime Detection at the University of Perugia. AVI-BDA/ITAVIS@AVI (2020)
Patrizio Angelini, Peter Eades, Seok-Hee Hong, Karsten Klein, Stephen G. Kobourov, Giuseppe Liotta, Alfredo Navarra, Alessandra Tappini
Graph Planarity by Replacing Cliques with Paths. Algorithms 13 (8) (2020)
Emilio Di Giacomo, Leszek Gasieniec, Giuseppe Liotta, Alfredo Navarra
On the curve complexity of 3-colored point-set embeddings. Theor. Comput. Sci. 846 (2020)
Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani
Sketched Representations and Orthogonal Planarity of Bounded Treewidth Graphs. CoRR (2019)
Václav Blazej, Jirí Fiala, Giuseppe Liotta, Simon Lomic
On the edge-length ratio of 2-trees. CoRR (2019)
Walter Didimo, Giuseppe Liotta, Maurizio Patrignani
HV-planarity: Algorithms and complexity. J. Comput. Syst. Sci. 99 (2019)
Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen G. Kobourov, William Lenhart, Giuseppe Liotta, Henk Meijer, Alessandra Tappini, Stephen K. Wismath
Packing Trees into 1-planar Graphs. CoRR (2019)
Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani, Ignaz Rutter, Alessandra Tappini
NodeTrix Planarity Testing with Small Clusters. Algorithmica 81 (9) (2019)
Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini
Graph Planarity Testing with Hierarchical Embedding Constraints. CoRR (2019)
Alessio Arleo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
A Distributed Multilevel Force-Directed Algorithm. IEEE Trans. Parallel Distributed Syst. 30 (4) (2019)
Walter Didimo, Luca Grilli, Giuseppe Liotta, Fabrizio Montecchiani, Daniele Pagliuca
Visual querying and analysis of temporal fiscal networks. Inf. Sci. 505 (2019)
Patrizio Angelini, Henry Förster, Michael Hoffmann, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Maurizio Patrignani
The QuaSEFE Problem. Graph Drawing (2019)
Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani
Sketched Representations and Orthogonal Planarity of Bounded Treewidth Graphs. Graph Drawing (2019)
Sylvain Lazard, William J. Lenhart, Giuseppe Liotta
On the edge-length ratio of outerplanar graphs. Theor. Comput. Sci. 770 (2019)
Patrizio Angelini, Henry Förster, Michael Hoffmann, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Maurizio Patrignani
The QuaSEFE Problem. CoRR (2019)
Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
A Survey on Graph Drawing Beyond Planarity. ACM Comput. Surv. 52 (1) (2019)
Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Timothy W. Randolph, Alessandra Tappini
(k, p)-Planarity: A Relaxation of Hybrid Planarity. WALCOM (2019)
Michael A. Bekos, Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou
Edge partitions of optimal 2-plane and 3-plane graphs. Discret. Math. 342 (4) (2019)
Patrizio Angelini, Michael A. Bekos, Giuseppe Liotta, Fabrizio Montecchiani
Universal Slope Sets for 1-Bend Planar Drawings. Algorithmica 81 (6) (2019)

Giuseppe Liotta.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Giuseppe Liotta