About me

I am a postdoctoral researcher at the Algorithms and Complexity (D1) Department of Max Planck Institut für Informatik.

My research interests include the design and analysis of exact and approximation algorithms on graphs, of fault-tolerant algorithms and data structures, and the study of problems in the field of Algorithmic Game Theory.
That includes, for example, the design of sparse single-source edge-fault-tolerant spanners and oracles, the design of algorithms that are able to withstand memory corruptions or erroneous operation results (e.g., comparison faults), and the study of distributed network formation dynamics.
I am also interested in pinpointing the computational complexity of combinatorial puzzle games.

A list of my published papers can be found here.

Work & Education


I am one of the founders and maintainers of the Complexity of Games (CoG) project: a collaborative compendium of computational complexity results on games and puzzles.


Below is a list of my published papers. You can also check DBLP or Google Scholar.

  • Retrieving list...


I am in the organizing committee of ADFOCS 2019.

I am/was in the program committee of MLG 2019 and MLG 2018.

I am/was a reviewer for the following conferences: ESA 2019, PODC 2019, ICALP 2019, SPAA 2019, STOC 2019, ESA 2018, FUN 2018, JCDCG^3 2018, SEA 2018, ICALP 2018, SWAT 2018, ISAAC 2018, ATMOS 2017, SAGT 2017, ICTCS 2016, SODA 2017, ESA 2016, MFCS 2016, ICDM 2016, SIROCCO 2015, ICALP 2013, IWOCA 2013;

...and for the following journals: ACM Transaction on Algorithms, Algorithmica, Discrete Mathematics, Journal of Discrete Algorithms, Theoretical Computer Science, Journal of Experimental Algorithmics, Information Processing Letters.