default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGiuseppe Liotta
- > Home > Persons > Giuseppe Liotta
Publications
- 2025
[j152]Emilio Di Giacomo
, Walter Didimo, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath:
Bounds on the edge-length ratio of 2-outerplanar graphs. Comput. Geom. 129: 102192 (2025)- 2024
- [j149]Steven Chaplick, Giordano Da Lozzo, Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees. Algorithmica 86(8): 2413-2447 (2024) - [j148]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) - [j147]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: 103466 (2024) - [j143]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini:
Comparative Study and Evaluation of Hybrid Visualizations of Graphs. IEEE Trans. Vis. Comput. Graph. 30(7): 3503-3515 (2024) - [c195]Carla Binucci, Giulio Biondi, Emilio Di Giacomo, Walter Didimo, Alice Fortuni, Giuseppe Liotta:
CHIP: a Recommender System and a Travel Planner for Cultural Tourism (short paper). IAI4CH@AI*IA 2024: 85-92 - [d1]Dimitar Garkov, Tommaso Piselli, Emilio Di Giacomo, Karsten Klein, Giuseppe Liotta, Fabrizio Montecchiani, Falk Schreiber:
Collaborative Problem Solving in Mixed Reality: A Study on Visual Graph Analysis - Replication data. DaRUS, 2024
- [i70]Dimitar Garkov, Tommaso Piselli, Emilio Di Giacomo, Karsten Klein, Giuseppe Liotta, Fabrizio Montecchiani, Falk Schreiber:
Collaborative Problem Solving in Mixed Reality: A Study on Visual Graph Analysis. CoRR abs/2412.14776 (2024) - 2023
- [j140]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): 875-902 (2023) - [c186]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: 90-99 - [c184]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 - [i69]Carla Binucci, Emilio Di Giacomo, Michael Kaufmann, Giuseppe Liotta, Alessandra Tappini:
k-planar Placement and Packing of Δ-regular Caterpillars. CoRR abs/2301.01226 (2023) - [i65]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) - [i60]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 abs/2311.14634 (2023) - 2022
- [j135]Michael A. Bekos, Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
Universal Slope Sets for Upward Planar Drawings. Algorithmica 84(9): 2556-2580 (2022) - [j133]Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
Orthogonal planarity testing of bounded treewidth graphs. J. Comput. Syst. Sci. 125: 129-148 (2022) - [c172]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: 304-318 - [i57]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 abs/2209.00453 (2022) - 2021
- [j129]Emilio Di Giacomo, Walter Didimo, Michael Kaufmann, Giuseppe Liotta:
Stable visualization of connected components in dynamic graphs. Inf. Vis. 20(1): 3-19 (2021) - [j128]Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen G. Kobourov, William J. Lenhart, Giuseppe Liotta, Henk Meijer, Alessandra Tappini, Stephen K. Wismath:
Packing Trees into 1-planar Graphs. J. Graph Algorithms Appl. 25(2): 605-624 (2021) - [j125]Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Timothy W. Randolph, Alessandra Tappini:
(k, p)-planarity: A relaxation of hybrid planarity. Theor. Comput. Sci. 896: 19-30 (2021) - [j124]Emilio Di Giacomo, Jaroslav Hancl Jr., Giuseppe Liotta:
2-colored point-set embeddings of partial 2-trees. Theor. Comput. Sci. 896: 31-45 (2021) - [c168]Carla Binucci, Emilio Di Giacomo, Giuseppe Liotta, Alessandra Tappini:
Quasi-upward Planar Drawings with Minimum Curve Complexity. GD 2021: 195-209 - [c165]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: 271-285 - [c164]Emilio Di Giacomo, Jaroslav Hancl, Giuseppe Liotta:
2-Colored Point-Set Embeddings of Partial 2-Trees. WALCOM 2021: 247-259 - [i53]Steven Chaplick, Giordano Da Lozzo, Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees. CoRR abs/2105.08124 (2021) - [i52]Carla Binucci, Emilio Di Giacomo, Giuseppe Liotta, Alessandra Tappini:
Quasi-upward Planar Drawings with Minimum Curve Complexity. CoRR abs/2108.10784 (2021) - 2020
- [j121]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: 101592 (2020) - [j120]Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
1-bend upward planar slope number of SP-digraphs. Comput. Geom. 90: 101628 (2020) - [j117]Emilio Di Giacomo, Peter Eades, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani:
Polyline drawings with topological constraints. Theor. Comput. Sci. 809: 250-264 (2020) - [j116]Emilio Di Giacomo, Leszek Gasieniec, Giuseppe Liotta, Alfredo Navarra:
On the curve complexity of 3-colored point-set embeddings. Theor. Comput. Sci. 846: 114-140 (2020) - [c163]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: 195-200 - [c160]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini:
Storyline Visualizations with Ubiquitous Actors. GD 2020: 324-332 - [c156]Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen G. Kobourov, William J. Lenhart, Giuseppe Liotta, Henk Meijer, Alessandra Tappini, Stephen K. Wismath:
Packing Trees into 1-Planar Graphs. WALCOM 2020: 81-93 - [i48]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini:
Storyline Visualizations with Ubiquitous Actors. CoRR abs/2008.04125 (2020) - 2019
- [j114]Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani, Ignaz Rutter, Alessandra Tappini:
NodeTrix Planarity Testing with Small Clusters. Algorithmica 81(9): 3464-3493 (2019) - [j112]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): 1038-1047 (2019) - [j109]Felice De Luca, Emilio Di Giacomo, Walter Didimo, Stephen G. Kobourov, Giuseppe Liotta:
An Experimental Study on the Ply Number of Straight-line Drawings. J. Graph Algorithms Appl. 23(1): 71-91 (2019) - [c154]Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
Sketched Representations and Orthogonal Planarity of Bounded Treewidth Graphs. GD 2019: 379-392 - [c153]Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Timothy W. Randolph, Alessandra Tappini:
(k, p)-Planarity: A Relaxation of Hybrid Planarity. WALCOM 2019: 148-159 - [i44]Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
Sketched Representations and Orthogonal Planarity of Bounded Treewidth Graphs. CoRR abs/1908.05015 (2019) - [i38]Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen G. Kobourov, William J. Lenhart, Giuseppe Liotta, Henk Meijer, Alessandra Tappini, Stephen K. Wismath:
Packing Trees into 1-planar Graphs. CoRR abs/1911.01761 (2019) - 2018
- [j104]Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath:
Ortho-polygon Visibility Representations of Embedded Graphs. Algorithmica 80(8): 2345-2383 (2018) - [j103]Alessio Arleo, Carla Binucci, Emilio Di Giacomo, William S. Evans, Luca Grilli, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Sue Whitesides, Stephen K. Wismath:
Visibility representations of boxes in 2.5 dimensions. Comput. Geom. 72: 19-33 (2018) - [j99]Carla Binucci, Emilio Di Giacomo, Md. Iqbal Hossain, Giuseppe Liotta:
1-page and 2-page drawings with bounded number of crossings per edge. Eur. J. Comb. 68: 24-37 (2018) - [j97]Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath:
New results on edge partitions of 1-plane graphs. Theor. Comput. Sci. 713: 78-84 (2018) - [j96]Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
Drawing subcubic planar graphs with four slopes and optimal angular resolution. Theor. Comput. Sci. 714: 51-73 (2018) - [c151]Michael A. Bekos, Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
Universal Slope Sets for Upward Planar Drawings. GD 2018: 77-91 - [c148]Emilio Di Giacomo, Peter Eades, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani:
Polyline Drawings with Topological Constraints. ISAAC 2018: 39:1-39:13 - [c147]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. WG 2018: 27-39 - [i37]Michael A. Bekos, Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
Universal Slope Sets for Upward Planar Drawings. CoRR abs/1803.09949 (2018) - [i34]Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Timothy W. Randolph, Alessandra Tappini:
(k, p)-Planarity: A Generalization of Hybrid Planarity. CoRR abs/1806.11413 (2018) - [i31]Emilio Di Giacomo, Peter Eades, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani:
Polyline Drawings with Topological Constraints. CoRR abs/1809.08111 (2018) - 2017
- [j95]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
Area-Thickness Trade-Offs for Straight-Line Drawings of Planar Graphs. Comput. J. 60(1): 135-142 (2017) - [j93]Carla Binucci, Felice De Luca, Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
Designing the Content Analyzer of a Travel Recommender System. Expert Syst. Appl. 87: 199-208 (2017) - [c143]Emilio Di Giacomo, Leszek Gasieniec, Giuseppe Liotta, Alfredo Navarra:
Colored Point-Set Embeddings of Acyclic Graphs. GD 2017: 413-425 - [c142]Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani, Alessandra Tappini:
NodeTrix Planarity Testing with Small Clusters. GD 2017: 479-491 - [c140]Felice De Luca, Emilio Di Giacomo, Walter Didimo, Stephen G. Kobourov, Giuseppe Liotta:
An Experimental Study on the Ply Number of Straight-Line Drawings. WALCOM 2017: 135-148 - [i28]Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath:
New Results on Edge Partitions of 1-plane Graphs. CoRR abs/1706.05161 (2017) - [i25]Emilio Di Giacomo, Leszek Gasieniec, Giuseppe Liotta, Alfredo Navarra:
Colored Point-set Embeddings of Acyclic Graphs. CoRR abs/1708.09167 (2017) - [i24]Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani, Alessandra Tappini:
NodeTrix Planarity Testing with Small Clusters. CoRR abs/1708.09281 (2017) - 2016
- [j86]Emilio Di Giacomo, Giuseppe Liotta, Tamara Mchedlidze:
Lower and upper bounds for long induced paths in 3-connected planar graphs. Theor. Comput. Sci. 636: 47-55 (2016) - [c135]Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
1-Bend Upward Planar Drawings of SP-Digraphs. GD 2016: 123-130 - [c134]Alessio Arleo, Carla Binucci, Emilio Di Giacomo, William S. Evans, Luca Grilli, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Sue Whitesides, Stephen K. Wismath:
Visibility Representations of Boxes in 2.5 Dimensions. GD 2016: 251-265 - [c132]Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath:
Ortho-Polygon Visibility Representations of Embedded Graphs. GD 2016: 280-294 - [i22]Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath:
Ortho-polygon Visibility Representations of Embedded Graphs. CoRR abs/1604.08797 (2016) - [i19]Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
1-bend Upward Planar Drawings of SP-digraphs. CoRR abs/1608.08425 (2016) - [i15]Alessio Arleo, Carla Binucci, Emilio Di Giacomo, William S. Evans, Luca Grilli, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Sue Whitesides, Stephen K. Wismath:
Visibility Representations of Boxes in 2.5 Dimensions. CoRR abs/1608.08899 (2016) - 2015
- [j84]Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer:
The Approximate Rectangle of Influence Drawability Problem. Algorithmica 72(2): 620-655 (2015) - [j82]Emilio Di Giacomo, Walter Didimo, Luca Grilli, Giuseppe Liotta, Salvatore Agostino Romeo:
Heuristics for the Maximum 2-Layer RAC Subgraph Problem. Comput. J. 58(5): 1085-1098 (2015) - [j81]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Planar and Quasi-Planar Simultaneous Geometric Embedding. Comput. J. 58(11): 3126-3140 (2015) - [j79]Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
Drawing Outer 1-planar Graphs with Few Slopes. J. Graph Algorithms Appl. 19(2): 707-741 (2015) - [c123]Carla Binucci, Felice De Luca, Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
VisFLOWer: Visual analysis of touristic flows. IISA 2015: 1-6 - [c122]Emilio Di Giacomo, Walter Didimo, Seok-Hee Hong, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Kazuo Misue, Antonios Symvonis, Hsu-Chun Yen:
Low ply graph drawing. IISA 2015: 1-6 - [c121]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
Network visualization retargeting. IISA 2015: 1-6 - [c120]Carla Binucci, Emilio Di Giacomo, Md. Iqbal Hossain, Giuseppe Liotta:
1-Page and 2-Page Drawings with Bounded Number of Crossings per Edge. IWOCA 2015: 38-51 - 2014
- [j78]Emilio Di Giacomo, Walter Didimo, Peter Eades, Giuseppe Liotta:
2-Layer Right Angle Crossing Drawings. Algorithmica 68(4): 954-997 (2014) - [j75]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Ioannis G. Tollis:
Techniques for Edge Stratification of Complex Graph Drawings. J. Vis. Lang. Comput. 25(4): 533-543 (2014) - [c117]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Planar and Quasi Planar Simultaneous Geometric Embedding. GD 2014: 52-63 - [c116]Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
Drawing Outer 1-planar Graphs with Few Slopes. GD 2014: 174-185 - [c111]Emilio Di Giacomo, Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Fabrizio Montecchiani:
Upward-rightward planar drawings. IISA 2014: 145-150 - [c110]Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
The Planar Slope Number of Subcubic Graphs. LATIN 2014: 132-143 - 2013
- [j72]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
Area requirement of graph drawings with few crossings per edge. Comput. Geom. 46(8): 909-916 (2013) - [c108]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Ioannis G. Tollis:
Exploring Complex Drawings via Edge Stratification. GD 2013: 304-315 - [c104]Emilio Di Giacomo, Giuseppe Liotta, Tamara Mchedlidze:
Lower and Upper Bounds for Long Induced Paths in 3-Connected Planar Graphs. WG 2013: 213-224 - [r2]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta:
Spine and Radial Drawings. Handbook of Graph Drawing and Visualization 2013: 247-284 - 2012
- [j68]Emilio Di Giacomo, Walter Didimo, Peter Eades, Seok-Hee Hong, Giuseppe Liotta:
Bounds on the crossing resolution of complete geometric graphs. Discret. Appl. Math. 160(1-2): 132-139 (2012) - [j64]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer:
Drawing a tree as a minimum spanning tree approximation. J. Comput. Syst. Sci. 78(2): 491-503 (2012) - [j63]Emilio Di Giacomo, Luca Grilli, Marcus Krug, Giuseppe Liotta, Ignaz Rutter:
Hamiltonian orthogeodesic alternating paths. J. Discrete Algorithms 16: 34-52 (2012) - [c102]Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer:
The Approximate Rectangle of Influence Drawability Problem. GD 2012: 114-125 - [c96]Emilio Di Giacomo, Walter Didimo, Luca Grilli, Giuseppe Liotta, Salvatore Agostino Romeo:
Heuristics for the Maximum 2-layer RAC Subgraph Problem. WALCOM 2012: 211-216 - [c95]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area. WG 2012: 91-102 - [i4]Emilio Di Giacomo, Giuseppe Liotta, Tamara Mchedlidze:
How many vertex locations can be arbitrarily chosen when drawing planar graphs? CoRR abs/1212.0804 (2012) - 2011
- [j59]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer:
Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings. Theory Comput. Syst. 49(3): 565-575 (2011) - [j58]Emilio Di Giacomo, Francesco Giordano, Giuseppe Liotta:
Upward Topological Book Embeddings of DAGs. SIAM J. Discret. Math. 25(2): 479-489 (2011) - [c90]Emilio Di Giacomo, Walter Didimo, Peter Eades, Giuseppe Liotta:
2-Layer Right Angle Crossing Drawings. IWOCA 2011: 156-169 - [c89]Emilio Di Giacomo, Luca Grilli, Marcus Krug, Giuseppe Liotta, Ignaz Rutter:
Hamiltonian Orthogeodesic Alternating Paths. IWOCA 2011: 170-181 - 2010
- [j55]Emilio Di Giacomo, Giuseppe Liotta, Francesco Trotta:
Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge. Algorithmica 57(4): 796-818 (2010) - [j54]Carla Binucci, Emilio Di Giacomo, Walter Didimo, Alejandro Estrella-Balderrama, Fabrizio Frati, Stephen G. Kobourov, Giuseppe Liotta:
Upward straight-line embeddings of directed graphs into point sets. Comput. Geom. 43(2): 219-232 (2010) - [j51]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Constrained Point-Set Embeddability of Planar Graphs. Int. J. Comput. Geom. Appl. 20(5): 577-600 (2010) - [j49]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Pietro Palladino:
Visual Analysis of One-To-Many Matched Graphs. J. Graph Algorithms Appl. 14(1): 97-119 (2010) - [c85]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Pietro Palladino:
Visual analysis of financial crimes: [system paper]. AVI 2010: 393-394 - [c84]Emilio Di Giacomo, Giuseppe Liotta, Stefano Federici:
Information Visualization Techniques for Motion Impaired People. HEALTHINF 2010: 361-366 - [c79]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer:
Drawing a Tree as a Minimum Spanning Tree Approximation. ISAAC (2) 2010: 61-72 - [c78]Emilio Di Giacomo, Giuseppe Liotta:
The Hamiltonian Augmentation Problem and Its Applications to Graph Drawing. WALCOM 2010: 35-46 - 2009
- [j48]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Point-set embeddings of trees with given partial drawings. Comput. Geom. 42(6-7): 664-676 (2009) - [j47]Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Volume requirements of 3D upward drawings. Discret. Math. 309(7): 1824-1837 (2009) - [j46]Emilio Di Giacomo, Walter Didimo, Marc J. van Kreveld, Giuseppe Liotta, Bettina Speckmann:
Matched Drawings of Planar Graphs. J. Graph Algorithms Appl. 13(3): 423-445 (2009) - [c77]Carla Binucci, Emilio Di Giacomo, Walter Didimo, Alejandro Estrella-Balderrama, Fabrizio Frati, Stephen G. Kobourov, Giuseppe Liotta:
On Directed Graphs with an Upward Straight-line. CCCG 2009: 21-24 - [c76]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer:
Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings. GD 2009: 15-20 - 2008
- [j43]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta:
Radial drawings of graphs: Geometric constraints and trade-offs. J. Discrete Algorithms 6(1): 109-124 (2008) - [j42]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Francesco Trotta, Stephen K. Wismath:
k-colored Point-set Embeddability of Outerplanar Graphs. J. Graph Algorithms Appl. 12(1): 29-49 (2008) - [j41]Emilio Di Giacomo, Luca Grilli, Giuseppe Liotta:
Drawing Bipartite Graphs on Two Parallel Convex Curves. J. Graph Algorithms Appl. 12(1): 97-112 (2008) - [j39]Melanie Badent, Emilio Di Giacomo, Giuseppe Liotta:
Drawing colored graphs on colored points. Theor. Comput. Sci. 408(2-3): 129-142 (2008) - [c72]Emilio Di Giacomo, Walter Didimo, Luca Grilli, Giuseppe Liotta, Pietro Palladino:
WhatsOnWeb+ : An Enhanced Visual Search Clustering Engine. PacificVis 2008: 167-174 - [c70]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Pietro Palladino:
Visual Analysis of One-to-Many Matched Graphs. GD 2008: 133-144 - [c68]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Constrained Point-Set Embeddability of Planar Graphs. GD 2008: 360-371 - 2007
- [j37]Emilio Di Giacomo, Giuseppe Liotta:
Simultaneous Embedding of Outerplanar Graphs, Paths, and Cycles. Int. J. Comput. Geom. Appl. 17(2): 139-160 (2007) - [j36]Emilio Di Giacomo, Walter Didimo, Luca Grilli, Giuseppe Liotta:
Graph Visualization Techniques for Web Clustering Engines. IEEE Trans. Vis. Comput. Graph. 13(2): 294-304 (2007) - [c64]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Point-Set Embedding of Trees with Edge Constraints. GD 2007: 113-124 - [c63]Emilio Di Giacomo, Walter Didimo, Marc J. van Kreveld, Giuseppe Liotta, Bettina Speckmann:
Matched Drawings of Planar Graphs. GD 2007: 183-194 - [c62]Emilio Di Giacomo, Giuseppe Liotta, Francesco Trotta:
Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge. GD 2007: 315-326 - [c59]Melanie Badent, Emilio Di Giacomo, Giuseppe Liotta:
Drawing Colored Graphs on Colored Points. WADS 2007: 102-113 - 2006
- [j34]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath:
Book Embeddability of Series-Parallel Digraphs. Algorithmica 45(4): 531-547 (2006) - [j33]Emilio Di Giacomo, Giuseppe Liotta, Francesco Trotta:
On Embedding a Graph on Two Sets of Points. Int. J. Found. Comput. Sci. 17(5): 1071-1094 (2006) - [j31]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Matthew Suderman:
k-Spine, 1-bend planarity. Theor. Comput. Sci. 359(1-3): 148-175 (2006) - [c57]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Francesco Trotta, Stephen K. Wismath:
k -Colored Point-Set Embeddability of Outerplanar Graphs. GD 2006: 318-329 - [c56]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta:
Radial Drawings of Graphs: Geometric Constraints and Trade-Offs. GD 2006: 355-366 - [c55]Emilio Di Giacomo, Luca Grilli, Giuseppe Liotta:
Drawing Bipartite Graphs on Two Curves. GD 2006: 380-385 - 2005
- [j30]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath:
Curve-constrained drawings of planar graphs. Comput. Geom. 30(1): 1-23 (2005) - [j29]Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer:
Computing straight-line 3D grid drawings of graphs in linear volume. Comput. Geom. 32(1): 26-58 (2005) - [j26]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer:
Computing Radial Drawings on the Minimum Number of Circles. J. Graph Algorithms Appl. 9(3): 365-389 (2005) - [c54]Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Volume Requirements of 3D Upward Drawings. GD 2005: 101-110 - [c53]Emilio Di Giacomo, Giuseppe Liotta, Francesco Trotta:
How to Embed a Path onto Two Sets of Points. GD 2005: 111-116 - [c51]Emilio Di Giacomo, Walter Didimo, Luca Grilli, Giuseppe Liotta:
WhatsOnWeb: Using Graph Drawing to Search the Web. GD 2005: 480-491 - [c50]Emilio Di Giacomo, Walter Didimo, Luca Grilli, Giuseppe Liotta:
A Topology-Driven Approach to the Design of Web Meta-search Clustering Engines. SOFSEM 2005: 106-116 - [i1]Emilio Di Giacomo, Giuseppe Liotta:
A note on simultaneous embedding of planar graphs. EuroCG 2005: 207-210 - 2004
- [j25]Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani:
A note on 3D orthogonal drawings with direction constrained edges. Inf. Process. Lett. 90(2): 97-101 (2004) - [c49]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer:
Computing Radial Drawings on the Minimum Number of Circles. GD 2004: 251-261 - [c48]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Matthew Suderman:
Hamiltonian-with-Handles Graphs and the k-Spine Drawability Problem. GD 2004: 262-272 - 2003
- [c46]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath:
Drawing Planar Graphs on a Curve. WG 2003: 192-204 - 2002
- [c45]Emilio Di Giacomo, Giuseppe Liotta, Stephen K. Wismath:
Drawing series-parallel graphs on a box. CCCG 2002: 149-153 - [c43]Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani:
Orthogonal 3D Shapes of Theta Graphs. GD 2002: 142-149 - [c42]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath:
Book Embeddings and Point-Set Embeddings of Series-Parallel Digraphs. GD 2002: 162-173 - 2001
- [c37]Emilio Di Giacomo, Giuseppe Liotta:
WAVE. GD 2001: 440-441
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 2025-08-13 21:17 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:
