# Michael Fellows

> American computer scientist

**Wikidata**: [Q6830255](https://www.wikidata.org/wiki/Q6830255)  
**Wikipedia**: [English](https://en.wikipedia.org/wiki/Michael_Fellows)  
**Source**: https://4ort.xyz/entity/michael-fellows

## Summary  
Michael Fellows is an American‑Australian computer scientist specializing in theoretical computer science. He is a professor and researcher known for his work on algorithmic graph theory and parameterized complexity, and he has received several prestigious awards including the 2014 Nerode Prize and the Companion of the Order of Australia.

## Biography  
- **Born:** 15 June 1952, Upland, California, United States  
- **Nationality:** United States, Australia  
- **Education:** B.Sc. – Sonoma State University; Ph.D. – University of California, San Diego (doctoral advisor : Michael Fredman)  
- **Known for:** Fundamental contributions to theoretical computer science, especially parameterized complexity and graph algorithms  
- **Employer(s):** University of Bergen (Norway); Victoria University of Wellington (New Zealand); University of Victoria (Canada); University of Newcastle (Australia); Charles Darwin University (Australia)  
- **Field(s):** Theoretical computer science, algorithm design, graph theory  

## Contributions  
Michael Fellows has authored hundreds of research papers that have shaped modern parameterized complexity theory. His collaborative work on kernelization techniques and fixed‑parameter tractable algorithms earned him the 2014 Nerode Prize, one of the highest honors in theoretical computer science. Fellows’ research has produced practical algorithms for graph‑based problems, influencing both academic curricula and software tools used in network analysis. He has mentored a generation of scholars, supervising doctoral students such as Michael Dinneen, Elena Prieto, and Yasunori Koda, many of whom now hold prominent research positions. His interdisciplinary collaborations have led to Humboldt Research Fellowships and a Humboldt Prize, reflecting the international impact of his theoretical insights on computational practice.

## FAQs  
### Q: What area of computer science does Michael Fellows specialize in?  
A: He specializes in theoretical computer science, with a focus on parameterized complexity and graph algorithms.  

### Q: Which universities has Michael Fellows been affiliated with?  
A: He has held faculty positions at the University of Bergen, Victoria University of Wellington, University of Victoria, University of Newcastle, and Charles Darwin University.  

### Q: What major awards has Michael Fellows received?  
A: Among others, he received the 2014 Nerode Prize, a Humboldt Research Fellowship, the Humboldt Prize, and was appointed a Companion of the Order of Australia in 2016.  

## Why They Matter  
Fellows’ work transformed how researchers approach computationally hard problems by introducing parameterized methods that isolate tractable sub‑cases. This paradigm shift enabled the design of efficient algorithms for large‑scale networks, influencing fields from bioinformatics to logistics. His mentorship cultivated a global community of scholars who continue to expand the frontier of algorithmic theory. Without his contributions, many modern techniques for dealing with NP‑hard problems would lack the rigorous foundations that make them practical today.

## Notable For  
- **Nerode Prize (2014):** Recognized for pioneering contributions to parameterized complexity.  
- **Companion of the Order of Australia (2016):** Honoured for eminent service to higher education and theoretical computer science.  
- **Humboldt Research Fellowship & Humboldt Prize:** Acknowledged for outstanding international research collaboration.  
- **Honorary Fellow of the Royal Society Te Apārangi (2014):** Celebrated for significant scientific impact in New Zealand.  
- **Honorary Doctorate, Paris Dauphine University (2022):** Awarded for distinguished contributions to computer science.

## Body  

### Early Life and Education  
- Born in Upland, California, on 15 June 1952.  
- Completed undergraduate studies at Sonoma State University.  
- Earned a Ph.D. from the University of California, San Diego under the supervision of Michael Fredman.  

### Academic Career  
- Held professorial appointments at several institutions across four continents, including:  
  - **University of Bergen** (Norway) – current primary affiliation.  
  - **Victoria University of Wellington** (New Zealand).  
  - **University of Victoria** (Canada).  
  - **University of Newcastle** and **Charles Darwin University** (Australia).  
- Member of **Academia Europaea**, reflecting his standing in the European research community.  

### Research Contributions  
- Developed core concepts in **parameterized complexity**, introducing kernelization and fixed‑parameter tractable (FPT) algorithms for graph problems.  
- Published extensively; his DBLP author ID (f/MichaelRFellows) lists hundreds of peer‑reviewed articles.  
- Supervised doctoral students who have become leading researchers, including Michael Dinneen and Elena Prieto.  

### Honors and Awards  
- **Nerode Prize (2014)** – for seminal work on parameterized algorithms.  
- **Humboldt Research Fellowship** and later the **Humboldt Prize**, recognizing his cross‑border scientific influence.  
- **Companion of the Order of Australia (2016)** – for eminent service to higher education and public outreach.  
- **Honorary Fellow of the Royal Society Te Apārangi (2014)** and **Honorary Doctorate, Paris Dauphine University (2022)**.  

### Professional Service  
- Active in editorial boards and conference program committees within theoretical computer science.  
- Engages in outreach programs for children, promoting computational thinking.  

## Schema Markup  
```json
{
  "@context": "https://schema.org",
  "@type": "Person",
  "name": "Michael Fellows",
  "jobTitle": "Computer Scientist",
  "worksFor": {
    "@type": "Organization",
    "name": "University of Bergen"
  },
  "nationality": [
    {
      "@type": "Country",
      "name": "United States"
    },
    {
      "@type": "Country",
      "name": "Australia"
    }
  ],
  "birthDate": "1952-06-15",
  "birthPlace": "Upland, California, United States",
  "alumniOf": [
    {
      "@type": "EducationalOrganization",
      "name": "Sonoma State University"
    },
    {
      "@type": "EducationalOrganization",
      "name": "University of California, San Diego"
    }
  ],
  "knowsAbout": [
    "Theoretical computer science",
    "Parameterized complexity",
    "Graph algorithms"
  ],
  "sameAs": [
    "https://en.wikipedia.org/wiki/Michael_Fellows"
  ],
  "description": "Michael Fellows is an American‑Australian computer scientist known for his contributions to theoretical computer science, especially parameterized complexity."
}

## References

1. Australian Honours Search Facility
2. [Source](https://www.royalsociety.org.nz/who-we-are/our-people/our-fellows/all-honorary-fellows/)
3. [Source](https://dauphine.psl.eu/dauphine/media-et-communication/article/ceremonie-de-remise-des-doctorats-honoris-causa-2022)
4. Mathematics Genealogy Project
5. Virtual International Authority File
6. CiNii Research
7. [Source](https://www.ae-info.org/ae/Member/Fellows_Michael)
8. IdRef
9. National Library of Israel Names and Subjects Authority File