Pubblication & Technical Reports

Algorithm Engineering
Research Group
Most recent are on top
  1. W. Didimo and A. Leonforte, "GRID: An Interactive Tool for Computing Orthogonal Drawings With the Minimum Number of Bends", in G. Di Battista, editor, Graph Drawing (Proc. GD '97), volume 1353 of Lecture Notes Comput. Sci., pages 309-315, Springer-Verlag, 1998.

    2.  
  2. M. Patrignani and F. Vargiu, "3DCube: a Tool for Three Dimensional Graph Drawing", in G. Di Battista, editor, Graph Drawing (Proc. GD '97), volume 1353 of Lecture Notes Comput. Sci., pages 284-290. Springer-Verlag, 1998.

    3.  
  3. P. Bertolazzi, G. Di Battista and W. Didimo. "Computing Orthogonal Drawing with the Minimum Number of Bends", in Proc. Workshop Algorithms Data Struct., 1997 (to appear).

    4.  
  4. G. Di Battista, G. Liotta, and F. Vargiu, "Spirality and Optimal Grid Drawings", SIAM Journal on Computing (to appear).

    5.  
  5. G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu "An Experimental Comparison of Four Graph Drawing Algorithms", Computational Geometry: Theory and Applications no. 7, pp. 303-325, 1997.

    6.  
  6. G. Di Battista, A. Garg, G. Liotta, A. Parise, R. Tamassia, E. Tassinari, F. Vargiu, and L. Vismara. "Drawing directed graphs: an experimental study", in S. North, editor, Graph Drawing (Proc. GD '96), Lecture Notes Comput. Sci. Springer-Verlag, 1997. (see also a preliminary version in Technical Report CS-96-24, Center for Geometric Computing, Dept. Computer Science, Brown Univ., 1996. ftp://ftp.cs.brown.edu/pub/techreports/96/cs96-24.ps.Z)

    7.  
  7. G. Di Battista, R. Tamassia, and L. Vismara. "Output-Sensitive Reporting of Disjoint Paths", in Proc. Computing and Combinatorics Conference, volume 1090 of Lecture Notes Comput. Sci., pages 81-91. Springer-Verlag, 1996.

    8. (see also Technical Report TR 16-96, Dipartimento di Informatica e Automazione , Universita' di Roma Tre, Italy, 1996. http://www.inf.uniroma3.it/tech-rep/inf-16-96.ps)
     
  8. P. Bose, G. Di Battista, W. Lenhart and G. Liotta, "Proximity Constraints and Representable Trees", TR 9-96, Dipartimento di Informatica e Automazione , Universita' di Roma Tre, Italy, June 1996. http://www.inf.uniroma3.it/tech-rep/inf-9-96.ps

    9.  
  9. L. Buti, G. Di Battista, G. Liotta, E. Tassinari, F. Vargiu, and L. Vismara, "GD-workbench: a system for prototyping and testing graph drawing algorithms", in F. J. Brandenburg, editor, Graph Drawing (Proc. GD '95), volume 1027 of Lecture Notes Comput. Sci., pages 111-122. Springer-Verlag, 1996.

    10.  
  10. G. Di Battista, G. Liotta, S. H. Whitesides "On the Strength of Weak Proximity", presented at the Symposium on Graph Drawing, 1995.

    11. (see also Technical Report TR 8-96, Dipartimento di Informatica e Automazione , Universita' di Roma Tre, Italy, 1996. http://www.inf.uniroma3.it/tech-rep/inf-8-96.ps)
     
  11. G. Di Battista, R. Tamassia, "On-Line Planarity Testing", SIAM Journal on Computing, vol. 25, no. 5, pp. 956-957 (1996).

    12. (see also Technical Report CS-89-31, Dept. Computer Science, Brown Univ., 1989. http://www.cs.brown.edu/publications/techreports/reports/CS-89-31.html)
     
  12. G.Di Battista, R.Tamassia, "On-line Maintenance of Triconnected Components with SPQR Trees", Algorithmica, vol. 15, pages 302-318 (1996).

    13.  
  13. G. Di Battista, W. Lenhart and G. Liotta, "Proximity Drawability: a Survey'', Graph Drawing, Proc. of the DIMACS International Workshop GD'94, New Jersey USA, October 1994, Lecture Notes in Computer Science LNCS 894, R. Tamassia and I.G. Tollis eds., Springer-Verlag, 1995, pp. 328-339.

    14.  
  14. G. Di Battista, R. Tamassia, and L. Vismara, "On-Line Convex Planarity Testing", Graph-Theoretic Concepts in Computer Science (Proc. Int. Workshop WG '94), Lecture Notes in Computer Science, vol. 903, Springer-Verlag, pp. 242-255 (1995). (see also Technical Report 2-95, Dipartimento di Informatica e Automazione, Universita' di Roma Tre, Italy, 1995. http://www.inf.uniroma3.it/tech-rep/inf-2-95.ps)

    15.  
  15. P.Bertolazzi, G.Di Battista, G.Liotta "Parametric Graph Drawing", IEEE Transactions on Software Engineering, vol. 21, no. 8, pp. 662-673, 1995.

    16.  
  16. G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari and F. Vargiu, "An experimental comparison of three graph drawing algorithms", in Proc. 11th Annu. ACM Sympos. Comput. Geom., pages 306-315, 1995.

    17.  
  17. G. Di Battista and G. Liotta, "Computing Proximity Drawings of Trees in the 3-dimensional Space", in Proc. 4th Workshop on Algorithms and Data Structures, Kingston, Canada, August 1995, S.G.Akl, F.Dehne, J.Sack, N.Santoro (eds.), Lecture Notes in Computer Science, Springer Verlag, pp.239-250, 1995.

    18.  
  18. R. F. Cohen, G. Di Battista, R. Tamassia, and I. G. Tollis, "Dynamic graph drawings: Trees, series-parallel digraphs, and planar ST-digraphs", SIAM J. Comput., 24(5): 970-1001, 1995.

    19.  
  19. G. Di Battista, G. Liotta, F. Vargiu, "Diagram Server", Journal of Visual Languages and Computing (special issue on Graph Visualization), I. F. Cruz and P. Eades, editors), 6(3), 1995.

    20.  
  20. G. Di Battista, P. Eades, R. Tamassia, I.G. Tollis, "Algorithms for Automatic Drawing Graphs: an Annotated Bibliography'', Computational Geometry: Theory and Applications, vol. 4, pages 235-282, 1994.

    21.  
  21. P. Bertolazzi, R. F. Cohen, G. Di Battista, R. Tamassia and I. G. Tollis, "How to Draw a Series-Parallel Digraph", International Journal of Computational Geometry and Applications, vol. 4, no. 4 pp. 385-402 (1994).

    22.  
  22. P. Bertolazzi, G. Di Battista, G. Liotta, C. Mannino, "Upward Drawings of Triconnected Digraphs", Algorithmica, vol. 6, no. 12, pages 476-497, Springer-Verlag (1994).

    23.  
  23. G. Di Battista, G. Liotta and F. Vargiu, "Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs", Proc. Workshop Algorithms Data Struct., Vol 709 of Lecture Notes in Computer Science, pages 151-162. Springer-Verlag, 1993.

    24.  
  24. G. Di Battista and L. Vismara, "Angles of Planar Triangular Graphs", Proc. ACM Symposium on Theory of Computing, 1993, pages 431-437.

    25.  
  25. P. Bertolazzi, G. Di Battista, C. Mannino and R. Tamassia, "Optimal Upward Planarity Testing of Single-Source Digraphs", Proc. European Symp. on Algorithms (ESA '93), Lecture Notes in Computer Science, vol. 726, Springer-Verlag, pp. 37-48 (1993).

    26.  
  26. R.F. Cohen, G. Di Battista, A. Kanevsky and R. Tamassia, "Reinventing the Wheel: an Optimal Data Structure for Connectivity Queries", in Proc. 25th ACM Symp. on Theory of Computing, pp. 194-200 (1993).

    27.  
  27. G. Di Battista, R. Tamassia and I. G. Tollis, "Area Requirement and Symmetry Display of Planar Upward Drawings", Discrete & Computational Geometry, vol. 7(4), pp. 381-401 (1992).

    28.  
  28. P. Bertolazzi, R. F. Cohen, G. Di Battista, R. Tamassia and I. G. Tollis, "How to Draw a Series-Parallel Digraph", Algorithm Theory (Proc. SWAT), Lecture Notes in Computer Science, vol. 621, pp. 272-283 (1992).

    29.  
  29. G. Di Battista, G. Liotta, M. Strani, F. Vargiu, "Diagram Services for Diagram Managing Systems", Proc. Workshop on Softaware Evolution, pp. 87-101, Bari, March 23 1992 (invited lecture).

    30.  
  30. G. Di Battista, R. Tamassia and I. G. Tollis, "Constrained Visibility Representations of Graphs", Information Processing Letters, vol. 41, pp. 1-7 (1992).

    31.  
  31. R. F. Cohen, G. Di Battista, R. Tamassia, I. G. Tollis and P. Bertolazzi, "A Framework for Dynamic Graph Drawing", in Proc. ACM Symp. on Computational Geometry, pp. 261-270 (1992).

    32. (see also Technical Report CS-92-34, Dept. Computer Science, Brown Univ., 1992. http://www.cs.brown.edu/publications/techreports/reports/CS-92-34.html)
     
  32. A. Kanevsky, R. Tamassia, G. Di Battista, and J. Chen, "On-Line Maintenance of the Four-Connected Components of a Graph", in Proc. 32th IEEE Symp. on Foundations of Computer Science, pp. 793-801 (1991).

    33.  
  33. G. Di Battista, A. Giammarco, G. Santucci and R. Tamassia, "The Architecture of Diagram Server", in Proc. IEEE Workshop on Visual Languages (VL'90), pp. 60-65 (1990).

    34.  
  34. G. Di Battista and R. Tamassia, "On-Line Graph Algorithms with SPQR-Trees", Automata, Languages and Programming (Proc. 17th ICALP), Lecture Notes in Computer Science, vol. 442, pp. 598-611 (1990).

    35.  
  35. G. Di Battista, H. Kangassalo, and R. Tamassia, "Definition Libraries for Conceptual Modelling" Data & Knowledge Engineering, vol. 4, pp. 245-260 (1989).

    36.  
  36. G. Di Battista and R. Tamassia, "Incremental Planarity Testing", in Proc. 30th IEEE Symp. on Foundations of Computer Science, pp. 436-441 (1989).

    37.  
  37. G. Di Battista, E. Pietrosanti, R. Tamassia and I. G. Tollis, "Automatic Layout of PERT Diagrams with XPERT", in Proc. IEEE Workshop on Visual Languages (VL'89), pp. 171-176 (1989).

    38.  
  38. G. Di Battista, E. Pietrosanti, R. Tamassia and I.G. Tollis, "XPERT: A Graphic Tool for Project Management", in Proc. Int. Workshop on Computer-Aided Software Engineering (CASE '89), pp. 151-168 (1989).

    39.  
  39. G. Di Battista, R. Tamassia and I.G. Tollis, "Area Requirement and Symmetry Display in Drawing Graphs", in Proc. ACM Symp. on Computational Geometry, pp. 51-60 (1989).

    40.  
  40. P. Bertolazzi, G. Di Battista, C. Mannino, and R. Tamassia, "Optimal Upward Planarity Testing of Single-Source Digraphs", SIAM Journal on Computing, vol. 27, no. 1 (1988). (see also Technical Report CS-94-46, Dept. of Computer Science, Brown Univ., 1994. http://www.cs.brown.edu/publications/techreports/reports/CS-94-46.html)

    41.  
  41. G. Di Battista and R. Tamassia, "Algorithms for Plane Representations of Acyclic Digraphs", Theoretical Computer Science, vol. 61, pp. 175-198 (1988).

    42.  
  42. R. Tamassia, G. Di Battista, and C. Batini, "Automatic Graph Drawing and Readability of Diagrams", IEEE Transactions on Systems, Man and Cybernetics, vol. SMC18(1), pp. 61-79 (1988).

    43.  
  43. G. Di Battista and R. Tamassia, "Upward Drawings of Acyclic Digraphs", Graph-Theoretic Concepts in Computer Science (Proc. Int. Workshop WG '87, Kloster Banz, June 1987), pp. 121-133 in Lecture Notes in Computer Science, vol. 314, Springer-Verlag, (1988).

    44.  
  44. G. Di Battista and R. Tamassia, "An Integrated Graphic System for Designing and Accessing Statistical Data Bases", in Proc. 7th Symp. on Computational Statistics (COMPSTAT 1986), pp. 231-236 Physica-Verlag, (1986).

    45.  
  45. C. Batini, P. Brunetti, G. Di Battista, P. Naggar, E. Nardelli, G. Richelli and R. Tamassia, "An Automatic Layout Facility and its Applications", in Proc. Int. Workshop on Software Engineering Environment, pp. 139-157 China Academic Publishers, (1986). (Invited paper.)

    46.  
  46. G. Di Battista and R. Tamassia, "Uno Strumento User-Friendly per il Progetto di Basi di Dati Statistiche", Atti Quarto Convegno Nazionale Progetto Finalizzato Trasporti (Torino, Novembre 1986), pp. 619-634 Consiglio Nazionale delle Ricerche, (1986).

    47.  
  47. C. Batini, P. Brunetti, G. Di Battista, P. Naggar, E. Nardelli, G. Richelli, and R. Tamassia, "GIOTTO: a Graphic Layout Tool for Information System Diagrams", in Proc. ISETT, (1986).
Click here for comments or suggestions about this page

Back (Research Groups)