Abstract
This informal tribute in honor of Mike Fellows’ 60th birthday is based on some personal recollections.
Keywords
- Parameterized Complexity
- Planar Cover
- Graph Homomorphism
- Crossword Puzzle
- Personal Recollection
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Abello, J., Fellows, M., Stillwell, J.: On the Complexity and Combinatorics of Covering Finite Complexes. Australasian Journal of Combinatorics 4 (1991)
Bell, T., Fellows, M., Witten, I.: Computer Science Unplugged: offline activities and games for all ages (1996)
Bodlaender, H., Downey, R., Fellows, M., Hermelin, D.: On problems without polynomial kernels. J. Comput. Syst. Sci. 75, 8 (2009)
Courcelle, B., Engelfriet, J., Rozenberg, G.: Handle-rewriting hypergraph grammars. J. Comput. System Sci. 46, 218–270 (1993)
Downey, R., Fellows, M.: Parameterized Complexity. Springer (1999)
Everett, M., Borgatti, S.: Role colouring a graph. Mathematical Social Sciences 21(2), 183–188 (1991)
Fellows, M.: Encoding Graphs in Graphs. Ph.D. Dissertation, Univ. of California, San Diego (1985)
Fellows, M., Rosamond, F., Rotics, U., Szeider, S.: Clique-Width Minimization is NP-Hard. In: Proceedings of the 38th Annual Symposium on Theory of Computing, STOC 2006 (2006)
Fellows, M.: Planar Emulators and Planar Covers (1988) (manuscript)
Fellows, M.: Advice to Students, http://www.mrfellows.net/wordpress/advice-to-students-2/
Fiala, J., Kratochvíl, J.: Locally constrained graph homomorphisms - structure, complexity, and applications. Computer Science Review 2, 97–111 (2008)
Hlinêný, P.: 20 Years of Negamis Planar Cover Conjecture. Graphs and Combinatorics 26, 525–536 (2010)
The Mathematics Genealogy Project
Negami, S.: The Spherical Genus and Virtually Planar Graphs. Discrete Math. 70, 159–168 (1988)
Rieck, Y., Yamashita, Y.: Finite planar emulators for K\(_{\mbox{4,5}}\)-4K\(_{\mbox{2}}\) and K\(_{\mbox{1,2,2,2}}\) and Fellows’ Conjecture. Eur. J. Comb. 31, 903–907 (2010)
Wikipedia
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Telle, J.A. (2012). Mike Fellows: Weaving the Web of Mathematics and Adventure. In: Bodlaender, H.L., Downey, R., Fomin, F.V., Marx, D. (eds) The Multivariate Algorithmic Revolution and Beyond. Lecture Notes in Computer Science, vol 7370. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30891-8_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-30891-8_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30890-1
Online ISBN: 978-3-642-30891-8
eBook Packages: Computer ScienceComputer Science (R0)
