Serge Gaspers

Professor Serge Gaspers is a faculty member in the School of Computer Science and Engineering at the University of New South Wales (UNSW), specializing in algorithms for computationally intractable problems. His research focuses on parameterized algorithms, quantum algorithms, and graph theory, with applications in computational social choice and constraint satisfaction. He joined UNSW in 2012 as an ARC DECRA Fellow and later held an ARC Future Fellowship. Gaspers obtained his PhD from the University of Bergen (Norway) in 2008, followed by postdoctoral positions in Montpellier, Santiago, and Vienna.

His research interests include algorithms for NP-hard problems, quantum computing, and fair resource allocation. He has been awarded grants totaling over A$2 million, including an ARC Discovery Project (DP210103849) on improved algorithms via random sampling and collaborations with Data61/CSIRO and NICTA. Notable awards include the ARC Future Fellowship (2014), IJCAI 2013 Most Educational Video Award, and DECRA (2012).

Teaching: Gaspers teaches COMP6741 - Algorithms for Intractable Problems. His advising spans parameterized algorithms, quantum algorithms, and graph algorithms. Research grants highlight his work in algorithms, with a focus on turbocharging heuristics and computational complexity of resource allocation problems.