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

• Robot localization without depth perception
  Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro
  Lecture Notes in Computer Science 2368, 2002, pp. 249-259
• Online parallel heuristics and robot searching under the competitive framework
  Alejandro López-Ortiz, Sven Schuierer
  Lecture Notes in Computer Science 2368, 2002, pp. 260-269
• Analysis of heuristics for the Freeze-Tag Problem
  Marcelo O. Sztainberg, Esther M. Arkin, Michael A. Bender, Joseph S.B. Mitchell
  Lecture Notes in Computer Science 2368, 2002, pp. 270-279
• Approximations for Maximum Transportation Problem With Permutable Supply Vector and other capacitated Star Packing problems
  Esther M. Arkin, Refael Hassin, Shlomi Rubinstein, Maxim Sviridenko
  Lecture Notes in Computer Science 2368, 2002, pp. 280-287
• All-norm approximation algorithms
  Yossi Azar, Leah Epstein, Yossi Richter, Gerhard J. Woeginger
  Lecture Notes in Computer Science 2368, 2002, pp. 288-297
• Approximability of dense instances of NEAREST CODEWORD problem
  Cristina Bazgan, W. Fernandez de la Vega, Marek Karpinski
  Lecture Notes in Computer Science 2368, 2002, pp. 298-307
• Call control with k rejections
  R. Sai Anand, Thomas Erlebach, Alexander Hall, Stamatis Stefanakos
  Lecture Notes in Computer Science 2368, 2002, pp. 308-317
• On network design problems: Fixed cost flows and the covering Steiner Problem
  Guy Even, Guy Kortsarz, Wolfgang Slany
  Lecture Notes in Computer Science 2368, 2002, pp. 318-327
• Packet bundling
  Jens S. Frederiksen, Kim S. Larsen
  Lecture Notes in Computer Science 2368, 2002, pp. 328-337
• Algorithms for the multi-constrained routing problem
  Anuj Puri, Stavros Tripakis
  Lecture Notes in Computer Science 2368, 2002, pp. 338-347
• Computing the threshold for q-gram filters
  Juha Kärkkäinen
  Lecture Notes in Computer Science 2368, 2002, pp. 348-357
• On the generality of phylogenies from incomplete directed characters
  Itsik Pe'er, Ron Shamir, Roded Sharan
  Lecture Notes in Computer Science 2368, 2002, pp. 358-367
• Sorting with a forklift
  M.H. Albert, M.D. Atkinson
  Lecture Notes in Computer Science 2368, 2002, pp. 368-377
• Tree decompositions with small cost
  Hans L. Bodlaender, Fedor V. Fomin
  Lecture Notes in Computer Science 2368, 2002, pp. 378-387
• Computing the treewidth and the minimum fill-in with the modular decomposition
  Hans L. Bodlaender, Udi Rotics
  Lecture Notes in Computer Science 2368, 2002, pp. 388-397
• Performance tuning an algorithm for compressing relational tables
  Jyrki Katajainen, Jeppe Nejsum Madsen
  Lecture Notes in Computer Science 2368, 2002, pp. 398-407
• A randomized in-place algorithm for positioning the kth element in a multiset
  Jyrki Katajainen, Tomi A. Pasanen
  Lecture Notes in Computer Science 2368, 2002, pp. 408-417
• Paging on a RAM with limited resources
  Tony W. Lai
  Lecture Notes in Computer Science 2368, 2002, pp. 418-427
• An optimal algorithm for finding NCA on Pure Pointer Machines
  A. Dal Palú, E. Pontelli, D. Ranjan
  Lecture Notes in Computer Science 2368, 2002, pp. 428-438
• Amortized complexity of bulk updates in AVL-trees
  Eljas Soisalon-Soininen, Peter Widmayer
  Lecture Notes in Computer Science 2368, 2002, pp. 439-448