- Hardness of permutation pattern matching2017 | Faculty of Mathematics and Physics
- A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes2020 | Faculty of Mathematics and Physics
- Griddings of Permutations and Hardness of Pattern Matching2021 | Faculty of Mathematics and Physics
- Long paths make pattern-counting hard, and deep trees make it harder2021 | Faculty of Mathematics and Physics
- Tight bounds on the maximum size of a set of permutations with bounded VC-dimension +12012 | Faculty of Mathematics and Physics
- Splittings and Ramsey properties of permutation classes2015 | Faculty of Mathematics and Physics
- Pattern avoidance in partial permutations (extended abstract)2010 | Faculty of Mathematics and Physics
- Constructions and Stories2011 | Faculty of Arts
- Efficient generation of rectangulations via permutation languages2021 | Faculty of Mathematics and Physics
- Combinatorial Generation via Permutation Languages. III. Rectangulations2022 | Faculty of Mathematics and Physics
- Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns2012 | Faculty of Mathematics and Physics
- Pattern-Avoiding Binary Trees - Generation, Counting, and Bijections2023 | Faculty of Mathematics and Physics