default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID60th Birthday: Michael R. Fellows : 2012
- Hans L. Bodlaender
, Rod Downey, Fedor V. Fomin, Dániel Marx:
The Multivariate Algorithmic Revolution and Beyond - Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 7370, Springer 2012, ISBN 978-3-642-30890-1
Memories
- Michael A. Langston:
Fixed-Parameter Tractability, A Prehistory, . 3-16 - Rod Downey:
The Birth and Early Years of Parameterized Complexity. 17-38 - Neal Koblitz:
Crypto Galore! 39-50 - Todd Wareham:
Flyby: Life Before, During, and After Graduate Studies with Mike Fellows. 51-55 - Ulrike Stege:
The Impact of Parameterized Complexity to Interdisciplinary Problem Solving. 56-68 - Venkatesh Raman:
Vertex Cover, Dominating Set and My Encounters with Parameterized Complexity and Mike Fellows. 69-73 - Jan Arne Telle:
Mike Fellows: Weaving the Web of Mathematics and Adventure. 74-79 - Frances A. Rosamond:
Passion Plays: Melodramas about Mathematics. 80-87
Surveys
- Rod Downey:
A Basic Parameterized Complexity Primer. 91-128 - Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh:
Kernelization - Preprocessing with a Guarantee. 129-161 - Jianer Chen, Iyad A. Kanj:
Parameterized Complexity and Subexponential-Time Computability. 162-195 - Hans L. Bodlaender:
Fixed-Parameter Tractability of Treewidth and Pathwidth. 196-227 - Dimitrios M. Thilikos:
Graph Minors and Parameterized Algorithm Design. 228-256 - Gregory Z. Gutin, Anders Yeo:
Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey. 257-286 - Serge Gaspers, Stefan Szeider:
Backdoors to Satisfaction. 287-317 - Nadja Betzler, Robert Bredereck, Jiehua Chen, Rolf Niedermeier:
Studies in Computational Aspects of Voting - A Parameterized Complexity Perspective. 318-363 - Yijia Chen, Jörg Flum:
A Parameterized Halting Problem. 364-397 - Tim Bell, Frances A. Rosamond, Nancy Casey:
Computer Science Unplugged and Related Projects in Math and Computer Science Popularization. 398-456 - Fedor V. Fomin, Dániel Marx:
FPT Suspects and Tough Customers: Open Problems of Downey and Fellows. 457-468 - Dániel Marx:
What's Next? Future Directions in Parameterized Complexity. 469-496
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-26 07:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
