Graph drawing and information visualization

Biedl, T. and Kant, G. 1994. A Better Heuristic for Orthogonal Graph Drawings Proceedings of ESA '94, Lecture Notes in Comp. Sci. 855, Springer-Verlag, pp. 124-135.

Brandenburg, F.J., Editor, 1996. Graph Drawing: Proceedings of GD '95, Lecture Notes in Comp. Sci. 1027, Springer-Verlag.

Di Battista, G., Eades, P., Tamassia, R., and Tollis, I.G., 1994. Algorithms for Drawing Graphs: an Annotated Bibliography, Computational Geometry: Theory and Applications, vol. 4 no. 5, pp. 235-282. Latest version.

Di Battista, G., Garg, A., Liotta, G., Tamassia, R., Tassinari, E., and Vargiu, F., 1995. An Experimental Comparison of Three Graph Drawing Algorithms, Proceedings of ACM Symp. on Computational Geometry, pp. 306-315. A new version of the paper containing the four algorithms can be found here.

Di Battista, G., Garg, A., Liotta, G., Parise, A., Tamassia, R., Tassinari, E., Vargiu, F., and Vismara, L., 1997. Drawing Directed Graphs: An Experimental Study, Graph Drawing: Proceedings of GD '96, Lecture Notes in Comp. Sci., North, S., Editor, Springer-Verlag, (to appear). Also available here.

Di Battista, G., Liotta, G., and Vargiu, F., 1993. Spirality of Orthogonal Representations and Optimal Drawings of Series-Parallel Graphs and $3$-Planar Graphs, Proceedings WADS'93, Lecture Notes in Comp. Sci. 709, pp. 151- -162.

Eades, P., 1984. A Heuristic for Graph Drawing Congressus Numerantium, vol. 42, pp. 149-160.

Gansner, E.R., Koutsofios, E., North, S.C. and Vo, K.P. 1993. A Technique for Drawing Directed Graphs, IEEE Trans. on Software Engineering, vol. 19, no. 3, pp. 214-230.

Gansner, E.R., North, S.C. and Vo, K.P. 1988. DAG -- A Program that Draws Directed Graphs, Software Practice and Experience, vol. 18, no. 11, pp. 1047-1062.

Garg, A., and Tamassia, R., 1995. On the Computational Complexity of Upward and Rectilinear Planarity Testing, Proceedings of GD '94, Lecture Notes in Comp. Sci. 894, Tamassia, R. and Tollis, I.G., Editors, Springer-Verlag, pp. 286-297.

North, S., Editor, Graph Drawing: Proceedings of GD '96, Lecture Notes in Comp. Sci., Springer-Verlag, (to appear).

Papakostas, A., Six, J., and Tollis, I.G., 1997. Experimental and Theoretical Results in Interactive Orthogonal Graph Drawing, Graph Drawing: Proceedings of GD '96, Lecture Notes in Comp. Sci., North, S., Editor, Springer- Verlag, (to appear). Also available here.

Papakostas, A., and Tollis, I.G., 1995. Improved Algorithms and Bounds for Orthogonal Drawings, Graph Drawing: Proceedings of GD '94, Lecture Notes in Comp. Sci. 894, Tamassia, R. and Tollis, I.G., Editors, Springer-Verlag, pp. 40-51.

Papakostas, A., and Tollis, I.G., 1996. Issues in Interactive Orthogonal Graph Drawing, Graph Drawing: Proceedings of GD '95, Lecture Notes in Comp. Sci. 1027, Brandenburg, F.J., Editor, Springer-Verlag, pp. 419- 430. Also available here.

Papakostas, A., and Tollis, I.G., 1997. A Pairing Technique for Area-Efficient Orthogonal Drawings, Graph Drawing: Proceedings of GD '96, Lecture Notes in Comp. Sci., North, S., Editor, Springer-Verlag, (to appear). Also available here.

Sugiyama, K., Tagawa, S., and Toda, M., 1981. Methods for Visual Understanding of Hierarchical Systems, IEEE Trans. on Systems, Man, and Cybernetics, vol. SMC-11, no. 2, pp. 109-125.

Tamassia, R., 1987. On Embedding a Graph in the Grid with the Minimum Number of Bends, SIAM J. Computing, vol. 16, no. 3, pp. 421-444.

R. Tamassia. Graph drawing, In Eli Goodman and Joseph O'Rourke, editors, Handbook of Discrete and Computational, Geometry. CRC Press. to appear. Also available here.

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

Tamassia, R. and Tollis, I.G., Editors, 1995. Graph Drawing: Proceedings of GD '94, Lecture Notes in Comp. Sci. 894, Springer-Verlag.

Tamassia, R. and Tollis, I.G., 1989. Planar Grid Embedding in Linear Time, IEEE Trans. on Circuits and Systems, vol. CAS-36, no. 9, pp. 1230-1234.

Tamassia, R. and Tollis, I.G., Vitter, J.S., 1991. Lower Bounds for Planar Orthogonal Drawings of Graphs, Information Processing Letters, vol. 39, pp. 35-40.