Bodlaender, H.L., Downey, R., Fomin, F.V., Marx, D. (Eds.)
2012, XXII, 506p. 32 illus..
Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.
You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.
After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.
Features classical research papers reflecting the breadth of the work and influence of Michael R. Fellows
Written by experts
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 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.
Fixed-Parameter Tractability, A Prehistory.- The Birth and Early Years of Parameterized Complexity.- Crypto Galore!.- Flyby: Life Before, During, and After Graduate Studies with Mike Fellows.- The Impact of Parameterized Complexity to Interdisciplinary Problem Solving.- Vertex Cover, Dominating Set and My Encounters with Parameterized Complexity and Mike Fellows.- Mike Fellows: Weaving the Web of Mathematics and Adventure.- Passion Plays: Melodramas about Mathematics.- A Basic Parameterized Complexity Primer.- Kernelization – Preprocessing with a Guarantee.- Parameterized Complexity and Subexponential-Time Computability.- Fixed-Parameter Tractability of Treewidth and Pathwidth.- Graph Minors and Parameterized Algorithm Design.- Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey.- Backdoors to Satisfaction.- Studies in Computational Aspects of Voting: A Parameterized Complexity Perspective.- A Parameterized Halting Problem.- Computer Science Unplugged and Related Projects in Math and Computer Science Popularization.- FPT Suspects and Tough Customers: Open Problems of Downey and Fellows.- What’s Next? Future Directions in Parameterized Complexity.