References next up previous
Next: About this document Up: Graph Layout for Previous: Acknowledgments


Alt, M.; Aßmann, U.; Someren, H.: Compiler Phase Embedding with the CoSy Compiler Model, in Fritzson, P.A., ed.: Compiler Construction, Proc. 5th International Conference CC'94, Lecture Notes in Computer Science 786, pp. 278-293, Springer, 1994
Almasi, G.S.; Gottlieb, A.: Highly Parallel Computing, The Benjamin/Cummings Publishing Company, Inc., 1989
Bachl, W.; Brandenburg F.J.; Hickl T.: Hierarchical Graph Design Using HiGraD, Technical Report MIP 9405, Fakultät Mathematik und Informatik, University of Passau, Germany, 1994.
Brandenburg, F.J.; Himsolt, M.; Rohrer, C.: An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms, in [Br96], pp. 76-87, 1996
Batini, C.; Nardelli, E.; Tamassia, R.: A Layout Algorithm for Data Flow Diagrams, IEEE Trans. on Software Engineering, SE-12(4), pp. 538-546, 1986,
Boehm, W.; Prautzsch, H.: Numerical Methods, A.K. Peters, Vieweg, 1991.
Bräunl, T.; Parallele Programmierung, Eine Einführung, Vieweg, 1993.
Brandenburg, F.J.: Designing Graph Drawings by Layout Graph Grammars, in [TaTo95], pp. 416-427, 1995.
Brandenburg, F.J., ed.: Proc. Symposium on Graph Drawing, GD'95, Lecture Notes in Computer Science 1027, Springer, 1996
Carpano, M.J.: Automatic Display of Hierarchized Graphs for Computer Aided Decision Analysis, IEEE Trans. Sys., Man, and Cybernetics, SMC 10(11), pp. 705-715, 1980.
Carpendale, M.S.T.; Cowperthwaite, D.J.; Fracchia, F.D.; Shermer T.: Graph Folding: Extending Detail and Context Viewing into a Tool for Subgraph Comparisons, in [Br96], pp. 127-139, 1996
Davidson, R.; Harel, D.: Drawing Graphs Nicely Using Simulated Annealing, Technical Report CS89-13, Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot, Israel, 1989
Eades, P.: A Heuristic for Graph Drawing, Congressus Numerantium 41, pp. 149-160, 1984.
Eades, P.; Kelly, D.: Heuristics for Reducing Crossings in 2-Layered Networks, Ars Combinatorica 21-A, pp. 89-98, 1986.
Eades, P.; Sugiyama, K.: How to Draw a Directed Graph, Journal of Information Processing, 13 (4), pp. 424-437, 1990
Eades, P.; Wormald N.: The Median Heuristic for Drawing 2-Layers Networks, Technical Report 69, Department of Computer Science, University of Queensland, 1986
Frick, A.; Ludwig, A.; Mehldau, H.: A Fast Adaptive Layout Algorithm for Undirected Graphs, in [TaTo95], pp. 388-403, 1995
Formella, A.; Keller, J.: Generalized Fisheye Views of Graphs, in [Br96], pp. 242-253, 1996
Fößmeier, U.; Kaufmann, M.: Drawing High Degree Graphs with Low Bend Numbers, in [Br96], pp. 254-266, 1996
Fruchterman, T.M.J.; Reingold, E.M.: Graph Drawing by Force-Directed Placement, Software - Practice and Experience 21, pp. 1129-1164, 1991
Fröhlich, M,; Werner, M.: Das interaktive Graph Visualisierungssytem daVinci V1.2, Technical Report (in German), Fachbereich Mathematik und Informatik, University of Bremen, Germany, 1993
Furnas, G.W.: Generalized Fisheye Views, Proc. ACM SIGCHI'86, Conference on Human Factors in Computing Systems, pp. 16-23, 1986
Garey, M.R.; Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman & Co., San Francisco, 1979
Garey, M.R.; Johnson, D.S.: Crossing Number is NP-complete, SIAM Journal of Algebraic and Discrete Methods, 4(3), pp. 312-316 1983
Garg, A.; Tamassia, R.: On the Computational Complexity of Upward and Rectilinear Planarity Testing, Technical Report CS-94-10, Department of Computer Science, Brown University, 1994
Gansner, E.R.; Koutsofios, E.; North, S.C.; Vo, K.-P.: A Technique for Drawing Directed Graphs, IEEE Trans. on Software Engineering, 19(3), pp. 214-230, 1993
Green, T.R.; Petre, M.; Bellamy, R.K.E.: Comprehensibility of Visual and Textual Programs: A Test of Superlativism Against the Match-Mismatch Conjecture, Fourth Workshop on Empirical Studies of Programmers, pp. 121-146, 1991
Harel, D.; Sardas, M.: Randomized Graph Drawing with Heavy-Duty Preprocessing, Technical Report CS93-16, Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot, Israel, 1993
Henry, T.R.: Interactive Graph Layout: The Exploration of Large Graphs, Ph. D. Thesis, TR 92-03, Department of Computer Science, The University of Arizona, 1992
Himsolt, M.: GraphEd - A Graphical Platform for the Implementation of Graph Algorithms, in [TaTo95], pp. 182-193, 1995.
Hyrskykari, A.: Development of Program Visualization Systems, Report, Department of Computer Science, University of Tampere, Finland, presented at the 2nd Czech British Symposium of Visual Aspects of Man-Machine Systems, Praha, 1993
Johnson, D.: The NP-completeness column: An ongoing guide, Journal on Algorithms, 3(1), pp. 215-218, 1982
Jünger, M.; Mutzel, P.: Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization, in [Br96], pp. 337-348, 1996
Kamada, T.; Kawai, S.: An Algorithm for Drawing General Undirected Graphs, Information Processing Letters, 31, pp. 7-15, 1989.
Kaugars, K.; Reinfels, J.; Brazma A.: A Simple Algorithm for Drawing Large Graphs on Small Screens, in [TaTo95], pp. 278-281, 1995
Masui, T.: Graphic Object Layout with Interactive Genetic Algorithms, Proc. IEEE Workshop on Visual Languages, pp. 74-80, 1992
Mehlhorn, K.: Data Structures and Algorithms, Vol. 2: Graph Algorithms and NP-Completeness, Springer, 1984,
Misue, K.; Sugiyama K.: Multi-viewpoint Perspective Display Methods: Formulation and Application to Compound Graphs, Human Aspects in Computing, in Bullinger H.J., ed.: Proc. 4th Intern. Conf. on Human-Computer Interaction pp. 834-838, Elsevier, 1991
Madden, B.; Madden, P.; Powers, S.; Himsolt, M.: Portable Graph Layout and Editing, in [Br96], pp. 385-395, 1996
Mackinlay, J.D.; Robertson, G.G.; Card, A.K.: The Perspective Wall: Detail and Context Smoothly Integrated, in Proc. ACM SIGCHI'91, Conference on Human Factors in Computing Systems, pp. 173-179, 1991
McCreary C.L.; Shieh F.S.; Gill H.: CG: A Graph Drawing System Using Graph Grammar Parsing, in [TaTo95], pp. 270-273, 1995.
Noik, E. G.: Layout-independent Fisheye Views of Nested Graphs, Proc. IEEE Symposium on Visual Languages, pp. 336-341, 1993
Pazel, D.: A Graphical Interface for Evaluating a Genetic Algorithm for Graph Layout, Technical Report RC 14348, IBM T.J. Watson Research Center, 1989
Paulisch, F. N.; Tichy, W.F.: EDGE: An Extendible Graph Editor, Software - Practice and Experience 20 (S1), pp. 63-88, 1990
Protsko, L.B.; Sorenson, P.G.; Tremblay, J.P.; Schaefer, D.A.: Towards the Automatic Generation of Software Diagrams, IEEE Trans. on Software Engeneering, 17(1), pp. 10-21, 1991,
Quinn Jr., N. R.; Breuer, M. A.: A Force Directed Component Placement Procedure for Printed Circuit Boards, IEEE Trans. on Circuits and Systems, CAS-26(6), pp. 377-388, 1979.
Sander, G.: Graph Layout through the VCG Tool, Technical Report A03-94, FB 14 Informatik, University of Saarbrücken, Germany, 1994, an extended abstract is in [TaTo95], pp. 194-205, 1995.
Sander, G.: A Fast Heuristic for Hierarchical Manhattan Layout, in [Br96], pp. 447-458, 1996
Sander, G.: Visualisierungstechniken für den Compilerbau, Doctoral Thesis, to appear in German, FB 14 Informatik, University of Saarbrücken, Germany, 1996
Sarkar, M.; Brown, M. H.: Graphical Fisheye Views, Communications of the ACM, vol. 37, no. 12, pp. 73-84, 1994
Scott, A.: A Survey of Graph Drawing Systems, Technical Report 95-1 Department of Computer Science, University of Newcastle, Australia, 1995
Shieh F.-S.; McCreary C.L.: Directed Graphs Drawing by Clan-based Decomposition, in [Br96], pp. 472-482, 1996
Storey, M.D.; Müller, H.A.: Graph Layout Adjustment Strategies, in [Br96], pp. 487-499, 1996
Sugiyama, K.; Tagawa, S.; Toda, M.: Methods for Visual Understanding of Hierarchical Systems, IEEE Trans. Sys., Man, and Cybernetics, SMC 11(2), pp. 109-125, 1981.
Sugiyama K.; Misue K.: Visualization of Structural Information: Automatic Drawing of Compound Digraphs, IEEE Trans. Sys., Man, and Cybernetics, 21(4), pp. 876-892, 1991.
Sugiyama, K.; Misue, K.: Graph Drawing by Magnetic-Spring Model, Research Report ISIS-RR-94-14E, Inst. Social Information Science, Fujitsu Labs. Ltd., 1994
Sugiyama, K.; Misue, K.: A Simple and Unified Method for Drawing Graphs: Magnetic-Spring Algorithm, in [TaTo95], pp. 364-375, 1995
Tamassia, R.: On Embedding a Graph in the Grid with the Minimum Number of Bends, SIAM Journal of Computing, 16(3), pp. 421-444, 1987.
Tamassia, R., Tollis, I.G.: Planar Grid Embedding in Linear Time, IEEE Trans. on Circuits and Systems, 36(9), pp. 1230-1234, 1989.
Tamassia, R.; Tollis, I.G., eds.: Graph Drawing, Proc. DIMACS Intern. Workshop GD'94, Lecture Notes in Computer Science 894, Springer, 1995.
Tunkelang, D.: A Practical Approach to Drawing Undirected Graphs, Technical Report CMU-CS-94-161, School of Computer Science, Carnegie Mellon University, Pittsburgh, 1994
Warfield, J. N.: Crossing Theory and Hierarchy Mapping, IEEE Trans. Sys., Man, and Cybernetics, SMC 7(7), pp. 505-523, 1977.
Wilhelm, R.; Maurer, D.: Compiler Design, Addison Wesley, 1995
Woods, D.R.: Drawing Planar Graphs, Technical Report STAN-CS-82-943, Computer Science Department, Stanford University, 1982

Georg Sander
Thu Aug 1 15:27:34 PDT 1996