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

- Center for Complex Systems Studies: CCSS
- Complexity Lab Utrecht: CLUe.

- Conferences, symposia, workshops:
- SOFSEM 2022 (postponed until 2023).
- Discrete algorithms, theoretical computer science.

- Interest Groups
- Programmes: Networks
- Weblogs:
- Computational complexity (Fortnow & Gasarch), Theory of computation (Lipton & Regan), In theory (Trevisan).

- Research in Europe:

- Our technical reports (1977-2019)

- Compendia:
- complexity zoo (Aaronson), NP-optimization problems (Creszenzi and Kann), parameterized complexity problems (Cesati), quantum algorithm zoo (Jordan), Steiner tree problems (Hauptmann and Karpinski).

- 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), theorems of the 21st century (Grechuk).

- Reflections: The algorithm: idiom of modern science (Chazelle), Complexity and algorithms (Diaz).
- 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).

- Journals/Proceedings:
- ACM Digital Library (ACM DL), Dagstuhl Research Online Publication Server (DROPS), Lecture Notes in Computer Science (LNCS, also here), Science Direct (Elsevier), List of CS Journals (Wikipedia).

- Collections/Repositories:
- e-Print archive (arXiv), computer science (e-prints), computer science bibliographies, CoRR (Computing Research Repository), DBLP (Trier), OpenAIRE (Open Access), ResearchIndex (CiteSeerx).

- Search engines:

The term `Algorithmic Systems' derives from 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: May 2021.*