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

• Homogeneous sets and domination problems
  Falk Nicolai, Thomas Szymczak
  Lecture Notes in Computer Science 1197, 1997, pp. 323-337
• Independent spanning trees of product graphs
  Koji Obokata, Yukihiro Iwasaki, Feng Bao, Yoshihide Igarashi
  Lecture Notes in Computer Science 1197, 1997, pp. 338-351
• Designing distance-preserving fault-tolerant topologies
  Swamy K. Sitarama, Abdol-Hossein Esfahanian
  Lecture Notes in Computer Science 1197, 1997, pp. 352-366
• Shortest path algorithms for nearly acyclic directed graphs
  Tadao Takaoka
  Lecture Notes in Computer Science 1197, 1997, pp. 367-374
• Computing disjoint paths with length constraints
  Spyros Tragoudas, Yaakov L. Varol
  Lecture Notes in Computer Science 1197, 1997, pp. 375-389
• Generalized edge-rankings of trees
  Xiao Zhou, M.A. Kashem, Takao Nishizeki
  Lecture Notes in Computer Science 1197, 1997, pp. 390-404