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 YEAR=2001

• Scalable sparse topologies with small spectrum
  Robert Elsässer, Rastislav Královic̑, Burkhard Monien
  Lecture Notes in Computer Science 2010, 2001, pp. 218-229
• Optimal preemptive scheduling on uniform processors with non-decreasing speed ratios
  Leah Epstein
  Lecture Notes in Computer Science 2010, 2001, pp. 230-237
• The UPS problem
  Cristina G. Fernandes, Till Nierhoff
  Lecture Notes in Computer Science 2010, 2001, pp. 238-246
• Gathering of asynchronous oblivious robots with limited visibility
  Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer
  Lecture Notes in Computer Science 2010, 2001, pp. 247-258
• Generalized Langton's ant: Dynamical behavior and complexity
  Anahí Gajardo, Eric Goles, Andrés Moreira
  Lecture Notes in Computer Science 2010, 2001, pp. 259-270
• Optimal and approximate station placement in networks (With applications to multicasting and space efficient traversals)
  Clemente Galdi, Christos Kaklamanis, Manuela Montangero, Pino Persiano
  Lecture Notes in Computer Science 2010, 2001, pp. 271-282
• Learning expressions over monoids
  Ricard Gavaldà, Denis Thérien
  Lecture Notes in Computer Science 2010, 2001, pp. 283-293
• Efficient recognition of random unsatisfiable k-SAT instances by spectral methods
  Andreas Goerdt, Michael Krivelevich
  Lecture Notes in Computer Science 2010, 2001, pp. 294-304
• A user study in similarity measures for graph drawing
  Stina Bridgeman, Roberto Tamassia
  Lecture Notes in Computer Science 1984, 2001, pp. 19-30
• How to draw the minimum cuts of a planar graph
  Ulrik Brandes, Sabine Cornelsen, Dorothea Wagner
  Lecture Notes in Computer Science 1984, 2001, pp. 103-114
• 2D-structure drawings of similar molecules
  J.D. Boissonnat, F. Cazals, J. Flötotto
  Lecture Notes in Computer Science 1984, 2001, pp. 115-126
• Fast layout methods for timetable graphs
  Ulrik Brandes, Galina Shubina, Roberto Tamassia, Dorothea Wagner
  Lecture Notes in Computer Science 1984, 2001, pp. 127-138
• An algorithmic framework for visualizing statecharts
  R. Castelló, R. Mili, I.G. Tollis
  Lecture Notes in Computer Science 1984, 2001, pp. 139-149
• Visualization of the autonomous systems interconnections with HERMES
  Andrea Carmignani, Giuseppe di Battista, Walter Didimo, Francesco Matera, Maurizio Pizzonia
  Lecture Notes in Computer Science 1984, 2001, pp. 150-163
• Drawing hypergraphs in the subset standard
  François Bertault, Peter Eades
  Lecture Notes in Computer Science 1984, 2001, pp. 164-169
• A multi-dimensional approach to force-directed layouts of large graphs
  Pawel Gajer, Michael T. Goodrich, Stephen G. Kobourov
  Lecture Notes in Computer Science 1984, 2001, pp. 211-221
• GRIP: Graph dRawing with Intelligent Placement
  Pawel Gajer, Stephen G. Kobourov
  Lecture Notes in Computer Science 1984, 2001, pp. 222-228
• A fast layout algorithm for k-level graphs
  Christoph Buchheim, Michael Jünger, Sebastian Leipert
  Lecture Notes in Computer Science 1984, 2001, pp. 229-240
• Three-dimensional orthogonal graph drawing with optimal volume
  Therese Biedl, Torsten Thiele, David R. Wood
  Lecture Notes in Computer Science 1984, 2001, pp. 284-295
• \omega-searchlight obedient graph drawings
  Gill Barequet
  Lecture Notes in Computer Science 1984, 2001, pp. 321-327
• A layout algorithm for bar-visibility graphs on the Möbius band
  Alice M. Dean
  Lecture Notes in Computer Science 1984, 2001, pp. 350-359
• On maximum symmetric subgraphs
  Ho-Lin Chen, Hsueh-I. Lu, Hsu-Chun Yen
  Lecture Notes in Computer Science 1984, 2001, pp. 372-383
• The Marey graph animation tool demo
  Carsten Friedrich, Peter Eades
  Lecture Notes in Computer Science 1984, 2001, pp. 396-406
• Graph data format workshop report
  Ulrik Brandes, M. Scott Marshall, Stephen C. North
  Lecture Notes in Computer Science 1984, 2001, pp. 407-409
• Graph-drawing contest report
  Franz Brandenburg, Ulrik Brandes, Michael Himsolt, Marcus Raitner
  Lecture Notes in Computer Science 1984, 2001, pp. 410-418