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
Computing Sciences.

**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: discrete algorithms, complexity, design, experimentation.
- Interest Groups
- Weblogs: Computational complexity (Fortnow & Gasarch), Theory of computation (Lipton & Regan), In theory (Trevisan).
- Research in Europe: European Research Area (ERA), Open Access Infrastructure (OpenAIRE).
- Research links: Horizon 2020, ERC.

- Reflections: The algorithm: idiom of modern science (Chazelle), Complexity and algorithms (Diaz).
- Compendia: complexity zoo (Aaronson), NP-optimization problems (Creszenzi and Kann), parameterized complexity problems (Cesati).
- Game theory: game theory net.
- Graph classes and their inclusions: ISGCI (De Ridder et al).
- Lists: integer sequences (Sloane), random numbers (Haahr), algorithms (Wikipedia), sorting algorithm animations (Martin).
- Seminars: Computational sustainability (2013).
- Some old papers:
- A
partial
*k*-arboretum of graphs with bounded treewidth (Bodlaender, 1998)

- A
partial
- The most important: algorithms (Kouchan), programmers (Wikipedia), software innovations (Wheeler).
- Other Pages: The P-versus-NP page (Woeginger), Theory Matters (SIGACT).

- Journals/Proceedings:
- ACM digital lib (ACM), ACM guide (ACM), Electronic Colloquium on Computational Complexity (ECC), IEEE digital lib (IEEE), Lecture Notes in Computer Science (LNCS, see also here), Electronic Notes in TCS (vol 1 -) , Science Direct (Elsevier).

- Collections/Repositories:
- e-Print archive (arXiv), computer science (e-prints), computer science bibliographies, CoRR (Computing Research Repository), DBLP (Trier, see also: old format ), ResearchIndex (CiteSeerx).

- 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.*