Hypertree-depth and minors in hypergraphs. - Isolde Adler; Tomas Gavenciak; Tereza Klimosová (Theor. Comput. Sci., 2012)

Hereditary properties of permutations are strongly testable. - Tereza Klimosová; Daniel Král' (SODA, 2014)

Large permutations and parameter testing. - Roman Glebov; Carlos Hoppen; Tereza Klimosová; Yoshiharu Kohayakawa; Daniel Král; Hong Liu 010 (CoRR, 2014)

Infinite dimensional finitely forcible graphon. - Roman Glebov; Tereza Klimosová; Daniel Král (CoRR, 2014)

Strong Immersions and Maximum Degree. - Zdenek Dvorák 001; Tereza Klimosová (SIAM J. Discret. Math., 2014)

Finitely forcible graphons and permutons. - Roman Glebov; Andrzej Grzesik; Tereza Klimosová; Daniel Král (J. Comb. Theory B, 2015)

Immersion in four-edge-connected graphs. - Maria Chudnovsky; Zdenek Dvorák 001; Tereza Klimosová; Paul D. Seymour (J. Comb. Theory B, 2016)

Polynomial-time algorithm for Maximum Weight Independent Set on $P_6$-free graphs. - Andrzej Grzesik; Tereza Klimosová; Marcin Pilipczuk; Michal Pilipczuk (CoRR, 2017)

Densities in large permutations and parameter testing. - Roman Glebov; Carlos Hoppen; Tereza Klimosová; Yoshiharu Kohayakawa; Daniel Král'; Hong Liu 010 (Eur. J. Comb., 2017)

A skew version of the Loebl-Komlós-Sós conjecture. - Tereza Klimosová; Diana Piguet; Václav Rozhon (Electron. Notes Discret. Math., 2017)

Decomposing graphs into paths and trees. - Tereza Klimosová; Stéphan Thomassé (Electron. Notes Discret. Math., 2017)

Colouring (P_r+P_s)-Free Graphs. - Tereza Klimosová; Josef Malík; Tomás Masarík; Jana Novotná 001; Daniël Paulusma; Veronika Slívová (ISAAC, 2018)

Polynomial-time algorithm for Maximum Weight Independent Set on P6-free graphs. - Andrzej Grzesik; Tereza Klimosová; Marcin Pilipczuk; Michal Pilipczuk (SODA, 2019)

Colouring (Pr + Ps)-Free Graphs. - Tereza Klimosová; Josef Malík; Tomás Masarík; Jana Novotná 001; Daniël Paulusma; Veronika Slívová (Algorithmica, 2020)

Covering minimal separators and potential maximal cliques in Pt-free graphs. - Andrzej Grzesik; Tereza Klimosová; Marcin Pilipczuk; Michal Pilipczuk (CoRR, 2020)

Note on 3-Coloring of (2P4, C5)-Free Graphs. - Vít Jelínek; Tereza Klimosová; Tomás Masarík; Jana Novotná 001; Aneta Pokorná (CoRR, 2020)

A version of the Loebl-Komlós-Sós conjecture for skew trees. - Tereza Klimosová; Diana Piguet; Václav Rozhon (Eur. J. Comb., 2020)

Covering Minimal Separators and Potential Maximal Cliques in $P_t$-Free Graphs. - Andrzej Grzesik; Tereza Klimosová; Marcin Pilipczuk; Michal Pilipczuk (Electron. J. Comb., 2021)

Counterexamples to Thomassen's Conjecture on Decomposition of Cubic Graphs. - Thomas Bellitto; Tereza Klimosová; Martin Merker; Marcin Witkowski; Yelena Yuditsky (Graphs Comb., 2021)

Edge-decomposing graphs into coprime forests. - Tereza Klimosová; Stéphan Thomassé (J. Graph Theory, 2021)

On 3-Coloring of (2P4, C5)-Free Graphs. - Vít Jelínek; Tereza Klimosová; Tomás Masarík; Jana Novotná 001; Aneta Pokorná (Algorithmica, 2022)

Edge-partitioning 3-edge-connected graphs into paths. - Tereza Klimosová; Stéphan Thomassé (J. Comb. Theory B, 2022)

Polynomial-time Algorithm for Maximum Weight Independent Set on P6-free Graphs. - Andrzej Grzesik; Tereza Klimosová; Marcin Pilipczuk; Michal Pilipczuk (ACM Trans. Algorithms, 2022)

3-Coloring C4 or C3-Free Diameter Two Graphs. - Tereza Klimosová; Vibha Sahlot (WADS, 2023)

Sandwiching biregular random graphs. - Tereza Klimosová; Christian Reiher; Andrzej Rucinski 001; Matas Sileikis (Comb. Probab. Comput., 2023)

On Vizing's edge colouring question. - Marthe Bonamy; Oscar Defrain; Tereza Klimosová; Aurélie Lagoutte; Jonathan Narboni (J. Comb. Theory B, 2023)

Antipaths in oriented graphs. - Tereza Klimosová; Maya Stein (Discret. Math., 2023)