Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Booktitle=Proceedings of the Symposium on Graph Drawing, GD'95 (Passau, Germany, September 20-22, 1995)

• Drawing high degree graphs with low bend numbers
  Ulrich Föss̈meier, Michael Kaufmann
  Lecture Notes in Computer Science 1027, 1996, pp. 254-266
• The drawing of configurations
  Harald Gropp
  Lecture Notes in Computer Science 1027, 1996, pp. 267-276
• Upward drawings on planes and spheres
  S. Mehdi Hashemi, Andrzej Kisielewicz, Ivan Rival
  Lecture Notes in Computer Science 1027, 1996, pp. 277-286
• Grid embedding of 4-connected plane graphs
  Xin He
  Lecture Notes in Computer Science 1027, 1996, pp. 287-299
• Recognizing leveled-planar dags in linear time
  Lenwood S. Heath, Sriram V. Pemmaraju
  Lecture Notes in Computer Science 1027, 1996, pp. 300-311
• Contact graphs of curves
  Petr Hlinȇný
  Lecture Notes in Computer Science 1027, 1996, pp. 312-323
• On representations of some thickness-two graphs
  Joan P. Hutchinson, Thomas Shermer, Andrew Vince
  Lecture Notes in Computer Science 1027, 1996, pp. 324-332
• Drawing force-directed graphs using Optigraph
  Jovanna Ignatowicz
  Lecture Notes in Computer Science 1027, 1996, pp. 333-336
• Exact and heuristic algorithms for 2-layer straightline crossing minimization
  Michael Jünger, Petra Mutzel
  Lecture Notes in Computer Science 1027, 1996, pp. 337-348
• Constraint-based spring-model algorithm for graph layout
  Thomas Kamps, Joerg Kleinz, John Read
  Lecture Notes in Computer Science 1027, 1996, pp. 349-360
• Layout algorithms of graph-like diagrams for GRADE windows graphic editors
  Paulis Ķikusts, Pēteris Ruc̑evskis
  Lecture Notes in Computer Science 1027, 1996, pp. 361-364
• Grid intersection and box intersection graphs on surfaces
  Jan Kratochvil, Teresa Przytycka
  Lecture Notes in Computer Science 1027, 1996, pp. 365-372
• How to draw outerplanar minimum weight triangulations
  William Lenhart, Giuseppe Liotta
  Lecture Notes in Computer Science 1027, 1996, pp. 373-384
• Portable graph layout and editing
  Brendan Madden, Patrick Madden, Steve Powers, Michael Himsolt
  Lecture Notes in Computer Science 1027, 1996, pp. 385-395
• A parallel simulated annealing algorithm for generating 3D layouts of undirected graphs
  Burkhard Monien, Friedhelm Ramme, Helmut Salmen
  Lecture Notes in Computer Science 1027, 1996, pp. 396-408
• Incremental layout in DynaDAG
  Stephen C. North
  Lecture Notes in Computer Science 1027, 1996, pp. 409-418
• Issues in interactive orthogonal graph drawing
  Achilleas Papakostas, Ioannis G. Tollis
  Lecture Notes in Computer Science 1027, 1996, pp. 419-430
• Automatic drawing of compound digraphs for a real-time power system simulator
  Gilles Paris
  Lecture Notes in Computer Science 1027, 1996, pp. 431-434
• Validating graph drawing aesthetics
  Helen C. Purchase, Robert F. Cohen, Murray James
  Lecture Notes in Computer Science 1027, 1996, pp. 435-446
• A fast heuristic for hierarchical Manhattan layout
  G. Sander
  Lecture Notes in Computer Science 1027, 1996, pp. 447-458
• CLaX - A visualized compiler
  G. Sander, M. Alt, C. Ferdinand, R. Wilhelm
  Lecture Notes in Computer Science 1027, 1996, pp. 459-462
• Crossing numbers of meshes
  Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrt'o
  Lecture Notes in Computer Science 1027, 1996, pp. 463-471
• Directed graphs drawing by clan-based decomposition
  Fwu-Shan Shieh, Carolyn L. McCreary
  Lecture Notes in Computer Science 1027, 1996, pp. 472-482
• TOSCANA management system for conceptual data
  Martin Skorsky
  Lecture Notes in Computer Science 1027, 1996, pp. 483-486
• Graph layout adjustment strategies
  Margaret-Anne D. Storey, Hansi A. Müller
  Lecture Notes in Computer Science 1027, 1996, pp. 487-499