optimisation

when you just want what's best

We focus on several areas in discrete optimisation. Our work includes algorithms for graph coloring, constraint satisfaction, global constraints, scheduling, and Satisfiability.

selected papers

  1. Faster Graph Coloring in Polynomial Space
    Algorithmica, 2023
  2. Armin Biere, Marijn Heule, Hans Maaren, and Toby Walsh
    Handbook of Satisfiability - Second Edition
    2021
  3. Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, and Stanislav Zivný
    Backdoors into heterogeneous classes of SAT and CSP
    Journal of Computer and System Sciences, 2017
  4. IPEC
    Serge Gaspers, Christos H. Papadimitriou, Sigve Hortemo Sæther, and Jan Arne Telle
    On Satisfiability Problems with a Linear Structure
    In 11th International Symposium on Parameterized and Exact Computation, IPEC 2016, August 24-26, 2016, Aarhus, Denmark, 2016
  5. IJCAI
    Geoffrey Chu, Serge GaspersNina Narodytska, Andreas Schutt, and Toby Walsh
    On the Complexity of Global Scheduling Constraints under Structural Restrictions
    In IJCAI 2013, Proceedings of the 23rd International Joint Conference on Artificial Intelligence, Beijing, China, August 3-9, 2013, 2013
  6. Francesca Rossi, Peter Beek, and Toby Walsh
    Handbook of Constraint Programming
    2006