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

• Lower bounds for linear decision trees via an energy complexity argument
  Kei Uchizawa, Eiji Takimoto
  Lecture Notes in Computer Science 6907, 2011, pp. 568-579
• Weak cost monadic logic over infinite trees
  Michael Vanden Boom
  Lecture Notes in Computer Science 6907, 2011, pp. 580-591
• Linear problem kernels for planar graph problems with small distance property
  Jianxin Wang, Yongjie Yang, Jiong Guo, Jianer Chen
  Lecture Notes in Computer Science 6907, 2011, pp. 592-603
• New parameterized algorithms for the edge dominating set problem
  Mingyu Xiao, Ton Kloks, Sheung-Hung Poon
  Lecture Notes in Computer Science 6907, 2011, pp. 604-615