Michael Fellows

Michael Fellows
Name	Michael Fellows
Birth date	1952
Birth place	Worcester, England
Nationality	British-American
Occupation	Computer scientist, professor, author
Alma mater	University of Oxford, Massachusetts Institute of Technology
Known for	Parameterized complexity, fixed-parameter tractability, algorithm design
Awards	Erdős Prize; Fulkerson Prize; ACM Fellow

Michael Fellows is a British-American computer scientist noted for foundational work in parameterized complexity, algorithm design, and computational complexity theory. He has held faculty appointments at major research institutions and has authored influential monographs and edited volumes that helped establish parameterized complexity as a central subfield of theoretical computer science. Fellows's research has influenced work in combinatorics, graph theory, and algorithmic applications across industry and academia.

Early life and education

Fellows was born in Worcester, England and completed early schooling before undertaking undergraduate study at the University of Oxford. He pursued graduate research at the Massachusetts Institute of Technology, where he studied under advisors connected to scholars in Computational Complexity and Algorithmic Graph Theory. During his doctoral studies he engaged with researchers affiliated with Princeton University, Harvard University, and research groups at Bell Labs and the IBM Research laboratories. His formative education intersected with contemporaries from Stanford University, Carnegie Mellon University, and University of California, Berkeley who were developing modern perspectives on parameterized methods.

Academic career

Fellows has held academic appointments at institutions including Ohio State University, Boston University, and Charles Darwin University. He served as a professor in departments associated with Computer Science and participated in interdisciplinary centers linked to Applied Mathematics, Discrete Mathematics, and Theoretical Computer Science. Fellows founded and directed research programs and workshops that collaborated with organizations such as the European Research Council, National Science Foundation, and professional societies like the Association for Computing Machinery and the Society for Industrial and Applied Mathematics. He has been a visiting researcher at institutes including Microsoft Research, DIMACS, and the Institute for Advanced Study.

Research contributions

Fellows is a principal architect of parameterized complexity theory, contributing core definitions, methodological frameworks, and algorithmic paradigms that underpin fixed-parameter tractability research. He co-developed concepts that interface with areas such as Graph Minor Theory, Treewidth, Kernelization, and complexity classes analogous to NP-completeness within parameterized settings. His group produced influential algorithms for problems in Graph Theory, Combinatorial Optimization, and Bioinformatics that exploit structural parameters to achieve efficient performance. Fellows has edited and co-authored major collections and handbooks that shaped pedagogical and research directions in parameterized algorithms, collaborating with leading theorists associated with École Polytechnique, Technische Universität Berlin, University of Warsaw, and University of Bergen. His research programs established bridges to applied fields, enabling connections to practitioners at Genentech, Google Research, and clinical informatics groups at Massachusetts General Hospital.

Awards and honors

Fellows's contributions have been recognized by awards and fellowships from academic and professional organizations. He has received distinctions such as the Erdős Prize and the Fulkerson Prize for collaborative work in discrete mathematics and combinatorial algorithms. He is an elected ACM Fellow and has been honored by national research councils including the Australian Research Council and the United Kingdom Research and Innovation agency. Fellows held invited plenary positions at conferences organized by STOC, FOCS, ICALP, and IPEC, and served on program committees for events by SIAM and the European Symposium on Algorithms.

Selected publications

Fellows has authored and edited numerous books and papers that serve as foundational references. Key monographs and edited volumes include works published in collaboration with scholars from Springer, Cambridge University Press, and Oxford University Press. Representative publications address parameterized complexity, kernelization, and algorithm design for graph problems, and appear in journals and proceedings sponsored by ACM, IEEE, and SIAM. His editorial collaborations involved colleagues from University of Liverpool, University of Warsaw, and Universität des Saarlandes; these collections often include contributions from authors affiliated with Princeton University and ETH Zürich.

Personal life and students

Fellows has mentored a generation of researchers who now hold positions at institutions such as University of Edinburgh, TU Munich, University of Toronto, McGill University, and University of British Columbia. His doctoral students and postdoctoral protégés have received grants from organizations including the National Institutes of Health, the European Research Council, and the National Science Foundation, and have collaborated with technology groups at Amazon and IBM. Outside his professional work, Fellows has engaged with community initiatives connected to scientific outreach at museums like the Science Museum, London and educational programs at the Royal Institution.

Category:British computer scientists Category:American computer scientists Category:Living people