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

• On Big Data algorithmics
  Yossi Matias
  Lecture Notes in Computer Science 7501, 2012, pp. 1-1
• Open problems in throughput scheduling
  Jiȓí Sgall
  Lecture Notes in Computer Science 7501, 2012, pp. 2-11
• Preemptive coordination mechanisms for unrelated machines
  Fidaa Abed, Chien-Chung Huang
  Lecture Notes in Computer Science 7501, 2012, pp. 12-23
• Hierarchical hub labelings for shortest paths
  Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato F.Werneck
  Lecture Notes in Computer Science 7501, 2012, pp. 24-35
• Bottleneck non-crossing matching in the plane
  A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Yohai Trabelsi
  Lecture Notes in Computer Science 7501, 2012, pp. 36-47
• Lower bounds for sorted geometric queries in the I/O model
  Peyman Afshani, Norbert Zeh
  Lecture Notes in Computer Science 7501, 2012, pp. 48-59
• Constructing street networks from GPS trajectories
  Mahmuda Ahmed, Carola Wenk
  Lecture Notes in Computer Science 7501, 2012, pp. 60-71
• I/O-efficient hierarchical diameter approximation
  Deepak Ajwani, Ulrich Meyer, David Veith
  Lecture Notes in Computer Science 7501, 2012, pp. 72-83
• On the value of job migration in online makespan minimization
  Susanne Albers, Matthias Hellwig
  Lecture Notes in Computer Science 7501, 2012, pp. 84-95
• Simplifying massive contour maps
  Lars Arge, Lasse Deleuran, Thomas Mlhave, Morten Revsbæk, Jakob Truelsen
  Lecture Notes in Computer Science 7501, 2012, pp. 96-107
• Explicit and efficient hash families suffice for cuckoo hashing with a stash
  Martin Aumüller, Martin Dietzfelbinger, Philipp Woelfel
  Lecture Notes in Computer Science 7501, 2012, pp. 108-120
• On online labeling with polynomially many labels
  Martin Babka, Jan Bulánek, Vladimír C̑unát, Michal Koucký, Michael Saks
  Lecture Notes in Computer Science 7501, 2012, pp. 121-132
• A 5-approximation for capacitated facility location
  Manisha Bansal, Naveen Garg, Neelima Gupta
  Lecture Notes in Computer Science 7501, 2012, pp. 133-144
• Weighted geometric set multi-cover via quasi-uniform sampling
  Nikhil Bansal, Kirk Pruhs
  Lecture Notes in Computer Science 7501, 2012, pp. 145-156
• A bicriteria approximation for the reordering buffer problem
  Siddharth Barman, Shuchi Chawla, Seeun Umboh
  Lecture Notes in Computer Science 7501, 2012, pp. 157-168
• Time-dependent route planning with generalized objective functions
  Gernot Veit Batz, Peter Sanders
  Lecture Notes in Computer Science 7501, 2012, pp. 169-180
• New lower and upper bounds for representing sequences
  Djamal Belazzougui, Gonzalo Navarro
  Lecture Notes in Computer Science 7501, 2012, pp. 181-192
• Span programs and quantum algorithms for st-connectivity and claw detection
  Aleksandrs Belovs, Ben W. Reichardt
  Lecture Notes in Computer Science 7501, 2012, pp. 193-204
• The stretch factor of L_1- and L_{\infty}-Delaunay triangulations
  Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse
  Lecture Notes in Computer Science 7501, 2012, pp. 205-216
• Two dimensional range minimum queries and Fibonacci lattices
  Gerth Stlting Brodal, Pooya Davoodi, Moshe Lewenstein, Rajeev Raman, Satti Srinivasa Rao
  Lecture Notes in Computer Science 7501, 2012, pp. 217-228
• Locally correct Fréchet matchings
  Kevin Buchin, Maike Buchin, Wouter Meulemans, Bettina Speckmann
  Lecture Notes in Computer Science 7501, 2012, pp. 229-240
• The clique problem in ray intersection graphs
  Sergio Cabello, Jean Cardinal, Stefan Langerman
  Lecture Notes in Computer Science 7501, 2012, pp. 241-252
• Revenue guarantees in sponsored search auctions
  Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou
  Lecture Notes in Computer Science 7501, 2012, pp. 253-264
• Optimizing social welfare for network bargaining games in the face of unstability, greed and spite
  T.-H. Hubert Chan, Fei Chen, Li Ning
  Lecture Notes in Computer Science 7501, 2012, pp. 265-276
• Optimal lower bound for differentially private multi-party aggregation
  T.-H. Hubert Chan, Elaine Shi, Dawn Song
  Lecture Notes in Computer Science 7501, 2012, pp. 277-288