| 2009 | ||
|---|---|---|
| 52 | Walter Didimo, Peter Eades, Giuseppe Liotta: Drawing Graphs with Right Angle Crossings. WADS 2009: 206-217 | |
| 2008 | ||
| 51 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Pietro Palladino: Visual Analysis of One-to-Many Matched Graphs. Graph Drawing 2008: 133-144 | |
| 50 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath: Constrained Point-Set Embeddability of Planar Graphs. Graph Drawing 2008: 360-371 | |
| 49 | Emilio Di Giacomo, Walter Didimo, Luca Grilli, Giuseppe Liotta, Pietro Palladino: WhatsOnWeb+ : An Enhanced Visual Search Clustering Engine. PacificVis 2008: 167-174 | |
| 48 | Carla Binucci, Walter Didimo, Francesco Giordano: Maximum upward planar subgraphs of embedded planar digraphs. Comput. Geom. 41(3): 230-246 (2008) | |
| 47 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta: Radial drawings of graphs: Geometric constraints and trade-offs. J. Discrete Algorithms 6(1): 109-124 (2008) | |
| 46 | 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) | |
| 45 | Walter Didimo, Francesco Giordano, Giuseppe Liotta: Overlapping Cluster Planarity. J. Graph Algorithms Appl. 12(3): 267-291 (2008) | |
| 2007 | ||
| 44 | Walter Didimo, Francesco Giordano, Giuseppe Liotta: Overlapping cluster planarity. APVIS 2007: 73-80 | |
| 43 | 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 | |
| 42 | 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 | |
| 41 | Emilio Di Giacomo, Walter Didimo, Marc J. van Kreveld, Giuseppe Liotta, Bettina Speckmann: Matched Drawings of Planar Graphs. Graph Drawing 2007: 183-194 | |
| 40 | Carla Binucci, Walter Didimo, Francesco Giordano: Maximum Upward Planar Subgraphs of Embedded Planar Digraphs. Graph Drawing 2007: 195-206 | |
| 39 | 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) | |
| 2006 | ||
| 38 | 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 | |
| 37 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta: Radial Drawings of Graphs: Geometric Constraints and Trade-Offs. Graph Drawing 2006: 355-366 | |
| 36 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath: Book Embeddability of Series-Parallel Digraphs. Algorithmica 45(4): 531-547 (2006) | |
| 35 | Walter Didimo: Upward Planar Drawings and Switch-regularity Heuristics. J. Graph Algorithms Appl. 10(2): 259-285 (2006) | |
| 34 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Matthew Suderman: k-Spine, 1-bend planarity. Theor. Comput. Sci. 359(1-3): 148-175 (2006) | |
| 2005 | ||
| 33 | Carla Binucci, Walter Didimo: Experiments on Area Compaction Algorithms for Orthogonal Drawings. CCCG 2005: 113-116 | |
| 32 | Walter Didimo, Francesco Giordano, Giuseppe Liotta: Upward Spirality and Upward Planarity Testing. Graph Drawing 2005: 117-128 | |
| 31 | Emilio Di Giacomo, Walter Didimo, Luca Grilli, Giuseppe Liotta: WhatsOnWeb: Using Graph Drawing to Search the Web. Graph Drawing 2005: 480-491 | |
| 30 | 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 | |
| 29 | Walter Didimo: Computing Upward Planar Drawings Using Switch-Regularity Heuristics. SOFSEM 2005: 117-126 | |
| 28 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath: Curve-constrained drawings of planar graphs. Comput. Geom. 30(1): 1-23 (2005) | |
| 27 | Carla Binucci, Walter Didimo, Giuseppe Liotta, Maddalena Nonato: Orthogonal drawings of graphs with vertex and edge labels. Comput. Geom. 32(2): 71-114 (2005) | |
| 2004 | ||
| 26 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer: Computing Radial Drawings on the Minimum Number of Circles. Graph Drawing 2004: 251-261 | |
| 25 | 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 | ||
| 24 | Emilio Di Giacomo, Walter Didimo: Straight-Line Drawings of 2-Outerplanar Graphs on Two Curves. Graph Drawing 2003: 419-424 | |
| 23 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath: Drawing Planar Graphs on a Curve. WG 2003: 192-204 | |
| 22 | Walter Didimo, Maurizio Pizzonia: Upward Embeddings and Orientations of Undirected Planar Graphs. J. Graph Algorithms Appl. 7(2): 221-241 (2003) | |
| 2002 | ||
| 21 | 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 | |
| 20 | Carla Binucci, Walter Didimo, Giuseppe Liotta, Maddalena Nonato: Computing Labeled Orthogonal Drawings. Graph Drawing 2002: 66-73 | |
| 19 | Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo: Quasi-Upward Planarity. Algorithmica 32(3): 474-506 (2002) | |
| 18 | Carla Binucci, Walter Didimo: A Software System for Computing Labeled Orthogonal Drawings of Graphs. Electr. Notes Theor. Comput. Sci. 72(2): (2002) | |
| 17 | Andrea Carmignani, Giuseppe Di Battista, Walter Didimo, Francesco Matera, Maurizio Pizzonia: Visualization of the High Level Structure of the Internet with HERMES. J. Graph Algorithms Appl. 6(3): 281-311 (2002) | |
| 16 | Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia: Drawing database schemas. Softw., Pract. Exper. 32(11): 1065-1098 (2002) | |
| 2001 | ||
| 15 | Carla Binucci, Walter Didimo, Giuseppe Liotta, Maddalena Nonato: Labeling Heuristics for Orthogonal Drawings. Graph Drawing 2001: 139-153 | |
| 14 | Gabriele Barbagallo, Andrea Carmignani, Giuseppe Di Battista, Walter Didimo, Maurizio Pizzonia: Exploration and Visualization of Computer Networks: Polyphemus and Hermes. Graph Drawing 2001: 444-445 | |
| 13 | Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia: Drawing Database Schemas with DBdraw. Graph Drawing 2001: 451-452 | |
| 12 | Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia: Industrial Plant Drawer. Graph Drawing 2001: 475-476 | |
| 11 | Giuseppe Di Battista, Walter Didimo, A. Marcandalli: Planarization of Clustered Graphs. Graph Drawing 2001: 60-74 | |
| 10 | Walter Didimo, Maurizio Pizzonia: Upward Embeddings and Orientations of Undirected Planar Graphs. WADS 2001: 339-351 | |
| 2000 | ||
| 9 | Andrea Carmignani, Giuseppe Di Battista, Walter Didimo, Francesco Matera, Maurizio Pizzonia: Visualization of the Autonomous Systems Interconnections with HERMES. Graph Drawing 2000: 150-163 | |
| 8 | Stina S. Bridgeman, Giuseppe Di Battista, Walter Didimo, Giuseppe Liotta, Roberto Tamassia, Luca Vismara: Turn-regularity and optimal area drawings of orthogonal representations. Comput. Geom. 16(1): 53-93 (2000) | |
| 7 | Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo: Computing Orthogonal Drawings with the Minimum Number of Bends. IEEE Trans. Computers 49(8): 826-840 (2000) | |
| 1999 | ||
| 6 | Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia: Orthogonal and Quasi-upward Drawings with Vertices of Prescribed Size. Graph Drawing 1999: 297-310 | |
| 5 | Stina S. Bridgeman, Giuseppe Di Battista, Walter Didimo, Giuseppe Liotta, Roberto Tamassia, Luca Vismara: Turn-Regularity and Planar Orthogonal Drawings. Graph Drawing 1999: 8-26 | |
| 1998 | ||
| 4 | Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo: Quasi-Upward Planarity. Graph Drawing 1998: 15-29 | |
| 3 | Walter Didimo, Giuseppe Liotta: Computing Orthogonal Drawings in a Variable Embedding Setting. ISAAC 1998: 79-88 | |
| 1997 | ||
| 2 | Walter Didimo, Antonio Leonforte: GRID: An Interactive Tool for Computing Orthogonal Drawings With the Minimum Number of Bends. Graph Drawing 1997: 309-315 | |
| 1 | Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo: Computing Orthogonal Drawings with the Minimum Number of Bends. WADS 1997: 331-344 | |