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

• Fractal parallelism: Solving SAT in bounded space and time
  Denys Duchier, Jérôme Durand-Lose, Maxime Senot
  Lecture Notes in Computer Science 6506, 2010, pp. 279-290
• Interpretation of stream programs: Characterizing type 2 polynomial time complexity
  Hugo Férée, Emmanuel Hainry, Mathieu Hoyrup, Romain Péchoux
  Lecture Notes in Computer Science 6506, 2010, pp. 291-303
• New upper bounds on the average PTF density of Boolean functions
  Kazuyuki Amano
  Lecture Notes in Computer Science 6506, 2010, pp. 304-315
• An optimal algorithm for computing angle-constrained spanners
  Paz Carmi, Michiel Smid
  Lecture Notes in Computer Science 6506, 2010, pp. 316-327
• Approximating minimum bending energy path in a simple corridor
  Jinhui Xu, Lei Xu, Yulai Xie
  Lecture Notes in Computer Science 6506, 2010, pp. 328-339
• Analysis of an iterated local search algorithm for vertex coloring
  Dirk Sudholt, Christine Zarges
  Lecture Notes in Computer Science 6506, 2010, pp. 340-352
• Bounded max-colorings of graphs
  Evripidis Bampis, Alexander Kononov, Giorgio Lucarelli, Ioannis Milis
  Lecture Notes in Computer Science 6506, 2010, pp. 353-365
• Parameterized algorithms for boxicity
  Abhijin Adiga, Rajesh Chitnis, Saket Saurabh
  Lecture Notes in Computer Science 6506, 2010, pp. 366-377
• On tractable cases of target set selection
  André Nichterlein, Rolf Niedermeier, Johannes Uhlmann, Mathias Weller
  Lecture Notes in Computer Science 6506, 2010, pp. 378-389
• Combining two worlds: Parameterised approximation for vertex cover
  Ljiljana Brankovic, Henning Fernau
  Lecture Notes in Computer Science 6506, 2010, pp. 390-402
• Listing all maximal cliques in sparse graphs in near-optimal time
  David Eppstein, Maarten Löffler, Darren Strash
  Lecture Notes in Computer Science 6506, 2010, pp. 403-414
• Lower bounds for Howard's algorithm for finding minimum mean-cost cycles
  Thomas Dueholm Hansen, Uri Zwick
  Lecture Notes in Computer Science 6506, 2010, pp. 415-426
• Solving two-stage stochastic Steiner tree problems by two-stage branch-and-cut
  Immanuel Bomze, Markus Chimani, Michael Jünger, Ivana Ljubić, Petra Mutzel, Bernd Zey
  Lecture Notes in Computer Science 6506, 2010, pp. 427-439
• An optimal algorithm for single maximum coverage location on trees and related problems
  Joachim Spoerhase
  Lecture Notes in Computer Science 6506, 2010, pp. 440-450
• A faster algorithm for the maximum even factor problem
  Maxim A. Babenko
  Lecture Notes in Computer Science 6506, 2010, pp. 451-462