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

• On a conjecture on Wiener indices in combinatorial chemistry
  Yih-En Andrew Ban, Sergei Bespamyatnikh, Nabil H. Mustafa
  Lecture Notes in Computer Science 2697, 2003, pp. 509-518
• Double digest revisited: Complexity and approximability in the presence of noisy data
  Mark Cieliebak, Stephan Eidenbenz, Gerhard J. Woeginger
  Lecture Notes in Computer Science 2697, 2003, pp. 519-527
• Fast and space-efficient location of heavy or dense segments in run-length encoded sequences
  Ronald I. Greenberg
  Lecture Notes in Computer Science 2697, 2003, pp. 528-536
• Genomic distances under deletions and insertions
  Mark Marron, Krister M. Swenson, Bernard M.E. Moret
  Lecture Notes in Computer Science 2697, 2003, pp. 537-547
• Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable
  Stefan Szeider
  Lecture Notes in Computer Science 2697, 2003, pp. 548-558