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 Volume=5193

• A local-search 2-approximation for 2-correlation-clustering
  Tom Coleman, James Saunderson, Anthony Wirth
  Lecture Notes in Computer Science 5193, 2008, pp. 308-319
• The Alcuin number of a graph
  Péter Csorba, Cor A.J. Hurkens, Gerhard J. Woeginger
  Lecture Notes in Computer Science 5193, 2008, pp. 320-331
• Time-dependent SHARK-routing
  Daniel Delling
  Lecture Notes in Computer Science 5193, 2008, pp. 332-343
• Detecting regular visit patterns
  Bojan Djordjevic, Joachim Gudmundsson, Anh Pham, Thomas Wolle
  Lecture Notes in Computer Science 5193, 2008, pp. 344-355
• Improved approximation algorithms for relay placement
  Alon Efrat, Sándor P. Fekete, Poornananda R. Gaddehosur, Joseph S.B. Mitchell, Valentin Polishchuk, Jukka Suomela
  Lecture Notes in Computer Science 5193, 2008, pp. 356-367
• Selfish bin packing
  Leah Epstein, Elena Kleiman
  Lecture Notes in Computer Science 5193, 2008, pp. 368-380
• Improved randomized results for that interval selection problem
  Leah Epstein, Asaf Levin
  Lecture Notes in Computer Science 5193, 2008, pp. 381-392
• Succinct representations of arbitrary graphs
  Arash Farzan, J. Ian Munro
  Lecture Notes in Computer Science 5193, 2008, pp. 393-404
• Edge coloring and decompositions of weighted graphs
  Uriel Feige, Mohit Singh
  Lecture Notes in Computer Science 5193, 2008, pp. 405-416
• The complexity of sorting with networks of stacks and queues
  Stefan Felsner, Martin Pergel
  Lecture Notes in Computer Science 5193, 2008, pp. 417-429
• Faster Steiner tree computation in polynomial-space
  Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
  Lecture Notes in Computer Science 5193, 2008, pp. 430-441
• Fitting a step function to a point set
  Hervé Fournier, Antoine Vigneron
  Lecture Notes in Computer Science 5193, 2008, pp. 442-453
• Faster swap edge computation in minimum diameter spanning trees
  Beat Gfeller
  Lecture Notes in Computer Science 5193, 2008, pp. 454-465
• The partial augment-relabel algorithm for the maximum flow problem
  Andrew V. Goldberg
  Lecture Notes in Computer Science 5193, 2008, pp. 466-477
• An optimal dynamic spanner for doubling metric spaces
  Lee-Ad Gottlieb, Liam Roditty
  Lecture Notes in Computer Science 5193, 2008, pp. 478-489
• RFQ: Redemptive fair queuing
  Ajay Gulati, Peter Varman
  Lecture Notes in Computer Science 5193, 2008, pp. 490-502
• Range medians
  Sariel Har-Peled, S. Muthukrishnan
  Lecture Notes in Computer Science 5193, 2008, pp. 503-514
• Locality and bounding-box quality of two-dimensional space-filling curves
  Herman Haverkort, Freek van Walderveen
  Lecture Notes in Computer Science 5193, 2008, pp. 515-527
• Probabilistic analysis of online bin coloring algorithms via stochastic comparison
  Benjamin Hiller, Tjark Vredeveld
  Lecture Notes in Computer Science 5193, 2008, pp. 528-539
• On the complexity of optimal hotlink assignment
  Tobias Jacobs
  Lecture Notes in Computer Science 5193, 2008, pp. 540-552
• Oblivious randomized direct search for real-parameter optimization
  Jens Jägersküpper
  Lecture Notes in Computer Science 5193, 2008, pp. 553-564
• Path minima in incremental unrooted trees
  Haim Kaplan, Nira Shafrir
  Lecture Notes in Computer Science 5193, 2008, pp. 565-576
• Improved competitive performance bounds for CIOQ switches
  Alex Kesselman, Kirill Kogan, Michael Segal
  Lecture Notes in Computer Science 5193, 2008, pp. 577-588
• Two-stage robust network design with exponential scenarios
  Rohit Khandekar, Guy Kortsarz, Vahab Mirrokni, Mohammad R. Salavatipour
  Lecture Notes in Computer Science 5193, 2008, pp. 589-600
• An optimal incremental algorithm for minimizing lateness with rejection
  Samir Khuller, Julián Mestre
  Lecture Notes in Computer Science 5193, 2008, pp. 601-610