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 [1]	Hilfe

Suche: Series=LNCS AND YEAR=2004

• Erratum to ''Analysis of the harmonic algorithm for three servers''
  Marek Chrobak, Jiȓí Sgall
  Lecture Notes in Computer Science 2996, 2004, pp. 656-656
• 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
• 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
• 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
• 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
• 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
• Track drawings of graphs with constant queue number
  Emilio Di Giacomo, Henk Meijer
  Lecture Notes in Computer Science 2912, 2004, pp. 214-225
• 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
• Planar embeddings of graphs with specified edge lengths
  Sergio Cabello, Erik D. Demaine, Günter Rote
  Lecture Notes in Computer Science 2912, 2004, pp. 283-294
• BGPlay: A system for visualizing the interdomain routing evolution
  Giuseppe Di Battista, Federico Mariani, Maurizio Patrignani, Maurizio Pizzonia
  Lecture Notes in Computer Science 2912, 2004, pp. 295-306
• GraphEx: An improved graph translation service
  Stina Bridgeman
  Lecture Notes in Computer Science 2912, 2004, pp. 307-313
• Fixed parameter algorithms for ONE-SIDED CROSSING MINIMIZATION revisited
  Vida Dujmović, Henning Fernau, Michael Kaufmann
  Lecture Notes in Computer Science 2912, 2004, pp. 332-344
• Characterizing families of cuts that can be represented by axis-parallel rectangles
  Ulrik Brandes, Sabine Cornelsen, Dorothea Wagner
  Lecture Notes in Computer Science 2912, 2004, pp. 357-368
• Radial level planarity testing and embedding in linear time
  Christian Bachmaier, Franz J. Brandenburg, Michael Forster
  Lecture Notes in Computer Science 2912, 2004, pp. 393-405
• Straight-line drawings of 2-outerplanar graphs on two curves
  Emilio Di Giacomo, Walter Didimo
  Lecture Notes in Computer Science 2912, 2004, pp. 419-424
• Drawing graphs with nonuniform nodes using potential fields
  Jen-Hui Chuang, Chun-Cheng Lin, Hsu-Chun Yen
  Lecture Notes in Computer Science 2912, 2004, pp. 460-465
• Drawing area-proportional Venn and Euler diagrams
  Stirling Chow, Frank Ruskey
  Lecture Notes in Computer Science 2912, 2004, pp. 466-477
• Web-linkage viewer: Drawing links in the Web based on a site-oriented framework
  Yasuhito Asano, Takao Nishizeki
  Lecture Notes in Computer Science 2912, 2004, pp. 498-499
• Visual data mining with ILOG discovery
  Thomas Baudel, Bruno Haible, Georg Sander
  Lecture Notes in Computer Science 2912, 2004, pp. 502-503
• Graph drawing contest report
  Franz J. Brandenburg, Ulrik Brandes, Peter Eades, Joe Marks
  Lecture Notes in Computer Science 2912, 2004, pp. 504-508
• Engineering and visualizing algorithms
  Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano
  Lecture Notes in Computer Science 2912, 2004, pp. 509-513
• Selected open problems in graph drawing
  Franz Brandenburg, David Eppstein, Michael T. Goodrich, Stephen Kobourov, Giuseppe Liotta, Petra Mutzel
  Lecture Notes in Computer Science 2912, 2004, pp. 515-539