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.
Publications
Smaller universal targets for homomorphisms of edge-colored graphs
JOCO 2021,
COCOON 2019,
slides
An in-place, subquadratic algorithm for permutation inversion
arXiv 2019
Connecting the dots (with minimum crossings)
SoCG 2019,
full version,
arXiv,
slides
On an extremal problem for poset dimension
Order 2018,
arXiv
Universal targets for homomorphisms of edge-colored graphs
JCTB 2017,
arXiv,
master's thesis,
slides
The Partial Visibility Representation Extension Problem
Algorithmica 2018,
GD 2016,
arXiv
PhD thesis
New combinatorial structures for several algorithmic problems
thesis,
slides (slides in Polish)
Other materials
Debugging and testing guides for high school students (in Polish)
Contact info
Faculty of Informatics, office C526
Botanická 68A
602 00 Brno
Czech Republic
E-mail: 
last update: January 2023