The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Walter Didimo: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Carla Binucci, Walter Didimo
    Experiments on Area Compaction Algorithms for Orthogonal Drawings. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:113-116 [Conf]
  2. Carla Binucci, Walter Didimo, Giuseppe Liotta, Maddalena Nonato
    Labeling Heuristics for Orthogonal Drawings. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:139-153 [Conf]
  3. Carla Binucci, Walter Didimo, Giuseppe Liotta, Maddalena Nonato
    Computing Labeled Orthogonal Drawings. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2002, pp:66-73 [Conf]
  4. Gabriele Barbagallo, Andrea Carmignani, Giuseppe Di Battista, Walter Didimo, Maurizio Pizzonia
    Exploration and Visualization of Computer Networks: Polyphemus and Hermes. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:444-445 [Conf]
  5. Giuseppe Di Battista, Walter Didimo, A. Marcandalli
    Planarization of Clustered Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:60-74 [Conf]
  6. Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia
    Drawing Database Schemas with DBdraw. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:451-452 [Conf]
  7. Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia
    Orthogonal and Quasi-upward Drawings with Vertices of Prescribed Size. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1999, pp:297-310 [Conf]
  8. Stina S. Bridgeman, Giuseppe Di Battista, Walter Didimo, Giuseppe Liotta, Roberto Tamassia, Luca Vismara
    Turn-Regularity and Planar Orthogonal Drawings. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1999, pp:8-26 [Conf]
  9. Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo
    Quasi-Upward Planarity. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1998, pp:15-29 [Conf]
  10. Andrea Carmignani, Giuseppe Di Battista, Walter Didimo, Francesco Matera, Maurizio Pizzonia
    Visualization of the Autonomous Systems Interconnections with HERMES. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2000, pp:150-163 [Conf]
  11. Walter Didimo, Francesco Giordano, Giuseppe Liotta
    Upward Spirality and Upward Planarity Testing. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:117-128 [Conf]
  12. Walter Didimo, Antonio Leonforte
    GRID: An Interactive Tool for Computing Orthogonal Drawings With the Minimum Number of Bends. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1997, pp:309-315 [Conf]
  13. Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia
    Industrial Plant Drawer. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:475-476 [Conf]
  14. Emilio Di Giacomo, Walter Didimo
    Straight-Line Drawings of 2-Outerplanar Graphs on Two Curves. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:419-424 [Conf]
  15. Emilio Di Giacomo, Walter Didimo, Luca Grilli, Giuseppe Liotta
    WhatsOnWeb: Using Graph Drawing to Search the Web. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:480-491 [Conf]
  16. Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer
    Computing Radial Drawings on the Minimum Number of Circles. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2004, pp:251-261 [Conf]
  17. Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Matthew Suderman
    Hamiltonian-with-Handles Graphs and the k-Spine Drawability Problem. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2004, pp:262-272 [Conf]
  18. Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath
    Book Embeddings and Point-Set Embeddings of Series-Parallel Digraphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2002, pp:162-173 [Conf]
  19. Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Francesco Trotta, Stephen K. Wismath
    k -Colored Point-Set Embeddability of Outerplanar Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2006, pp:318-329 [Conf]
  20. Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta
    Radial Drawings of Graphs: Geometric Constraints and Trade-Offs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2006, pp:355-366 [Conf]
  21. Walter Didimo, Giuseppe Liotta
    Computing Orthogonal Drawings in a Variable Embedding Setting. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1998, pp:79-88 [Conf]
  22. Emilio Di Giacomo, Walter Didimo, Luca Grilli, Giuseppe Liotta
    A Topology-Driven Approach to the Design of Web Meta-search Clustering Engines. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2005, pp:106-116 [Conf]
  23. Walter Didimo
    Computing Upward Planar Drawings Using Switch-Regularity Heuristics. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2005, pp:117-126 [Conf]
  24. Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo
    Computing Orthogonal Drawings with the Minimum Number of Bends. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:331-344 [Conf]
  25. Walter Didimo, Maurizio Pizzonia
    Upward Embeddings and Orientations of Undirected Planar Graphs. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:339-351 [Conf]
  26. Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath
    Drawing Planar Graphs on a Curve. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:192-204 [Conf]
  27. Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo
    Quasi-Upward Planarity. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:32, n:3, pp:474-506 [Journal]
  28. Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath
    Book Embeddability of Series-Parallel Digraphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:45, n:4, pp:531-547 [Journal]
  29. Carla Binucci, Walter Didimo, Giuseppe Liotta, Maddalena Nonato
    Orthogonal drawings of graphs with vertex and edge labels. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:32, n:2, pp:71-114 [Journal]
  30. Stina S. Bridgeman, Giuseppe Di Battista, Walter Didimo, Giuseppe Liotta, Roberto Tamassia, Luca Vismara
    Turn-regularity and optimal area drawings of orthogonal representations. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2000, v:16, n:1, pp:53-93 [Journal]
  31. Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath
    Curve-constrained drawings of planar graphs. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:30, n:1, pp:1-23 [Journal]
  32. Carla Binucci, Walter Didimo
    A Software System for Computing Labeled Orthogonal Drawings of Graphs. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:72, n:2, pp:- [Journal]
  33. Andrea Carmignani, Giuseppe Di Battista, Walter Didimo, Francesco Matera, Maurizio Pizzonia
    Visualization of the High Level Structure of the Internet with HERMES. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2002, v:6, n:3, pp:281-311 [Journal]
  34. Walter Didimo, Maurizio Pizzonia
    Upward Embeddings and Orientations of Undirected Planar Graphs. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2003, v:7, n:2, pp:221-241 [Journal]
  35. Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia
    Drawing database schemas. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 2002, v:32, n:11, pp:1065-1098 [Journal]
  36. Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo
    Computing Orthogonal Drawings with the Minimum Number of Bends. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2000, v:49, n:8, pp:826-840 [Journal]
  37. Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Matthew Suderman
    k-Spine, 1-bend planarity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:359, n:1-3, pp:148-175 [Journal]
  38. Emilio Di Giacomo, Walter Didimo, Luca Grilli, Giuseppe Liotta
    Graph Visualization Techniques for Web Clustering Engines. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Vis. Comput. Graph., 2007, v:13, n:2, pp:294-304 [Journal]
  39. 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. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:233-236 [Conf]

  40. WhatsOnWeb+ : An Enhanced Visual Search Clustering Engine. [Citation Graph (, )][DBLP]


  41. Overlapping cluster planarity. [Citation Graph (, )][DBLP]


  42. Visual analysis of large graphs using (X, Y)-clustering and hybrid visualizations. [Citation Graph (, )][DBLP]


  43. Graph visualization techniques for conceptual Web site traffic analysis. [Citation Graph (, )][DBLP]


  44. Visual analysis of financial crimes: [system paper]. [Citation Graph (, )][DBLP]


  45. On Directed Graphs with an Upward Straight-line. [Citation Graph (, )][DBLP]


  46. On the Perspectives Opened by Right Angle Crossing Drawings. [Citation Graph (, )][DBLP]


  47. Drawing Trees in a Streaming Model. [Citation Graph (, )][DBLP]


  48. Maximum Upward Planar Subgraphs of Embedded Planar Digraphs. [Citation Graph (, )][DBLP]


  49. Matched Drawings of Planar Graphs. [Citation Graph (, )][DBLP]


  50. Point-Set Embedding of Trees with Edge Constraints. [Citation Graph (, )][DBLP]


  51. Visual Analysis of One-to-Many Matched Graphs. [Citation Graph (, )][DBLP]


  52. Constrained Point-Set Embeddability of Planar Graphs. [Citation Graph (, )][DBLP]


  53. Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings. [Citation Graph (, )][DBLP]


  54. Drawing Graphs with Right Angle Crossings. [Citation Graph (, )][DBLP]


  55. Switch-Regular Upward Planar Embeddings of Trees. [Citation Graph (, )][DBLP]


  56. Maximum upward planar subgraphs of embedded planar digraphs. [Citation Graph (, )][DBLP]


  57. Point-set embeddings of trees with given partial drawings. [Citation Graph (, )][DBLP]


  58. Upward straight-line embeddings of directed graphs into point sets. [Citation Graph (, )][DBLP]


Search in 0.016secs, Finished in 0.466secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002