✍ Scribed by Bodlaender, Hans L.; Downey, Rod; Fomin, Fedor V.; Marx, Dániel
No coin nor oath required. For personal study only.
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 papers that showcase the important scientific contributions of this remarkable man, describes the history of the field of parameterized complexity, and also reflects on other parts of Mike Fellows’s unique and broad range of interests, including his work on the popularization of discrete mathematics for young children. The volume contains several surveys that introduce the reader to the field of parameterized complexity and discuss important notions, results, and developments in this field.
📜 SIMILAR VOLUMES
Annotation This Book Constitutes The Refereed Proceedings Of The 21st International Symposium On Algorithms And Computation, Isaac 2010, Held In Jeju, South Korea In December 2010. The 77 Revised Full Papers Presented Were Carefully Reviewed And Selected From 182 Submissions For Inclusion In The Boo
Of interest to both researchers and professionals, this book constitutes the thoroughly refereed post-proceedings of the first International Conference on E-Voting and Identity, VOTE-ID 2007, held in Germany in 2007. The 16 revised full papers here were reviewed and selected from numerous submission