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

• Finding small holes: A brief foray into computational topology
  Jeff Erickson
  Lecture Notes in Computer Science 4619, 2007, pp. 1-1
• Approximate range searching: The absolute model
  Guilherme D. da Fonseca
  Lecture Notes in Computer Science 4619, 2007, pp. 2-14
• Orthogonal range searching in linear and almost-linear space
  Yakov Nekrich
  Lecture Notes in Computer Science 4619, 2007, pp. 15-26
• Spherical LSH for approximate nearest neighbor search on unit hypersphere
  Kengo Terasawa, Yuzuru Tanaka
  Lecture Notes in Computer Science 4619, 2007, pp. 27-38
• A 4/3-approximation algorithm for minimum 3-edge-connectivity
  Prabhakar Gubbala, Balaji Raghavachari
  Lecture Notes in Computer Science 4619, 2007, pp. 39-51
• Approximating the maximum sharing problem
  Amitabh Chaudhary, Danny Z. Chen, Rudolf Fleischer, Xiaobo S. Hu, Jian Li, Michael T. Niemier, Zhiyi Xie, Hong Zhu
  Lecture Notes in Computer Science 4619, 2007, pp. 52-63
• The Stackelberg Minimum Spanning Tree game
  Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann
  Lecture Notes in Computer Science 4619, 2007, pp. 64-76
• Edges and switches, tunnels and bridges
  David Eppstein, Marc van Kreveld, Elena Mumford, Bettina Speckmann
  Lecture Notes in Computer Science 4619, 2007, pp. 77-88
• How to draw a clustered tree
  Giuseppe Di Battista, Guido Drovandi, Fabrizio Frati
  Lecture Notes in Computer Science 4619, 2007, pp. 89-101
• Drawing colored graphs on colored points
  Melanie Badent, Emilio Di Giacomo, Giuseppe Liotta
  Lecture Notes in Computer Science 4619, 2007, pp. 102-113
• Discrepancy-sensitive dynamic fractional cascading, dominated maxima searching, and 2-d nearest neighbors in any Minkowski metric
  Mikhail J. Atallah, Marina Blanton, Michael T. Goodrich, Stanislas Polu
  Lecture Notes in Computer Science 4619, 2007, pp. 114-126
• Priority queues resilient to memory faults
  Allan Grnlund Jrgensen, Gabriel Moruz, Thomas Mlhave
  Lecture Notes in Computer Science 4619, 2007, pp. 127-138
• Simple and space-efficient minimal perfect hash functions
  Fabiano C. Botelho, Rasmus Pagh, Nivio Ziviani
  Lecture Notes in Computer Science 4619, 2007, pp. 139-150
• A near linear time approximation scheme for Steiner tree among obstacles in the plane
  Matthias Müller-Hannemann, Siamak Tazari
  Lecture Notes in Computer Science 4619, 2007, pp. 151-162
• A pseudopolynomial time O(\log n)-approximation algorithm for art gallery problems
  Ajay Deshpande, Taejung Kim, Erik D. Demaine, Sanjay E. Sarma
  Lecture Notes in Computer Science 4619, 2007, pp. 163-174
• Optimization for first order Delaunay triangulations
  Marc van Kreveld, Maarten Löffler, Rodrigo I. Silveira
  Lecture Notes in Computer Science 4619, 2007, pp. 175-187
• Constant factor approximations for the hotlink assignment problem
  Tobias Jacobs
  Lecture Notes in Computer Science 4619, 2007, pp. 188-200
• Approximation algorithms for the sex-equal stable marriage problem
  Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa
  Lecture Notes in Computer Science 4619, 2007, pp. 201-213
• A stab at approximating minimum subadditive join
  Staal A. Vinterbo
  Lecture Notes in Computer Science 4619, 2007, pp. 214-225
• Algorithmic challenges for systems-level correlational analysis: A tale of two datasets
  Michael A. Langston
  Lecture Notes in Computer Science 4619, 2007, pp. 226-226
• Flooding countries and destroying dams
  Rodrigo I. Silveira, René van Oostrum
  Lecture Notes in Computer Science 4619, 2007, pp. 227-238
• I/O-efficient flow modeling on fat terrains
  Mark de Berg, Otfried Cheong, Herman Haverkort, Jung Gun Lim, Laura Toma
  Lecture Notes in Computer Science 4619, 2007, pp. 239-250
• Computing the visibility map of fat objects
  Mark de Berg, Chris Gray
  Lecture Notes in Computer Science 4619, 2007, pp. 251-262
• Independent sets in bounded-degree hypergraphs
  Magnús M. Halldórsson, Elena Losievskaja
  Lecture Notes in Computer Science 4619, 2007, pp. 263-274
• Steiner tree in planar graphs: An O(n \log n) approximation scheme with singly-exponential dependence on epsilon
  Glencora Borradaile, Philip N. Klein, Claire Mathieu
  Lecture Notes in Computer Science 4619, 2007, pp. 275-286