| Description |
1 online resource : portraits |
| Series |
Lecture notes in computer science, 0302-9743 ; 7370 |
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
|
Lecture notes in computer science ; 7370.
|
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
|
| Contents |
Machine generated contents note: pt. I Memories -- Fixed-Parameter Tractability, A Prehistory / Michael A. Langston -- Birth and Early Years of Parameterized Complexity / Rod Downey -- Crypto Galore! / Neal Koblitz -- Flyby: Life Before, During, and After Graduate Studies with Mike Fellows / Todd Wareham -- Impact of Parameterized Complexity to Interdisciplinary Problem Solving / Ulrike Stege -- Vertex Cover, Dominating Set and My Encounters with Parameterized Complexity and Mike Fellows / Venkatesh Raman -- Mike Fellows: Weaving the Web of Mathematics and Adventure / Jan Arne Telle -- Passion Plays: Melodramas about Mathematics / Frances Rosamond -- pt. II Surveys -- Basic Parameterized Complexity Primer / Rod Downey -- Kernelization -- Preprocessing with a Guarantee / Saket Saurabh -- Parameterized Complexity and Subexponential-Time Computability / Iyad A. Kanj -- Fixed-Parameter Tractability of Treewidth and Pathwidth / Hans L. Bodlaender -- Graph Minors and Parameterized Algorithm Design / Dimitrios M. Thilikos -- Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey / Anders Yeo -- Backdoors to Satisfaction / Stefan Szeider -- Studies in Computational Aspects of Voting: A Parameterized Complexity Perspective / Rolf Niedermeier -- Parameterized Halting Problem / Jorg Flum -- Computer Science Unplugged and Related Projects in Math and Computer Science Popularization / Nancy Casey -- FPT Suspects and Tough Customers: Open Problems of Downey and Fellows / Daniel Marx -- What's Next? Future Directions in Parameterized Complexity / Daniel Marx |
| Summary |
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 |
| Analysis |
Computer science |
|
Computer software |
|
Logic design |
|
Computational complexity |
|
Algorithm Analysis and Problem Complexity |
|
Discrete Mathematics in Computer Science |
|
Computation by Abstract Devices |
|
Mathematical Logic and Formal Languages |
|
Logics and Meanings of Programs |
| Bibliography |
Includes bibliographical references and author index |
| Notes |
English |
| Subject |
Computational complexity.
|
|
Computer algorithms.
|
|
Algorithms.
|
|
algorithms.
|
|
Informatique.
|
|
Algorithms
|
|
Computational complexity
|
|
Computer algorithms
|
| Genre/Form |
Festschriften
|
|
Software.
|
|
Festschriften.
|
| Form |
Electronic book
|
| Author |
Bodlaender, H. L.
|
| ISBN |
9783642308918 |
|
3642308910 |
|
