| Route- and Travel planners
INFORMATICA / COMPUTER SCIENCE - CENTER FOR ALGORITHMIC SYSTEMS
ALGORITHMS AND COMPLEXITY - Utrecht University
''Designing Solutions for the Algorithmic Future''
All systems in science, industry, business, and society are built on algorithms.
The Center focuses on the algorithmic and complexity-theoretic challenges in the design
and analysis of modern complex systems. We aim at competitive solutions
that exploit novel information structures and computational approaches in any context.
The Chair for Algorithms and Complexity is led by professor Hans L. Bodlaender and is part of
the division Algorithms and Data Research 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 in algorithmic modeling, algorithm design, combinatorial
optimization, network algorithms and computational complexity for the BSc-, MSc-
and PhD-programs in
- 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.
- Combinatorial optimization and simulation e.g. advanced integer linear
programming, local search, planning, scheduling, robustness.
- Applied algorithmics e.g. in computational sustainability,
public transport, and network science.
- Conferences, symposia, workshops:
complexity, design, experimentation.
- Interest Groups
- Algorithmic Foundations of Information Technology:
- Algorithms and Computation Theory:
- Discrete Math and Algorithms:
- Parameterized Complexity:
(Fortnow & Gasarch),
Theory of computation (Lipton & Regan),
In theory (Trevisan).
- Research in Europe:
European Research Area (ERA),
Open Access Infrastructure (OpenAIRE).
- Research links:
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: September 2016.