The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Giuseppe Liotta: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. James E. Baker, Isabel F. Cruz, Giuseppe Liotta, Roberto Tamassia
    Algorithm animation over the World Wide Web. [Citation Graph (0, 0)][DBLP]
    AVI, 1996, pp:203-212 [Conf]
  2. James E. Baker, Isabel F. Cruz, Giuseppe Liotta, Roberto Tamassia
    The Mocha algorithm animation system. [Citation Graph (0, 0)][DBLP]
    AVI, 1996, pp:248-250 [Conf]
  3. Giuseppe Di Battista, Giuseppe Liotta, M. Strani, Francesco Vargiu
    Diagram Server. [Citation Graph (0, 0)][DBLP]
    Advanced Visual Interfaces, 1992, pp:415-117 [Conf]
  4. Pier Francesco Cortese, Giuseppe Di Battista, Fabrizio Frati, Luca Grilli, Katharina Anna Lehmann, Giuseppe Liotta, Maurizio Patrignani, Ioannis G. Tollis, Francesco Trotta
    On the Topologies of Local Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
    CAAN, 2006, pp:31-44 [Conf]
  5. Emilio Di Giacomo, Giuseppe Liotta, Stephen K. Wismath
    Drawing series-parallel graphs on a box. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:149-153 [Conf]
  6. Goos Kant, Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis
    Area Requirement of Visibility Representations of Trees. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:192-197 [Conf]
  7. Giuseppe Liotta
    A note on checking proximity graphs. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  8. Giuseppe Liotta, Francesco Vargiu, Giuseppe Di Battista
    Orthogonal Drawings with the Minimum Number of Bends. [Citation Graph (0, 0)][DBLP]
    CCCG, 1994, pp:281-286 [Conf]
  9. Roberto Tamassia, Giuseppe Liotta, Franco P. Preparata
    Robust Proximity Queries in Implicit Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:1-1 [Conf]
  10. Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis, Paola Vocca
    Area Requirement of Gabriel Drawings. [Citation Graph (0, 0)][DBLP]
    CIAC, 1997, pp:135-146 [Conf]
  11. Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides
    Embedding Problems for Paths with Direction Constrained Edges. [Citation Graph (0, 0)][DBLP]
    COCOON, 2000, pp:64-73 [Conf]
  12. James E. Baker, Isabel F. Cruz, Giuseppe Liotta, Roberto Tamassia
    Animating Geometric Algorithms Over the Web. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:0-3 [Conf]
  13. Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Roberto Tamassia, Emanuele Tassinari, Francesco Vargiu
    An Experimental Comparison of Three Graph Drawing Algorithms (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:306-315 [Conf]
  14. Giuseppe Liotta, Franco P. Preparata, Roberto Tamassia
    Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:156-165 [Conf]
  15. Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood
    On the Parameterized Complexity of Layered Graph Drawing. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:488-499 [Conf]
  16. Fabrizio d'Amore, Paolo Giulio Franciosa, Giuseppe Liotta
    Robust Region Approach to the Computation of Geometric Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1998, pp:175-186 [Conf]
  17. Luciano Buti, Giuseppe Di Battista, Giuseppe Liotta, Emanuele Tassinari, Francesco Vargiu, Luca Vismara
    GD-Workbench: A System for Prototyping and Testing Graph Drawing Algorithms. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1995, pp:111-122 [Conf]
  18. 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]
  19. Carla Binucci, Walter Didimo, Giuseppe Liotta, Maddalena Nonato
    Computing Labeled Orthogonal Drawings. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2002, pp:66-73 [Conf]
  20. Prosenjit Bose, Giuseppe Di Battista, William Lenhart, Giuseppe Liotta
    Proximity Constraints and Representable Trees. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1994, pp:340-351 [Conf]
  21. Franz-Josef Brandenburg, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel
    Selected Open Problems in Graph Drawing. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:515-539 [Conf]
  22. Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Armando Parise, Roberto Tamassia, Emanuele Tassinari, Francesco Vargiu, Luca Vismara
    Drawing Directed Acyclic Graphs: An Experimental Study. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1996, pp:76-91 [Conf]
  23. Giuseppe Di Battista, Giuseppe Liotta
    Upward Planarity Checking: ``Faces Are More than Polygons''. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1998, pp:72-86 [Conf]
  24. Giuseppe Di Battista, William Lenhart, Giuseppe Liotta
    Proximity Drawability: a Survey. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1994, pp:328-339 [Conf]
  25. Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides
    Orthogonal Drawings of Cycles in 3D Space (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2000, pp:272-283 [Conf]
  26. Giuseppe Di Battista, Giuseppe Liotta, Sue Whitesides
    The Strength of Weak Proximity. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1995, pp:178-189 [Conf]
  27. 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]
  28. Hossam A. ElGindy, Giuseppe Liotta, Anna Lubiw, Henk Meijer, Sue Whitesides
    Recognizing Rectangle of Influence Drawable Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1994, pp:352-363 [Conf]
  29. Stefan Felsner, Giuseppe Liotta, Stephen K. Wismath
    Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:328-342 [Conf]
  30. Camil Demetrescu, Giuseppe Di Battista, Irene Finocchi, Giuseppe Liotta, Maurizio Patrignani, Maurizio Pizzonia
    Infinite Trees and the Future. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1999, pp:379-391 [Conf]
  31. Walter Didimo, Francesco Giordano, Giuseppe Liotta
    Upward Spirality and Upward Planarity Testing. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:117-128 [Conf]
  32. Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood
    A Fixed-Parameter Approach to Two-Layer Planarization. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:1-15 [Conf]
  33. Ashim Garg, Giuseppe Liotta
    Almost Bend-Optimal Planar Orthogonal Drawings of Biconnected Degree-3 Planar Graphs in Quadratic Time. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1999, pp:38-48 [Conf]
  34. 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]
  35. 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]
  36. 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]
  37. 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]
  38. Emilio Di Giacomo, Giuseppe Liotta
    WAVE. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:440-441 [Conf]
  39. Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath
    Volume Requirements of 3D Upward Drawings. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:101-110 [Conf]
  40. Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani
    Orthogonal 3D Shapes of Theta Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2002, pp:142-149 [Conf]
  41. Emilio Di Giacomo, Giuseppe Liotta, Francesco Trotta
    How to Embed a Path onto Two Sets of Points. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:111-116 [Conf]
  42. William Lenhart, Giuseppe Liotta
    Minimum Weight Drawings of Maximal Triangulations (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2000, pp:338-349 [Conf]
  43. William Lenhart, Giuseppe Liotta
    How to Draw Outerplanar Minimum Weight Triangulations. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1995, pp:373-384 [Conf]
  44. William Lenhart, Giuseppe Liotta
    Proximity Drawings of Outerplanar Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1996, pp:286-302 [Conf]
  45. William Lenhart, Giuseppe Liotta
    Drawable and Forbidden Minimum Weight Triangulations. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1997, pp:1-12 [Conf]
  46. Giuseppe Liotta, Henk Meijer
    Voronoi Drawings of Trees. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1999, pp:369-378 [Conf]
  47. 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]
  48. Emilio Di Giacomo, Luca Grilli, Giuseppe Liotta
    Drawing Bipartite Graphs on Two Curves. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2006, pp:380-385 [Conf]
  49. 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]
  50. Walter Didimo, Giuseppe Liotta
    Computing Orthogonal Drawings in a Variable Embedding Setting. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1998, pp:79-88 [Conf]
  51. 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]
  52. Massimiliano Beccaria, Paola Bertolazzi, Giuseppe Di Battista, Giuseppe Liotta
    A Tailorable and Extensible Automatic Layout Facility. [Citation Graph (0, 0)][DBLP]
    VL, 1991, pp:68-73 [Conf]
  53. Giuseppe Di Battista, Giuseppe Liotta, Francesco Vargiu
    Spirality of Orthogonal Representations and Optimal Drawings of Series-Parallel Graphs and 3-Planar Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1993, pp:151-162 [Conf]
  54. Olivier Devillers, Giuseppe Liotta, Franco P. Preparata, Roberto Tamassia
    Checking the Convexity of Polytopes and the Planarity of Subdivisions (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:186-199 [Conf]
  55. Ferran Hurtado, Giuseppe Liotta, Henk Meijer
    Optimal, Suboptimal, and Robust Algorithms for Proximity Graphs. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:2-13 [Conf]
  56. Giuseppe Liotta, Giuseppe Di Battista
    Computing Proximity Drawings of Trees in the 3-Dimemsional Space. [Citation Graph (0, 0)][DBLP]
    WADS, 1995, pp:239-250 [Conf]
  57. Camil Demetrescu, Irene Finocchi, Giuseppe Liotta
    Visualizing Algorithms over the Web with the Publication-Driven Approach. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 2000, pp:147-158 [Conf]
  58. 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]
  59. Paola Bertolazzi, Giuseppe Di Battista, Giuseppe Liotta, Carlo Mannino
    Upward Drawings of Triconnected Digraphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:12, n:6, pp:476-497 [Journal]
  60. Prosenjit Bose, William Lenhart, Giuseppe Liotta
    Characterizing Proximity Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:16, n:1, pp:83-110 [Journal]
  61. Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood
    A Fixed-Parameter Approach to 2-Layer Planarization. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:45, n:2, pp:159-182 [Journal]
  62. 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]
  63. 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]
  64. James E. Baker, Isabel F. Cruz, Giuseppe Liotta, Roberto Tamassia
    Visualizing geometric algorithms over the Web. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1999, v:12, n:1-2, pp:125-152 [Journal]
  65. 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]
  66. Olivier Devillers, Giuseppe Liotta, Franco P. Preparata, Roberto Tamassia
    Checking the convexity of polytopes and the planarity of subdivisions. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:11, n:3-4, pp:187-208 [Journal]
  67. 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]
  68. Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer
    Computing straight-line 3D grid drawings of graphs in linear volume. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:32, n:1, pp:26-58 [Journal]
  69. Giuseppe Liotta, Anna Lubiw, Henk Meijer, Sue Whitesides
    The rectangle of influence drawability problem. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:10, n:1, pp:1-22 [Journal]
  70. Giuseppe Liotta, Henk Meijer
    Voronoi drawings of trees. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:24, n:3, pp:147-178 [Journal]
  71. Ferran Hurtado, Giuseppe Liotta, Henk Meijer
    Optimal and suboptimal robust algorithms for proximity graphs. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:25, n:1-2, pp:35-49 [Journal]
  72. Emo Welzl, Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Roberto Tamassia, Emanuele Tassinari, Francesco Vargiu
    An Experimental Comparison of Four Graph Drawing Algorithms. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:7, n:, pp:303-325 [Journal]
  73. James E. Baker, Isabel F. Cruz, Giuseppe Liotta, Roberto Tamassia
    A New Model for Algorithm Animation Over the WWW. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1995, v:27, n:4, pp:568-572 [Journal]
  74. Giuseppe Liotta, Henk Meijer
    Advances in graph drawing: The 11th International Symposium on Graph Drawing. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:9, pp:1077- [Journal]
  75. Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Armando Parise, Roberto Tamassia, Emanuele Tassinari, Francesco Vargiu, Luca Vismara
    Drawing Directed Acyclic Graphs: An Experimental Study. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2000, v:10, n:6, pp:623-648 [Journal]
  76. Emilio Di Giacomo, Giuseppe Liotta, Francesco Trotta
    On Embedding a Graph on Two Sets of Points. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2006, v:17, n:5, pp:1071-1094 [Journal]
  77. Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani
    A note on 3D orthogonal drawings with direction constrained edges. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:90, n:2, pp:97-101 [Journal]
  78. Goos Kant, Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis
    Area Requirement of Visibility Representations of Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:62, n:2, pp:81-88 [Journal]
  79. William Lenhart, Giuseppe Liotta
    Drawing Outerplanar Minimum Weight Triangulations. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:57, n:5, pp:253-260 [Journal]
  80. Giuseppe Di Battista, Giuseppe Liotta, Sue Whitesides
    The strength of weak proximity. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:3, pp:384-400 [Journal]
  81. Giuseppe Liotta
    Guest Editor's Foreword. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2005, v:9, n:1, pp:3-5 [Journal]
  82. Giuseppe Liotta, Ioannis G. Tollis
    Guest Editors' Foreword. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2003, v:7, n:2, pp:101-103 [Journal]
  83. Giuseppe Liotta, Sue Whitesides
    Guest Editors' Foreword. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2000, v:4, n:3, pp:1-3 [Journal]
  84. Stefan Felsner, Giuseppe Liotta, Stephen K. Wismath
    Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2003, v:7, n:4, pp:363-398 [Journal]
  85. Giuseppe Di Battista, Giuseppe Liotta, Francesco Vargiu
    Spirality and Optimal Orthogonal Drawings. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:6, pp:1764-1811 [Journal]
  86. Giuseppe Liotta, Franco P. Preparata, Roberto Tamassia
    Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:3, pp:864-889 [Journal]
  87. Luca Vismara, Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Roberto Tamassia, Francesco Vargiu
    Experimental studies on graph drawing algorithms. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 2000, v:30, n:11, pp:1235-1284 [Journal]
  88. Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides
    Embedding problems for paths with direction constrained edges. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:2, pp:897-917 [Journal]
  89. 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]
  90. William Lenhart, Giuseppe Liotta
    The drawability problem for minimum weight triangulations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:270, n:1-2, pp:261-286 [Journal]
  91. Paola Bertolazzi, Giuseppe Di Battista, Giuseppe Liotta
    Parametric Graph Drawing. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 1995, v:21, n:8, pp:662-673 [Journal]
  92. 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]
  93. Giuseppe Di Battista, Giuseppe Liotta, Francesco Vargiu
    Diagram Server. [Citation Graph (0, 0)][DBLP]
    J. Vis. Lang. Comput., 1995, v:6, n:3, pp:275-298 [Journal]
  94. Ethan Kim, Sue Whitesides, Giuseppe Liotta
    A Note on Drawing Direction-constrained Paths in 3D. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:193-196 [Conf]
  95. Ulrik Brandes, Cesim Erten, J. Fowler, Fabrizio Frati, Markus Geyer, Carsten Gutwenger, S. Hong, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel, Antonios Symvonis
    Colored Simultaneous Geometric Embeddings. [Citation Graph (0, 0)][DBLP]
    COCOON, 2007, pp:254-263 [Conf]
  96. Melanie Badent, Emilio Di Giacomo, Giuseppe Liotta
    Drawing Colored Graphs on Colored Points. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:102-113 [Conf]

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


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


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


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


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


  102. A note on alpha-drawable k-trees. [Citation Graph (, )][DBLP]


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


  104. A note on simultaneous embedding of planar graphs. [Citation Graph (, )][DBLP]


  105. Embeddability Problems for Upward Planar Digraphs. [Citation Graph (, )][DBLP]


  106. Geometric Simultaneous Embeddings of a Graph and a Matching. [Citation Graph (, )][DBLP]


  107. Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices. [Citation Graph (, )][DBLP]


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


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


  110. Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge. [Citation Graph (, )][DBLP]


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


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


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


  114. Beyond a Visuocentric Way of a Visual Web Search Clustering Engine: The Sonification of WhatsOnWeb. [Citation Graph (, )][DBLP]


  115. Computing Upward Topological Book Embeddings of Upward Planar Digraphs. [Citation Graph (, )][DBLP]


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


  117. The Hamiltonian Augmentation Problem and Its Applications to Graph Drawing. [Citation Graph (, )][DBLP]


  118. Matched Drawability of Graph Pairs and of Graph Triples. [Citation Graph (, )][DBLP]


  119. On the Parameterized Complexity of Layered Graph Drawing. [Citation Graph (, )][DBLP]


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


  121. Matched drawability of graph pairs and of graph triples. [Citation Graph (, )][DBLP]


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


  123. Proximity Drawings of High-Degree Trees [Citation Graph (, )][DBLP]


  124. Universal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices. [Citation Graph (, )][DBLP]


  125. Volume requirements of 3D upward drawings. [Citation Graph (, )][DBLP]


Search in 0.046secs, Finished in 0.049secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002