2009 | ||
---|---|---|
116 | EE | Luca Grilli, Seok-Hee Hong, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath: Matched Drawability of Graph Pairs and of Graph Triples. WALCOM 2009: 322-333 |
2008 | ||
115 | Svetlana Stolpner, Jonathan Lenchner, Giuseppe Liotta, David Bremner, Christophe Paul, Marc Pouget, Stephen K. Wismath: A note on alpha-drawable k-trees. CCCG 2008 | |
114 | EE | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Pietro Palladino: Visual Analysis of One-to-Many Matched Graphs. Graph Drawing 2008: 133-144 |
113 | EE | Francesco Giordano, Giuseppe Liotta, Sue Whitesides: Embeddability Problems for Upward Planar Digraphs. Graph Drawing 2008: 242-253 |
112 | EE | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath: Constrained Point-Set Embeddability of Planar Graphs. Graph Drawing 2008: 360-371 |
111 | EE | Emilio Di Giacomo, Walter Didimo, Luca Grilli, Giuseppe Liotta, Pietro Palladino: WhatsOnWeb+ : An Enhanced Visual Search Clustering Engine. PacificVis 2008: 167-174 |
110 | EE | Vida Dujmovic, Michael R. Fellows, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Sue Whitesides, David R. Wood: On the Parameterized Complexity of Layered Graph Drawing. Algorithmica 52(2): 267-292 (2008) |
109 | EE | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta: Radial drawings of graphs: Geometric constraints and trade-offs. J. Discrete Algorithms 6(1): 109-124 (2008) |
108 | EE | 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) |
107 | EE | Emilio Di Giacomo, Luca Grilli, Giuseppe Liotta: Drawing Bipartite Graphs on Two Parallel Convex Curves. J. Graph Algorithms Appl. 12(1): 97-112 (2008) |
106 | EE | Walter Didimo, Francesco Giordano, Giuseppe Liotta: Overlapping Cluster Planarity. J. Graph Algorithms Appl. 12(3): 267-291 (2008) |
105 | EE | Melanie Badent, Emilio Di Giacomo, Giuseppe Liotta: Drawing colored graphs on colored points. Theor. Comput. Sci. 408(2-3): 129-142 (2008) |
2007 | ||
104 | EE | Walter Didimo, Francesco Giordano, Giuseppe Liotta: Overlapping cluster planarity. APVIS 2007: 73-80 |
103 | Ethan Kim, Sue Whitesides, Giuseppe Liotta: A Note on Drawing Direction-constrained Paths in 3D. CCCG 2007: 193-196 | |
102 | EE | Ulrik Brandes, Cesim Erten, J. Joseph Fowler, Fabrizio Frati, Markus Geyer, Carsten Gutwenger, Seok-Hee Hong, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel, Antonios Symvonis: Colored Simultaneous Geometric Embeddings. COCOON 2007: 254-263 |
101 | EE | 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 |
100 | EE | Emilio Di Giacomo, Walter Didimo, Marc J. van Kreveld, Giuseppe Liotta, Bettina Speckmann: Matched Drawings of Planar Graphs. Graph Drawing 2007: 183-194 |
99 | EE | Emilio Di Giacomo, Giuseppe Liotta, Francesco Trotta: Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge. Graph Drawing 2007: 315-326 |
98 | EE | Hazel Everett, Sylvain Lazard, Giuseppe Liotta, Stephen K. Wismath: Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices. Graph Drawing 2007: 345-351 |
97 | EE | Francesco Giordano, Giuseppe Liotta, Tamara Mchedlidze, Antonios Symvonis: Computing Upward Topological Book Embeddings of Upward Planar Digraphs. ISAAC 2007: 172-183 |
96 | EE | Melanie Badent, Emilio Di Giacomo, Giuseppe Liotta: Drawing Colored Graphs on Colored Points. WADS 2007: 102-113 |
95 | EE | Giuseppe Liotta, Henk Meijer: Advances in graph drawing: The 11th International Symposium on Graph Drawing. Discrete Applied Mathematics 155(9): 1077 (2007) |
94 | EE | 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) |
93 | EE | Emilio Di Giacomo, Giuseppe Liotta: Simultaneous Embedding of Outerplanar Graphs, Paths, and Cycles. Int. J. Comput. Geometry Appl. 17(2): 139-160 (2007) |
2006 | ||
92 | EE | 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. CAAN 2006: 31-44 |
91 | EE | 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 |
90 | EE | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta: Radial Drawings of Graphs: Geometric Constraints and Trade-Offs. Graph Drawing 2006: 355-366 |
89 | EE | Emilio Di Giacomo, Luca Grilli, Giuseppe Liotta: Drawing Bipartite Graphs on Two Curves. Graph Drawing 2006: 380-385 |
88 | EE | 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. Algorithmica 45(2): 159-182 (2006) |
87 | EE | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath: Book Embeddability of Series-Parallel Digraphs. Algorithmica 45(4): 531-547 (2006) |
86 | EE | 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) |
85 | EE | Giuseppe Di Battista, Giuseppe Liotta, Sue Whitesides: The strength of weak proximity. J. Discrete Algorithms 4(3): 384-400 (2006) |
84 | EE | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Matthew Suderman: k-Spine, 1-bend planarity. Theor. Comput. Sci. 359(1-3): 148-175 (2006) |
2005 | ||
83 | EE | Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath: Volume Requirements of 3D Upward Drawings. Graph Drawing 2005: 101-110 |
82 | EE | Emilio Di Giacomo, Giuseppe Liotta, Francesco Trotta: How to Embed a Path onto Two Sets of Points. Graph Drawing 2005: 111-116 |
81 | EE | Walter Didimo, Francesco Giordano, Giuseppe Liotta: Upward Spirality and Upward Planarity Testing. Graph Drawing 2005: 117-128 |
80 | EE | Emilio Di Giacomo, Walter Didimo, Luca Grilli, Giuseppe Liotta: WhatsOnWeb: Using Graph Drawing to Search the Web. Graph Drawing 2005: 480-491 |
79 | EE | 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 |
78 | EE | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath: Curve-constrained drawings of planar graphs. Comput. Geom. 30(1): 1-23 (2005) |
77 | EE | 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) |
76 | EE | Carla Binucci, Walter Didimo, Giuseppe Liotta, Maddalena Nonato: Orthogonal drawings of graphs with vertex and edge labels. Comput. Geom. 32(2): 71-114 (2005) |
75 | EE | Giuseppe Liotta: Guest Editor's Foreword. J. Graph Algorithms Appl. 9(1): 3-5 (2005) |
2004 | ||
74 | Giuseppe Liotta: Graph Drawing, 11th International Symposium, GD 2003, Perugia, Italy, September 21-24, 2003, Revised Papers Springer 2004 | |
73 | EE | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer: Computing Radial Drawings on the Minimum Number of Circles. Graph Drawing 2004: 251-261 |
72 | EE | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Matthew Suderman: Hamiltonian-with-Handles Graphs and the k-Spine Drawability Problem. Graph Drawing 2004: 262-272 |
71 | EE | 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) |
2003 | ||
70 | EE | Franz-Josef Brandenburg, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel: Selected Open Problems in Graph Drawing. Graph Drawing 2003: 515-539 |
69 | EE | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath: Drawing Planar Graphs on a Curve. WG 2003: 192-204 |
68 | Giuseppe Liotta, Henk Meijer: Voronoi drawings of trees. Comput. Geom. 24(3): 147-178 (2003) | |
67 | Ferran Hurtado, Giuseppe Liotta, Henk Meijer: Optimal and suboptimal robust algorithms for proximity graphs. Comput. Geom. 25(1-2): 35-49 (2003) | |
66 | EE | Giuseppe Liotta, Ioannis G. Tollis: Guest Editors' Foreword. J. Graph Algorithms Appl. 7(2): 101-103 (2003) |
65 | EE | Stefan Felsner, Giuseppe Liotta, Stephen K. Wismath: Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions. J. Graph Algorithms Appl. 7(4): 363-398 (2003) |
2002 | ||
64 | EE | Emilio Di Giacomo, Giuseppe Liotta, Stephen K. Wismath: Drawing series-parallel graphs on a box. CCCG 2002: 149-153 |
63 | EE | Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani: Orthogonal 3D Shapes of Theta Graphs. Graph Drawing 2002: 142-149 |
62 | EE | 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 |
61 | EE | Carla Binucci, Walter Didimo, Giuseppe Liotta, Maddalena Nonato: Computing Labeled Orthogonal Drawings. Graph Drawing 2002: 66-73 |
60 | EE | William Lenhart, Giuseppe Liotta: The drawability problem for minimum weight triangulations. Theor. Comput. Sci. 270(1-2): 261-286 (2002) |
59 | Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides: Embedding problems for paths with direction constrained edges. Theor. Comput. Sci. 289(2): 897-917 (2002) | |
2001 | ||
58 | EE | 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. ESA 2001: 488-499 |
57 | EE | 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. Graph Drawing 2001: 1-15 |
56 | EE | Carla Binucci, Walter Didimo, Giuseppe Liotta, Maddalena Nonato: Labeling Heuristics for Orthogonal Drawings. Graph Drawing 2001: 139-153 |
55 | EE | Stefan Felsner, Giuseppe Liotta, Stephen K. Wismath: Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions. Graph Drawing 2001: 328-342 |
54 | EE | Emilio Di Giacomo, Giuseppe Liotta: WAVE. Graph Drawing 2001: 440-441 |
53 | EE | Ferran Hurtado, Giuseppe Liotta, Henk Meijer: Optimal, Suboptimal, and Robust Algorithms for Proximity Graphs. WADS 2001: 2-13 |
2000 | ||
52 | EE | Camil Demetrescu, Irene Finocchi, Giuseppe Liotta: Visualizing Algorithms over the Web with the Publication-Driven Approach. Algorithm Engineering 2000: 147-158 |
51 | EE | Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides: Embedding Problems for Paths with Direction Constrained Edges. COCOON 2000: 64-73 |
50 | EE | Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides: Orthogonal Drawings of Cycles in 3D Space (Extended Abstract). Graph Drawing 2000: 272-283 |
49 | EE | William Lenhart, Giuseppe Liotta: Minimum Weight Drawings of Maximal Triangulations (Extended Abstract). Graph Drawing 2000: 338-349 |
48 | 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) | |
47 | Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Armando Parise, Roberto Tamassia, Emanuele Tassinari, Francesco Vargiu, Luca Vismara: Drawing Directed Acyclic Graphs: An Experimental Study. Int. J. Comput. Geometry Appl. 10(6): 623-648 (2000) | |
46 | EE | Giuseppe Liotta, Sue Whitesides: Guest Editors' Foreword. J. Graph Algorithms Appl. 4(3): 1-3 (2000) |
45 | Luca Vismara, Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Roberto Tamassia, Francesco Vargiu: Experimental studies on graph drawing algorithms. Softw., Pract. Exper. 30(11): 1235-1284 (2000) | |
1999 | ||
44 | EE | Giuseppe Liotta, Henk Meijer: Voronoi Drawings of Trees. Graph Drawing 1999: 369-378 |
43 | EE | Camil Demetrescu, Giuseppe Di Battista, Irene Finocchi, Giuseppe Liotta, Maurizio Patrignani, Maurizio Pizzonia: Infinite Trees and the Future. Graph Drawing 1999: 379-391 |
42 | EE | Ashim Garg, Giuseppe Liotta: Almost Bend-Optimal Planar Orthogonal Drawings of Biconnected Degree-3 Planar Graphs in Quadratic Time. Graph Drawing 1999: 38-48 |
41 | EE | 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 |
40 | James E. Baker, Isabel F. Cruz, Giuseppe Liotta, Roberto Tamassia: Visualizing geometric algorithms over the Web. Comput. Geom. 12(1-2): 125-152 (1999) | |
1998 | ||
39 | EE | Giuseppe Liotta: A note on checking proximity graphs. CCCG 1998 |
38 | EE | Fabrizio d'Amore, Paolo Giulio Franciosa, Giuseppe Liotta: Robust Region Approach to the Computation of Geometric Graphs (Extended Abstract). ESA 1998: 175-186 |
37 | EE | Giuseppe Di Battista, Giuseppe Liotta: Upward Planarity Checking: ``Faces Are More than Polygons''. Graph Drawing 1998: 72-86 |
36 | EE | Walter Didimo, Giuseppe Liotta: Computing Orthogonal Drawings in a Variable Embedding Setting. ISAAC 1998: 79-88 |
35 | Giuseppe Liotta, Anna Lubiw, Henk Meijer, Sue Whitesides: The rectangle of influence drawability problem. Comput. Geom. 10(1): 1-22 (1998) | |
34 | Olivier Devillers, Giuseppe Liotta, Franco P. Preparata, Roberto Tamassia: Checking the convexity of polytopes and the planarity of subdivisions. Comput. Geom. 11(3-4): 187-208 (1998) | |
33 | EE | Giuseppe Di Battista, Giuseppe Liotta, Francesco Vargiu: Spirality and Optimal Orthogonal Drawings. SIAM J. Comput. 27(6): 1764-1811 (1998) |
32 | Giuseppe Liotta, Franco P. Preparata, Roberto Tamassia: Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design. SIAM J. Comput. 28(3): 864-889 (1998) | |
1997 | ||
31 | Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis, Paola Vocca: Area Requirement of Gabriel Drawings. CIAC 1997: 135-146 | |
30 | William Lenhart, Giuseppe Liotta: Drawable and Forbidden Minimum Weight Triangulations. Graph Drawing 1997: 1-12 | |
29 | EE | Giuseppe Liotta, Franco P. Preparata, Roberto Tamassia: Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design. Symposium on Computational Geometry 1997: 156-165 |
28 | Olivier Devillers, Giuseppe Liotta, Franco P. Preparata, Roberto Tamassia: Checking the Convexity of Polytopes and the Planarity of Subdivisions (Extended Abstract). WADS 1997: 186-199 | |
27 | Emo Welzl, Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Roberto Tamassia, Emanuele Tassinari, Francesco Vargiu: An Experimental Comparison of Four Graph Drawing Algorithms. Comput. Geom. 7: 303-325 (1997) | |
26 | EE | Goos Kant, Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis: Area Requirement of Visibility Representations of Trees. Inf. Process. Lett. 62(2): 81-88 (1997) |
1996 | ||
25 | EE | James E. Baker, Isabel F. Cruz, Giuseppe Liotta, Roberto Tamassia: Algorithm animation over the World Wide Web. AVI 1996: 203-212 |
24 | EE | James E. Baker, Isabel F. Cruz, Giuseppe Liotta, Roberto Tamassia: The Mocha algorithm animation system. AVI 1996: 248-250 |
23 | Roberto Tamassia, Giuseppe Liotta, Franco P. Preparata: Robust Proximity Queries in Implicit Voronoi Diagrams. CCCG 1996: 1-1 | |
22 | William Lenhart, Giuseppe Liotta: Proximity Drawings of Outerplanar Graphs. Graph Drawing 1996: 286-302 | |
21 | Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Armando Parise, Roberto Tamassia, Emanuele Tassinari, Francesco Vargiu, Luca Vismara: Drawing Directed Acyclic Graphs: An Experimental Study. Graph Drawing 1996: 76-91 | |
20 | EE | James E. Baker, Isabel F. Cruz, Giuseppe Liotta, Roberto Tamassia: Animating Geometric Algorithms Over the Web. Symposium on Computational Geometry 1996: C-3-C-4 |
19 | Prosenjit Bose, William Lenhart, Giuseppe Liotta: Characterizing Proximity Trees. Algorithmica 16(1): 83-110 (1996) | |
18 | EE | William Lenhart, Giuseppe Liotta: Drawing Outerplanar Minimum Weight Triangulations. Inf. Process. Lett. 57(5): 253-260 (1996) |
1995 | ||
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. Graph Drawing 1995: 111-122 | |
16 | Giuseppe Di Battista, Giuseppe Liotta, Sue Whitesides: The Strength of Weak Proximity. Graph Drawing 1995: 178-189 | |
15 | William Lenhart, Giuseppe Liotta: How to Draw Outerplanar Minimum Weight Triangulations. Graph Drawing 1995: 373-384 | |
14 | EE | Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Roberto Tamassia, Emanuele Tassinari, Francesco Vargiu: An Experimental Comparison of Three Graph Drawing Algorithms (Extended Abstract). Symposium on Computational Geometry 1995: 306-315 |
13 | Giuseppe Liotta, Giuseppe Di Battista: Computing Proximity Drawings of Trees in the 3-Dimemsional Space. WADS 1995: 239-250 | |
12 | James E. Baker, Isabel F. Cruz, Giuseppe Liotta, Roberto Tamassia: A New Model for Algorithm Animation Over the WWW. ACM Comput. Surv. 27(4): 568-572 (1995) | |
11 | EE | Paola Bertolazzi, Giuseppe Di Battista, Giuseppe Liotta: Parametric Graph Drawing. IEEE Trans. Software Eng. 21(8): 662-673 (1995) |
10 | Giuseppe Di Battista, Giuseppe Liotta, Francesco Vargiu: Diagram Server. J. Vis. Lang. Comput. 6(3): 275-298 (1995) | |
1994 | ||
9 | Giuseppe Liotta, Francesco Vargiu, Giuseppe Di Battista: Orthogonal Drawings with the Minimum Number of Bends. CCCG 1994: 281-286 | |
8 | Giuseppe Di Battista, William Lenhart, Giuseppe Liotta: Proximity Drawability: a Survey. Graph Drawing 1994: 328-339 | |
7 | Prosenjit Bose, Giuseppe Di Battista, William Lenhart, Giuseppe Liotta: Proximity Constraints and Representable Trees. Graph Drawing 1994: 340-351 | |
6 | Hossam A. ElGindy, Giuseppe Liotta, Anna Lubiw, Henk Meijer, Sue Whitesides: Recognizing Rectangle of Influence Drawable Graphs. Graph Drawing 1994: 352-363 | |
5 | Paola Bertolazzi, Giuseppe Di Battista, Giuseppe Liotta, Carlo Mannino: Upward Drawings of Triconnected Digraphs. Algorithmica 12(6): 476-497 (1994) | |
1993 | ||
4 | Goos Kant, Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis: Area Requirement of Visibility Representations of Trees. CCCG 1993: 192-197 | |
3 | Giuseppe Di Battista, Giuseppe Liotta, Francesco Vargiu: Spirality of Orthogonal Representations and Optimal Drawings of Series-Parallel Graphs and 3-Planar Graphs (Extended Abstract). WADS 1993: 151-162 | |
1992 | ||
2 | Giuseppe Di Battista, Giuseppe Liotta, M. Strani, Francesco Vargiu: Diagram Server. Advanced Visual Interfaces 1992: 415-117 | |
1991 | ||
1 | Massimiliano Beccaria, Paola Bertolazzi, Giuseppe Di Battista, Giuseppe Liotta: A Tailorable and Extensible Automatic Layout Facility. VL 1991: 68-73 |