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

• Optimal exploration of terrains with obstacles
  Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc
  Lecture Notes in Computer Science 6139, 2010, pp. 1-12
• Reconstructing a simple polygon from its angles
  Yann Disser, Matús̑ Mihalák, Peter Widmayer
  Lecture Notes in Computer Science 6139, 2010, pp. 13-24
• Semidefinite programming and approximation algorithms: A survey
  Sanjeev Arora
  Lecture Notes in Computer Science 6139, 2010, pp. 25-25
• Strictly-regular number system and data structures
  Amr Elmasry, Claus Jensen, Jyrki Katajainen
  Lecture Notes in Computer Science 6139, 2010, pp. 26-37
• An O(\log \log n)-competitive binary search tree with optimal worst-case access times
  Prosenjit Bose, Karim Douïeb, Vida Dujmović, Rolf Fagerberg
  Lecture Notes in Computer Science 6139, 2010, pp. 38-49
• The emergence of sparse spanners and greedy well-separated pair decomposition
  Jie Gao, Dengpan Zhou
  Lecture Notes in Computer Science 6139, 2010, pp. 50-61
• A bottom-up method and fast algorithms for max independent set
  Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M.M. van Rooij
  Lecture Notes in Computer Science 6139, 2010, pp. 62-73
• Capacitated domination faster than O(2^n)
  Marek Cygan, Marcin Pilipczuk, Jakub Onufry Wojtaszczyk
  Lecture Notes in Computer Science 6139, 2010, pp. 74-80
• Isomorphism for graphs of bounded feedback vertex set number
  Stefan Kratsch, Pascal Schweitzer
  Lecture Notes in Computer Science 6139, 2010, pp. 81-92
• On feedback vertex set new measure and new structures
  Yixin Cao, Jianer Chen, Yang Liu
  Lecture Notes in Computer Science 6139, 2010, pp. 93-104
• Conflict-free coloring made stronger
  Elad Horev, Roi Krakovski, Shakhar Smorodinsky
  Lecture Notes in Computer Science 6139, 2010, pp. 105-117
• Polychromatic coloring for half-planes
  Shakhar Smorodinsky, Yelena Yuditsky
  Lecture Notes in Computer Science 6139, 2010, pp. 118-126
• A 3/2-approximation algorithm for multiple depot multiple Traveling Salesman Problem
  Zhou Xu, Brian Rodrigues
  Lecture Notes in Computer Science 6139, 2010, pp. 127-138
• Minimum and maximum against k lies
  Michael Hoffmann, Jiȓí Matous̑ek, Yoshio Okamoto, Philipp Zumstein
  Lecture Notes in Computer Science 6139, 2010, pp. 139-149
• Feasible and accurate algorithms for covering semidefinite programs
  Garud Iyengar, David J. Phillips, Cliff Stein
  Lecture Notes in Computer Science 6139, 2010, pp. 150-162
• The quantitative analysis of user behavior online - Data, models and algorithms
  Prabhakar Raghavan
  Lecture Notes in Computer Science 6139, 2010, pp. 163-163
• Systems of linear equations over \mathbb {F}_2 and problems parameterized above average
  Robert Crowston, Gregory Gutin, Mark Jones, Eun Jung Kim, Imre Z. Ruzsa
  Lecture Notes in Computer Science 6139, 2010, pp. 164-175
• Capacitated max-batching with interval graph compatibilities
  Tim Nonner
  Lecture Notes in Computer Science 6139, 2010, pp. 176-187
• A weakly robust PTAS for minimum clique partition in unit disk graphs
  Imran A. Pirwani, Mohammad R. Salavatipour
  Lecture Notes in Computer Science 6139, 2010, pp. 188-199
• Representing a functional curve by curves with fewer peaks
  Danny Z. Chen, Chao Wang, Haitao Wang
  Lecture Notes in Computer Science 6139, 2010, pp. 200-211
• Bregman clustering for separable instances
  Marcel R. Ackermann, Johannes Blömer
  Lecture Notes in Computer Science 6139, 2010, pp. 212-223
• Improved methods for generating quasi-Gray codes
  Prosenjit Bose, Paz Carmi, Dana Jansens, Anil Maheshwari, Pat Morin, Michiel Smid
  Lecture Notes in Computer Science 6139, 2010, pp. 224-235
• The MST of symmetric disk graphs is light
  A. Karim Abu-Affash, Rom Aschner, Paz Carmi, Matthew J. Katz
  Lecture Notes in Computer Science 6139, 2010, pp. 236-247
• Vector bin packing with multiple-choice
  Boaz Patt-Shamir, Dror Rawitz
  Lecture Notes in Computer Science 6139, 2010, pp. 248-259
• Bin packing with fixed number of bins revisited
  Klaus Jansen, Stefan Kratsch, Dániel Marx, Ildikó Schlotter
  Lecture Notes in Computer Science 6139, 2010, pp. 260-272