Advertisement

Mike Fellows: Weaving the Web of Mathematics and Adventure

  • Jan Arne Telle
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7370)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 2.
    Bell, T., Fellows, M., Witten, I.: Computer Science Unplugged: offline activities and games for all ages (1996)Google Scholar
  3. 3.
    Bodlaender, H., Downey, R., Fellows, M., Hermelin, D.: On problems without polynomial kernels. J. Comput. Syst. Sci. 75, 8 (2009)MathSciNetzbMATHGoogle Scholar
  4. 4.
    Courcelle, B., Engelfriet, J., Rozenberg, G.: Handle-rewriting hypergraph grammars. J. Comput. System Sci. 46, 218–270 (1993)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Downey, R., Fellows, M.: Parameterized Complexity. Springer (1999)Google Scholar
  6. 6.
    Everett, M., Borgatti, S.: Role colouring a graph. Mathematical Social Sciences 21(2), 183–188 (1991)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Fellows, M.: Encoding Graphs in Graphs. Ph.D. Dissertation, Univ. of California, San Diego (1985)Google Scholar
  8. 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. 9.
    Fellows, M.: Planar Emulators and Planar Covers (1988) (manuscript)Google Scholar
  10. 10.
  11. 11.
    Fiala, J., Kratochvíl, J.: Locally constrained graph homomorphisms - structure, complexity, and applications. Computer Science Review 2, 97–111 (2008)CrossRefzbMATHGoogle Scholar
  12. 12.
    Hlinêný, P.: 20 Years of Negamis Planar Cover Conjecture. Graphs and Combinatorics 26, 525–536 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    The Mathematics Genealogy ProjectGoogle Scholar
  14. 14.
    Negami, S.: The Spherical Genus and Virtually Planar Graphs. Discrete Math. 70, 159–168 (1988)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 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)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Jan Arne Telle
    • 1
  1. 1.Department of InformaticsUniversity of BergenNorway

Personalised recommendations