Skip to main content
SpringerLink
Log in

Mike Fellows: Weaving the Web of Mathematics and Adventure

  • Chapter
The Multivariate Algorithmic Revolution and Beyond

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7370))

  • 1311 Accesses

Abstract

This informal tribute in honor of Mike Fellows’ 60th birthday is based on some personal recollections.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abello, J., Fellows, M., Stillwell, J.: On the Complexity and Combinatorics of Covering Finite Complexes. Australasian Journal of Combinatorics 4 (1991)

    Google Scholar 

  2. Bell, T., Fellows, M., Witten, I.: Computer Science Unplugged: offline activities and games for all ages (1996)

    Google Scholar 

  3. Bodlaender, H., Downey, R., Fellows, M., Hermelin, D.: On problems without polynomial kernels. J. Comput. Syst. Sci. 75, 8 (2009)

    MathSciNet  MATH  Google Scholar 

  4. Courcelle, B., Engelfriet, J., Rozenberg, G.: Handle-rewriting hypergraph grammars. J. Comput. System Sci. 46, 218–270 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  5. Downey, R., Fellows, M.: Parameterized Complexity. Springer (1999)

    Google Scholar 

  6. Everett, M., Borgatti, S.: Role colouring a graph. Mathematical Social Sciences 21(2), 183–188 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  7. Fellows, M.: Encoding Graphs in Graphs. Ph.D. Dissertation, Univ. of California, San Diego (1985)

    Google Scholar 

  8. 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)

    Google Scholar 

  9. Fellows, M.: Planar Emulators and Planar Covers (1988) (manuscript)

    Google Scholar 

  10. Fellows, M.: Advice to Students, http://www.mrfellows.net/wordpress/advice-to-students-2/

  11. Fiala, J., Kratochvíl, J.: Locally constrained graph homomorphisms - structure, complexity, and applications. Computer Science Review 2, 97–111 (2008)

    Article  MATH  Google Scholar 

  12. Hlinêný, P.: 20 Years of Negamis Planar Cover Conjecture. Graphs and Combinatorics 26, 525–536 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  13. The Mathematics Genealogy Project

    Google Scholar 

  14. Negami, S.: The Spherical Genus and Virtually Planar Graphs. Discrete Math. 70, 159–168 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  15. 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)

    Article  MathSciNet  MATH  Google Scholar 

  16. Wikipedia

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, University of Bergen, Norway

    Jan Arne Telle

Authors
  1. Jan Arne Telle
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Information and Computing Sciences, Utrecht University, P.O. Box 80.089, 3508 TB, Utrecht, The Netherlands

    Hans L. Bodlaender

  2. School of Mathematics, Statistics and Operations Research, Victoria University, P.O. Box 600, Wellington, New Zealand

    Rod Downey

  3. Institute of Informatics, University of Bergen, Postboks 7800, 5020, Bergen, Norway

    Fedor V. Fomin

  4. Computer and Automation Research Institute, Hungarian Academy of Sciences (MTA SZTAKI), Pf. 63, 1518, Budapest, Hungary

    Dániel Marx

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation