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

• Characterization and recognition of digraphs of bounded Kelly-width
  Daniel Meister, Jan Arne Telle, Martin Vatshelle
  Lecture Notes in Computer Science 4769, 2007, pp. 270-279
• How to use planarity efficiently: New tree-decomposition based algorithms
  Frederic Dorn
  Lecture Notes in Computer Science 4769, 2007, pp. 280-291
• Obtaining a planar graph by vertex deletion
  Dániel Marx, Ildikó Schlotter
  Lecture Notes in Computer Science 4769, 2007, pp. 292-303
• Mixed search number and linear-width of interval and split graphs
  Fedor V. Fomin, Pinar Heggernes, Rodica Mihai
  Lecture Notes in Computer Science 4769, 2007, pp. 304-315
• Lower bounds for three algorithms for the transversal hypergraph generation
  Matthias Hagen
  Lecture Notes in Computer Science 4769, 2007, pp. 316-327
• The complexity of bottleneck labeled graph problems
  Refael Hassin, Jérôme Monnot, Danny Segev
  Lecture Notes in Computer Science 4769, 2007, pp. 328-340