Conferences

[




• A. Garg and G. Liotta ``Almost Bend-Optimal Planar Orthogonal Drawings of Biconnected Degree-3 Planar Graphs in Quadratic Time'', Proc. Graph Drawing '99, Lecture Notes in Computer Science, Vol. 1731, Springer-Verlag, 1999, pp. 38-48.
• R.C. Chuang, A. Garg, X. He, M.Y. Kao and H. Lu, ``Compact Encoding of Planar Graphs via Canonical Orderings and Multiple Parentheses'', Proc. International Colloquium on Automata, Languages and Programming (ICALP), Lecture Notes in Computer Sciece, Vol. 1443, Springer, 1998, pp. 118-129.
• S. Bridgeman, J. Fanto, A. Garg, R. Tamassia, and L. Vismara, ``Interactive Giotto: An Algorithm for Interactive Orthogonal Graph Drawing'', Proc. Graph Drawing '97, Lecture Notes in Computer Science, Vol. 1190, Springer-Verlag, 1998, pp. 303-308.
• A. Garg and R. Tamassia, ``GIOTTO3D: A System for Visualizing Hierarchical Structures in 3D'', Proc. Graph Drawing '96, Lecture Notes in Computer Science, Vol. 1190, Springer-Verlag, 1997.
• S. Bridgeman, A. Garg, and R. Tamassia, ``A Graph Drawing and Translation Service on the WWW'', Proc. Graph Drawing '96, Lecture Notes in Computer Science, Vol. 1190, Springer-Verlag, 1997, pp. 45-52.

• A. Garg, R. Tamassia, and P. Vocca, ``Drawing with Colors'', Proc. 4th Annual European Symposium on Algorithms, 1996, Lecture Notes in Computer Science, Springer-Verlag, Vol. 1136, 1997, pp. 12-26.
• A. Garg and R. Tamassia, ``A New Minimum Cost Flow Algorithm with Applications to Graph Drawing'', Proc. Graph Drawing '96, Lecture Notes in Computer Science, Vol. 1190, Springer-Verlag, 1997, pp. 201-216.
• G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E.\ Tassinari, F. Vargiu, and L. Vismara, ``Drawing Directed Graphs: An Experimental Study'', Proc. Graph Drawing '96, Lecture Notes in Computer Science, Vol. 1190, Springer-Verlag, 1997, pp. 76-91.
• G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu, ``An Experimental Comparison of Three Graph Drawing Algorithms'', Proc. 11th ACM Symp. on Computational Geometry, 1995, pp. 306-315.
• A. Garg and R. Tamassia, ``On the Computational Complexity of Upward and Rectilinear Planarity Testing'', Proc. Graph Drawing '94, Lecture Notes in Computer Science, Vol. 894, Springer-Verlag, 1995, pp. 286-297. Also available as Technical Report No. CS-94-10, Dept. of Computer Science, Brown Univ., 1994.
• A. Garg, ``On Drawing Angle Graphs'', Proc. Graph Drawing '94, Lecture Notes in Computer Science, Vol. 894, Springer-Verlag, 1995, pp. 84-95.
• I. Cruz and A. Garg, ``Drawing Graphs by Example Efficiently: Trees and Planar Directed Acyclic Digraphs'', Proc. Graph Drawing '94, Lecture Notes in Computer Science, Vol. 894, Springer-Verlag, 1995, pp. 404-415.
• A. Garg and R. Tamassia, ``Planar Drawings and Angular Resolution: Algorithms and Bounds'', Proc. 2nd Annual European Symposium on Algorithms, 1994, Lecture Notes in Computer Science, Springer-Verlag, 1994, pp. 12-23.
• A. Garg and R. Tamassia, ``Advances in Graph Drawing'', Proc. Second Italian Conference on Algorithms and Complexity, 1994, Lecture Notes in Computer Science, Vol. 778, Springer-Verlag, 1994, pp. 12-21.
• A. Garg, M.T. Goodrich, and R. Tamassia, ``Area-Efficient Upward Tree Drawings,'' Proc. ACM Symp. on Computational Geometry, 1993, pp. 359-368.