| Route- and Travel planners
INFORMATICA / COMPUTER SCIENCE - ALGORITHMIC SYSTEMS
ALGORITHMS AND COMPLEXITY - Utrecht University
''Designing Solutions for the Algorithmic Future''
All systems in science, industry and business are built on algorithms. The
center is devoted to the algorithmic challenges in the design and analysis of modern
complex systems and to the underlying theories of computational complexity. We
aim at competitive algorithmic solutions that exploit novel concepts,
structures and approaches in any context.
The Chair for Algorithms and Complexity is led by professor Hans L. Bodlaender and is part of
the division `Algorithms' of the Department of Information and
Computing Sciences at Utrecht University. The research is part of the programme of the
Utrecht Research Institute of Information and
We also provide courses on data structures, algorithm design, combinatorial
optimization, computational complexity and network science for the BSc-, MSc- and
- Computational complexity e.g. fixed parameter tractability, exact algorithms,
kernelization, hardness, fine-grained complexity.
- Graph- and network algorithms e.g. graph classes, structural analysis,
treewidth, parameterized algorithms, network modeling.
- Optimization and simulation e.g. linear programming, column
generation, heuristics, planning, scheduling, robustness.
- Applied algorithmics e.g. in computational sustainability,
public transport, and network science.
Algorithmic pointers and diversions
Scientific information / Search tools
- Search engines:
The term `Algorithmic Systems' was used for the first time in
the First ACM Turing Award Lecture, by Alan J. Perlis in 1966: The
Synthesis of Algorithmic Systems, see J.ACM 14 (1967) 1-9.
Last changed: February 2018.