Serge Gaspers
Professor, UNSW Sydney
Serge is pronounced /sɝːdʒ/ (typical English pronounciation) or /sɛʁʒ/ (typical French pronounciation).

Computer Science and Engineering
UNSW
Building K17
Sydney NSW 2052, Australia
My research is 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. I consider simple-to-state, fundamental computational problems with applications in diverse 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):
- Faculty of Engineering,
- School of Computer Science and Engineering,
- Algorithms group (head of group).
- Algorithmic Decision Theory group, and
- UNSW AI Institute.
I serve on the editorial board of Acta Informatica.
news
Feb 2025 | check out the new webpage of the algorithms group. |
---|---|
Feb 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 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 2023 | join us at SOFSEM 2024 in Cochem, Germany, chaired by Henning Fernau, Ralf Klasing, and myself. |