BE UCA MSc PhD UMD
Office: School of IT, J12. Room 4W-409.
Phone: +61 2 9351 4276
Email: reveal email address
I do research in Theoretical Computer Science. More specifically, I am broadly interested in the design and analysis of efficient algorithms for combinatorial optimization problems such as:
- Approximation algorithms for covering, packing, coloring, scheduling, and routing problems.
- Matchings under preferences: popular, stable and fair assignments.
- Uncertainty models: universal, incremental, and stochastic optimization.