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

• Origami, linkages, and polyhedra: Folding with algorithms
  Erik D. Demaine
  Lecture Notes in Computer Science 4168, 2006, pp. 1-1
• Reliable and efficient geometric computing
  Kurt Mehlhorn
  Lecture Notes in Computer Science 4168, 2006, pp. 2-2
• Some computational challenges in today's bio-medicine
  Ron Shamir
  Lecture Notes in Computer Science 4168, 2006, pp. 3-3
• Kinetic collision detection for convex fat objects
  M.A. Abam, M. de Berg, S.-H. Poon, B. Speckmann
  Lecture Notes in Computer Science 4168, 2006, pp. 4-15
• Dynamic connectivity for axis-parallel rectangles
  Peyman Afshani, Timothy M. Chan
  Lecture Notes in Computer Science 4168, 2006, pp. 16-27
• Single machine precedence constrained scheduling is a vertex cover problem
  Christoph Ambühl, Monaldo Mastrolilli
  Lecture Notes in Computer Science 4168, 2006, pp. 28-39
• Cooperative TSP
  Amitai Armon, Adi Avidor, Oded Schwartz
  Lecture Notes in Computer Science 4168, 2006, pp. 40-51
• Fréchet distance for curves, revisited
  Boris Aronov, Sariel Har-Peled, Christian Knauer, Yusu Wang, Carola Wenk
  Lecture Notes in Computer Science 4168, 2006, pp. 52-63
• Resource allocation in bounded degree trees
  Reuven Bar-Yehuda, Michael Beder, Yuval Cohen, Dror Rawitz
  Lecture Notes in Computer Science 4168, 2006, pp. 64-75
• Dynamic algorithms for graph spanners
  Surender Baswana
  Lecture Notes in Computer Science 4168, 2006, pp. 76-87
• Latency constrained aggregation in sensor networks
  Luca Becchetti, Peter Korteweg, Alberto Marchetti-Spaccamela, Martin Skutella, Leen Stougie, Andrea Vitaletti
  Lecture Notes in Computer Science 4168, 2006, pp. 88-99
• Competitive analysis of flash-memory algorithms
  Avraham Ben-Aroya, Sivan Toledo
  Lecture Notes in Computer Science 4168, 2006, pp. 100-111
• Contention resolution with heterogeneous job sizes
  Michael A. Bender, Jeremy T. Fineman, Seth Gilbert
  Lecture Notes in Computer Science 4168, 2006, pp. 112-123
• Deciding relaxed two-colorability - A hardness jump
  Robert Berke, Tibor Szabó
  Lecture Notes in Computer Science 4168, 2006, pp. 124-135
• Negative examples for sequential importance sampling of binary contingency tables
  Ivona Bezáková, Alistair Sinclair, Daniel S̑tefankovic̑, Eric Vigoda
  Lecture Notes in Computer Science 4168, 2006, pp. 136-147
• Estimating entropy over data streams
  Lakshminath Bhuvanagiri, Sumit Ganguly
  Lecture Notes in Computer Science 4168, 2006, pp. 148-159
• Necklaces, convolutions, and X + Y
  David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Perouz Taslakian
  Lecture Notes in Computer Science 4168, 2006, pp. 160-171
• Purely functional worst case constant time catenable sorted lists
  Gerth Stlting Brodal, Christos Makris, Kostas Tsichlas
  Lecture Notes in Computer Science 4168, 2006, pp. 172-183
• Taxes for linear atomic congestion games
  Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos
  Lecture Notes in Computer Science 4168, 2006, pp. 184-195
• Spanners with slack
  T.-H. Hubert Chan, Michael Dinitz, Anupam Gupta
  Lecture Notes in Computer Science 4168, 2006, pp. 196-207
• Compressed indexes for approximate string matching
  Ho-Leung Chan, Tak-Wah Lam, Wing-Kin Sung, Siu-Lung Tam, Swee-Seong Wong
  Lecture Notes in Computer Science 4168, 2006, pp. 208-219
• Traversing the machining graph
  Danny Z. Chen, Rudolf Fleischer, Jian Li, Haitao Wang, Hong Zhu
  Lecture Notes in Computer Science 4168, 2006, pp. 220-231
• Efficient computation of Nash equilibria for very sparse win-lose bimatrix games
  Bruno Codenotti, Mauro Leoncini, Giovanni Resta
  Lecture Notes in Computer Science 4168, 2006, pp. 232-243
• Distributed almost exact approximations for minor-closed families
  Andrzej Czygrinow, Michaƚ Hańćkowiak
  Lecture Notes in Computer Science 4168, 2006, pp. 244-255
• Spectral clustering by recursive partitioning
  Anirban Dasgupta, John Hopcroft, Ravi Kannan, Pradipta Mitra
  Lecture Notes in Computer Science 4168, 2006, pp. 256-267