The Multivariate Algorithmic Revolution and Beyond [electronic resource] : Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday /
Bodlaender, Hans L.editor.(orcid)0000-0002-9297-3330https://orcid.org/0000-0002-9297-3330edt
Downey, Rodney.editor.
Fomin, Fedor V.editor.
Marx, Dániel.editor.
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.
Bibliographic Level Mode of Issuance: Monograph
Includes bibliographical references and author index.
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.
Algorithms.
Computer science—Mathematics.
Computers.
Mathematical logic.
Computer logic.
Algorithm Analysis and Problem Complexity.
Discrete Mathematics in Computer Science.
Computation by Abstract Devices.
Mathematical Logic and Formal Languages.
Logics and Meanings of Programs.
Lecture notes in computer science