Giuseppe Di Battista
Giuseppe Di Battista
Dipartimento di Ingegneria Universitą Roma Tre
Verified email at dia.uniroma3.it - Homepage
TitleCited byYear
Graph drawing: algorithms for the visualization of graphs
GD Battista, P Eades, R Tamassia, IG Tollis
Prentice Hall PTR, 1998
30451998
Algorithms for drawing graphs: an annotated bibliography
G Di Battista, P Eades, R Tamassia, IG Tollis
Computational Geometry 4 (5), 235-282, 1994
12561994
Automatic graph drawing and readability of diagrams
R Tamassia, G Di Battista, C Batini
IEEE Transactions on Systems, Man, and Cybernetics 18 (1), 61-79, 1988
5871988
Algorithms for plane representations of acyclic digraphs
G Di Battista, R Tamassia
Theoretical Computer Science 61 (2-3), 175-198, 1988
2931988
Computing the types of the relationships between autonomous systems
G Di Battista, M Patrignani, M Pizzonia
IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE …, 2003
279*2003
Computing the types of the relationships between autonomous systems
G Di Battista, M Patrignani, M Pizzonia
INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and …, 2003
279*2003
On-line planarity testing
G Di Battista, R Tamassia
SIAM Journal on Computing 25 (5), 956-997, 1996
2411996
An experimental comparison of four graph drawing algorithms
G Di Battista, A Garg, G Liotta, R Tamassia, E Tassinari, F Vargiu
Computational Geometry 7 (5-6), 303-325, 1997
2201997
Incremental planarity testing
G Di Battista, R Tamassia
30th Annual Symposium on Foundations of Computer Science, 436-441, 1989
2121989
On-line maintenance of triconnected components with SPQR-trees
G Di Battista, R Tamassia
Algorithmica 15 (4), 302-318, 1996
1701996
Area requirement and symmetry display of planar upward drawings
G Di Battista, R Tamassia, IG Tollis
Discrete & Computational Geometry 7 (4), 381-401, 1992
1601992
Upward drawings of triconnected digraphs
P Bertolazzi, G Di Battista, G Liotta, C Mannino
Algorithmica 12 (6), 476-497, 1994
1421994
Optimal upward planarity testing of single-source digraphs
P Bertolazzi, G Di Battista, C Mannino, R Tamassia
SIAM Journal on Computing 27 (1), 132-169, 1998
139*1998
A note on optimal area algorithms for upward drawings of binary trees
P Crescenzi, G Di Battista, A Piperno
Computational Geometry 2 (4), 187-200, 1992
1351992
On-line graph algorithms with SPQR-trees
G Di Battista, R Tamassia
International Colloquium on Automata, Languages, and Programming, 598-611, 1990
1251990
An experimental study on distance-based graph drawing
U Brandes, C Pich
International Symposium on Graph Drawing, 218-229, 2008
1012008
Computing the types of the relationships between autonomous systems
G Di Battista, T Erlebach, A Hall, M Patrignani, M Pizzonia, T Schank
IEEE/ACM Transactions on Networking (ToN) 15 (2), 267-280, 2007
952007
Structuring primitives for a dictionary of entity relationship data schemas
C Batini, G Di Battista, G Santucci
IEEE Transactions on Software Engineering 19 (4), 344-365, 1993
901993
Graph drawing
IG Tollis, M Patrignani
Lecture Notes in Computer Science 5417, 2009
872009
Bipartite graphs, upward drawings, and planarity
G Di Battista, WP Liu, I Rival
Information Processing Letters 36 (6), 317-322, 1990
831990
The system can't perform the operation now. Try again later.
Articles 1–20