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 [2]	Hilfe

Suche: Series=LNCS AND Volume=7965

• Small stretch pairwise spanners
  Telikepalli Kavitha, Nithin M. Varma
  Lecture Notes in Computer Science 7965, 2013, pp. 601-612
• Linear kernels and single-exponential algorithms via protrusion decompositions
  Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, Somnath Sikdar
  Lecture Notes in Computer Science 7965, 2013, pp. 613-624
• The power of linear programming for finite-valued CSPs: A constructive characterization
  Vladimir Kolmogorov
  Lecture Notes in Computer Science 7965, 2013, pp. 625-636
• Approximating semi-matchings in streaming and in two-party communication
  Christian Konrad, Adi Rosén
  Lecture Notes in Computer Science 7965, 2013, pp. 637-649
• Full-fledged real-time indexing for constant size alphabets
  Gregory Kucherov, Yakov Nekrich
  Lecture Notes in Computer Science 7965, 2013, pp. 650-660
• Arithmetic circuit lower bounds via MaxRank
  Mrinal Kumar, Gaurav Maheshwari, Jayalal Sarma M.N.
  Lecture Notes in Computer Science 7965, 2013, pp. 661-672
• Model checking lower bounds for simple graphs
  Michael Lampis
  Lecture Notes in Computer Science 7965, 2013, pp. 673-683
• The complexity of proving that a graph is Ramsey
  Massimo Lauria, Pavel Pudlák, Vojtȇch Rödl, Neil Thapen
  Lecture Notes in Computer Science 7965, 2013, pp. 684-695
• An improved lower bound for the randomized decision tree complexity of recursive majority
  Nikos Leonardos
  Lecture Notes in Computer Science 7965, 2013, pp. 696-708
• A quasi-polynomial time partition oracle for graphs with an excluded minor
  Reut Levi, Dana Ron
  Lecture Notes in Computer Science 7965, 2013, pp. 709-720
• Fixed-parameter algorithms for minimum cost edge-connectivity augmentation
  Dániel Marx, László A. Végh
  Lecture Notes in Computer Science 7965, 2013, pp. 721-732
• Graph reconstruction via distance oracles
  Claire Mathieu, Hang Zhou
  Lecture Notes in Computer Science 7965, 2013, pp. 733-744
• Dual techniques for scheduling on a machine with varying speed
  Nicole Megow, José Verschae
  Lecture Notes in Computer Science 7965, 2013, pp. 745-756
• Improved space bounds for strongly competitive randomized paging algorithms
  Gabriel Moruz, Andrei Negoescu
  Lecture Notes in Computer Science 7965, 2013, pp. 757-768
• No-wait flowshop scheduling is as hard as asymmetric Traveling Salesman Problem
  Marcin Mucha, Maxim Sviridenko
  Lecture Notes in Computer Science 7965, 2013, pp. 769-779
• A composition theorem for the Fourier entropy-influence conjecture
  Ryan O'Donnell, Li-Yang Tan
  Lecture Notes in Computer Science 7965, 2013, pp. 780-791
• Large neighborhood local search for the maximum set packing problem
  Maxim Sviridenko, Justin Ward
  Lecture Notes in Computer Science 7965, 2013, pp. 792-803
• The complexity of three-element Min-Sol and conservative Min-Cost-Hom
  Hannes Uppman
  Lecture Notes in Computer Science 7965, 2013, pp. 804-815
• The complexity of infinitely repeated alternating move games
  Yaron Velner
  Lecture Notes in Computer Science 7965, 2013, pp. 816-827
• Approximating the diameter of planar graphs in near linear time
  Oren Weimann, Raphael Yuster
  Lecture Notes in Computer Science 7965, 2013, pp. 828-839
• Testing linear-invariant function isomorphism
  Karl Wimmer, Yuichi Yoshida
  Lecture Notes in Computer Science 7965, 2013, pp. 840-850