|
Search the dblp DataBase
Giuseppe Di Battista:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Carlo Batini, Giuseppe Di Battista, Giuseppe Santucci
Structuring Primitives for a Dictionary of Entity Relationship Data Schemas. [Citation Graph (9, 0)][DBLP] IEEE Trans. Software Eng., 1993, v:19, n:4, pp:344-365 [Journal]
- Giuseppe Di Battista, Carlo Batini
Design of statistical databases: a methodology for the conceptual step. [Citation Graph (8, 0)][DBLP] Inf. Syst., 1988, v:13, n:4, pp:407-422 [Journal]
- Carlo Batini, Giuseppe Di Battista
A methodology for conceptual documentation and maintenance. [Citation Graph (6, 0)][DBLP] Inf. Syst., 1988, v:13, n:3, pp:297-318 [Journal]
- Giuseppe Di Battista, Maurizio Lenzerini
Deductive Entity-Relationship Modeling. [Citation Graph (5, 22)][DBLP] IEEE Trans. Knowl. Data Eng., 1993, v:5, n:3, pp:439-450 [Journal]
- Giuseppe Di Battista, Maurizio Lenzerini
A Deductive Method for Entity-Relationship Modeling. [Citation Graph (3, 14)][DBLP] VLDB, 1989, pp:13-21 [Conf]
- Giuseppe Di Battista, Hannu Kangassalo, Roberto Tamassia
Definition Libraries for Conceptual Modelling. [Citation Graph (2, 8)][DBLP] ER, 1988, pp:251-267 [Conf]
- G. Barcaroli, Giuseppe Di Battista, E. Fortunato, C. Leporelli
Design of Statistical Information Media: Time Performance and Storage Constraints. [Citation Graph (2, 6)][DBLP] SSDBM, 1988, pp:93-104 [Conf]
- Giuseppe Di Battista
Automatic Drawing of Statistical Diagrams. [Citation Graph (2, 10)][DBLP] SSDBM, 1988, pp:141-156 [Conf]
- Giuseppe Di Battista, Roberto Tamassia
Algorithms for Plane Representations of Acyclic Digraphs. [Citation Graph (2, 0)][DBLP] Theor. Comput. Sci., 1988, v:61, n:, pp:175-198 [Journal]
- Giuseppe Di Battista, Maurizio Lenzerini
Object Modeling Based on Logic. [Citation Graph (1, 9)][DBLP] ER, 1988, pp:207-225 [Conf]
- Giuseppe Santucci, Carlo Batini, Giuseppe Di Battista
Multilevel Schema Integration. [Citation Graph (1, 16)][DBLP] ER, 1993, pp:327-338 [Conf]
- Giuseppe Di Battista, Enrico Nardelli
An Algorithm for Testing Planarity of Hierarchical Graphs. [Citation Graph (1, 0)][DBLP] WG, 1986, pp:277-289 [Conf]
- Giuseppe Di Battista, Hannu Kangassalo, Roberto Tamassia
Definition Libraries for Conceptual Modelling. [Citation Graph (1, 0)][DBLP] Data Knowl. Eng., 1989, v:4, n:, pp:245-260 [Journal]
- Maurizio Pizzonia, Giuseppe Di Battista
Object-Oriented Design of Graph Oriented Data Structures. [Citation Graph (0, 0)][DBLP] ALENEX, 1999, pp:140-155 [Conf]
- Giuseppe Di Battista, Giuseppe Liotta, M. Strani, Francesco Vargiu
Diagram Server. [Citation Graph (0, 0)][DBLP] Advanced Visual Interfaces, 1992, pp:415-117 [Conf]
- 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]
- 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]
- Giuseppe Di Battista, Roberto Tamassia, Luca Vismara
Output-Sensitive Reporting of Disjoint Paths (Extended Abstract). [Citation Graph (0, 0)][DBLP] COCOON, 1996, pp:81-91 [Conf]
- 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]
- 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]
- Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis
Area Requirement and Symmetry Display in Drawing Graphs. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1989, pp:51-60 [Conf]
- Paola Bertolazzi, Giuseppe Di Battista
On Upward Drawing Testing of Triconnected Digraphs (Extended Abstract). [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1991, pp:272-280 [Conf]
- Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis, Paola Bertolazzi
A Framework for Dynamic Graph Drawing. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1992, pp:261-270 [Conf]
- Pier Francesco Cortese, Giuseppe Di Battista
Clustered planarity. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2005, pp:32-34 [Conf]
- Paola Bertolazzi, Giuseppe Di Battista, Carlo Mannino, Roberto Tamassia
Optimal Upward Planarity Testing of Single-Source Digraphs. [Citation Graph (0, 0)][DBLP] ESA, 1993, pp:37-48 [Conf]
- Giuseppe Di Battista, Roberto Tamassia
Incremental Planarity Testing (Extended Abstract) [Citation Graph (0, 0)][DBLP] FOCS, 1989, pp:436-441 [Conf]
- Arkady Kanevsky, Roberto Tamassia, Giuseppe Di Battista, Jianer Chen
On-Line Maintenance of the Four-Connected Components of a Graph (Extended Abstract) [Citation Graph (0, 0)][DBLP] FOCS, 1991, pp:793-801 [Conf]
- 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]
- 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]
- 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. [Citation Graph (0, 0)][DBLP] Graph Drawing, 2003, pp:25-36 [Conf]
- 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]
- Giuseppe Di Battista, Walter Didimo, A. Marcandalli
Planarization of Clustered Graphs. [Citation Graph (0, 0)][DBLP] Graph Drawing, 2001, pp:60-74 [Conf]
- 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]
- 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]
- Giuseppe Di Battista, Fabrizio Frati
Small Area Drawings of Outerplanar Graphs. [Citation Graph (0, 0)][DBLP] Graph Drawing, 2005, pp:89-100 [Conf]
- 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]
- 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]
- Giuseppe Di Battista, William Lenhart, Giuseppe Liotta
Proximity Drawability: a Survey. [Citation Graph (0, 0)][DBLP] Graph Drawing, 1994, pp:328-339 [Conf]
- 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]
- Giuseppe Di Battista, Renato Lillo, Fabio Vernacotola
Ptolomaeus: The Web Cartographer. [Citation Graph (0, 0)][DBLP] Graph Drawing, 1998, pp:444-445 [Conf]
- Giuseppe Di Battista, Giuseppe Liotta, Sue Whitesides
The Strength of Weak Proximity. [Citation Graph (0, 0)][DBLP] Graph Drawing, 1995, pp:178-189 [Conf]
- Giuseppe Di Battista, Federico Mariani, Maurizio Patrignani, Maurizio Pizzonia
BGPlay: A System for Visualizing the Interdomain Routing Evolution. [Citation Graph (0, 0)][DBLP] Graph Drawing, 2003, pp:295-306 [Conf]
- Giuseppe Di Battista, Maurizio Patrignani, Francesco Vargiu
A Split&Push Approach to 3D Orthogonal Drawing. [Citation Graph (0, 0)][DBLP] Graph Drawing, 1998, pp:87-101 [Conf]
- 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]
- Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo
Quasi-Upward Planarity. [Citation Graph (0, 0)][DBLP] Graph Drawing, 1998, pp:15-29 [Conf]
- 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]
- Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia
Clustering Cycles into Cycles of Clusters. [Citation Graph (0, 0)][DBLP] Graph Drawing, 2004, pp:100-110 [Conf]
- Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia
On Embedding a Cycle in a Plane Graph. [Citation Graph (0, 0)][DBLP] Graph Drawing, 2005, pp:49-60 [Conf]
- 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]
- Fabrizio Frati, Giuseppe Di Battista
Three-Dimensional Drawings of Bounded Degree Trees. [Citation Graph (0, 0)][DBLP] Graph Drawing, 2006, pp:89-94 [Conf]
- Giuseppe Di Battista, Roberto Tamassia
On-Line Graph Algorithms with SPQR-Trees. [Citation Graph (0, 0)][DBLP] ICALP, 1990, pp:598-611 [Conf]
- Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia
Computing the Types of the Relationships between Autonomous Systems. [Citation Graph (0, 0)][DBLP] INFOCOM, 2003, pp:- [Conf]
- Lorenzo Colitti, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia, Massimo Rimondini
Investigating Prefix Propagation through Active BGP Probing. [Citation Graph (0, 0)][DBLP] ISCC, 2006, pp:497-504 [Conf]
- Carlo Batini, Giuseppe Di Battista, Giuseppe Santucci
A Formal Framework for Multilevel Schema Documentation in a Data Dictionary. [Citation Graph (0, 0)][DBLP] ISCO, 1992, pp:53-85 [Conf]
- Giuseppe Di Battista, Luca Vismara
Angles of planar triangular graphs. [Citation Graph (0, 0)][DBLP] STOC, 1993, pp:431-437 [Conf]
- Robert F. Cohen, Giuseppe Di Battista, Arkady Kanevsky, Roberto Tamassia
Reinventing the wheel: an optimal data structure for connectivity queries. [Citation Graph (0, 0)][DBLP] STOC, 1993, pp:194-200 [Conf]
- Paola Bertolazzi, Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis
How to Draw a Series-Parallel Digraph (Extended Abstract). [Citation Graph (0, 0)][DBLP] SWAT, 1992, pp:272-283 [Conf]
- Giuseppe Di Battista, Amadeo Giammarco, Giuseppe Santucci, Roberto Tamassia
The Architecture of Diagram Server. [Citation Graph (0, 0)][DBLP] VL, 1990, pp:60-65 [Conf]
- 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]
- 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]
- 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]
- 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]
- Giuseppe Di Battista, Roberto Tamassia
Upward Drawings of Acyclic Digraphs. [Citation Graph (0, 0)][DBLP] WG, 1987, pp:121-133 [Conf]
- Giuseppe Di Battista, Roberto Tamassia, Luca Vismara
On-Line Convex Plabarity Testing. [Citation Graph (0, 0)][DBLP] WG, 1994, pp:242-255 [Conf]
- Giuseppe Di Battista, Roberto Tamassia
On-Line Maintenance of Triconnected Components with SPQR-Trees. [Citation Graph (0, 0)][DBLP] Algorithmica, 1996, v:15, n:4, pp:302-318 [Journal]
- Giuseppe Di Battista, Roberto Tamassia
Guest Editors' Introduction to the Special Issue on Graph Drwaing [Citation Graph (0, 0)][DBLP] Algorithmica, 1996, v:16, n:1, pp:1-3 [Journal]
- Giuseppe Di Battista, Roberto Tamassia, Luca Vismara
Output-Sensitive Reporting of Disjoint Paths. [Citation Graph (0, 0)][DBLP] Algorithmica, 1999, v:23, n:4, pp:302-340 [Journal]
- 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]
- 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]
- Giuseppe Di Battista, Peter Eades, Roberto Tamassia, Ioannis G. Tollis
Algorithms for Drawing Graphs: an Annotated Bibliography. [Citation Graph (0, 0)][DBLP] Comput. Geom., 1994, v:4, n:, pp:235-282 [Journal]
- 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]
- Pierluigi Crescenzi, Giuseppe Di Battista, Adolfo Piperno
A Note on Optimal Area Algorithms for Upward Drawings of Binary Trees. [Citation Graph (0, 0)][DBLP] Comput. Geom., 1992, v:2, n:, pp:187-200 [Journal]
- 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]
- Maurizio Pizzonia, Giuseppe Di Battista
Object-Oriented Design of Graph Oriented Data Structures [Citation Graph (0, 0)][DBLP] CoRR, 1998, v:0, n:, pp:- [Journal]
- Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis
Area Requirement and Symmetry Display of Planar Upward Drawings. [Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 1992, v:7, n:, pp:381-401 [Journal]
- Giuseppe Di Battista, Roberto Tamassia, Luca Vismara
Incremental Convex Planarity Testing. [Citation Graph (0, 0)][DBLP] Inf. Comput., 2001, v:169, n:1, pp:94-126 [Journal]
- 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]
- Paola Bertolazzi, Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis
How to Draw a Series-Parallel Digraph. [Citation Graph (0, 0)][DBLP] Int. J. Comput. Geometry Appl., 1994, v:4, n:4, pp:385-402 [Journal]
- Giuseppe Di Battista, Wei-Ping Liu, Ivan Rival
Bipartite Graphs, Upward Drawings, and Planarity. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1990, v:36, n:6, pp:317-322 [Journal]
- Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis
Constrained Visibility Representations of Graphs. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1992, v:41, n:1, pp:1-7 [Journal]
- 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]
- Giuseppe Di Battista, Petra Mutzel
Guest Editors' Introduction. [Citation Graph (0, 0)][DBLP] J. Graph Algorithms Appl., 1999, v:3, n:4, pp:1-2 [Journal]
- Giuseppe Di Battista, Maurizio Patrignani, Francesco Vargiu
A Split & Push Approach to 3D Orthogonal Drawing. [Citation Graph (0, 0)][DBLP] J. Graph Algorithms Appl., 2000, v:4, n:3, pp:105-133 [Journal]
- 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]
- Lorenzo Colitti, Giuseppe Di Battista, Federico Mariani, Maurizio Patrignani, Maurizio Pizzonia
Visualizing Interdomain Routing with BGPlay. [Citation Graph (0, 0)][DBLP] J. Graph Algorithms Appl., 2005, v:9, n:1, pp:117-148 [Journal]
- 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]
- Giuseppe Di Battista, Roberto Tamassia
On-Line Planarity Testing. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1996, v:25, n:5, pp:956-997 [Journal]
- Paola Bertolazzi, Giuseppe Di Battista, Carlo Mannino, Roberto Tamassia
Optimal Upward Planarity Testing of Single-Source Digraphs. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1998, v:27, n:1, pp:132-169 [Journal]
- Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis
Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar ST-Digraphs. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1995, v:24, n:5, pp:970-1001 [Journal]
- Giuseppe Di Battista, Luca Vismara
Angles of Planar Triangular Graphs. [Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1996, v:9, n:3, pp:349-359 [Journal]
- 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]
- 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]
- 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]
- 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]
- 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]
- Pier Francesco Cortese, Giuseppe Di Battista, Antonello Moneta, Maurizio Patrignani, Maurizio Pizzonia
Topographic Visualization of Prefix Propagation in the Internet. [Citation Graph (0, 0)][DBLP] IEEE Trans. Vis. Comput. Graph., 2006, v:12, n:5, pp:725-732 [Journal]
- 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]
- Giuseppe Di Battista, Bernardo Palazzi
Authenticated Relational Tables and Authenticated Skip Lists. [Citation Graph (0, 0)][DBLP] DBSec, 2007, pp:31-46 [Conf]
- Patrizio Angelini, Giuseppe Di Battista, Maurizio Patrignani
Computing a Minimum-Depth Planar Graph Embedding in O ( n 4) Time. [Citation Graph (0, 0)][DBLP] WADS, 2007, pp:287-299 [Conf]
- Giuseppe Di Battista, Guido Drovandi, Fabrizio Frati
How to Draw a Clustered Tree. [Citation Graph (0, 0)][DBLP] WADS, 2007, pp:89-101 [Conf]
- Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani
On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features. [Citation Graph (0, 0)][DBLP] FUN, 2007, pp:1-13 [Conf]
- Giuseppe Di Battista, Thomas Erlebach, Alexander Hall, Maurizio Patrignani, Maurizio Pizzonia, Thomas Schank
Computing the types of the relationships between autonomous systems. [Citation Graph (0, 0)][DBLP] IEEE/ACM Trans. Netw., 2007, v:15, n:2, pp:267-280 [Journal]
- Lorenzo Colitti, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia, Massimo Rimondini
Investigating prefix propagation through active BGP probing. [Citation Graph (0, 0)][DBLP] Microprocessors and Microsystems, 2007, v:31, n:7, pp:460-474 [Journal]
Succinct Greedy Drawings Do Not Always Exist. [Citation Graph (, )][DBLP]
On the Perspectives Opened by Right Angle Crossing Drawings. [Citation Graph (, )][DBLP]
Drawing Trees in a Streaming Model. [Citation Graph (, )][DBLP]
Non-convex Representations of Graphs. [Citation Graph (, )][DBLP]
Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces. [Citation Graph (, )][DBLP]
Policy-Aware Visualization of Internet Dynamics. [Citation Graph (, )][DBLP]
Topological Morphing of Planar Graphs. [Citation Graph (, )][DBLP]
Measuring Route Diversity in the Internet from Remote Vantage Points. [Citation Graph (, )][DBLP]
Wheel + Ring = Reel: the Impact of Route Filtering on the Stability of Policy Routing. [Citation Graph (, )][DBLP]
On the feasibility of static analysis for BGP convergence. [Citation Graph (, )][DBLP]
Measuring and visualizing interdomain routing dynamics with BGPATH. [Citation Graph (, )][DBLP]
Testing Planarity of Partially Embedded Graphs. [Citation Graph (, )][DBLP]
(Un)-Stable Routing in the Internet: A Survey from the Algorithmic Perspective. [Citation Graph (, )][DBLP]
How to extract BGP peering information from the internet routing registry. [Citation Graph (, )][DBLP]
Tracking back the root cause of a path change in interdomain routing. [Citation Graph (, )][DBLP]
Discovering IPv6-in-IPv4 tunnels in the Internet. [Citation Graph (, )][DBLP]
Doing don'ts: Modifying BGP attributes within an autonomous system. [Citation Graph (, )][DBLP]
Small Area Drawings of Outerplanar Graphs. [Citation Graph (, )][DBLP]
On embedding a cycle in a plane graph. [Citation Graph (, )][DBLP]
Search in 0.006secs, Finished in 0.656secs
|