| 2012 | ||
|---|---|---|
| j26 | Emilio Di Giacomo, Walter Didimo, Peter Eades, Seok-Hee Hong, Giuseppe Liotta: Bounds on the crossing resolution of complete geometric graphs. Discrete Applied Mathematics 160(1-2): 132-139 (2012) | |
| j25 | 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) | |
| j24 | Emilio Di Giacomo, Luca Grilli, Marcus Krug, Giuseppe Liotta, Ignaz Rutter: Hamiltonian orthogeodesic alternating paths. J. Discrete Algorithms 16: 34-52 (2012) | |
| c38 | Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer: The Approximate Rectangle of Influence Drawability Problem. Graph Drawing 2012: 114-125 | |
| c37 | 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 | |
| c36 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani: h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area. WG 2012: 91-102 | |
| i2 | 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 | ||
| j23 | Carla Binucci, Emilio Di Giacomo, Walter Didimo, Aimal Rextin: Switch-Regular Upward Planarity Testing of Directed Trees. J. Graph Algorithms Appl. 15(5): 587-629 (2011) | |
| j22 | 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) | |
| j21 | Emilio Di Giacomo, Francesco Giordano, Giuseppe Liotta: Upward Topological Book Embeddings of DAGs. SIAM J. Discrete Math. 25(2): 479-489 (2011) | |
| c35 | Emilio Di Giacomo, Fabrizio Frati, Radoslav Fulek, Luca Grilli, Marcus Krug: Orthogeodesic Point-Set Embedding of Trees. Graph Drawing 2011: 52-63 | |
| c34 | Emilio Di Giacomo, Walter Didimo, Peter Eades, Giuseppe Liotta: 2-Layer Right Angle Crossing Drawings. IWOCA 2011: 156-169 | |
| c33 | Emilio Di Giacomo, Luca Grilli, Marcus Krug, Giuseppe Liotta, Ignaz Rutter: Hamiltonian Orthogeodesic Alternating Paths. IWOCA 2011: 170-181 | |
| 2010 | ||
| j20 | 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) | |
| j19 | 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) | |
| j18 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath: Constrained Point-Set Embeddability of Planar Graphs. Int. J. Comput. Geometry Appl. 20(5): 577-600 (2010) | |
| j17 | 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) | |
| c32 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Pietro Palladino: Visual analysis of financial crimes: [system paper]. AVI 2010: 393-394 | |
| c31 | Emilio Di Giacomo, Giuseppe Liotta, Stefano Federici: Information Visualization Techniques for Motion Impaired People. HEALTHINF 2010: 361-366 | |
| c30 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer: Drawing a Tree as a Minimum Spanning Tree Approximation. ISAAC (2) 2010: 61-72 | |
| c29 | Emilio Di Giacomo, Giuseppe Liotta: The Hamiltonian Augmentation Problem and Its Applications to Graph Drawing. WALCOM 2010: 35-46 | |
| c28 | Carla Binucci, Emilio Di Giacomo, Walter Didimo, Aimal Rextin: Switch-Regular Upward Planar Embeddings of Trees. WALCOM 2010: 58-69 | |
| 2009 | ||
| j16 | 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) | |
| j15 | Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath: Volume requirements of 3D upward drawings. Discrete Mathematics 309(7): 1824-1837 (2009) | |
| j14 | 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) | |
| c27 | 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 | |
| c26 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer: Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings. Graph Drawing 2009: 15-20 | |
| 2008 | ||
| j13 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta: Radial drawings of graphs: Geometric constraints and trade-offs. J. Discrete Algorithms 6(1): 109-124 (2008) | |
| j12 | 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) | |
| j11 | Emilio Di Giacomo, Luca Grilli, Giuseppe Liotta: Drawing Bipartite Graphs on Two Parallel Convex Curves. J. Graph Algorithms Appl. 12(1): 97-112 (2008) | |
| j10 | Melanie Badent, Emilio Di Giacomo, Giuseppe Liotta: Drawing colored graphs on colored points. Theor. Comput. Sci. 408(2-3): 129-142 (2008) | |
| c25 | Emilio Di Giacomo, Walter Didimo, Luca Grilli, Giuseppe Liotta, Pietro Palladino: WhatsOnWeb+ : An Enhanced Visual Search Clustering Engine. PacificVis 2008: 167-174 | |
| c24 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Pietro Palladino: Visual Analysis of One-to-Many Matched Graphs. Graph Drawing 2008: 133-144 | |
| c23 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath: Constrained Point-Set Embeddability of Planar Graphs. Graph Drawing 2008: 360-371 | |
| 2007 | ||
| j9 | Emilio Di Giacomo, Giuseppe Liotta: Simultaneous Embedding of Outerplanar Graphs, Paths, and Cycles. Int. J. Comput. Geometry Appl. 17(2): 139-160 (2007) | |
| j8 | 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) | |
| c22 | Melanie Badent, Carla Binucci, Emilio Di Giacomo, Walter Didimo, Stefan Felsner, Francesco Giordano, Jan Kratochvíl, Pietro Palladino, Maurizio Patrignani, Francesco Trotta: Homothetic Triangle Contact Representations of Planar Graphs. CCCG 2007: 233-236 | |
| c21 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath: Point-Set Embedding of Trees with Edge Constraints. Graph Drawing 2007: 113-124 | |
| c20 | Emilio Di Giacomo, Walter Didimo, Marc J. van Kreveld, Giuseppe Liotta, Bettina Speckmann: Matched Drawings of Planar Graphs. Graph Drawing 2007: 183-194 | |
| c19 | Emilio Di Giacomo, Giuseppe Liotta, Francesco Trotta: Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge. Graph Drawing 2007: 315-326 | |
| c18 | Melanie Badent, Emilio Di Giacomo, Giuseppe Liotta: Drawing Colored Graphs on Colored Points. WADS 2007: 102-113 | |
| 2006 | ||
| j7 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath: Book Embeddability of Series-Parallel Digraphs. Algorithmica 45(4): 531-547 (2006) | |
| j6 | 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) | |
| j5 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Matthew Suderman: k-Spine, 1-bend planarity. Theor. Comput. Sci. 359(1-3): 148-175 (2006) | |
| c17 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Francesco Trotta, Stephen K. Wismath: k -Colored Point-Set Embeddability of Outerplanar Graphs. Graph Drawing 2006: 318-329 | |
| c16 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta: Radial Drawings of Graphs: Geometric Constraints and Trade-Offs. Graph Drawing 2006: 355-366 | |
| c15 | Emilio Di Giacomo, Luca Grilli, Giuseppe Liotta: Drawing Bipartite Graphs on Two Curves. Graph Drawing 2006: 380-385 | |
| 2005 | ||
| j4 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath: Curve-constrained drawings of planar graphs. Comput. Geom. 30(1): 1-23 (2005) | |
| j3 | 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) | |
| j2 | 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) | |
| c14 | Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath: Volume Requirements of 3D Upward Drawings. Graph Drawing 2005: 101-110 | |
| c13 | Emilio Di Giacomo, Giuseppe Liotta, Francesco Trotta: How to Embed a Path onto Two Sets of Points. Graph Drawing 2005: 111-116 | |
| c12 | Emilio Di Giacomo, Walter Didimo, Luca Grilli, Giuseppe Liotta: WhatsOnWeb: Using Graph Drawing to Search the Web. Graph Drawing 2005: 480-491 | |
| c11 | 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 | ||
| j1 | 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) | |
| c10 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer: Computing Radial Drawings on the Minimum Number of Circles. Graph Drawing 2004: 251-261 | |
| c9 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Matthew Suderman: Hamiltonian-with-Handles Graphs and the k-Spine Drawability Problem. Graph Drawing 2004: 262-272 | |
| 2003 | ||
| c8 | Emilio Di Giacomo, Henk Meijer: Track Drawings of Graphs with Constant Queue Number. Graph Drawing 2003: 214-225 | |
| c7 | Emilio Di Giacomo: Drawing Series-Parallel Graphs on Restricted Integer 3D Grids. Graph Drawing 2003: 238-246 | |
| c6 | Emilio Di Giacomo, Walter Didimo: Straight-Line Drawings of 2-Outerplanar Graphs on Two Curves. Graph Drawing 2003: 419-424 | |
| c5 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath: Drawing Planar Graphs on a Curve. WG 2003: 192-204 | |
| 2002 | ||
| c4 | Emilio Di Giacomo, Giuseppe Liotta, Stephen K. Wismath: Drawing series-parallel graphs on a box. CCCG 2002: 149-153 | |
| c3 | Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani: Orthogonal 3D Shapes of Theta Graphs. Graph Drawing 2002: 142-149 | |
| c2 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath: Book Embeddings and Point-Set Embeddings of Series-Parallel Digraphs. Graph Drawing 2002: 162-173 | |
| 2001 | ||
| c1 | ||
Data released under the ODC-BY 1.0 license — See also our legal information page