I am a postdoctoral researcher at Masaryk University in Brno. I work as part of the Laboratory of Discrete Methods and Algorithms (DIMEA), which is led by Petr Hliněný and Daniel Kráľ. I am interested in algorithmics and combinatorics.
I defended my PhD in 2020, in the Theoretical Computer Science group at Jagiellonian University, advised by Paweł Idziak and Grzegorz Gutowski. Between my studies and coming to Brno, I worked as a software engineer at Google.
Smaller universal targets for homomorphisms of edge-colored graphs
An in-place, subquadratic algorithm for permutation inversion
Connecting the dots (with minimum crossings)
On an extremal problem for poset dimension
Universal targets for homomorphisms of edge-colored graphs
The Partial Visibility Representation Extension Problem
New combinatorial structures for several algorithmic problems
Faculty of Informatics, office C516
602 00 Brno
last update: January 2023