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

• The robustness of level sets
  Paul Bendich, Herbert Edelsbrunner, Dmitriy Morozov, Amit Patel
  Lecture Notes in Computer Science 6346, 2010, pp. 1-10
• Solving an avionics real-time scheduling problem by advanced IP-methods
  Friedrich Eisenbrand, Karthikeyan Kesavan, Raju S. Mattikalli, Martin Niemeier, Arnold W. Nordsieck, Martin Skutella, José Verschae, Andreas Wiese
  Lecture Notes in Computer Science 6346, 2010, pp. 11-22
• Non-clairvoyant speed scaling for weighted flow time
  Sze-Hang Chan, Tak-Wah Lam, Lap-Kei Lee
  Lecture Notes in Computer Science 6346, 2010, pp. 23-35
• A robust PTAS for machine covering and packing
  Martin Skutella, José Verschae
  Lecture Notes in Computer Science 6346, 2010, pp. 36-47
• Balancing degree, diameter and weight in Euclidean spanners
  Shay Solomon, Michael Elkin
  Lecture Notes in Computer Science 6346, 2010, pp. 48-59
• Testing Euclidean spanners
  Frank Hellweg, Melanie Schmidt, Christian Sohler
  Lecture Notes in Computer Science 6346, 2010, pp. 60-71
• Fast approximation in subspaces by doubling metric decomposition
  Marek Cygan, Lukasz Kowalik, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski
  Lecture Notes in Computer Science 6346, 2010, pp. 72-83
• f-sensitivity distance oracles and routing schemes
  Shiri Chechnik, Michael Langberg, David Peleg, Liam Roditty
  Lecture Notes in Computer Science 6346, 2010, pp. 84-96
• Fast minor testing in planar graphs
  Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos
  Lecture Notes in Computer Science 6346, 2010, pp. 97-109
• On the number of spanning trees a planar graph can have
  Kevin Buchin, André Schulz
  Lecture Notes in Computer Science 6346, 2010, pp. 110-121
• Contractions of planar graphs in polynomial time
  Marcin Kamiński, Daniël Paulusma, Dimitrios M. Thilikos
  Lecture Notes in Computer Science 6346, 2010, pp. 122-133
• Communication complexity of quasirandom rumor spreading
  Petra Berenbrink, Robert Elsässer, Thomas Sauerwald
  Lecture Notes in Computer Science 6346, 2010, pp. 134-145
• A complete characterization of group-strategyproof mechanisms of cost-sharing
  Emmanouil Pountourakis, Angelina Vidali
  Lecture Notes in Computer Science 6346, 2010, pp. 146-157
• Contribution games in social networks
  Elliot Anshelevich, Martin Hoefer
  Lecture Notes in Computer Science 6346, 2010, pp. 158-169
• Improved bounds for online stochastic matching
  Bahman Bahmani, Michael Kapralov
  Lecture Notes in Computer Science 6346, 2010, pp. 170-181
• Online stochastic packing applied to display ad allocation
  Jon Feldman, Monika Henzinger, Nitish Korula, Vahab S. Mirrokni, Cliff Stein
  Lecture Notes in Computer Science 6346, 2010, pp. 182-194
• Caching is hard - Even in the fault model
  Marek Chrobak, Gerhard J. Woeginger, Kazuhisa Makino, Haifeng Xu
  Lecture Notes in Computer Science 6346, 2010, pp. 195-206
• Superselectors: Efficient constructions and applications
  Ferdinando Cicalese, Ugo Vaccaro
  Lecture Notes in Computer Science 6346, 2010, pp. 207-218
• Estimating the average of a Lipschitz-continuous function from one sample
  Abhimanyu Das, David Kempe
  Lecture Notes in Computer Science 6346, 2010, pp. 219-230
• Streaming graph computations with a helpful advisor
  Graham Cormode, Michael Mitzenmacher, Justin Thaler
  Lecture Notes in Computer Science 6346, 2010, pp. 231-242
• Algorithms for dominating set in disk graphs: Breaking the \log n barrier
  Matt Gibson, Imran A. Pirwani
  Lecture Notes in Computer Science 6346, 2010, pp. 243-254
• Minimum vertex cover in rectangle graphs
  Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz
  Lecture Notes in Computer Science 6346, 2010, pp. 255-266
• Feedback vertex sets in tournaments
  Serge Gaspers, Matthias Mnich
  Lecture Notes in Computer Science 6346, 2010, pp. 267-277
• n-level graph partitioning
  Vitaly Osipov, Peter Sanders
  Lecture Notes in Computer Science 6346, 2010, pp. 278-289
• Fast routing in very large public transportation networks using transfer patterns
  Hannah Bast, Erik Carlsson, Arno Eigenwillig, Robert Geisberger, Chris Harrelson, Veselin Raychev, Fabien Viger
  Lecture Notes in Computer Science 6346, 2010, pp. 290-301