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

• Cops and robber game without recharging
  Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov
  Lecture Notes in Computer Science 6139, 2010, pp. 273-284
• Path schematization for route sketches
  Daniel Delling, Andreas Gemsa, Martin Nöllenburg, Thomas Pajor
  Lecture Notes in Computer Science 6139, 2010, pp. 285-296
• Approximation algorithms for free-label maximization
  Mark de Berg, Dirk H.P. Gerrits
  Lecture Notes in Computer Science 6139, 2010, pp. 297-308
• Phase transitions in sampling algorithms and the underlying random structures
  Dana Randall
  Lecture Notes in Computer Science 6139, 2010, pp. 309-309
• Polynomial kernels for hard problems on disk graphs
  Bart Jansen
  Lecture Notes in Computer Science 6139, 2010, pp. 310-321
• Faster parameterized algorithms for minor containment
  Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos
  Lecture Notes in Computer Science 6139, 2010, pp. 322-333
• Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing
  Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
  Lecture Notes in Computer Science 6139, 2010, pp. 334-345
• Dispatching equal-length jobs to parallel machines to maximize throughput
  David P. Bunde, Michael H. Goldwasser
  Lecture Notes in Computer Science 6139, 2010, pp. 346-358
• Online function tracking with generalized penalties
  Marcin Bienkowski, Stefan Schmid
  Lecture Notes in Computer Science 6139, 2010, pp. 359-370
• Better bounds on online unit clustering
  Martin R. Ehmsen, Kim S. Larsen
  Lecture Notes in Computer Science 6139, 2010, pp. 371-382
• Online selection of intervals and t-intervals
  Unnar Th. Bachmann, Magnús M. Halldórsson, Hadas Shachnai
  Lecture Notes in Computer Science 6139, 2010, pp. 383-394
• Approximating the maximum 3- and 4-edge-colorable subgraph
  Marcin Kamiński, Łukasz Kowalik
  Lecture Notes in Computer Science 6139, 2010, pp. 395-407
• Improved algorithm for degree bounded survivable network design problem
  Anand Louis, Nisheeth K. Vishnoi
  Lecture Notes in Computer Science 6139, 2010, pp. 408-419
• Minimizing the diameter of a network using shortcut edges
  Erik D. Demaine, Morteza Zadimoghaddam
  Lecture Notes in Computer Science 6139, 2010, pp. 420-431