# Fedor Fomin > researcher **Wikidata**: [Q30103845](https://www.wikidata.org/wiki/Q30103845) **Wikipedia**: [English](https://en.wikipedia.org/wiki/Fedor_Fomin) **Source**: https://4ort.xyz/entity/fedor-fomin ## Summary Fedor Fomin is a Russian computer scientist and researcher, known for his contributions to parameterized complexity and exact exponential algorithms. He is a professor at the University of Bergen in Norway and was named an ACM Fellow in 2024 for his influential work in theoretical computer science. ## Biography - **Born**: March 16, 1968, in Saint Petersburg, Russia - **Nationality**: Russian (formerly Soviet Union) - **Education**: Doctorate from Saint Petersburg State University (advised by Nikolay Petrov) - **Known for**: Advancements in parameterized complexity and algorithm design - **Employer(s)**: University of Bergen (current) - **Field(s)**: Computer science, algorithms, theoretical computer science ## Contributions Fedor Fomin has made significant contributions to the field of theoretical computer science, particularly in parameterized complexity and exact exponential algorithms. His work includes: - **Parameterized Complexity**: Developed foundational theories and techniques that have advanced the understanding of computationally hard problems, enabling more efficient solutions for specific cases. - **Exact Exponential Algorithms**: Pioneered algorithms that solve problems optimally in exponential time, improving upon brute-force methods. - **Publications**: Authored numerous influential papers and books, including collaborations with other leading computer scientists. - **Mentorship**: Supervised several doctoral students, including Michal Pilipczuk, Frederic Dorn, Alexey Stepanov, Serge Gaspers, and Pål Grønås Drange, who have gone on to make their own contributions to the field. ## FAQs **What is Fedor Fomin known for?** Fedor Fomin is renowned for his work in parameterized complexity and exact exponential algorithms, which have significantly impacted theoretical computer science. **Where does Fedor Fomin work?** He is currently affiliated with the University of Bergen in Norway, where he conducts research and teaches. **What awards has Fedor Fomin received?** Fomin was awarded the Nerode Prize in 2015 and was named an ACM Fellow in 2024 for his contributions to computer science. **Who were Fedor Fomin’s notable students?** His doctoral students include Michal Pilipczuk, Frederic Dorn, Alexey Stepanov, Serge Gaspers, and Pål Grønås Drange. **What is Fedor Fomin’s educational background?** He earned his doctorate from Saint Petersburg State University under the supervision of Nikolay Petrov. ## Why They Matter Fedor Fomin’s work has fundamentally shaped the field of parameterized complexity, providing new tools and techniques for solving computationally challenging problems. His research has influenced both theoretical and practical approaches to algorithm design, making previously intractable problems more manageable. His mentorship has also cultivated a new generation of computer scientists, extending his impact beyond his own publications. ## Notable For - **ACM Fellow (2024)**: Recognized for contributions to parameterized complexity and exact exponential algorithms. - **Nerode Prize (2015)**: Awarded for outstanding contributions to theoretical computer science. - **Pioneering Research**: Developed key theories in parameterized complexity, advancing the field. - **Mentorship**: Supervised multiple doctoral students who have become prominent in computer science. - **Publications**: Authored influential works that are widely cited in theoretical computer science. ## Body ### Early Life and Education Fedor Fomin was born on March 16, 1968, in Saint Petersburg, Russia. He pursued his higher education at Saint Petersburg State University, where he earned his doctorate under the guidance of Nikolay Petrov. His early academic work laid the foundation for his later contributions to computer science. ### Career and Research Fomin is currently a professor at the University of Bergen in Norway, where he continues to conduct research in theoretical computer science. His primary areas of focus include parameterized complexity and exact exponential algorithms. His work in these fields has led to the development of new techniques for solving computationally hard problems more efficiently. Fomin’s research has been widely recognized, earning him the Nerode Prize in 2015 and the title of ACM Fellow in 2024. His contributions have not only advanced theoretical understanding but have also had practical implications for algorithm design and computational problem-solving. ### Mentorship and Influence Throughout his career, Fomin has mentored several doctoral students, many of whom have gone on to make significant contributions to computer science. Notable among his students are Michal Pilipczuk, Frederic Dorn, Alexey Stepanov, Serge Gaspers, and Pål Grønås Drange. His mentorship has helped shape the next generation of researchers in the field. ### Awards and Recognition Fomin’s work has been honored with several prestigious awards. In 2015, he received the Nerode Prize, which recognizes outstanding contributions to theoretical computer science. In 2024, he was named an ACM Fellow for his contributions to parameterized complexity and exact exponential algorithms. These accolades underscore the significance of his research and its impact on the field. ### Publications and Collaborations Fomin has authored numerous influential papers and books, often in collaboration with other leading computer scientists. His publications are widely cited and have contributed to the advancement of theoretical computer science. His work continues to inspire and inform researchers in the field. ### Legacy Fedor Fomin’s legacy in computer science is marked by his pioneering research, mentorship, and numerous accolades. His contributions to parameterized complexity and exact exponential algorithms have had a lasting impact on the field, influencing both theoretical and practical approaches to computational problem-solving. His work continues to be a cornerstone in the study of algorithms and complexity theory. ## References 1. Mathematics Genealogy Project 2. [Source](https://eatcs.org/images/awards/Nerode15-laudation.pdf) 3. [Source](https://www.acm.org/media-center/2024/january/fellows-2023) 4. [Source](https://data.dnb.de/opendata/authorities-gnd-person_lds.rdf.gz) 5. Virtual International Authority File 6. dblp computer science bibliography 7. [Fedor V. Fomin | Open Library](https://openlibrary.org/authors/OL3180278A/Fedor_V._Fomin) 8. [SciGraph](https://scigraph.springernature.com/person.013714615237.93)