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=2912

• Confluent drawings: Visualizing non-planar diagrams in a planar way
  Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng
  Lecture Notes in Computer Science 2912, 2004, pp. 1-12
• An experimental study of crossing minimization heuristics
  Carsten Gutwenger, Petra Mutzel
  Lecture Notes in Computer Science 2912, 2004, pp. 13-24
• Stop minding your P's and Q's: Implementing a fast and simple DFS-based planarity testing and embedding algorithm
  John M. Boyer, Pier Francesco Cortese, Maurizio Patrignani, Giuseppe Di Battista
  Lecture Notes in Computer Science 2912, 2004, pp. 25-36
• Bounds and methods for k-planar crossing numbers
  Farhad Shahrokhi, Ondrej Sýkora, Laszlo A. Székely, Imrich Vrt'o
  Lecture Notes in Computer Science 2912, 2004, pp. 37-46
• How many ways can one draw a graph?
  János Pach, Géza Tóth
  Lecture Notes in Computer Science 2912, 2004, pp. 47-58
• Two results on intersection graphs of polygons
  Jan Kratochvíl, Martin Pergel
  Lecture Notes in Computer Science 2912, 2004, pp. 59-70
• Stretching of Jordan arc contact systems
  Hubert de Fraysseix, Patrice Ossona de Mendez
  Lecture Notes in Computer Science 2912, 2004, pp. 71-85
• Noncrossing Hamiltonian paths in geometric graphs
  Jakub C̑erný, Zdenȇk Dvoȓák, Vít Jelínek, Jan Kára
  Lecture Notes in Computer Science 2912, 2004, pp. 86-97
• GraphAEL: Graph animations with evolving layouts
  Cesim Erten, Philip J. Harding, Stephen G. Kobourov, Kevin Wampler, Gary Yee
  Lecture Notes in Computer Science 2912, 2004, pp. 98-110
• Visualizing related metabolic pathways in two and a half dimensions
  Ulrik Brandes, Tim Dwyer, Falk Schreiber
  Lecture Notes in Computer Science 2912, 2004, pp. 111-122
• GoVisual for CASE tools Borland Together ControlCenter and Gentleware Poseidon - System demonstration
  Carsten Gutwenger, Joachim Kupke, Karsten Klein, Sebastian Leipert
  Lecture Notes in Computer Science 2912, 2004, pp. 123-128
• Area-efficient drawings of outerplanar graphs
  Ashim Garg, Adrian Rusu
  Lecture Notes in Computer Science 2912, 2004, pp. 129-134
• A framework for user-grouped circular drawings
  Janet M. Six, Ioannis (Yanni) G. Tollis
  Lecture Notes in Computer Science 2912, 2004, pp. 135-146
• Fixed-location circular-arc drawing of planar graphs
  Alon Efrat, Cesim Erten, Stephen G. Kobourov
  Lecture Notes in Computer Science 2912, 2004, pp. 147-158
• A more practical algorithm for drawing binary trees in linear area with arbitrary aspect ratio
  Ashim Garg, Adrian Rusu
  Lecture Notes in Computer Science 2912, 2004, pp. 159-165
• An integer programming approach to fuzzy symmetry detection
  Christoph Buchheim, Michael Jünger
  Lecture Notes in Computer Science 2912, 2004, pp. 166-177
• Barycentric drawings of periodic graphs
  Olaf Delgado-Friedrichs
  Lecture Notes in Computer Science 2912, 2004, pp. 178-189
• Three-dimensional grid drawings with sub-quadratic volume
  Vida Dujmović, David R. Wood
  Lecture Notes in Computer Science 2912, 2004, pp. 190-201
• Laying out iterated line digraphs using queues
  Toru Hasunuma
  Lecture Notes in Computer Science 2912, 2004, pp. 202-213
• Track drawings of graphs with constant queue number
  Emilio Di Giacomo, Henk Meijer
  Lecture Notes in Computer Science 2912, 2004, pp. 214-225
• 3D visibility representations of complete graphs
  Jan S̑tola
  Lecture Notes in Computer Science 2912, 2004, pp. 226-237
• Drawing series-parallel graphs on restricted integer 3D grids
  Emilio Di Giacomo
  Lecture Notes in Computer Science 2912, 2004, pp. 238-246
• Nearly optimal three dimensional layout of hypercube networks
  Tiziana Calamoneri, Annalisa Massini
  Lecture Notes in Computer Science 2912, 2004, pp. 247-258
• Graph embedding with minimum depth and maximum external face
  Carsten Gutwenger, Petra Mutzel
  Lecture Notes in Computer Science 2912, 2004, pp. 259-272
• More efficient generation of plane triangulations
  Shin-ichi Nakano, Takeaki Uno
  Lecture Notes in Computer Science 2912, 2004, pp. 273-282