2008 | ||
---|---|---|
117 | EE | Patrizio Angelini, Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani: Topological Morphing of Planar Graphs. Graph Drawing 2008: 145-156 |
116 | EE | Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani: Non-convex Representations of Graphs. Graph Drawing 2008: 390-395 |
115 | EE | Luca Cittadini, Tiziana Refice, Alessio Campisano, Giuseppe Di Battista, Claudio Sasso: Policy-Aware Visualization of Internet Dynamics. Graph Drawing 2008: 435-436 |
114 | EE | Luca Cittadini, Tiziana Refice, Alessio Campisano, Giuseppe Di Battista, Claudio Sasso: Measuring and visualizing interdomain routing dynamics with BGPATH. ISCC 2008: 780-787 |
113 | EE | Alessio Campisano, Luca Cittadini, Giuseppe Di Battista, Tiziana Refice, Claudio Sasso: Tracking back the root cause of a path change in interdomain routing. NOMS 2008: 441-448 |
112 | EE | Luca Cittadini, Giuseppe Di Battista, Massimo Rimondini: (Un)-Stable Routing in the Internet: A Survey from the Algorithmic Perspective. WG 2008: 1-13 |
111 | EE | Pier Francesco Cortese, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Maurizio Pizzonia: C-Planarity of C-Connected Clustered Graphs. J. Graph Algorithms Appl. 12(2): 225-262 (2008) |
2007 | ||
110 | EE | Giuseppe Di Battista, Bernardo Palazzi: Authenticated Relational Tables and Authenticated Skip Lists. DBSec 2007: 31-46 |
109 | EE | Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani: On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features. FUN 2007: 1-13 |
108 | EE | Giuseppe Di Battista, Fabrizio Frati: Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces. Graph Drawing 2007: 291-302 |
107 | EE | Patrizio Angelini, Giuseppe Di Battista, Maurizio Patrignani: Computing a Minimum-Depth Planar Graph Embedding in O ( n 4) Time. WADS 2007: 287-299 |
106 | EE | Giuseppe Di Battista, Guido Drovandi, Fabrizio Frati: How to Draw a Clustered Tree. WADS 2007: 89-101 |
105 | EE | Giuseppe Di Battista, Thomas Erlebach, Alexander Hall, Maurizio Patrignani, Maurizio Pizzonia, Thomas Schank: Computing the types of the relationships between autonomous systems. IEEE/ACM Trans. Netw. 15(2): 267-280 (2007) |
104 | EE | Lorenzo Colitti, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia, Massimo Rimondini: Investigating prefix propagation through active BGP probing. Microprocessors and Microsystems 31(7): 460-474 (2007) |
2006 | ||
103 | 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 |
102 | EE | Fabrizio Frati, Giuseppe Di Battista: Three-Dimensional Drawings of Bounded Degree Trees. Graph Drawing 2006: 89-94 |
101 | EE | Lorenzo Colitti, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia, Massimo Rimondini: Investigating Prefix Propagation through Active BGP Probing. ISCC 2006: 497-504 |
100 | EE | Giuseppe Di Battista, Tiziana Refice, Massimo Rimondini: How to extract BGP peering information from the internet routing registry. MineNet 2006: 317-322 |
99 | EE | Pier Francesco Cortese, Giuseppe Di Battista, Antonello Moneta, Maurizio Patrignani, Maurizio Pizzonia: Topographic Visualization of Prefix Propagation in the Internet. IEEE Trans. Vis. Comput. Graph. 12(5): 725-732 (2006) |
98 | EE | Giuseppe Di Battista, Giuseppe Liotta, Sue Whitesides: The strength of weak proximity. J. Discrete Algorithms 4(3): 384-400 (2006) |
2005 | ||
97 | EE | Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia: On Embedding a Cycle in a Plane Graph. Graph Drawing 2005: 49-60 |
96 | EE | Giuseppe Di Battista, Fabrizio Frati: Small Area Drawings of Outerplanar Graphs. Graph Drawing 2005: 89-100 |
95 | EE | Pier Francesco Cortese, Giuseppe Di Battista: Clustered planarity. Symposium on Computational Geometry 2005: 32-34 |
94 | EE | Lorenzo Colitti, Giuseppe Di Battista, Federico Mariani, Maurizio Patrignani, Maurizio Pizzonia: Visualizing Interdomain Routing with BGPlay. J. Graph Algorithms Appl. 9(1): 117-148 (2005) |
2004 | ||
93 | EE | Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia: Clustering Cycles into Cycles of Clusters. Graph Drawing 2004: 100-110 |
92 | EE | Lorenzo Colitti, Giuseppe Di Battista, Maurizio Patrignani: Discovering IPv6-in-IPv4 tunnels in the Internet. NOMS (1) 2004: 613-626 |
2003 | ||
91 | Giuseppe Di Battista, Uri Zwick: Algorithms - ESA 2003, 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003, Proceedings Springer 2003 | |
90 | EE | John M. Boyer, Pier Francesco Cortese, Maurizio Patrignani, Giuseppe Di Battista: Stop Minding Your P's and Q's: Implementing a Fast and Simple DFS-Based Planarity Testing and Embedding Algorithm. Graph Drawing 2003: 25-36 |
89 | EE | Giuseppe Di Battista, Federico Mariani, Maurizio Patrignani, Maurizio Pizzonia: BGPlay: A System for Visualizing the Interdomain Routing Evolution. Graph Drawing 2003: 295-306 |
88 | EE | Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia: Computing the Types of the Relationships between Autonomous Systems. INFOCOM 2003 |
2002 | ||
87 | EE | Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo: Quasi-Upward Planarity. Algorithmica 32(3): 474-506 (2002) |
86 | EE | 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) |
85 | Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia: Drawing database schemas. Softw., Pract. Exper. 32(11): 1065-1098 (2002) | |
84 | 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 | ||
83 | EE | 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 |
82 | EE | Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia: Drawing Database Schemas with DBdraw. Graph Drawing 2001: 451-452 |
81 | EE | Giuseppe Di Battista, Walter Didimo, A. Marcandalli: Planarization of Clustered Graphs. Graph Drawing 2001: 60-74 |
80 | Giuseppe Di Battista, Roberto Tamassia, Luca Vismara: Incremental Convex Planarity Testing. Inf. Comput. 169(1): 94-126 (2001) | |
2000 | ||
79 | EE | Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides: Embedding Problems for Paths with Direction Constrained Edges. COCOON 2000: 64-73 |
78 | EE | Andrea Carmignani, Giuseppe Di Battista, Walter Didimo, Francesco Matera, Maurizio Pizzonia: Visualization of the Autonomous Systems Interconnections with HERMES. Graph Drawing 2000: 150-163 |
77 | EE | Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides: Orthogonal Drawings of Cycles in 3D Space (Extended Abstract). Graph Drawing 2000: 272-283 |
76 | 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) | |
75 | EE | Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo: Computing Orthogonal Drawings with the Minimum Number of Bends. IEEE Trans. Computers 49(8): 826-840 (2000) |
74 | 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) | |
73 | EE | Giuseppe Di Battista, Maurizio Patrignani, Francesco Vargiu: A Split & Push Approach to 3D Orthogonal Drawing. J. Graph Algorithms Appl. 4(3): 105-133 (2000) |
72 | 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 | ||
71 | Giuseppe Di Battista, Peter Eades, Roberto Tamassia, Ioannis G. Tollis: Graph Drawing: Algorithms for the Visualization of Graphs Prentice-Hall 1999 | |
70 | EE | Maurizio Pizzonia, Giuseppe Di Battista: Object-Oriented Design of Graph Oriented Data Structures. ALENEX 1999: 140-155 |
69 | EE | Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia: Orthogonal and Quasi-upward Drawings with Vertices of Prescribed Size. Graph Drawing 1999: 297-310 |
68 | EE | Camil Demetrescu, Giuseppe Di Battista, Irene Finocchi, Giuseppe Liotta, Maurizio Patrignani, Maurizio Pizzonia: Infinite Trees and the Future. Graph Drawing 1999: 379-391 |
67 | 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 |
66 | EE | Giuseppe Di Battista, Roberto Tamassia, Luca Vismara: Output-Sensitive Reporting of Disjoint Paths. Algorithmica 23(4): 302-340 (1999) |
65 | EE | Giuseppe Di Battista, Petra Mutzel: Guest Editors' Introduction. J. Graph Algorithms Appl. 3(4): 1-2 (1999) |
1998 | ||
64 | EE | Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo: Quasi-Upward Planarity. Graph Drawing 1998: 15-29 |
63 | EE | Giuseppe Di Battista, Renato Lillo, Fabio Vernacotola: Ptolomaeus: The Web Cartographer. Graph Drawing 1998: 444-445 |
62 | EE | Giuseppe Di Battista, Giuseppe Liotta: Upward Planarity Checking: ``Faces Are More than Polygons''. Graph Drawing 1998: 72-86 |
61 | EE | Giuseppe Di Battista, Maurizio Patrignani, Francesco Vargiu: A Split&Push Approach to 3D Orthogonal Drawing. Graph Drawing 1998: 87-101 |
60 | EE | Maurizio Pizzonia, Giuseppe Di Battista: Object-Oriented Design of Graph Oriented Data Structures CoRR cs.SE/9810009: (1998) |
59 | Paola Bertolazzi, Giuseppe Di Battista, Carlo Mannino, Roberto Tamassia: Optimal Upward Planarity Testing of Single-Source Digraphs. SIAM J. Comput. 27(1): 132-169 (1998) | |
58 | EE | Giuseppe Di Battista, Giuseppe Liotta, Francesco Vargiu: Spirality and Optimal Orthogonal Drawings. SIAM J. Comput. 27(6): 1764-1811 (1998) |
1997 | ||
57 | Gian Carlo Bongiovanni, Daniel P. Bovet, Giuseppe Di Battista: Algorithms and Complexity, Third Italian Conference, CIAC '97, Rome, Italy, March 12-14, 1997, Proceedings Springer 1997 | |
56 | Giuseppe Di Battista: Graph Drawing, 5th International Symposium, GD '97, Rome, Italy, September 18-20, 1997, Proceedings Springer 1997 | |
55 | Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo: Computing Orthogonal Drawings with the Minimum Number of Bends. WADS 1997: 331-344 | |
54 | 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) | |
1996 | ||
53 | Giuseppe Di Battista, Roberto Tamassia, Luca Vismara: Output-Sensitive Reporting of Disjoint Paths (Extended Abstract). COCOON 1996: 81-91 | |
52 | 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 | |
51 | Giuseppe Di Battista, Roberto Tamassia: On-Line Maintenance of Triconnected Components with SPQR-Trees. Algorithmica 15(4): 302-318 (1996) | |
50 | Giuseppe Di Battista, Roberto Tamassia: Guest Editors' Introduction to the Special Issue on Graph Drwaing Algorithmica 16(1): 1-3 (1996) | |
49 | Giuseppe Di Battista, Roberto Tamassia: On-Line Planarity Testing. SIAM J. Comput. 25(5): 956-997 (1996) | |
48 | EE | Giuseppe Di Battista, Luca Vismara: Angles of Planar Triangular Graphs. SIAM J. Discrete Math. 9(3): 349-359 (1996) |
1995 | ||
47 | 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 | |
46 | Giuseppe Di Battista, Giuseppe Liotta, Sue Whitesides: The Strength of Weak Proximity. Graph Drawing 1995: 178-189 | |
45 | 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 |
44 | Giuseppe Liotta, Giuseppe Di Battista: Computing Proximity Drawings of Trees in the 3-Dimemsional Space. WADS 1995: 239-250 | |
43 | EE | Paola Bertolazzi, Giuseppe Di Battista, Giuseppe Liotta: Parametric Graph Drawing. IEEE Trans. Software Eng. 21(8): 662-673 (1995) |
42 | Giuseppe Di Battista, Giuseppe Liotta, Francesco Vargiu: Diagram Server. J. Vis. Lang. Comput. 6(3): 275-298 (1995) | |
41 | Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis: Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar ST-Digraphs. SIAM J. Comput. 24(5): 970-1001 (1995) | |
1994 | ||
40 | Giuseppe Liotta, Francesco Vargiu, Giuseppe Di Battista: Orthogonal Drawings with the Minimum Number of Bends. CCCG 1994: 281-286 | |
39 | Giuseppe Di Battista, William Lenhart, Giuseppe Liotta: Proximity Drawability: a Survey. Graph Drawing 1994: 328-339 | |
38 | Prosenjit Bose, Giuseppe Di Battista, William Lenhart, Giuseppe Liotta: Proximity Constraints and Representable Trees. Graph Drawing 1994: 340-351 | |
37 | Giuseppe Di Battista, Roberto Tamassia, Luca Vismara: On-Line Convex Plabarity Testing. WG 1994: 242-255 | |
36 | Paola Bertolazzi, Giuseppe Di Battista, Giuseppe Liotta, Carlo Mannino: Upward Drawings of Triconnected Digraphs. Algorithmica 12(6): 476-497 (1994) | |
35 | Giuseppe Di Battista, Peter Eades, Roberto Tamassia, Ioannis G. Tollis: Algorithms for Drawing Graphs: an Annotated Bibliography. Comput. Geom. 4: 235-282 (1994) | |
34 | Paola Bertolazzi, Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis: How to Draw a Series-Parallel Digraph. Int. J. Comput. Geometry Appl. 4(4): 385-402 (1994) | |
1993 | ||
33 | EE | Giuseppe Santucci, Carlo Batini, Giuseppe Di Battista: Multilevel Schema Integration. ER 1993: 327-338 |
32 | Paola Bertolazzi, Giuseppe Di Battista, Carlo Mannino, Roberto Tamassia: Optimal Upward Planarity Testing of Single-Source Digraphs. ESA 1993: 37-48 | |
31 | EE | Robert F. Cohen, Giuseppe Di Battista, Arkady Kanevsky, Roberto Tamassia: Reinventing the wheel: an optimal data structure for connectivity queries. STOC 1993: 194-200 |
30 | EE | Giuseppe Di Battista, Luca Vismara: Angles of planar triangular graphs. STOC 1993: 431-437 |
29 | 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 | |
28 | EE | Giuseppe Di Battista, Maurizio Lenzerini: Deductive Entity-Relationship Modeling. IEEE Trans. Knowl. Data Eng. 5(3): 439-450 (1993) |
27 | EE | Carlo Batini, Giuseppe Di Battista, Giuseppe Santucci: Structuring Primitives for a Dictionary of Entity Relationship Data Schemas. IEEE Trans. Software Eng. 19(4): 344-365 (1993) |
1992 | ||
26 | Giuseppe Di Battista, Giuseppe Liotta, M. Strani, Francesco Vargiu: Diagram Server. Advanced Visual Interfaces 1992: 415-117 | |
25 | Carlo Batini, Giuseppe Di Battista, Giuseppe Santucci: A Formal Framework for Multilevel Schema Documentation in a Data Dictionary. ISCO 1992: 53-85 | |
24 | Paola Bertolazzi, Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis: How to Draw a Series-Parallel Digraph (Extended Abstract). SWAT 1992: 272-283 | |
23 | EE | Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis, Paola Bertolazzi: A Framework for Dynamic Graph Drawing. Symposium on Computational Geometry 1992: 261-270 |
22 | Pierluigi Crescenzi, Giuseppe Di Battista, Adolfo Piperno: A Note on Optimal Area Algorithms for Upward Drawings of Binary Trees. Comput. Geom. 2: 187-200 (1992) | |
21 | Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis: Area Requirement and Symmetry Display of Planar Upward Drawings. Discrete & Computational Geometry 7: 381-401 (1992) | |
20 | Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis: Constrained Visibility Representations of Graphs. Inf. Process. Lett. 41(1): 1-7 (1992) | |
1991 | ||
19 | Arkady Kanevsky, Roberto Tamassia, Giuseppe Di Battista, Jianer Chen: On-Line Maintenance of the Four-Connected Components of a Graph (Extended Abstract) FOCS 1991: 793-801 | |
18 | EE | Paola Bertolazzi, Giuseppe Di Battista: On Upward Drawing Testing of Triconnected Digraphs (Extended Abstract). Symposium on Computational Geometry 1991: 272-280 |
17 | Massimiliano Beccaria, Paola Bertolazzi, Giuseppe Di Battista, Giuseppe Liotta: A Tailorable and Extensible Automatic Layout Facility. VL 1991: 68-73 | |
1990 | ||
16 | Giuseppe Di Battista, Roberto Tamassia: On-Line Graph Algorithms with SPQR-Trees. ICALP 1990: 598-611 | |
15 | Giuseppe Di Battista, Amadeo Giammarco, Giuseppe Santucci, Roberto Tamassia: The Architecture of Diagram Server. VL 1990: 60-65 | |
14 | Giuseppe Di Battista, Wei-Ping Liu, Ivan Rival: Bipartite Graphs, Upward Drawings, and Planarity. Inf. Process. Lett. 36(6): 317-322 (1990) | |
1989 | ||
13 | Giuseppe Di Battista, Roberto Tamassia: Incremental Planarity Testing (Extended Abstract) FOCS 1989: 436-441 | |
12 | EE | Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis: Area Requirement and Symmetry Display in Drawing Graphs. Symposium on Computational Geometry 1989: 51-60 |
11 | EE | Giuseppe Di Battista, Maurizio Lenzerini: A Deductive Method for Entity-Relationship Modeling. VLDB 1989: 13-21 |
10 | Giuseppe Di Battista, Hannu Kangassalo, Roberto Tamassia: Definition Libraries for Conceptual Modelling. Data Knowl. Eng. 4: 245-260 (1989) | |
1988 | ||
9 | EE | Giuseppe Di Battista, Maurizio Lenzerini: Object Modeling Based on Logic. ER 1988: 207-225 |
8 | EE | Giuseppe Di Battista, Hannu Kangassalo, Roberto Tamassia: Definition Libraries for Conceptual Modelling. ER 1988: 251-267 |
7 | EE | Giuseppe Di Battista: Automatic Drawing of Statistical Diagrams. SSDBM 1988: 141-156 |
6 | EE | G. Barcaroli, Giuseppe Di Battista, E. Fortunato, C. Leporelli: Design of Statistical Information Media: Time Performance and Storage Constraints. SSDBM 1988: 93-104 |
5 | Carlo Batini, Giuseppe Di Battista: A methodology for conceptual documentation and maintenance. Inf. Syst. 13(3): 297-318 (1988) | |
4 | Giuseppe Di Battista, Carlo Batini: Design of statistical databases: a methodology for the conceptual step. Inf. Syst. 13(4): 407-422 (1988) | |
3 | Giuseppe Di Battista, Roberto Tamassia: Algorithms for Plane Representations of Acyclic Digraphs. Theor. Comput. Sci. 61: 175-198 (1988) | |
1987 | ||
2 | Giuseppe Di Battista, Roberto Tamassia: Upward Drawings of Acyclic Digraphs. WG 1987: 121-133 | |
1986 | ||
1 | Giuseppe Di Battista, Enrico Nardelli: An Algorithm for Testing Planarity of Hierarchical Graphs. WG 1986: 277-289 |