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

• Some open questions related to cuckoo hashing
  Michael Mitzenmacher
  Lecture Notes in Computer Science 5757, 2009, pp. 1-10
• Efficient computation of the characteristic polynomial of a tree and related tasks
  Martin Fürer
  Lecture Notes in Computer Science 5757, 2009, pp. 11-22
• Improved approximation algorithms for label cover problems
  Moses Charikar, MohammadTaghi Hajiaghayi, Howard Karloff
  Lecture Notes in Computer Science 5757, 2009, pp. 23-34
• A linear time algorithm for L(2,1)-labeling of trees
  Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
  Lecture Notes in Computer Science 5757, 2009, pp. 35-46
• On inducing polygons and related problems
  Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, Marc Scherfenberg
  Lecture Notes in Computer Science 5757, 2009, pp. 47-58
• Computing 3D periodic triangulations
  Manuel Caroli, Monique Teillaud
  Lecture Notes in Computer Science 5757, 2009, pp. 59-70
• Cauchy's theorem for orthogonal polyhedra of genus 0
  Therese Biedl, Burkay Genc
  Lecture Notes in Computer Science 5757, 2009, pp. 71-82
• Approximability of sparse integer programs
  David Pritchard
  Lecture Notes in Computer Science 5757, 2009, pp. 83-94
• Iterative rounding for multi-objective optimization problems
  Fabrizio Grandoni, R. Ravi, Mohit Singh
  Lecture Notes in Computer Science 5757, 2009, pp. 95-106
• A global-optimization algorithm for mixed-integer nonlinear programs having separable non-convexity
  Claudia D'Ambrosio, Jon Lee, Andreas Wächter
  Lecture Notes in Computer Science 5757, 2009, pp. 107-118
• Constructing Delaunay triangulations along space-filling curves
  Kevin Buchin
  Lecture Notes in Computer Science 5757, 2009, pp. 119-130
• Piercing translates and homothets of a convex body
  Adrian Dumitrescu, Minghui Jiang
  Lecture Notes in Computer Science 5757, 2009, pp. 131-142
• Output-sensitive algorithms for enumerating minimal transversals for some geometric hypergraphs
  Khaled Elbassioni, Kazuhisa Makino, Imran Rauf
  Lecture Notes in Computer Science 5757, 2009, pp. 143-154
• On revenue maximization in second-price ad auctions
  Yossi Azar, Benjamin Birnbaum, Anna R. Karlin, C. Thach Nguyen
  Lecture Notes in Computer Science 5757, 2009, pp. 155-166
• Clustering-based bidding languages for sponsored search
  Mohammad Mahdian, Grant Wang
  Lecture Notes in Computer Science 5757, 2009, pp. 167-178
• Altruism in atomic congestion games
  Martin Hoefer, Alexander Skopalik
  Lecture Notes in Computer Science 5757, 2009, pp. 179-189
• Geometric spanners for weighted point sets
  Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson, Michiel Smid
  Lecture Notes in Computer Science 5757, 2009, pp. 190-202
• k-outerplanar graphs, planar duality, and low stretch spanning trees
  Yuval Emek
  Lecture Notes in Computer Science 5757, 2009, pp. 203-214
• Narrow-shallow-low-light trees with and without Steiner points
  Michael Elkin, Shay Solomon
  Lecture Notes in Computer Science 5757, 2009, pp. 215-226
• Bounded budget betweenness centrality game for strategic network formations
  Xiaohui Bei, Wei Chen, Shang-Hua Teng, Jialin Zhang, Jiajie Zhu
  Lecture Notes in Computer Science 5757, 2009, pp. 227-238
• Exact and approximate equilibria for optimal Group Network Formation
  Elliot Anshelevich, Bugra Caskurlu
  Lecture Notes in Computer Science 5757, 2009, pp. 239-250
• On the performance of approximate equilibria in congestion games
  George Christodoulou, Elias Koutsoupias, Paul G. Spirakis
  Lecture Notes in Computer Science 5757, 2009, pp. 251-262
• Optimality and competitiveness of exploring polygons by mobile robots
  Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc
  Lecture Notes in Computer Science 5757, 2009, pp. 263-274
• Tractable cases of facility location on a network with a linear reliability order of links
  Refael Hassin, R. Ravi, F. Sibel Salman
  Lecture Notes in Computer Science 5757, 2009, pp. 275-276
• Dynamic vs. oblivious routing in network design
  Navin Goyal, Neil Olver, F. Bruce Shepherd
  Lecture Notes in Computer Science 5757, 2009, pp. 277-288