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.
| ISBN: | 9783642308901 |
| Publication date: | 31st May 2012 |
| Author: | M R Fellows, H L Bodlaender |
| Publisher: | Springer an imprint of Springer Berlin Heidelberg |
| Format: | Paperback |
| Pagination: | 496 pages |
| Series: | LNCS Sublibrary. SL 1, Theoretical Computer Science and General Issues |
| Genres: |
Algorithms and data structures Maths for computer scientists Discrete mathematics Mathematical theory of computation |