[Lecture Notes in Computer Science] The
โ
Bodlaender, Hans L.; Downey, Rod; Fomin, Fedor V.; Marx, Dรกniel
๐
Article
๐
2012
๐
Springer Berlin Heidelberg
๐
English
โ 208 KB
Parameterized complexity is currently a thriving field in complexity theory and algorithm design. A significant part of the success of the field can be attributed to Michael R. Fellows. This Festschrift has been published in honor of Mike Fellows on the occasion of his 60th birthday. It contains 20