Abstract
I wish Rod a happy birthday. Rod has offered a good historical account of our early days of collaboration in his paper, “The Birth and Early Days of Parameterized Complexity” [D12]. One of the themes of our life-long collaboration has been a shared passion for surfing, and many of our best ideas were hammered out on surf trips. This contribution is best viewed as a gloss on that earlier account by Rod, taking as an organizing skeleton, our various surf trips and what we were thinking about, with a particular emphasis on open problems and horizons that remain, and some reflections on the formation of our research community.
M.R. Fellows—Research supported by the Bergen Research Foundation, the Government of Norway through its Elite Professorship Program, and the Australian Research Council.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
Most surfers do not surf alone, because it is a statistically proven fact that if you do not surf alone, your chances of being taken by a shark are improved by at least fifty percent.
- 2.
Stand-up surfers look down on body-boarders, but they shouldn’t! Body-boarders can routinely catch waves that stand-up guys can’t, because bodyboarders have stronger sprinting ability, and the stability to handle a lip-launch as the wave breaks “late” (which involves flying through the air a bit). One could go on about this. There are lots of ways to have fun in the waves. When I first met Rod, he was a hand-gunner, which is a rare practice (except in Queensland) closely related to plain old body-surfing.
- 3.
This is a mainstay of the community. There is a sort of informal award system for the best young researchers in the field, which is to receive a copy of what we call “Mr. Opinion” — this is the book: The New Guide to Modern World Literature by Martin Seymour-Smith.
- 4.
This is not unheard-of in mathematics, that smaller “dimensions” require special approaches.
References
Abrahamson, K., Ellis, J., Fellows, M., Mata, M.: On the complexity of fixed-parameter problems. In: Proceedings of 13th FOCS, pp. 210–215 (1989)
Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels (extended abstract). In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5125, pp. 563–574. Springer, Heidelberg (2008). doi:10.1007/978-3-540-70575-8_46
Bodlaender, H., Fellows, M.R., Hallett, M.T.: Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy. In: Proceedings of ACM Symposium on Theory of Computing (STOC), pp. 449–458 (1994)
Cai, L., Chen, J., Downey, R., Fellows, M.: Advice classes of parameterized tractability. Ann. Pure Appl. Logic 84, 119–138 (1997)
Dinneen, M.: Too many minor order obstructions (for parameterized lower ideals). J. Univers. Comput. Sci. 3, 1199–1206 (1997)
Downey, R.: The birth and early years of parameterized complexity. In: Bodlaender, H.L., Downey, R., Fomin, F.V., Marx, D. (eds.) The Multivariate Algorithmic Revolution and Beyond. LNCS, vol. 7370, pp. 17–38. Springer, Heidelberg (2012). doi:10.1007/978-3-642-30891-8_2
Downey, R., Fellows, M., Stege, U.: Parameterized complexity: a framework for systematically confronting computational intractability. In: Graham, R., Krachovil, J., Nesetril, J., Roberts, F. (eds.) Contemporary Trends in Discrete Mathematics, DIMACS, vol. 49, pp. 49–100. American Mathematical Society, Providence (1999)
Downey, R.G., Fellows, M.R., Regan, K.W.: Parameterized circuit complexity and the W hierarchy. Theoret. Comput. Sci. A 191, 91–115 (1998)
Downey, R.G., Fellows, M., Regan, K.: Threshold dominating sets and an improved characterization of \(W\)[2]. Theoret. Comput. Sci. A 209, 123–140 (1998)
Downey, R.G., Fellows, M., Taylor, U.: The parameterized complexity of relational database queries, an improved characterization of \(W\)[1]. In: Combinatorics, Complexity and Logic: Proceedings of DMTCS 1996, pp. 194–213. Springer, Heidelberg (1997)
Downey, R., Fellows, M., Vardy, A., Whittle, G.: The parameterized complexity of some fundamental problems in coding theory. SIAM J. Comput. 29, 545–570 (1999)
Fellows, M., Langston, M.: Nonconstructive proofs of polynomial-time complexity. Inf. Process. Lett. 26, 157–162 (1987/1988)
Fellows, M., Langston, M.: Nonconstructive tools for proving polynomial-time complexity. J. Assoc. Comput. Mach. 35, 727–739 (1988)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Fellows, M.R. (2017). Surfing with Rod. In: Day, A., Fellows, M., Greenberg, N., Khoussainov, B., Melnikov, A., Rosamond, F. (eds) Computability and Complexity. Lecture Notes in Computer Science(), vol 10010. Springer, Cham. https://doi.org/10.1007/978-3-319-50062-1_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-50062-1_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-50061-4
Online ISBN: 978-3-319-50062-1
eBook Packages: Computer ScienceComputer Science (R0)