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

• Fast smallest-enclosing-ball computation in high dimensions
  Kaspar Fischer, Bernd Gärtner, Martin Kutz
  Lecture Notes in Computer Science 2832, 2003, pp. 630-641
• Multi-party pseudo-telepathy
  Gilles Brassard, Anne Broadbent, Alain Tapp
  Lecture Notes in Computer Science 2748, 2003, pp. 1-11
• Adapting (pseudo)-triangulations with a near-linear number of edge flips
  Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser
  Lecture Notes in Computer Science 2748, 2003, pp. 12-24
• Shape segmentation and matching with flow discretization
  Tamal K. Dey, Joachim Giesen, Samrat Goswami
  Lecture Notes in Computer Science 2748, 2003, pp. 25-36
• Toward optimal motif enumeration
  Patricia A. Evans, Andrew D. Smith
  Lecture Notes in Computer Science 2748, 2003, pp. 47-58
• Common-deadline lazy bureaucrat scheduling problems
  Behdad Esfahbod, Mohammad Ghodsi, Ali Sharifi
  Lecture Notes in Computer Science 2748, 2003, pp. 59-66
• Distribution-sensitive binomial queues
  Amr Elmasry
  Lecture Notes in Computer Science 2748, 2003, pp. 103-113
• Optimal worst-case operations for implicit cache-oblivious search trees
  Gianni Franceschini, Roberto Grossi
  Lecture Notes in Computer Science 2748, 2003, pp. 114-126
• The one-round Voronoi game replayed
  Sándor P. Fekete, Henk Meijer
  Lecture Notes in Computer Science 2748, 2003, pp. 150-161
• Integrated prefetching and caching with read and write requests
  Susanne Albers, Markus Büttner
  Lecture Notes in Computer Science 2748, 2003, pp. 162-173
• Online seat reservations via offline seating arrangements
  Jens S. Frederiksen, Kim S. Larsen
  Lecture Notes in Computer Science 2748, 2003, pp. 174-185
• Routing and call control algorithms for ring networks
  R. Saiand Thomas Erlebach Anand
  Lecture Notes in Computer Science 2748, 2003, pp. 186-197
• Multi-way space partitioning trees
  Christian A. Duncan
  Lecture Notes in Computer Science 2748, 2003, pp. 219-230
• Cropping-resilient segmented multiple watermarking
  Keith Frikken, Mikhail Atallah
  Lecture Notes in Computer Science 2748, 2003, pp. 231-242
• On simultaneous planar graph embeddings
  P. Brass, E. Cenek, C.A. Duncan, A. Efrat, C. Erten, D. Ismailescu, S.G. Kobourov, A. Lubiw, J.S.B. Mitchell
  Lecture Notes in Computer Science 2748, 2003, pp. 243-255
• Drawing graphs with large vertices and thick edges
  Gill Barequet, Michael T. Goodrich, Chris Riley
  Lecture Notes in Computer Science 2748, 2003, pp. 281-293
• The Traveling Salesman Problem for cubic graphs
  David Eppstein
  Lecture Notes in Computer Science 2748, 2003, pp. 307-318
• Dynamic text and static pattern matching
  Amihood Amir, Gad M. Landau, Moshe Lewenstein, Dina Sokol
  Lecture Notes in Computer Science 2748, 2003, pp. 340-352
• Real two dimensional scaled matching
  Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat
  Lecture Notes in Computer Science 2748, 2003, pp. 353-364
• The zigzag path of a pseudo-triangulation
  Oswin Aichholzer, Günter Rote, Bettina Speckmann, Ileana Streinu
  Lecture Notes in Computer Science 2748, 2003, pp. 377-388
• Chips on wafers
  Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
  Lecture Notes in Computer Science 2748, 2003, pp. 412-423
• Output-sensitive algorithms for computing nearest-neighbour decision boundaries
  David Bremner, Erik Demaine, Jeff Erickson, John Iacono, Stefan Langerman, Pat Morin, Godfried Toussaint
  Lecture Notes in Computer Science 2748, 2003, pp. 451-461
• New directions and new challenges in algorithm design and complexity, parameterized
  Michael R. Fellows
  Lecture Notes in Computer Science 2748, 2003, pp. 505-519
• Distributed quantum computing
  Harry Buhrman, Hein Röhrig
  Lecture Notes in Computer Science 2747, 2003, pp. 1-20
• Selfish routing in non-cooperative networks: A survey
  R. Feldmann, M. Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode
  Lecture Notes in Computer Science 2747, 2003, pp. 21-45