Recent Papers

Roberto Tamassia

For a complete list of publications, see my Curriculum Vitae.

Bibliography

1

R. Tamassia and B. Cantrill.
Data structures.
In A. B. Tucker Jr., editor, Handbook of Computer Science and Engineering, pages 86-110. CRC Press, 1997.

2

R. Tamassia.
Graph drawing.
In Jacob E. Goodman and Joseph O'Rourke, editors, CRC Handbook of Discrete and Computational Geometry. CRC Press, 1997.

3

Y.-J. Chiang and R. Tamassia.
Optimal shortest path and minimum-link path queries between two convex polygons inside a simple polygonal obstacle.
Internat. J. Comput. Geom. Appl.
to appear.

4

A. Garg and R. Tamassia.
A new minimum cost flow algorithm with applications to graph drawing.
In S. C. North, editor, Graph Drawing (Proc. GD '96), Lecture Notes Comput. Sci. Springer-Verlag, 1997.

5

A. Garg and R. Tamassia.
GIOTTO3D: A system for visualizing hierarchical structures in 3D.
In S. North, editor, Graph Drawing (Proc. GD '96), Lecture Notes Comput. Sci. Springer-Verlag, 1997.
to appear.

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.
to appear.

7

T. Chan, M. T. Goodrich, S. R. Kosaraju, and R. Tamassia.
Optimizing area and aspect ratio in straight-line orthogonal tree drawings,.
In S. North, editor, Graph Drawing (Proc. GD '96), Lecture Notes Comput. Sci. Springer-Verlag, 1997.
to appear.

8

S. Bridgeman, A. Garg, and R. Tamassia.
A graph drawing and translation service on the WWW.
In S. C. North, editor, Graph Drawing (Proc. GD '96), Lecture Notes Comput. Sci. Springer-Verlag, 1997.

9

R. Tamassia.
Data structures.
ACM Comput. Surv., 28(1):23-26, 1996.

10

G. Liotta, R. Tamassia, I. G. Tollis, and P. Vocca.
Area requirement of Gabriel drawings.
Technical Report CS-96-29, Center for Geometric Computing, Dept. Computer Science, Brown Univ., 1996.

11

Giuseppe Liotta, Franco P. Preparata, and Roberto Tamassia.
Robust proximity queries in implicit Voronoi diagrams.
Technical Report CS-96-16, Center for Geometric Computing, Comput. Sci. Dept., Brown Univ., Providence, RI, 1996.

12

G. Kant, G. Liotta, R. Tamassia, and I. G. Tollis.
Visibility representations of trees.
Technical Report CS-96-23, Center for Geometric Computing, Dept. Computer Science, Brown Univ., 1996.

13

A. Garg, R. Tamassia, and P. Vocca.
Drawing with colors.
In Proc. 4th Annu. European Sympos. Algorithms, volume 1136 of Lecture Notes Comput. Sci., pages 12-26. Springer-Verlag, 1996.

14

A. Garg, M. T. Goodrich, and R. Tamassia.
Planar upward tree drawings with optimal area.
Internat. J. Comput. Geom. Appl., 6:333-356, 1996.

15

P. Eades, X. Lin, and R. Tamassia.
An algorithm for drawing a hierarchical graph.
Internat. J. Comput. Geom. Appl., 6:145-156, 1996.

16

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.

17

G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu.
An experimental comparison of four graph drawing algorithms.
Comput. Geom. Theory Appl.
to appear.

18

G. Di Battista, A. Garg, G. Liotta, A. Parise, R. Tamassia, E. Tassinari, F. Vargiu, and L. Vismara.
Drawing directed graphs: an experimental study,.
Technical Report CS-96-24, Center for Geometric Computing, Dept. Computer Science, Brown Univ., 1996.

19

Y.-J. Chiang, F. P. Preparata, and R. Tamassia.
A unified approach to dynamic point location, ray shooting, and shortest paths in planar maps.
SIAM J. Comput., 25:207-233, 1996.

20

Marek Chrobak, Michael T. Goodrich, and Roberto Tamassia.
Convex drawings of graphs in two and three dimensions.
In Proc. 12th Annu. ACM Sympos. Comput. Geom., pages 319-328, 1996.

21

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.

22

J. E. Baker, I. F. Cruz, G. Liotta, and R. Tamassia.
The Mocha algorithm animation system.
In Proc. Int. Workshop on Advanced Visual Interfaces, pages 248-250, 1996.

23

James E. Baker, Isabel F. Cruz, Giuseppe Liotta, and Roberto Tamassia.
Animating geometric algorithms over the Web.
In Proc. 12th Annu. ACM Sympos. Comput. Geom., pages C3-C4, 1996.

24

J. E. Baker, I. F. Cruz, G. Liotta, and R. Tamassia.
Algorithm animation over the World Wide Web.
In Proc. Int. Workshop on Advanced Visual Interfaces, pages 203-212, 1996.

25

A. Garg and R. Tamassia.
Upward planarity testing.
Order, 12:109-133, 1995.

26

A. Garg and R. Tamassia.
On the computational complexity of upward and rectilinear planarity testing.
In R. Tamassia and I. G. Tollis, editors, Graph Drawing (Proc. GD '94), volume 894 of Lecture Notes Comput. Sci., pages 286-297. Springer-Verlag, 1995.

27

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.

28

R. F. Cohen and R. Tamassia.
Dynamic expression trees.
Algorithmica, 13:245-265, 1995.

29

Y.-J. Chiang, M. T. Goodrich, E. F. Grove, R. Tamassia, D. E. Vengroff, and J. S. Vitter.
External-memory graph algorithms.
In Proc. 6th ACM-SIAM Sympos. Discrete Algorithms, pages 139-149, 1995.

30

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.

31

J. E. Baker, I. F. Cruz, G. Liotta, and R. Tamassia.
A new model for algorithm animation over the WWW.
ACM Comput. Surv., 27(4):568-572, 1995.

32

A. Garg and R. Tamassia.
Advances in graph drawing.
In Algorithms and Complexity (Proc. CIAC' 94), volume 778 of Lecture Notes Comput. Sci., pages 12-21. Springer-Verlag, 1994.