next up previous
Next: Appendix A Up: thesis Previous: Further Work

Bibliography

1
Colin Ware, Helen Purchase, Linda Colpoys, Matthew McGill.
Cognitive Measurements of Graph Aesthetics.
Information Visualization, 1 Issue 2:103-110, 2002.

2
Dawn G. Gregg and Steven Walczak.
Adaptive Web Information Extraction.
Communications of the ACM, 49(5), May 2006.

3
Emden R. Gasner, Yehuda Koren, Stephen North.
Graph Drawing by Stress Majorization.
Proc. 12th Int. Sypm. Graph Drawing, pages 239-250, 2004.

4
J. D. Cohen.
Drawing Graphs to Convey Proximity: An Incremental Arrangement Method.
ACM Transactions of Computer Human Interaction, 4:197-229, 1997.

5
John Ellson et al.
Graphviz and Dynagraph - Static and Dynamic Graph Drawing Tools.
Graph Drawing Software, 2004.

6
Jürgen Branke.
9. Dynamic Graph Drawing.
Lecture Notes in Computer Science, 2025:228, Jan 2001.

7
K. Misue, P. Eades, W. Lai, K. Sugiyama.
Layout Adjustment and the Mental Map.
Journal of Visual Languages and Computing, 6:183-210, 1996.

8
K. Sugiyama, S. Tagawa, and M. Toda.
Methods for Visual Understanding of Hierarchical Systems.
IEEE Transactions on Systems, Man, and Cybernetics, 1981.

9
Kathy Ryall, Joe Marks, Stuart Shieber.
An Interactive Constraint Based System for Drawing Graphs.
ACM Symposium on User Interface Software and Technology, pages 97-104, 1997.

10
L.A. Rowe, M. Davies, E. Messinger, C. Meyer, C. Spirakis, A. Tuan.
A Browser for Directed Graphs.
Software Pract. Exper., 17:61-76, 1987.

11
Lynne E. Parker.
CS302 Lecture notes Topological Sort / Cycle Detection.
http://www.cs.utk.edu/~ parker/Courses/CS302-fall05/Notes/GraphIntro/, 2005.

12
Mark Allen Weiss.
Data Structures and Algorithm Analysis in C.
Addison Wesley, 2nd edition, 1996.

13
Michael Jünger, Petra Mutzel.
Technical Foundations.
Graph Drawing Software, 2004.

14
Michael R. Garey and David S. Johnson.
Computers and Intractability: A guide to the theory of NP-Completeness.
W.H.Freeman and Company, 1979.

15
Michael T. Goodrich, Robert Tamassia.
Data Structures and Algorithms in Java.
John Wiley and Sons, 1998.

16
Michael Wybrow.
Dunnart Diagram Editor.
http://www.csse.monash.edu.au/~ mwybrow/dunnart/.

17
Oliver Bastert & Christian Matuszewski.
5. Layered Drawings of Digraphs.
Lecture Notes in Computer Science, 2025:87, Jan 2001.

18
Peter Eades, Xuemin Lin.
A Heuristic for the Feedback Arc Set Problem.
Australasian Journal of Combinatorics, 12:15-25, 1995.

19
RM Karp.
Reducibility among combinatorial problems.
Proc. Sympos. IBM Thomas J Watson Research Center, 1972.

20
T. Fruchterman, E. Reingold.
Graph Drawing by Force Directed Placement.
Software Practise and Experience, 21(11), 1991.

21
Tarjan, R.
Depth first search and linear graph algorithms.
SIAM Journal on computing, 1:146-160, 1972.

22
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein.
Introduction to Algorithms.
The MIT Press, 2nd edition, 2001.

23
Tim Dwyer, Yehuda Koren and Kim Marriott.
Dig-CoLa: Directed Graph Layout through Constrained Energy Minimization.
IEEE Symposium on Information Visualization, pages 65-72, 2005.

24
Tim Dwyer, Yehuda Koren and Kim Marriott.
IPSep-CoLa: An Incremental Procedure for Seperation Constraint Layout of Graphs.
2006.

25
Tomihisa Kamada, Satoru Kawai.
An Algorithm for Drawing General Undirected Graphs.
Information Processing Letters, 31:7-15, 1988.

26
Ulrik Brandes.
4. Drawing on Physical Analogies.
Lecture Notes in Computer Science, 2005:71, Jan 2001.



2006-11-07