Serge Gaspers

Professor, UNSW Sydney


Computer Science and Engineering


Building K17

Sydney NSW 2052, Australia

My research is mainly about the study of intractable computational problems. I design new algorithms for these NP-hard problems, analyse their running time, and make fine-grained complexity classifications. I am interested in deterministic, randomized, and quantum algorithms. The considered computational problems have applications in many different areas and I have mainly looked at problems from Boolean satisfiability and constraint satisfaction, networks and graphs, and algorithmic decision theory.

I am affiliated with the following entities at UNSW Sydney (The University of New South Wales):

I serve on the editorial boards of Acta Informatica.


Feb 19, 2024 check out this new paper A Piecewise Approach for the Analysis of Exact Algorithms co-authored with Katie Clinch, Abdallah Saffidine, and Tiankuang Zhang.
Nov 15, 2023 check out this new paper Quantum Algorithms for Graph Coloring and other Partitioning, Covering, and Packing Problems co-authored with Jerry Zirui Li.
Aug 1, 2023 join us at SOFSEM 2024 in Cochem, Germany, chaired by Henning Fernau, Ralf Klasing, and myself.