Tereza Klimosová

Orcid: 0000-0002-7766-7298

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Antipaths in oriented graphs.
Discret. Math., September, 2023

On Vizing's edge colouring question.
J. Comb. Theory B, March, 2023

Sandwiching biregular random graphs.
Comb. Probab. Comput., January, 2023

3-Coloring C<sub>4</sub> or C<sub>3</sub>-Free Diameter Two Graphs.
Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

2022
Polynomial-time Algorithm for Maximum Weight Independent Set on <i>P</i><sub>6</sub>-free Graphs.
ACM Trans. Algorithms, 2022

Edge-partitioning 3-edge-connected graphs into paths.
J. Comb. Theory B, 2022

On 3-Coloring of (2P<sub>4, C<sub>5</sub></sub>)-Free Graphs.
Algorithmica, 2022

2021
Edge-decomposing graphs into coprime forests.
J. Graph Theory, 2021

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

Covering Minimal Separators and Potential Maximal Cliques in $P_t$-Free Graphs.
Electron. J. Comb., 2021

2020
A version of the Loebl-Komlós-Sós conjecture for skew trees.
Eur. J. Comb., 2020

Note on 3-Coloring of (2P<sub>4</sub>, C<sub>5</sub>)-Free Graphs.
CoRR, 2020

Covering minimal separators and potential maximal cliques in P<sub>t</sub>-free graphs.
CoRR, 2020

Colouring (P<sub>r</sub> + P<sub>s</sub>)-Free Graphs.
Algorithmica, 2020

2019
Polynomial-time algorithm for Maximum Weight Independent Set on P6-free graphs.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018
Colouring (P_r+P_s)-Free Graphs.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017
Decomposing graphs into paths and trees.
Electron. Notes Discret. Math., 2017

A skew version of the Loebl-Komlós-Sós conjecture.
Electron. Notes Discret. Math., 2017

Densities in large permutations and parameter testing.
Eur. J. Comb., 2017

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

2016
Immersion in four-edge-connected graphs.
J. Comb. Theory B, 2016

2015
Finitely forcible graphons and permutons.
J. Comb. Theory B, 2015

2014
Strong Immersions and Maximum Degree.
SIAM J. Discret. Math., 2014

Infinite dimensional finitely forcible graphon.
CoRR, 2014

Large permutations and parameter testing.
CoRR, 2014

Hereditary properties of permutations are strongly testable.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2012
Hypertree-depth and minors in hypergraphs.
Theor. Comput. Sci., 2012


  Loading...