Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming. - Timothy F. N. Chan; Jacob W. Cooper; Martin Koutecký; Daniel Král; Kristýna Pekárková (SIAM J. Comput., 2022)

Twin-Width of Graphs on Surfaces. - Daniel Král; Kristýna Pekárková; Kenny Storgel (MFCS, 2024)

Branch-depth is minor closure of contraction-deletion-depth. - Marcin Brianski; Daniel Král; Kristýna Pekárková (CoRR, 2024)

On pattern-avoiding permutons. - Frederik Garbe; Jan Hladký; Gábor Kun; Kristýna Pekárková (Random Struct. Algorithms, 2024)

Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming. - Marcin Brianski; Martin Koutecký; Daniel Král'; Kristýna Pekárková; Felix Schröder (Math. Program., 2024)

Obstructions and dualities for matroid depth parameters. - Jakub Gajarský; Kristýna Pekárková; Michal Pilipczuk (CoRR, 2025)