References

1

C. Ahlberg and B. Schneiderman. Visual information seeking: Tight coupling of dynamic query filters with starfield displays. In Proc. ACM Conference on Human Factors in Computing Systems (CHI), pages 313-317, 1994.

2

B. Bederson, J. Hollan, K. Perlin, J. Meyer, D. Bacon, and G. Furnas. Pad++: A zoomable graphical sketchpad for exploring alternate interface physics. Journal of Visual Languages and Computing, 7:3-31, 1996.

3

P. Bertolazzi, G. Di Battista, G. Liotta, and C. Mannino. Upward drawings of triconnected digraphs. Algorithmica, 6(12):476-497, 1994.

4

P. Bertolazzi, G. Di Battista, C. Mannino, and R. Tamassia. Optimal upward planarity testing of single-source digraphs. In 1st Annual European Symposium on Algorithms (ESA '93), volume 726 of Lecture Notes in Computer Science, pages 37-48. Springer-Verlag, 1993.

5

T. Biedl and G. Kant. A better heuristic for orthogonal graph drawings. In Proc. 2nd Annu. European Sympos. Algorithms (ESA '94), volume 855 of Lecture Notes in Computer Science, pages 24-35. Springer-Verlag, 1994.

6

Franz J. Brandenburg, M. Himsolt, and Christoph Rohrer. An experimental comparison of force-directed and randomized graph drawing algorithms. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD '95), volume 1027 of Lecture Notes in Computer Science, pages 76-87. Springer-Verlag, 1996.

7

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 in Computer Science. Springer-Verlag, 1997.

8

M.H. Brown and M.A. Najork. Algorithm animation using 3D interactive graphics. In ACM Symp. on User Interface Software and Tech., pages 93-100, 1993.

9

S. Bryson, D. Bulterman, T. Catarci, W. Citrin, I. Cruz (editor), E. Glinert, J. Grudin, J. Hollan (editor), Y. Ioannidis, R. Jacob, B. John, D. Kurlander, B. Myers (editor), D. Olsen, R. Pausch, S. Shieber, B. Schneiderman, J. Stasko, G. Strong, and K. Wittenburg. Strategic directions in human computer interaction. ACM Computing Surveys, 28(4), December 1996. Also available at http://www.cs.cmu.edu/~bam/nsfworkshop/hcireport.html.

10

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 in Computer Science. Springer-Verlag, 1997. to appear.

11

M.C. Chuah, S.F. Roth, J. Mattis, and J. Kolojejchick. Sdm: Selective dynamic manipulation of visualizations. In Proc. ACM Symposium on User Interface Software and Technology (UIST), pages 36-42, 1995.

12

P. Crescenzi, G. Di Battista, and A. Piperno. A note on optimal area algorithms for upward drawings of binary trees. Comput. Geom. Theory Appl., 2:187-200, 1992.

13

I. F. Cruz. DOODLE: A visual language for object-oriented databases. In Proc. ACM SIGMOD, pages 71-80, 1992.

14

I. F. Cruz. Using a visual constraint language for data display specification. In P. C. Kanellakis, J.-L. Lassez, and V. Saraswat, editors, First Workshop on Principles and Practice of Constraint Programming, Newport, RI, April 1993.

15

I. F. Cruz and A. Garg. Drawing graphs by example efficiently: Trees and planar acyclic digraphs. In R. Tamassia and I. G. Tollis, editors, Graph Drawing (Proc. GD '94), volume 894 of Lecture Notes in Computer Science, pages 404-415. Springer-Verlag, 1995.

16

E. Dengler, M. Friedell, and J. Marks. Constraint-driven diagram layout. In Proc. IEEE Sympos. on Visual Languages (VL '93), pages 330-335, 1993.

17

G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: an annotated bibliography. Comput. Geom. Theory Appl., 4:235-282, 1994.

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,. In S. North, editor, Graph Drawing (Proc. GD '96), Lecture Notes in Computer Science. Springer-Verlag, 1997. to appear.

19

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.

20

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.

21

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

22

G. Di Battista, W. P. Liu, and I. Rival. Bipartite graphs upward drawings and planarity. Inform. Process. Lett., 36:317-322, 1990.

23

G. Di Battista and R. Tamassia. Algorithms for plane representations of acyclic digraphs. Theoret. Comput. Sci., 61:175-198, 1988.

24

G. Di Battista, R. Tamassia, and I. G. Tollis. Area requirement and symmetry display of planar upward drawings. Discrete Comput. Geom., 7:381-401, 1992.

25

P. D. Eades. Drawing free trees. Bulletin of the Institute for Combinatorics and its Applications, 5:10-36, 1992.

26

S.G. Eick and G.J. Wills. Navigating large networks with hierarchies. In Proc. IEEE Visualization '93, pages 204-211, 1993.

27

K. M. Fairchild, S. E. Poltrock, and G. W. Furnas. Semnet: Three-dimensional graphic representation of large knowledge bas es. In Cognitive Sc. and its Applns for Human-Computer Interaction, pages 201-233. Lawrence Erlbaum Assoc., 1988.

28

G. Furnas. Generalized fisheye views. In Proc. ACM Conf. on Human Factors in Computing Systems (CHI), 1986.

29

G. Furnas and J. Zacks. Multitrees: Enriching and resuing hierarchical structures. In Proc. ACM Conference on Human Factors in Computing Systems (CHI), pages 330-336, 1994.

30

A. Garg, M. T. Goodrich, and R. Tamassia. Area-efficient upward tree drawings. In Proc. 9th Annu. ACM Sympos. Comput. Geom., pages 359-368, 1993.

31

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

32

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 in Computer Science, pages 286-297. Springer-Verlag, 1995.

33

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

34

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 in Computer Science. Springer-Verlag, 1997. to appear.

35

M. Hasan, D. Vista, and A. Mendelzon. Visual Web surfing with HY+. In Proc. CASCON'95, 1995. Available from http://www.db.toronto.edu:8020.

36

Tyson R. Henry and Scott E. Hudson. Interactive graph layout. In Proc. ACM Symposium on User Interface Software and Technology (UIST), pages 55-64, 1991.

37

M. Himsolt. Comparing and evaluating layout algorithms within GraphEd. Journal of Visual Languages and Computing, 6(3):93-100, 1995.

38

E. Hutchins, J. Hollan, and D. Norman. Direct manipulation interfaces. In D. Norman and S. Draper, editors, User Centered System Design: New Perspectives on Human-Computer Interaction, pages 87-124. Lawrence Earlbaum Associates, Hillsdale New Jersey, 1986.

39

M. D. Hutton and A. Lubiw. Upward planar drawing of single source acyclic digraphs. In Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms, pages 203-211, 1991.

40

D. Jablonowsky and V. A. Guarna. GMB: A tool for manipulating and animating graph data structures. Softw. - Pract. Exp., 19(3):283-301, 1989.

41

S. Jones, P. Eades, A. Moran, N. Ward, G. Delott, and R. Tamassia. A note on planar graph drawing algorithms. Technical Report 216, Department of Computer Science, University of Queensland, 1991.

42

Michael Jünger and Petra Mutzel. Exact and heuristic algorithms for 2-layer straightline crossing minimization. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD '95), volume 1027 of Lecture Notes in Computer Science, pages 337-348. Springer-Verlag, 1996.

43

T. Kamada. On Visualization of Abstract Objects and Relations. PhD thesis, Department of Information Science, University of Tokyo, 1988.

44

D.A. Keim and H.P. Kriegel. Visdb: Database exploration using multidimensional visualization. Computer Graphics and Applications, pages 40-49, 1994.

45

H. Koike and H. Yoshihara. Fractal approaches for visualizing huge hierarchies. In Proc. IEEE Symposium on Visual Languages, 1993, pages 55-61, 1993.

46

C. Kosak, J. Marks, and S. Shieber. Automating the layout of network diagrams with specified visual organization. IEEE Trans. Syst. Man Cybern., 24(3):440-454, 1994.

47

E. Koutsofios and S. North. Drawing graphs with dot. Technical report, AT&T Bell Laboratories, Murray Hill, NJ., 1995. Available at http://www.research.att.com/dist/drawdag.

48

D. Kurlander and S. Feiner. A history-based macro by example system. In Proc. ACM Symposium on User Interface Software and Technology (UIST), pages 99-106, 1992.

49

J. Lamping, R. Rao, and P. Pirolli. A focus+context technique based on hyperbolic geometry for visualizing large hierarchies. In Proc. ACM Conf. on Human Factors in Computing Systems (CHI), 1995.

50

S. Mukherjea, J. Foley, and S. Hudson. Visualizing complex hypermedia networks through multiple hierarchical views. In Proc. ACM Conference on Human Factors in Computing Systems (CHI), 1995.

51

S. Mukherjea, K. Hirata, and Y. Hara. Visualizing the results of multimeda web search engines. In Proc. IEEE Visualization '96, 1996. to appear.

52

S. Mukherjee and J.D. Foley. Visualizing the World-Wide Web with navigational view builder. Computer Networks and ISDN System, Special Issue on the Third International Conference on the World-Wide Web, April 1995.

53

B. Myers. Demonstrational interfaces: a step beyond direct manipulation. In D. Diaper and N. Hammond, editors, People and Computers, volume VI. Cambridge University Press, Cambridge, 1990.

54

J. Nielsen. Multimedia and hypertext, the internet and beyond. In AP Professional, First Edition, 1995.

55

S. North. 5114 directed graphs, 1995. Manuscript. ftp.research.att.com/dist/drawdag/.

56

A. Papakostas, J. Six, and I. G. Tollis. Experimental and theoretical results in interactive orthogonal graph drawing. In S. C. North, editor, Graph Drawing (Proc. GD '96), Lecture Notes in Computer Science. Springer-Verlag, 1997. also available at http://wwwpub.utdallas.edu/~janet/papers.html.

57

A. Papakostas and I. G. Tollis. Improved algorithms and bounds for orthogonal drawings. In R. Tamassia and I. G. Tollis, editors, Graph Drawing (Proc. GD '94), volume 894 of Lecture Notes in Computer Science, pages 40-51. Springer-Verlag, 1995.

58

J.E. Pitkow and K.A. Bharat. Webviz: A tool for world wide web access log analysis. In Proc. First International World Wide Web Conference, 1994.

59

E. Reingold and J. Tilford. Tidier drawing of trees. IEEE Trans. Softw. Eng., SE-7(2):223-228, 1981.

60

S. P. Reiss. 3-D visualization of program information. Graph Drawing (Proc. GD '94). LNCS, 894:12-24, Springer-Verlag. 1995.

61

G. Robertson, S. Card, and J.D. Mackinlay. Information visualization using 3D interactive animation. Communications of the ACM, 36(4):57-71, 1993.

62

G. G. Robertson, J. D. Mackinlay, and S. K. Card. Cone trees: Animated 3D visualizations of hierarchical information. In Proc. CHI'91, pages 189-193.

63

M. Sarkar and M. Brown. Graphical fisheye views of graphs. In Proc. ACM Conf. on Human Factors in Computing Systems (CHI), pages 83-92, 1992.

64

B. Shneiderman. The future of interactive systems and the emergence of direct manipulation. Behavior and Information Technology, 1:237-256, 1982.

65

B. Shneiderman. Dynamic queries for visual information seeking. IEEE Software, 11(6):70-77, 1994.

66

R.L. Sollenberger and P. Milgram. The effects of stereoscopic and rotational displays in a three-dimensional path-tracing task. Human Factors, 35(3):483-500.

67

L. Spratt and A. Ambler. Using 3D tubes to solve the intersecting line representation problem. In Proc. IEEE Symposium on Visual Languages, 1994, pages 254-261.

68

K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical systems. IEEE Trans. Syst. Man Cybern., SMC-11(2):109-125, 1981.

69

R. Tamassia, G. Di Battista, and C. Batini. Automatic graph drawing and readability of diagrams. IEEE Trans. Syst. Man Cybern., SMC-18(1):61-79, 1988.

70

R. Tamassia and I. G. Tollis. Planar grid embedding in linear time. IEEE Trans. Circuits Syst., CAS-36(9):1230-1234, 1989.

71

C. Thomassen. Planar acyclic oriented graphs. Order, 5(4):349-361, 1989.

72

C. Ware and G. Franck. Evaluating stereo and motion cues for visualizing information nets in three dimensions. ACM Transactions on Graphics. to appear. http://www.omg.unb.ca/hci/projects/hci-gv3D.html.

73

C. Ware, D. Hui, and G. Franck. Visualizing object oriented software in three dimensions. In CASCON '93, pages 621-620, 1993. http://www.omg.unb.ca/hci/projects/hci-gv3D.html.

74

L. Weitzman and K. Wittenburg. Automatic generation of multimedia documents using relational grammars. In Proc. ACM MultiMedia '94, pages 254-261, 1995.

75

C. Williamson and B. Schneiderman. The dynamic homefinder: Evaluating dynamic queries in a real-estate information exploration system. In Proc. ACM SIGIR '92, pages 339-346, 1992.