Computer Science and Engineering
Sydney NSW 2052, Australia
: K17 office 506
: +61 2 9065 6024
: K17 office 506
: +61 2 9065 6024
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.
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
2nd and 3rd year undergraduate students enrolled at universities in Australia or New Zealand can apply for Taste of Research scholarships. Domestic and international undergraduate and postgraduate students from partner and non-partner institutions can apply for the Study Abroad Research Practicum. International postgraduate students may be able to visit as Junior Visiting Research Fellows.
Please contact me by sending me your CV, your university transcripts, a few lines on your research interests and preferences, and information on what financial support you have and what financial support you would need from UNSW (if any).
UNSW students who 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 Topic Database. Feel free to propose your own topic if it is related to my research.
Please contact me by sending me your CV, your university transcripts, and a few lines on the research topics that you are interested in.
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.
Please send me a CV, your university transcripts, the results of the online self-assessment tool, and names and email addresses of 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 university grades, the ranking of your previous universities, and your publications (if any).
A research associate position is available at UNSW Sydney, Australia.
The position is funded via the ARC Discovery project
Serge Gaspers, Fedor Fomin, and Daniel Lokshtanov, Improved algorithms via random sampling. Australian Research Council Discovery project 2021.
You will join the UNSW Algorithms group and the Algorithmic Decision Theory group and conduct research with Serge Gaspers in the areas of parameterized complexity, exponential time algorithms, randomized algorithms, and/or approximation algorithms. Pursuing your own research agenda and collaborating with other local groups (such as the Sydney Algorithms and Computing Theory group at the University of Sydney) is possible and encouraged. Funding for travel expenses is available.
Duration: up to 2 years
Start date: 1 Nov 2021 - 1 Jul 2022
Salary: AUD $98,342 to $105,185 per year, plus 17% superannuation retirement investement fund (Level A, step 6-8)
Applications close: Mon 13 Sep 2021 at 11:55pm Sydney time (which is significantly ahead of many other time zones)
Please apply here and make sure to include