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

• An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals
  E. Boros, K. Elbassioni, V. Gurvich, Leonid Khachiyan
  Lecture Notes in Computer Science 2832, 2003, pp. 556-567
• Experiments on graph clustering algorithms
  Ulrik Brandes, Marco Gaertler, Dorothea Wagner
  Lecture Notes in Computer Science 2832, 2003, pp. 568-579
• More reliable protein NMR peak assignment via improved 2-interval scheduling
  Zhi-Zhong Chen, Tao Jiang, Guohui Lin, Romeo Rizzi, Jianjun Wen, Dong Xu, Ying Xu
  Lecture Notes in Computer Science 2832, 2003, pp. 580-592
• The minimum shift design problem: Theory and practice
  Luca Di Gaspero, Johannes Gärtner, Guy Kortsarz, Nysret Musliu, Andrea Schaerf, Wolfgang Slany
  Lecture Notes in Computer Science 2832, 2003, pp. 593-604
• Loglog counting of large cardinalities
  Marianne Durand, Philippe Flajolet
  Lecture Notes in Computer Science 2832, 2003, pp. 605-617
• Packing a trunk
  Friedrich Eisenbrand, Stefan Funke, Joachim Reichel, Elmar Schömer
  Lecture Notes in Computer Science 2832, 2003, pp. 618-629
• Fast smallest-enclosing-ball computation in high dimensions
  Kaspar Fischer, Bernd Gärtner, Martin Kutz
  Lecture Notes in Computer Science 2832, 2003, pp. 630-641
• Automated generation of search tree algorithms for graph modificaton problems
  Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier
  Lecture Notes in Computer Science 2832, 2003, pp. 642-653
• Boolean operations on 3D selective NEF complexes: Data structure, algorithms, and implementation
  Miguel Granados, Peter Hachenberger, Susan Hert, Lutz Kettner, Kurt Mehlhorn, Michael Seel
  Lecture Notes in Computer Science 2832, 2003, pp. 654-666
• Fleet assignment with connection dependent ground times
  Sven Grothklags
  Lecture Notes in Computer Science 2832, 2003, pp. 667-678
• A practical minimum spanning tree algorithm using the cycle property
  Irit Katriel, Peter Sanders, Jesper Larsson Träff
  Lecture Notes in Computer Science 2832, 2003, pp. 679-690
• The fractional prize-collecting Steiner tree problem on trees
  Gunnar W. Klau, Ivana Ljubić, Petra Mutzel, Ulrich Pferschy, René Weiskircher
  Lecture Notes in Computer Science 2832, 2003, pp. 691-702
• Algorithms and experiments for the webgraph
  Luigi Laura, Stefano Leonardi, Stefano Millozzi, Ulrich Meyer, Jop F. Sibeyn
  Lecture Notes in Computer Science 2832, 2003, pp. 703-714
• Finding short integral cycle bases for cyclic timetabling
  Christian Liebchen
  Lecture Notes in Computer Science 2832, 2003, pp. 715-726
• Slack optimization of timing-critical nets
  Matthias Müller-Hannemann, Ute Zimmermann
  Lecture Notes in Computer Science 2832, 2003, pp. 727-739
• Multisampling: A new approach to uniform sampling and approximate counting
  Piotr Sankowski
  Lecture Notes in Computer Science 2832, 2003, pp. 740-751
• Multicommodity flow approximation used for exact graph partitioning
  Meinolf Sellmann, Norbert Sensen, Larissa Timajev
  Lecture Notes in Computer Science 2832, 2003, pp. 752-764
• A linear time heuristic for the branch-decomposition of planar graphs
  Hisao Tamaki
  Lecture Notes in Computer Science 2832, 2003, pp. 765-775
• Geometric speed-up techniques for finding shortest paths in large sparse graphs
  Dorothea Wagner, Thomas Willhalm
  Lecture Notes in Computer Science 2832, 2003, pp. 776-787