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: Series=LNCS AND Volume=2265

• A fixed-parameter approach to two-layer planarization
  V. Dujmović, M. Fellows, M. Hallett, M. Kitching, Giuseppe Liotta, C. McCartin, N. Nishimura, P. Ragde, F. Rosamond, M. Suderman, S. Whitesides, David R. Wood
  Lecture Notes in Computer Science 2265, 2002, pp. 1-15
• How to layer a directed acyclic graph
  Patrick Healy, Nikola S. Nikolov
  Lecture Notes in Computer Science 2265, 2002, pp. 16-30
• Fast and simple horizontal coordinate assignment
  Ulrik Brandes, Boris Köpf
  Lecture Notes in Computer Science 2265, 2002, pp. 31-44
• Automated visualization of process diagrams
  Janet M. Six, Ioannis G. Tollis
  Lecture Notes in Computer Science 2265, 2002, pp. 45-59
• Planarization of clustered graphs
  Giuseppe di Battista, Walter Didimo, A. Marcandalli
  Lecture Notes in Computer Science 2265, 2002, pp. 60-74
• An algorithm for finding large induced planar subgraphs
  Keith Edwards, Graham Farr
  Lecture Notes in Computer Science 2265, 2002, pp. 75-83
• A characterization of DFS cotree critical graphs
  Hubert de Fraysseix, Patrice Ossona de Mendez
  Lecture Notes in Computer Science 2265, 2002, pp. 84-95
• An improved lower bound for crossing numbers
  Hristo Djidjev, Imrich Vrt'o
  Lecture Notes in Computer Science 2265, 2002, pp. 96-101
• Crossing-critical graphs and path-width
  Petr Hlinȇný
  Lecture Notes in Computer Science 2265, 2002, pp. 102-114
• One sided crossing minimization is NP-hard for sparse graphs
  Xavier Muñoz, W. Unger, Imrich Vrt'o
  Lecture Notes in Computer Science 2265, 2002, pp. 115-123
• Fast compaction for orthogonal drawings with vertices of prescribed size
  Markus Eiglsperger, Michael Kaufmann
  Lecture Notes in Computer Science 2265, 2002, pp. 124-138
• Labeling heuristics for orthogonal drawings
  Carla Binucci, Walter Didimo, Giuseppe Liotta, Maddalena Nonato
  Lecture Notes in Computer Science 2265, 2002, pp. 139-153
• Untangling a polygon
  János Pach, Gábor Tardos
  Lecture Notes in Computer Science 2265, 2002, pp. 154-161
• Drawing with fat edges
  Christian A. Duncan, Alon Efrat, Stephen G. Kobourov, Carola Wenk
  Lecture Notes in Computer Science 2265, 2002, pp. 162-177
• Detecting symmetries by branch & cut
  Christoph Buchheim, Michael Jünger
  Lecture Notes in Computer Science 2265, 2002, pp. 178-188
• Drawing graphs symmetrically in three dimensions
  Seok-Hee Hong
  Lecture Notes in Computer Science 2265, 2002, pp. 189-204
• User hints for directed graph drawing
  Hugo A.D. do Nascimento, Peter Eades
  Lecture Notes in Computer Science 2265, 2002, pp. 205-219
• Graph drawing in motion II
  Carsten Friedrich, Michael E. Houle
  Lecture Notes in Computer Science 2265, 2002, pp. 220-231
• Online hierarchical graph drawing
  Stephen C. North, Gordon Woodhull
  Lecture Notes in Computer Science 2265, 2002, pp. 232-246
• Recognizing string graphs is decidable
  János Pach, Géza Tóth
  Lecture Notes in Computer Science 2265, 2002, pp. 247-260
• On intersection graphs of segments with prescribed slopes
  Jakub C̑erný, Daniel Král', Helena Nyklová, Ondȓej Pangrác
  Lecture Notes in Computer Science 2265, 2002, pp. 261-271
• A short note on the history of graph drawing
  Eriola Kruja, Joe Marks, Ann Blair, Richard Waters
  Lecture Notes in Computer Science 2265, 2002, pp. 272-286
• Towards an aesthetic invariant for graph drawing
  Jan Adamec, Jaroslav Nes̑etȓil
  Lecture Notes in Computer Science 2265, 2002, pp. 287-296
• Orthogonal drawings with few layers
  Therese Biedl, John R. Johansen, Thomas Shermer, David R. Wood
  Lecture Notes in Computer Science 2265, 2002, pp. 297-311
• Bounded degree book embeddings and three-dimensional orthogonal graph drawing
  David R. Wood
  Lecture Notes in Computer Science 2265, 2002, pp. 312-327