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

• Counting the number of matchings in chordal and chordal bipartite graph classes
  Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno
  Lecture Notes in Computer Science 5911, 2010, pp. 296-307
• Distance d-domination games
  Stephan Kreutzer, Sebastian Ordyniak
  Lecture Notes in Computer Science 5911, 2010, pp. 308-319
• Cycles, paths, connectivity and diameter in distance graphs
  Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter
  Lecture Notes in Computer Science 5911, 2010, pp. 320-328
• Smallest odd holes in claw-free graphs
  Shimon Shrem, Michal Stern, Martin Charles Golumbic
  Lecture Notes in Computer Science 5911, 2010, pp. 329-340
• Finding induced paths of given parity in claw-free graphs
  Pim van 't Hof, Marcin Kamiński, Daniël Paulusma
  Lecture Notes in Computer Science 5911, 2010, pp. 341-352