> Friedrich-Schiller-Universität Jena
Fakultät für Mathematik und Informatik
Theoretische Informatik I
> Welcome

Theoretical Computer Science I
Computational Complexity

  • Parameterized Computational Complexity
  • Structural Complexity
  • NP-hard problems
  • Exact Algorithms
  • Graph Algorithms
  • Formal Languages

Humboldt research award winner Michael Fellows in Jena

Humboldt Foundation Professor Michael Fellows (University of Newcastle, Australia) is recognized for his foundational research in theoretical computer science that created the subject of parameterized complexity and algorithmics. This approach to the design of algorithms and the analysis of problem complexity has had significant impact in diverse application areas including databases, artificial intelligence and bioinformatics. At the Humboldt Award host institution, University of Jena, Professor Fellows will work with the group of Rolf Niedermeier on new systematic approaches to parameterized algorithm design for problems arising in various fields.

Michael Fellows will be in Jena from mid-August to the end of September 2007, and from April to November 2008. He is accompanied by his research partner and wife Dr. Frances Rosamond.

Upcoming Events with special interests of our group

past events...
Valid HTML 4.01! Last modified: Tue Aug 26 09:37:36 CEST 2008