Tereza Klimosová

35 papers A* 2B 3Journal 30

Year	Rank	Type	Title / Venue / Authors
2023	B	`conf`	3-Coloring C WADS Tereza Klimosová, Vibha Sahlot
2023	J	`jnl`	3-Coloring C CoRR Tereza Klimosová, Vibha Sahlot
2023	J	`jnl`	Antipaths in oriented graphs. Discret. Math. Tereza Klimosová, Maya Stein
2023	J	`jnl`	On Vizing's edge colouring question. J. Comb. Theory B Marthe Bonamy, Oscar Defrain, Tereza Klimosová, Aurélie Lagoutte, Jonathan Narboni
2023	J	`jnl`	Sandwiching biregular random graphs. Comb. Probab. Comput. Tereza Klimosová, Christian Reiher, Andrzej Rucinski, Matas Sileikis
2022	J	`jnl`	Edge-partitioning 3-edge-connected graphs into paths. J. Comb. Theory B Tereza Klimosová, Stéphan Thomassé
2022	J	`jnl`	On 3-Coloring of (2P Algorithmica Vít Jelínek, Tereza Klimosová, Tomás Masarík, Jana Novotná, Aneta Pokorná
2022	J	`jnl`	Polynomial-time Algorithm for Maximum Weight Independent Set on ACM Trans. Algorithms Andrzej Grzesik, Tereza Klimosová, Marcin Pilipczuk, Michal Pilipczuk
2021	J	`jnl`	Counterexamples to Thomassen's Conjecture on Decomposition of Cubic Graphs. Graphs Comb. Thomas Bellitto, Tereza Klimosová, Martin Merker, Marcin Witkowski, Yelena Yuditsky
2021	J	`jnl`	Covering Minimal Separators and Potential Maximal Cliques in $P_t$-Free Graphs. Electron. J. Comb. Andrzej Grzesik, Tereza Klimosová, Marcin Pilipczuk, Michal Pilipczuk
2021	J	`jnl`	Edge-decomposing graphs into coprime forests. J. Graph Theory Tereza Klimosová, Stéphan Thomassé
2021	B	`conf`	On 3-Coloring of (2P WG Vít Jelínek, Tereza Klimosová, Tomás Masarík, Jana Novotná, Aneta Pokorná
2021	J	`jnl`	On Vizing's edge colouring question. CoRR Marthe Bonamy, Oscar Defrain, Tereza Klimosová, Aurélie Lagoutte, Jonathan Narboni
2020	J	`jnl`	A version of the Loebl-Komlós-Sós conjecture for skew trees. Eur. J. Comb. Tereza Klimosová, Diana Piguet, Václav Rozhon
2020	J	`jnl`	Colouring (P Algorithmica Tereza Klimosová, Josef Malík, Tomás Masarík, Jana Novotná, Daniël Paulusma, Veronika Slívová
2020	J	`jnl`	Covering minimal separators and potential maximal cliques in P CoRR Andrzej Grzesik, Tereza Klimosová, Marcin Pilipczuk, Michal Pilipczuk
2020	J	`jnl`	Note on 3-Coloring of (2P CoRR Vít Jelínek, Tereza Klimosová, Tomás Masarík, Jana Novotná, Aneta Pokorná
2019	A*	`conf`	Polynomial-time algorithm for Maximum Weight Independent Set on P6-free graphs. SODA Andrzej Grzesik, Tereza Klimosová, Marcin Pilipczuk, Michal Pilipczuk
2018	B	`conf`	Colouring (P_r+P_s)-Free Graphs. ISAAC Tereza Klimosová, Josef Malík, Tomás Masarík, Jana Novotná, Daniël Paulusma, Veronika Slívová
2018	J	`jnl`	Colouring (P_r+P_s)-Free Graphs. CoRR Tereza Klimosová, Josef Malík, Tomás Masarík, Jana Novotná, Daniël Paulusma, Veronika Slívová
2018	J	`jnl`	Edge-decomposing graphs into coprime forests. CoRR Tereza Klimosová, Stéphan Thomassé
2017	J	`jnl`	A skew version of the Loebl-Komlós-Sós conjecture. Electron. Notes Discret. Math. Tereza Klimosová, Diana Piguet, Václav Rozhon
2017	J	`jnl`	Decomposing graphs into paths and trees. Electron. Notes Discret. Math. Tereza Klimosová, Stéphan Thomassé
2017	J	`jnl`	Densities in large permutations and parameter testing. Eur. J. Comb. Roman Glebov, Carlos Hoppen, Tereza Klimosová, Yoshiharu Kohayakawa, Daniel Král', Hong Liu
2017	J	`jnl`	Polynomial-time algorithm for Maximum Weight Independent Set on $P_6$-free graphs. CoRR Andrzej Grzesik, Tereza Klimosová, Marcin Pilipczuk, Michal Pilipczuk
2016	J	`jnl`	Immersion in four-edge-connected graphs. J. Comb. Theory B Maria Chudnovsky, Zdenek Dvorák, Tereza Klimosová, Paul D. Seymour
2015	J	`jnl`	Finitely forcible graphons and permutons. J. Comb. Theory B Roman Glebov, Andrzej Grzesik, Tereza Klimosová, Daniel Král
2014	A*	`conf`	Hereditary properties of permutations are strongly testable. SODA Tereza Klimosová, Daniel Král'
2014	J	`jnl`	Infinite dimensional finitely forcible graphon. CoRR Roman Glebov, Tereza Klimosová, Daniel Král
2014	J	`jnl`	Large permutations and parameter testing. CoRR Roman Glebov, Carlos Hoppen, Tereza Klimosová, Yoshiharu Kohayakawa, Daniel Král, Hong Liu
2014	J	`jnl`	Strong Immersions and Maximum Degree. SIAM J. Discret. Math. Zdenek Dvorák, Tereza Klimosová
2013	J	`jnl`	Immersion in four-edge-connected graphs. CoRR Maria Chudnovsky, Zdenek Dvorák, Tereza Klimosová, Paul D. Seymour
2013	J	`jnl`	Strong immersions and maximum degree CoRR Zdenek Dvorák, Tereza Klimosová
2012	J	`jnl`	Hereditary properties of permutations are strongly testable CoRR Tereza Klimosová, Daniel Král
2012	J	`jnl`	Hypertree-depth and minors in hypergraphs. Theor. Comput. Sci. Isolde Adler, Tomas Gavenciak, Tereza Klimosová