Serge Gaspers
Computer Science and Engineering
Building K17
Sydney NSW 2052, Australia

: K17 office 506
: +61 2 9385 6934
: +61 2 9385 5995


My expertise is in algorithms for computationally "intractable" problems from a large number of domains. While intractable in classical complexity theory, domain-specific features and structure often make these problems easier to solve in the real world. Modern approaches, like parameterized algorithms and complexity, identify and exploit the domain-specific structure.

Please get in touch to talk about projects that appeal to both industry and academia.

Domains and Keywords

Boolean satisfiability, computational chemistry, constraint satisfaction, fair resource allocation, graph and network algorithms, preference aggregation, preprocessing, scheduling, self-interested agents, turbocharging heuristics, worst-case running time guarantees.


If you are a UNSW student and would like to dedicate some of your time to research in parameterized complexity or exponential-time algorithms, please get in touch and send me a CV, your university transcripts, and a few lines about your research interests.


Undergraduate students enrolled at Australian universities or the University of Auckland (New Zealand) can apply for Taste of Research scholarships. Undergraduate students enrolled at Australian universities can apply for CSIRO Undergraduate Vacation Scholarships. Domestic and international undergraduate and postgraduate students from partner universities can apply for the Practicum exchange program. International postgraduate students may be able to visit as Junior Visiting Research Fellows.

Honours students

UNSW students that are enrolled (or would like to enrol) in the Computer Science (Honours) program at UNSW can see my proposed Honours thesis topics in the CSE Thesis Topics Database. Feel free to propose your own topic if it is related to my research.

PhD students

To enrol in the PhD program in computer science at UNSW, you are expected to have a degree that is equivalent to a First Class Honours degree from UNSW in computer science, mathematics, or a related field. Obtaining a PhD scholarship from UNSW is a very competitive process. UNSW's online self-assessment tool gives a good indication of how competitive you are for scholarships. PhD students under my supervision are often eligible for top-up scholarships from Data61.

Please send me a CV, recent transcripts, the results of the online self-assessment tool, and names and email addresses of 1-2 references. Please also indicate your research interests and whether you have any external funding for covering the UNSW tuition fee (for international students) and living costs. All scholarship applicants need to prepare a research proposal in consultation with the prospective supervisor (around 500 words). The selection also usually takes into account your grades (mainly for the last 2 years of study), the ranking of your previous university, and your publications (if any).


Locally funded postdoctoral positions are advertised here when available.

Competitive fellowships enabling postdoctoral research at UNSW and Data61 include: