Resume
Background
- Main research area is discrete optimization
- Specific topics include complexity classifications, especially in Valued Constraint Satisfaction Problems
- Designing algorithms for combinatorial optimization problems (e.g., maximum flow, minimum cost perfect matching)
- Algorithms for MAP inference in Markov Random Fields
- Previously worked on applications of discrete optimization (e.g., graph cuts) in computer vision
Miscellany
- Not accepting intern applications at the moment
- Open to postdoc applications in discrete optimization
- Supervises PhD students and postdocs including Pavel Arkhipov, Martin Dvořák, Jeferson Zapata, etc.
- Organized 'Workshop on Optimization in Machine Learning' at IST Austria (May 2020, cancelled due to pandemic)
- Affiliated with the European Laboratory for Learning and Intelligent Systems (ELLIS)