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 [2]	Hilfe

Suche: Series=LNCS AND Volume=4835

• Minimum fill-in and treewidth of split+ke and split+kv graphs
  Federico Mancini
  Lecture Notes in Computer Science 4835, 2007, pp. 881-892
• Weighted treewidth algorithmic techniques and results
  Emgad Bachoore, Hans L. Bodlaender
  Lecture Notes in Computer Science 4835, 2007, pp. 893-903
• Spanning trees with many leaves in regular bipartite graphs
  Emanuele Fusco, Angelo Monti
  Lecture Notes in Computer Science 4835, 2007, pp. 904-914
• Problem kernels for NP-complete edge deletion problems: Split and related graphs
  Jiong Guo
  Lecture Notes in Computer Science 4835, 2007, pp. 915-926