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 YEAR=2010

• On k-column sparse packing programs
  Nikhil Bansal, Nitish Korula, Viswanath Nagarajan, Aravind Srinivasan
  Lecture Notes in Computer Science 6080, 2010, pp. 369-382
• Hypergraphic LP relaxations for Steiner trees
  Deeparnab Chakrabarty, Jochen Könemann, David Pritchard
  Lecture Notes in Computer Science 6080, 2010, pp. 383-396
• Efficient deterministic algorithms for finding a minimum cycle basis in undirected graphs
  Edoardo Amaldi, Claudio Iuliano, Romeo Rizzi
  Lecture Notes in Computer Science 6080, 2010, pp. 397-410
• Towards a distributed search engine
  Ricardo Baeza-Yates
  Lecture Notes in Computer Science 6078, 2010, pp. 1-5
• An exact algorithm for Connected Red-Blue Dominating Set
  Faisal N. Abu-Khzam, Amer E. Mouawad, Mathieu Liedloff
  Lecture Notes in Computer Science 6078, 2010, pp. 25-36
• Improved approximations for TSP with simple precedence constraints
  Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Monika Steinová
  Lecture Notes in Computer Science 6078, 2010, pp. 61-72
• Parameterized complexity of even/odd subgraph problems
  Leizhen Cai, Boting Yang
  Lecture Notes in Computer Science 6078, 2010, pp. 85-96
• Popular matchings in the Marriage and Roommates Problems
  Péter Biró, Robert W. Irving, David F. Manlove
  Lecture Notes in Computer Science 6078, 2010, pp. 97-108
• Bounding the number of tolerable faults in majority-based systems
  Ching-Lueh Chang, Yuh-Dauh Lyuu
  Lecture Notes in Computer Science 6078, 2010, pp. 109-119
• Graph unique-maximum and conflict-free colorings
  Panagiotis Cheilaris, Géza Tóth
  Lecture Notes in Computer Science 6078, 2010, pp. 143-154
• The Steiner tree reoptimization problem with sharpened triangle inequality
  Hans-Joachim Böckenhauer, Karin Freiermuth, Juraj Hromkovic̑, Tobias Mömke, Andreas Sprock, Björn Steffen
  Lecture Notes in Computer Science 6078, 2010, pp. 180-191
• A planar linear arboricity conjecture
  Marek Cygan, Łukasz Kowalik, Borut Luz̑ar
  Lecture Notes in Computer Science 6078, 2010, pp. 204-216
• How simple robots benefit from looking back
  Jérémie Chalopin, Shantanu Das, Yann Disser, Matús̑ Mihalák, Peter Widmayer
  Lecture Notes in Computer Science 6078, 2010, pp. 229-239
• Online cooperative cost sharing
  Janina Brenner, Guido Schäfer
  Lecture Notes in Computer Science 6078, 2010, pp. 252-263
• Packing bipartite graphs with covers of complete bipartite graphs
  Jérémie Chalopin, Daniël Paulusma
  Lecture Notes in Computer Science 6078, 2010, pp. 276-287
• Irredundant set faster than O(2^n)
  Marek Cygan, Marcin Pilipczuk, Jakub Onufry Wojtaszczyk
  Lecture Notes in Computer Science 6078, 2010, pp. 288-298
• The complexity of computing minimal unidirectional covering sets
  Dorothea Baumeister, Felix Brandt, Felix Fischer, Jan Hoffmann, Jörg Rothe
  Lecture Notes in Computer Science 6078, 2010, pp. 299-310
• A parameterized route to exact puzzles: Breaking the 2^n-barrier for irredundance
  Daniel Binkele-Raible, Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Peter Rossmanith
  Lecture Notes in Computer Science 6078, 2010, pp. 311-322
• Preprocessing speed-up techniques is hard
  Reinhard Bauer, Tobias Columbus, Bastian Katz, Marcus Krug, Dorothea Wagner
  Lecture Notes in Computer Science 6078, 2010, pp. 359-370
• Communication requirements for stable marriages
  Jen-Hou Chou, Chi-Jen Lu
  Lecture Notes in Computer Science 6078, 2010, pp. 371-382
• Algorithms for energy management
  Susanne Albers
  Lecture Notes in Computer Science 6072, 2010, pp. 1-11
• Sofic and almost of finite type tree-shifts
  Nathalie Aubrun, Marie-Pierre Béal
  Lecture Notes in Computer Science 6072, 2010, pp. 12-24
• Proof-based design of security protocols
  Nazim Benaissa, Dominique Méry
  Lecture Notes in Computer Science 6072, 2010, pp. 25-36
• Approximating the minimum length of synchronizing words is hard
  Mikhail V. Berlinkov
  Lecture Notes in Computer Science 6072, 2010, pp. 37-47
• Realizability of dynamic MSC languages
  Benedikt Bollig, Loïc Hélouët
  Lecture Notes in Computer Science 6072, 2010, pp. 48-59