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

• The MAX QUASI-INDEPENDENT SET problem
  N. Bourgeois, A. Giannakos, G. Lucarelli, I. Milis, V.Th. Paschos, O. Pottié
  Lecture Notes in Computer Science 6072, 2010, pp. 60-71
• Equilibria in quantitative reachability games
  Thomas Brihaye, Véronique Bruyère, Julie De Pril
  Lecture Notes in Computer Science 6072, 2010, pp. 72-83
• Quotient complexity of closed languages
  Janusz Brzozowski, Galina Jirásková, Chenglong Zou
  Lecture Notes in Computer Science 6072, 2010, pp. 84-95
• Right-sequential functions on infinite words
  Olivier Carton
  Lecture Notes in Computer Science 6072, 2010, pp. 96-106
• A faster exact algorithm for the Directed Maximum Leaf Spanning Tree problem
  Daniel Binkele-Raible, Henning Fernau
  Lecture Notes in Computer Science 6072, 2010, pp. 328-339
• Colorful strips
  Greg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stephan Langerman, Oded Schwartz, Shakhar Smorodinsky, Perouz Taslakian
  Lecture Notes in Computer Science 6034, 2010, pp. 2-13
• The mono- and bichromatic empty rectangle and square problems in all dimensions
  Jonathan Backer, J. Mark Keil
  Lecture Notes in Computer Science 6034, 2010, pp. 14-25
• Randomized truthful algorithms for scheduling selfish tasks on parallel machines
  Eric Angel, Evripidis Bampis, Nicolas Thibault
  Lecture Notes in Computer Science 6034, 2010, pp. 38-48
• Average parameterization and partial kernelization for computing medians
  Nadja Betzler, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier
  Lecture Notes in Computer Science 6034, 2010, pp. 60-71
• Faithful representations of graphs by islands in the extended grid
  Michael D. Coury, Pavol Hell, Jan Kratochvíl, Tomás̑ Vyskoc̑il
  Lecture Notes in Computer Science 6034, 2010, pp. 131-142
• Compact rich-functional binary relation representations
  Jérémy Barbay, Francisco Claude, Gonzalo Navarro
  Lecture Notes in Computer Science 6034, 2010, pp. 170-183
• Quotient complexity of ideal languages
  Janusz Brzozowski, Galina Jirásková, Baiyu Li
  Lecture Notes in Computer Science 6034, 2010, pp. 208-221
• Complexity of operations on cofinite languages
  Frédérique Bassino, Laura Giambruno, Cyril Nicaud
  Lecture Notes in Computer Science 6034, 2010, pp. 222-233
• Fast set intersection and two-patterns matching
  Hagai Cohen, Ely Porat
  Lecture Notes in Computer Science 6034, 2010, pp. 234-242
• A larger lower bound on the OBDD complexity of the most significant bit of multiplication
  Beate Bollig
  Lecture Notes in Computer Science 6034, 2010, pp. 255-266
• Communication-efficient construction of the plane localized Delaunay graph
  Prosenjit Bose, Paz Carmi, Michiel Smid, Daming Xu
  Lecture Notes in Computer Science 6034, 2010, pp. 282-293
• Randomised broadcasting: Memory vs. randomness
  Petra Berenbrink, Robert Elsässer, Thomas Sauerwald
  Lecture Notes in Computer Science 6034, 2010, pp. 306-319
• On quadratic threshold CSPs
  Per Austrin, Siavosh Benabbas, Avner Magen
  Lecture Notes in Computer Science 6034, 2010, pp. 332-343
• Lipschitz unimodal and isotonic regression on paths and trees
  Pankaj K. Agarwal, Jeff M. Phillips, Bardia Sadri
  Lecture Notes in Computer Science 6034, 2010, pp. 384-396
• Finding the smallest gap between sums of square roots
  Qi Cheng, Yu-Hsin Li
  Lecture Notes in Computer Science 6034, 2010, pp. 446-455
• Matching points with things
  Greg Aloupis, Jean Cardinal, Sébastien Collette, Erik D. Demaine, Martin L. Demaine, Muriel Dulieu, Ruy Fabila-Monroy, Vi Hart, Ferran Hurtado, Stefan Langerman, Maria Saumell, Carlos Seara, Perouz Taslakian
  Lecture Notes in Computer Science 6034, 2010, pp. 456-467
• Tilings robust to errors
  Alexis Ballier, Bruno Durand, Emmanuel Jeandel
  Lecture Notes in Computer Science 6034, 2010, pp. 480-491
• Visiting a sequence of points with a bevel-tip needle
  Steven Bitner, Yam K. Cheung, Atlas F. Cook IV, Ovidiu Daescu, Anastasia Kurdia, Carola Wenk
  Lecture Notes in Computer Science 6034, 2010, pp. 492-502
• Euclidean prize-collecting Steiner forest
  MohammadHossein Bateni, MohammadTaghi Hajiaghayi
  Lecture Notes in Computer Science 6034, 2010, pp. 503-514
• The power of fair pricing mechanisms
  Christine Chung, Katrina Ligett, Kirk Pruhs, Aaron L. Roth
  Lecture Notes in Computer Science 6034, 2010, pp. 554-564