I have spaces for master projects! Don't hesitate to get in touch with me if you are interested in online algorithms.

My research interests are combinatorial optimization problems. I focus on designing online and approximation algorithms in various application areas, including network design, resource allocation, scheduling, and graph coloring. I have also worked on graph algorithms in special graph classes. 

I like potential functions (and accounting methods) for algorithm analysis. I like potential functions (and accounting methods) for algorithm analysis. In my opinion, the best superpower is non-determinism.