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

• Approximation algorithms for 3-D common substructure identification in drug and protein molecules
  Samarjit Chakraborty, Somenath Biswas
  Lecture Notes in Computer Science 1663, 1999, pp. 253-264
• A tight bound for \beta-skeleton of minimum weight triangulations
  Cao An Wang, Boting Yang
  Lecture Notes in Computer Science 1663, 1999, pp. 265-275
• Rectilinear static and dynamic discrete 2-center problems
  Sergei Bespamyatnikh, Michael Segal
  Lecture Notes in Computer Science 1663, 1999, pp. 276-287
• Gene trees and species trees: The gene-duplication problem is fixed-parameter tractable
  Ulrike Stege
  Lecture Notes in Computer Science 1663, 1999, pp. 288-293
• Efficient Web searching using temporal factors
  Artur Czumaj, Ian Finch, Leszek Ga̧sieniec, Alan Gibbons, Paul Leng, Wojciech Rytter, Michele Zito
  Lecture Notes in Computer Science 1663, 1999, pp. 294-305
• Elastic labels around the perimeter of a map
  Claudia Iturriaga, Anna Lubiw
  Lecture Notes in Computer Science 1663, 1999, pp. 306-317
• Optimal facility location under various distance functions
  Sergei Bespamyatnikh, Klara Kedem, Michael Segal
  Lecture Notes in Computer Science 1663, 1999, pp. 318-329
• Thresholds for sports elimination numbers: Algorithms and complexity
  Dan Gusfield, Chip Martel
  Lecture Notes in Computer Science 1663, 1999, pp. 330-341
• Dynamic representations of sparse graphs
  Gerth Stlting Brodal, Rolf Fagerberg
  Lecture Notes in Computer Science 1663, 1999, pp. 342-351
• Online data structures in external memory
  Jeffrey Scott Vitter
  Lecture Notes in Computer Science 1663, 1999, pp. 352-366