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

• Finding the diameter in real-world graphs: Experimentally turning a lower bound into an upper bound
  Pierluigi Crescenzi, Roberto Grossi, Claudio Imbrenda, Leonardo Lanzi, Andrea Marino
  Lecture Notes in Computer Science 6346, 2010, pp. 302-313
• Budgeted red-blue median and its generalizations
  MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz
  Lecture Notes in Computer Science 6346, 2010, pp. 314-325
• All ternary permutation constraint satisfaction problems parameterized above average have kernels with quadratic numbers of variables
  Gregory Gutin, Leo van Iersel, Matthias Mnich, Anders Yeo
  Lecture Notes in Computer Science 6346, 2010, pp. 326-337
• Strong formulations for the multi-module PESP and a quadratic algorithm for graphical diophantine equation systems
  Laura Galli, Sebastian Stiller
  Lecture Notes in Computer Science 6346, 2010, pp. 338-349
• Robust algorithms for sorting railway cars
  Christina Büsing, Jens Maue
  Lecture Notes in Computer Science 6346, 2010, pp. 350-361
• Cloning Voronoi diagrams via retroactive data structures
  Matthew T. Dickerson, David Eppstein, Michael T. Goodrich
  Lecture Notes in Computer Science 6346, 2010, pp. 362-373
• A unified approach to approximate proximity searching
  Sunil Arya, Guilherme D. da Fonseca, David M. Mount
  Lecture Notes in Computer Science 6346, 2010, pp. 374-385
• Spatio-temporal range searching over compressed kinetic sensor data
  Sorelle A. Friedler, David M. Mount
  Lecture Notes in Computer Science 6346, 2010, pp. 386-397
• Constructing the exact Voronoi diagram of arbitrary lines in three-dimensional space with fast point-location
  Michael Hemmer, Ophir Setter, Dan Halperin
  Lecture Notes in Computer Science 6346, 2010, pp. 398-409
• Local graph exploration and fast property testing
  Artur Czumaj
  Lecture Notes in Computer Science 6346, 2010, pp. 410-414
• A fully compressed algorithm for computing the edit distance of run-length encoded strings
  Kuan-Yu Chen, Kun-Mao Chao
  Lecture Notes in Computer Science 6346, 2010, pp. 415-426
• Fast prefix search in little space, with applications
  Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna
  Lecture Notes in Computer Science 6346, 2010, pp. 427-438
• On the Huffman and alphabetic tree problem with general cost functions
  Hiroshi Fujiwara, Tobias Jacobs
  Lecture Notes in Computer Science 6346, 2010, pp. 439-450
• Medium-space algorithms for inverse BWT
  Juha Kärkkäinen, Simon J. Puglisi
  Lecture Notes in Computer Science 6346, 2010, pp. 451-462
• Median trajectories
  Kevin Buchin, Maike Buchin, Marc van Kreveld, Maarten Löffler, Rodrigo I. Silveira, Carola Wenk, Lionov Wiratma
  Lecture Notes in Computer Science 6346, 2010, pp. 463-474
• Optimal cover of points by disks in a simple polygon
  Haim Kaplan, Matthew J. Katz, Gila Morgenstern, Micha Sharir
  Lecture Notes in Computer Science 6346, 2010, pp. 475-486
• Stability of \epsilon-kernels
  Pankaj K. Agarwal, Jeff M. Phillips, Hai Yu
  Lecture Notes in Computer Science 6346, 2010, pp. 487-499
• The geodesic diameter of polygonal domains
  Sang Won Bae, Matias Korman, Yoshio Okamoto
  Lecture Notes in Computer Science 6346, 2010, pp. 500-511
• Polyhedral and algorithmic properties of quantified linear programs
  U. Lorenz, A. Martin, J. Wolf
  Lecture Notes in Computer Science 6346, 2010, pp. 512-523
• Approximating parameterized convex optimization problems
  Joachim Giesen, Martin Jaggi, Sören Laue
  Lecture Notes in Computer Science 6346, 2010, pp. 524-535
• Approximation schemes for multi-budgeted independence systems
  Fabrizio Grandoni, Rico Zenklusen
  Lecture Notes in Computer Science 6346, 2010, pp. 536-548
• Algorithmic meta-theorems for restrictions of treewidth
  Michael Lampis
  Lecture Notes in Computer Science 6346, 2010, pp. 549-560
• Determining edge expansion and other connectivity measures of graphs of bounded genus
  Viresh Patel
  Lecture Notes in Computer Science 6346, 2010, pp. 561-572
• Constructing the R^* consensus tree of two trees in subcubic time
  Jesper Jansson, Wing-Kin Sung
  Lecture Notes in Computer Science 6346, 2010, pp. 573-584