Tereza Klimosová

According to our database, Tereza Klimosová authored at least 27 papers between 2012 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2023

Antipaths in oriented graphs.

Tereza Klimosová, Maya Stein

Discret. Math., September, 2023

On Vizing's edge colouring question.

Marthe Bonamy, Oscar Defrain, Tereza Klimosová, Aurélie Lagoutte, Jonathan Narboni

J. Comb. Theory B, March, 2023

Sandwiching biregular random graphs.

Tereza Klimosová, Christian Reiher, Andrzej Rucinski, Matas Sileikis

Comb. Probab. Comput., January, 2023

3-Coloring C₄ or C₃-Free Diameter Two Graphs.

Tereza Klimosová, Vibha Sahlot

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

2022

Polynomial-time Algorithm for Maximum Weight Independent Set on <i>P</i>₆-free Graphs.

Andrzej Grzesik, Tereza Klimosová, Marcin Pilipczuk, Michal Pilipczuk

ACM Trans. Algorithms, 2022

Edge-partitioning 3-edge-connected graphs into paths.

Tereza Klimosová, Stéphan Thomassé

J. Comb. Theory B, 2022

On 3-Coloring of (2P_{4, C₅})-Free Graphs.

Vít Jelínek, Tereza Klimosová, Tomás Masarík, Jana Novotná, Aneta Pokorná

Algorithmica, 2022

2021

Edge-decomposing graphs into coprime forests.

Tereza Klimosová, Stéphan Thomassé

J. Graph Theory, 2021

Counterexamples to Thomassen's Conjecture on Decomposition of Cubic Graphs.

Thomas Bellitto, Tereza Klimosová, Martin Merker, Marcin Witkowski, Yelena Yuditsky

Graphs Comb., 2021

Covering Minimal Separators and Potential Maximal Cliques in $P_t$-Free Graphs.

Andrzej Grzesik, Tereza Klimosová, Marcin Pilipczuk, Michal Pilipczuk

Electron. J. Comb., 2021

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

Note on 3-Coloring of (2P₄, C₅)-Free Graphs.

Vít Jelínek, Tereza Klimosová, Tomás Masarík, Jana Novotná, Aneta Pokorná

CoRR, 2020

Covering minimal separators and potential maximal cliques in P_t-free graphs.

Andrzej Grzesik, Tereza Klimosová, Marcin Pilipczuk, Michal Pilipczuk

CoRR, 2020

Colouring (P_r + P_s)-Free Graphs.

Tereza Klimosová, Josef Malík, Tomás Masarík, Jana Novotná, Daniël Paulusma, Veronika Slívová

Algorithmica, 2020

2019

Polynomial-time algorithm for Maximum Weight Independent Set on P6-free graphs.

Andrzej Grzesik, Tereza Klimosová, Marcin Pilipczuk, Michal Pilipczuk

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018

Colouring (P_r+P_s)-Free Graphs.

Tereza Klimosová, Josef Malík, Tomás Masarík, Jana Novotná, Daniël Paulusma, Veronika Slívová

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017

Decomposing graphs into paths and trees.

Tereza Klimosová, Stéphan Thomassé

Electron. Notes Discret. Math., 2017

A skew version of the Loebl-Komlós-Sós conjecture.

Tereza Klimosová, Diana Piguet, Václav Rozhon

Electron. Notes Discret. Math., 2017

Densities in large permutations and parameter testing.

Roman Glebov, Carlos Hoppen, Tereza Klimosová, Yoshiharu Kohayakawa, Daniel Král', Hong Liu

Eur. J. Comb., 2017

Polynomial-time algorithm for Maximum Weight Independent Set on $P_6$-free graphs.

Andrzej Grzesik, Tereza Klimosová, Marcin Pilipczuk, Michal Pilipczuk

CoRR, 2017

2016

Immersion in four-edge-connected graphs.

Maria Chudnovsky, Zdenek Dvorák, Tereza Klimosová, Paul D. Seymour

J. Comb. Theory B, 2016

2015

Finitely forcible graphons and permutons.

Roman Glebov, Andrzej Grzesik, Tereza Klimosová, Daniel Král

J. Comb. Theory B, 2015

2014

Strong Immersions and Maximum Degree.

Zdenek Dvorák, Tereza Klimosová

SIAM J. Discret. Math., 2014

Infinite dimensional finitely forcible graphon.

Roman Glebov, Tereza Klimosová, Daniel Král

CoRR, 2014

Large permutations and parameter testing.

Roman Glebov, Carlos Hoppen, Tereza Klimosová, Yoshiharu Kohayakawa, Daniel Král, Hong Liu

CoRR, 2014

Hereditary properties of permutations are strongly testable.

Tereza Klimosová, Daniel Král'

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2012

Hypertree-depth and minors in hypergraphs.

Isolde Adler, Tomas Gavenciak, Tereza Klimosová

Theor. Comput. Sci., 2012