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

• Linear algorithms for a k-partition problem of planar graphs without specifying bases
  Koichi Wada, Wei Chen
  Lecture Notes in Computer Science 1517, 1998, pp. 324-336
• Domination and Steiner tree problems on graphs with few P_4s
  Luitpold Babel, Stephan Olariu
  Lecture Notes in Computer Science 1517, 1998, pp. 337-350
• Minimum fill-in and treewidth for graphs modularly decomposable into chordal graphs
  Elias Dahlhaus
  Lecture Notes in Computer Science 1517, 1998, pp. 351-358
• Interval completion with the smallest max-degree
  Fedor V. Fomin, Petr A. Golovach
  Lecture Notes in Computer Science 1517, 1998, pp. 359-371
• An estimate of the tree-width of a planar graph which has not a given planar grid as a minor
  K.Yu. Gorbunov
  Lecture Notes in Computer Science 1517, 1998, pp. 372-383