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 Volume=4698

• Optimal algorithms for k-search with application in option pricing
  Julian Lorenz, Konstantinos Panagiotou, Angelika Steger
  Lecture Notes in Computer Science 4698, 2007, pp. 275-286
• Linear data structures for fast ray-shooting amidst convex polyhedra
  Haim Kaplan, Natan Rubin, Micha Sharir
  Lecture Notes in Computer Science 4698, 2007, pp. 287-298
• Stackelberg strategies for atomic congestion games
  Dimitris Fotakis
  Lecture Notes in Computer Science 4698, 2007, pp. 299-310
• Good quality virtual realization of unit ball graphs
  Sriram V. Pemmaraju, Imran A. Pirwani
  Lecture Notes in Computer Science 4698, 2007, pp. 311-322
• Algorithms for playing games with limited randomness
  Shankar Kalyanaraman, Christopher Umans
  Lecture Notes in Computer Science 4698, 2007, pp. 323-334
• Approximation of partial capacitated vertex cover
  Reuven Bar-Yehuda, Guy Flysher, Julián Mestre, Dror Rawitz
  Lecture Notes in Computer Science 4698, 2007, pp. 335-346
• Optimal resilient dynamic dictionaries
  Gerth Stlting Brodal, Rolf Fagerberg, Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano, Allan Grnlund Jrgensen, Gabriel Moruz, Thomas Mlhave
  Lecture Notes in Computer Science 4698, 2007, pp. 347-358
• Determining the smallest k such that G is k-outerplanar
  Frank Kammer
  Lecture Notes in Computer Science 4698, 2007, pp. 359-370
• On the size of succinct indices
  Alexander Golynski, Roberto Grossi, Ankur Gupta, Rajeev Raman, Satti Rao
  Lecture Notes in Computer Science 4698, 2007, pp. 371-382
• Compact oracles for approximate distances around obstacles in the plane
  Mikkel Thorup
  Lecture Notes in Computer Science 4698, 2007, pp. 383-394
• Convex combinations of single source unsplittable flows
  Maren Martens, Fernanda Salazar, Martin Skutella
  Lecture Notes in Computer Science 4698, 2007, pp. 395-406
• Farthest-polygon Voronoi diagrams
  Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na
  Lecture Notes in Computer Science 4698, 2007, pp. 407-418
• Equitable revisited
  Wolfgang Bein, Lawrence L. Larmore, John Noga
  Lecture Notes in Computer Science 4698, 2007, pp. 419-426
• Online scheduling of equal-length jobs on parallel machines
  Jihuan Ding, Tomás̑ Ebenlendr, Jiȓí Sgall, Guochuan Zhang
  Lecture Notes in Computer Science 4698, 2007, pp. 427-438
• k-anonymization with minimal loss of information
  Aristides Gionis, Tamir Tassa
  Lecture Notes in Computer Science 4698, 2007, pp. 439-450
• A quasi-PTAS for profit-maximizing pricing on line graphs
  Khaled Elbassioni, René Sitters, Yan Zhang
  Lecture Notes in Computer Science 4698, 2007, pp. 451-462
• Improved upper bounds on the competitive ratio for online realtime scheduling
  Koji Kobayashi, Kazuya Okamoto
  Lecture Notes in Computer Science 4698, 2007, pp. 463-474
• Bundle pricing with comparable items
  Alexander Grigoriev, Joyce van Loon, Maxim Sviridenko, Marc Uetz, Tjark Vredeveld
  Lecture Notes in Computer Science 4698, 2007, pp. 475-486
• Approximating interval scheduling problems with bounded profits
  Israel Beniaminy, Zeev Nutov, Meir Ovadia
  Lecture Notes in Computer Science 4698, 2007, pp. 487-497
• Pricing tree access networks with connected backbones
  Vineet Goyal, Anupam Gupta, Stefano Leonardi, R. Ravi
  Lecture Notes in Computer Science 4698, 2007, pp. 498-509
• Distance coloring
  Alexa Sharp
  Lecture Notes in Computer Science 4698, 2007, pp. 510-521
• An O(\log^2 k)-competitive algorithm for metric bipartite matching
  Nikhil Bansal, Niv Buchbinder, Anupam Gupta, Joseph (seffi) Naor
  Lecture Notes in Computer Science 4698, 2007, pp. 522-533
• To fill or not to fill: The gas station problem
  Samir Khuller, Azarakhsh Malekian, Julián Mestre
  Lecture Notes in Computer Science 4698, 2007, pp. 534-545
• Online bandwidth allocation
  Michal Foris̑ek, Branislav Katreniak, Jana Katreniaková, Rastislav Královic̑, Richard Královic̑, Vladimír Koutný, Dana Pardubská, Tomás̑ Plachetka, Branislav Rovan
  Lecture Notes in Computer Science 4698, 2007, pp. 546-557
• Two's company, three's a crowd: Stable family and threesome roommates problems
  Chien-Chung Huang
  Lecture Notes in Computer Science 4698, 2007, pp. 558-569