Literatur: Graphenzeichnen
- Hinweis: Die meisten Artikel auf „springerlink.com“ und „acm.org“ sind vom Campus der Universität einsehbar.
- Springembedder
- U. Brandes. Drawing on Physical Analogies in: M. Kaufmann, D. Wagner (Eds.) Drawing Graphs - Methods and Models, LNCS 2025, p. 71-86, Springer, 2001.
- P. Eades. A Heuristic for Graph Drawing in: Congressus Numerantium, 42:149-160, 1984.
- T. Fruchterman, E. Reingold. Graph Drawing by Force-Directed Placement in: Software – Practice & Experience 21(11):1129-1164, John Wiley & Sons, 1991.
- A. Frick, A. Ludwig, H. Mehldau. A Fast Adaptive Layout Algorithm for Undirected Graphs, in: R. Tamassia, I. Tollis (Eds.) Proc. DIMACS International Workshop on Graph Drawing (GD 1994), LNCS 894, , Springer, 1994.
- P. Gajer, S. Kobourov, GRIP: Graph Drawing with Intelligent Placement, in: Journal of Graph Algorithms and Applications, 6(3):203-224, 2002.
- C. Walshaw, A Multilevel Algorithm for Force-Directed Graph-Drawing, in: Journal of Graph Algorithms and Applications, 7(3):253-285, 2003.
- J. Barnes, P. Hut. A hierarchical O(N log N) force-calculation algorithm, in: Nature, 324:446-449, 1986.
- D. Tunkelang. JIGGLE: Java Interactive General Graph Layout Environment, S.H. Whitesides (Eds.) Proc. 6th International Symposium on Graph Drawing (GD 98), LNCS 1547, p. 413-422, Springer, 1998.
- Flussmethoden
- A. Garg and R. Tamassia. Planar drawings and angular resolution: Algorithms and bounds. In Proc. 2nd Annual European Symposia on Algorithms (ESA '94), LNCS 855, pages 12-23. Springer-Verlag, 1994. Signatur (Info-Bib): 1994.Utr(18964).
- G. Di Battista and L. Vismara. Angles of Planar Triangular Graphs. In Proc. STOC '93, pages 431-437, 1993.
- S. Malitz and A. Papakostas. On the angular resolution of planar graphs. In SIAM Journal on Discrete Mathematics 7(2), pages 172-183, 1994. Signatur (Uni-Bib): ZA 8162 / ZL.
- R. Tamassia. On embedding a graph in the grid with the minimum number of bends. In SIAM Journal on Computing 16(3), pages 421-444, 1987. Signatur (Info-Bib): Z123.
- A. Garg and R. Tamassia. A new minimum cost flow algorithm with applications to graph drawing. In Proc. of Graph Drawing 1996 (GD 96), LNCS 1190, pages 201-226, 1997. Signatur (Info-Bib): 1996.Ber(22459).
- Hans L. Bodlaender and Gerard Tel. Rectilinear graphs and angular resolution.
- Teile und Herrsche
- Seok-Hee Hong, Peter Eades, Aaron Quigley and Sang-Ho Lee, Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensions, Proceedings of the 6th Symp. on Graph Drawing '98, Lecture Notes in Comp uter Science, Springer, Montreal, Canada, 1998.
- Inkrementelle Konstruktion
- Ulrik Brandes, Eager st-Ordering . Proc. 10th Europ. Symp. Algorithms (ESA '02). LNCS 2461, pp. 247-256. Springer 2002.
- Planare Graphen
- Ashim Garg und Roberto Tamassia, Upward planarity testing. Order (12), pp. 109-133, 1995.
- Lagenlayouts
- Oliver Bastert, Christian Matuszewski, Layered drawings of digraphs. In: Michael Kaufmann, Dorothea Wagner (Eds.), Drawing Graphs - Methods and Models, LNCS 2025, 2001, pages 87-120. Signatur (Info-Bib): D.Dra(34753)
- Kozo Sugiyama, Shojiro Tagawa, and Mitsuhiko Toda, Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man, and Cybernetics, 11(2), pages 109-125, 1981.
- Peter Eades and Kozo Sugiyama, How to draw a directed graph. In Journal of Information Processing, 13:4, pages 424-437, 1990.