All systems in modern information and communication technology are built on algorithms. The Center focuses on the algorithmic challenges in applied computer science viz. the design of advanced IT systems. We aim at highly effective algorithmic solutions that exploit structure in information and efficient computation in any context.

The Center for Algorithmic Systems is led by dr Hans L. Bodlaender and is part of the Department of Information and Computing Sciences of Utrecht University. The research is part of the Utrecht Research Institute for Information and Computing Sciences (cluster Software and Algorithms).

Research

• Computational complexity e.g. fixed parameter complexity, exact algorithms, kernelization.
• Information structures e.g. graphs, treewidth, network algorithms, social networks, computational biology.
• Algorithmic modelling and simulation e.g. combinatorial optimization, constraint programming, planning, scheduling.
• Applied algorithmics e.g. in artificial intelligence, computational sustainability, and software design.

We also provide courses in algorithmic modeling, algorithm design, complexity theory, and computational intelligence for the BSc-, MSc- and PhD-programs in Computing Science.

News

• European Symposium on Algorithms: ESA 2013.
• Seminar: Algorithmic computational biology (2012), computational sustainability (2013).
• Weblogs: Computational complexity (Fortnow & Gasarch), Theory of computation (Lipton & Regan), Algorithmic game theory (Nisan).
• News: Science, Science Guide (NL), ACM TechnNews, Kennislink, W24.nl.
• Research in Europe: European Research Area (ERA), Open Access Infrastructure (OpenAIRE).
• Research links: horizon 2020, ERC, ESF, ATLANTIS (EU-US), CRA - Computing Research Association.

• Our technical reports

Algorithmic pointers and diversions

• Informatics: A fascinating science (Van Leeuwen), the algorithm: idiom of modern science (Chazelle), complexity and algorithms (Diaz), how algorithms shape our world (Slavin).
• Great algorithms (Karp), algorithms in the real world (Blelloch), Algorithmus der Woche (Fakultaetentag Informatik).
• Lists: On-line encyclopedia of integer sequences (Sloane), random numbers (Haahr), list of algorithms (Wikipedia), sorting algorithm animations (Martin).
• Compendia: complexity zoo (Aaronson), NP-optimization problems (Creszenzi and Kann), parameterized complexity problems (Cesati), game theory net.
• The most important: algorithms (Kouchan), programmers (Wikipedia, see also: here), software innovations (Wheeler).
• Pages: The P-versus-NP page (Woeginger), Theory Matters (SIGACT).
• More algorithmic pointers: software, surveys, courses, books, and so on ..

• Conferences and events: TCS conferences and workshops, conference search (ETH).
• Conference rankings: Computer Science (I), computer Science (II).
• Journals/Proceedings: Electronic journals (Utrecht University), 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:
  • Google, Google Scholar, Google Books, Academic Search (Microsoft), FreeFullPDF (Sagot), Science.gov (US), Wolfram Alpha, Information Literacy (NoodleTools), Ask, Altavista, Bing, Clusty, Dogpile, Quadsearch, Yahoo, Zoeken (NL).
• Article search: ISI Web of knowledge (incl Web of Science), Scirus .

`Algorithmic Systems'

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: January 2013.