- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j36 |      | Walter Didimo: Density of straight-line 1-planar graph drawings. Inf. Process. Lett. 113(7): 236-240 (2013) |
| e1 | | Walter Didimo, Maurizio Patrignani (Eds.): Graph Drawing - 20th International Symposium, GD 2012, Redmond, WA, USA, September 19-21, 2012, Revised Selected Papers. Lecture Notes in Computer Science 7704, Springer 2013, isbn 978-3-642-36762-5 |
| 2012 | ||
| j35 | | 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) |
| j34 | | Carla Binucci, Ulrik Brandes, Giuseppe Di Battista, Walter Didimo, Marco Gaertler, Pietro Palladino, Maurizio Patrignani, Antonios Symvonis, Katharina Anna Zweig: Drawing trees in a streaming model. Inf. Process. Lett. 112(11): 418-422 (2012) |
| j33 | | Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Yoshio Okamoto, Andreas Spillner: Vertex angle and crossing angle resolution of leveled tree drawings. Inf. Process. Lett. 112(16): 630-635 (2012) |
| j32 | | 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) |
| c53 |  | Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani: Vis4AUI: Visual Analysis of Banking Activity Networks. GRAPP/IVAPP 2012: 799-802 |
| c52 | | Walter Didimo, Fabrizio Montecchiani: Fast Layout Computation of Hierarchically Clustered Networks: Algorithmic Advances and Experimental Analysis. IV 2012: 18-23 |
| c51 | | 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 |
| c50 | | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani: h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area. WG 2012: 91-102 |
| 2011 | ||
| j31 | | Patrizio Angelini, Luca Cittadini, Walter Didimo, Fabrizio Frati, Giuseppe Di Battista, Michael Kaufmann, Antonios Symvonis: On the Perspectives Opened by Right Angle Crossing Drawings. J. Graph Algorithms Appl. 15(1): 53-78 (2011) |
| j30 | | Walter Didimo, Giuseppe Liotta, Salvatore Agostino Romeo: A Graph Drawing Application to Web Site Traffic Analysis. J. Graph Algorithms Appl. 15(2): 229-251 (2011) |
| j29 | | 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) |
| j28 | | 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) |
| j27 | | Walter Didimo, Peter Eades, Giuseppe Liotta: Drawing graphs with right angle crossings. Theor. Comput. Sci. 412(39): 5156-5166 (2011) |
| j26 | | Vladimir Batagelj, Franz-Josef Brandenburg, Walter Didimo, Giuseppe Liotta, Pietro Palladino, Maurizio Patrignani: Visual Analysis of Large Graphs Using (X, Y)-Clustering and Hybrid Visualizations. IEEE Trans. Vis. Comput. Graph. 17(11): 1587-1598 (2011) |
| c49 | | Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Pietro Palladino: An advanced network visualization system for financial crime detection. PacificVis 2011: 203-210 |
| c48 | | Patrizio Angelini, Walter Didimo, Stephen G. Kobourov, Tamara Mchedlidze, Vincenzo Roselli, Antonios Symvonis, Stephen K. Wismath: Monotone Drawings of Graphs with Fixed Embedding. Graph Drawing 2011: 379-390 |
| c47 | | Carla Binucci, Walter Didimo: Upward Planarity Testing of Embedded Mixed Graphs. Graph Drawing 2011: 427-432 |
| c46 | | Emilio Di Giacomo, Walter Didimo, Peter Eades, Giuseppe Liotta: 2-Layer Right Angle Crossing Drawings. IWOCA 2011: 156-169 |
| 2010 | ||
| j25 | | 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) |
| j24 | | 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) |
| j23 | | Walter Didimo, Peter Eades, Giuseppe Liotta: A characterization of complete bipartite RAC graphs. Inf. Process. Lett. 110(16): 687-691 (2010) |
| j22 | | 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) |
| c45 | | Walter Didimo, Giuseppe Liotta, Salvatore Agostino Romeo: Graph visualization techniques for conceptual Web site traffic analysis. PacificVis 2010: 193-200 |
| c44 | | Vladimir Batagelj, Walter Didimo, Giuseppe Liotta, Pietro Palladino, Maurizio Patrignani: Visual analysis of large graphs using (X, Y)-clustering and hybrid visualizations. PacificVis 2010: 209-216 |
| c43 | | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Pietro Palladino: Visual analysis of financial crimes: [system paper]. AVI 2010: 393-394 |
| c42 | | Walter Didimo, Giuseppe Liotta, Salvatore Agostino Romeo: Topology-Driven Force-Directed Algorithms. Graph Drawing 2010: 165-176 |
| c41 | | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer: Drawing a Tree as a Minimum Spanning Tree Approximation. ISAAC (2) 2010: 61-72 |
| c40 | | Carla Binucci, Emilio Di Giacomo, Walter Didimo, Aimal Rextin: Switch-Regular Upward Planar Embeddings of Trees. WALCOM 2010: 58-69 |
| 2009 | ||
| j21 | | 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) |
| j20 | | 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) |
| j19 | | Walter Didimo, Francesco Giordano, Giuseppe Liotta: Upward Spirality and Upward Planarity Testing. SIAM J. Discrete Math. 23(4): 1842-1899 (2009) |
| c39 | | 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 |
| c38 | | 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 |
| c37 | | Patrizio Angelini, Luca Cittadini, Giuseppe Di Battista, Walter Didimo, Fabrizio Frati, Michael Kaufmann, Antonios Symvonis: On the Perspectives Opened by Right Angle Crossing Drawings. Graph Drawing 2009: 21-32 |
| c36 | | Carla Binucci, Ulrik Brandes, Giuseppe Di Battista, Walter Didimo, Marco Gaertler, Pietro Palladino, Maurizio Patrignani, Antonios Symvonis, Katharina Anna Zweig: Drawing Trees in a Streaming Model. Graph Drawing 2009: 292-303 |
| c35 | | Walter Didimo, Peter Eades, Giuseppe Liotta: Drawing Graphs with Right Angle Crossings. WADS 2009: 206-217 |
| 2008 | ||
| j18 | | Carla Binucci, Walter Didimo, Francesco Giordano: Maximum upward planar subgraphs of embedded planar digraphs. Comput. Geom. 41(3): 230-246 (2008) |
| j17 | | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta: Radial drawings of graphs: Geometric constraints and trade-offs. J. Discrete Algorithms 6(1): 109-124 (2008) |
| j16 | | 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) |
| j15 | | Walter Didimo, Francesco Giordano, Giuseppe Liotta: Overlapping Cluster Planarity. J. Graph Algorithms Appl. 12(3): 267-291 (2008) |
| c34 | | Emilio Di Giacomo, Walter Didimo, Luca Grilli, Giuseppe Liotta, Pietro Palladino: WhatsOnWeb+ : An Enhanced Visual Search Clustering Engine. PacificVis 2008: 167-174 |
| c33 | | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Pietro Palladino: Visual Analysis of One-to-Many Matched Graphs. Graph Drawing 2008: 133-144 |
| c32 | | 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 | ||
| j14 | | 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) |
| c31 | | Walter Didimo, Francesco Giordano, Giuseppe Liotta: Overlapping cluster planarity. APVIS 2007: 73-80 |
| c30 | | 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 |
| c29 | | 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 |
| c28 | | Emilio Di Giacomo, Walter Didimo, Marc J. van Kreveld, Giuseppe Liotta, Bettina Speckmann: Matched Drawings of Planar Graphs. Graph Drawing 2007: 183-194 |
| c27 | | Carla Binucci, Walter Didimo, Francesco Giordano: Maximum Upward Planar Subgraphs of Embedded Planar Digraphs. Graph Drawing 2007: 195-206 |
| 2006 | ||
| j13 | | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath: Book Embeddability of Series-Parallel Digraphs. Algorithmica 45(4): 531-547 (2006) |
| j12 | | Walter Didimo: Upward Planar Drawings and Switch-regularity Heuristics. J. Graph Algorithms Appl. 10(2): 259-285 (2006) |
| j11 | | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Matthew Suderman: k-Spine, 1-bend planarity. Theor. Comput. Sci. 359(1-3): 148-175 (2006) |
| c26 | | 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 |
| c25 | | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta: Radial Drawings of Graphs: Geometric Constraints and Trade-Offs. Graph Drawing 2006: 355-366 |
| 2005 | ||
| j10 | | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath: Curve-constrained drawings of planar graphs. Comput. Geom. 30(1): 1-23 (2005) |
| j9 | | Carla Binucci, Walter Didimo, Giuseppe Liotta, Maddalena Nonato: Orthogonal drawings of graphs with vertex and edge labels. Comput. Geom. 32(2): 71-114 (2005) |
| j8 | | 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) |
| c24 | | Carla Binucci, Walter Didimo: Experiments on Area Compaction Algorithms for Orthogonal Drawings. CCCG 2005: 113-116 |
| c23 | | Walter Didimo, Francesco Giordano, Giuseppe Liotta: Upward Spirality and Upward Planarity Testing. Graph Drawing 2005: 117-128 |
| c22 | | Emilio Di Giacomo, Walter Didimo, Luca Grilli, Giuseppe Liotta: WhatsOnWeb: Using Graph Drawing to Search the Web. Graph Drawing 2005: 480-491 |
| c21 | | 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 |
| c20 | | Walter Didimo: Computing Upward Planar Drawings Using Switch-Regularity Heuristics. SOFSEM 2005: 117-126 |
| 2004 | ||
| c19 | | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer: Computing Radial Drawings on the Minimum Number of Circles. Graph Drawing 2004: 251-261 |
| c18 | | 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 | ||
| j7 | | Walter Didimo, Maurizio Pizzonia: Upward Embeddings and Orientations of Undirected Planar Graphs. J. Graph Algorithms Appl. 7(2): 221-241 (2003) |
| c17 | | Emilio Di Giacomo, Walter Didimo: Straight-Line Drawings of 2-Outerplanar Graphs on Two Curves. Graph Drawing 2003: 419-424 |
| c16 | | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath: Drawing Planar Graphs on a Curve. WG 2003: 192-204 |
| 2002 | ||
| j6 | | Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo: Quasi-Upward Planarity. Algorithmica 32(3): 474-506 (2002) |
| j5 | | Carla Binucci, Walter Didimo: A Software System for Computing Labeled Orthogonal Drawings of Graphs. Electr. Notes Theor. Comput. Sci. 72(2): 81-90 (2002) |
| j4 | | 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) |
| j3 | | Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia: Drawing database schemas. Softw., Pract. Exper. 32(11): 1065-1098 (2002) |
| c15 | | Carla Binucci, Walter Didimo, Giuseppe Liotta, Maddalena Nonato: Computing Labeled Orthogonal Drawings. Graph Drawing 2002: 66-73 |
| c14 | | 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 | ||
| c13 | | Giuseppe Di Battista, Walter Didimo, A. Marcandalli: Planarization of Clustered Graphs. Graph Drawing 2001: 60-74 |
| c12 | | Carla Binucci, Walter Didimo, Giuseppe Liotta, Maddalena Nonato: Labeling Heuristics for Orthogonal Drawings. Graph Drawing 2001: 139-153 |
| c11 | | 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 |
| c10 | | Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia: Drawing Database Schemas with DBdraw. Graph Drawing 2001: 451-452 |
| c9 | | Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia: Industrial Plant Drawer. Graph Drawing 2001: 475-476 |
| c8 | | Walter Didimo, Maurizio Pizzonia: Upward Embeddings and Orientations of Undirected Planar Graphs. WADS 2001: 339-351 |
| 2000 | ||
| j2 | | 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) |
| j1 | | Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo: Computing Orthogonal Drawings with the Minimum Number of Bends. IEEE Trans. Computers 49(8): 826-840 (2000) |
| c7 | | Andrea Carmignani, Giuseppe Di Battista, Walter Didimo, Francesco Matera, Maurizio Pizzonia: Visualization of the Autonomous Systems Interconnections with HERMES. Graph Drawing 2000: 150-163 |
| 1999 | ||
| c6 | | 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 |
| c5 | | Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia: Orthogonal and Quasi-upward Drawings with Vertices of Prescribed Size. Graph Drawing 1999: 297-310 |
| 1998 | ||
| c4 | | Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo: Quasi-Upward Planarity. Graph Drawing 1998: 15-29 |
| c3 | | Walter Didimo, Giuseppe Liotta: Computing Orthogonal Drawings in a Variable Embedding Setting. ISAAC 1998: 79-88 |
| 1997 | ||
| c2 | | Walter Didimo, Antonio Leonforte: GRID: An Interactive Tool for Computing Orthogonal Drawings With the Minimum Number of Bends. Graph Drawing 1997: 309-315 |
| c1 | | Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo: Computing Orthogonal Drawings with the Minimum Number of Bends. WADS 1997: 331-344 |
Data released under the ODC-BY 1.0 license — See also our legal information page