default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTereza Klimosová
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j18]Tereza Klimosová
, Christian Reiher, Andrzej Rucinski, Matas Sileikis:
Sandwiching biregular random graphs. Comb. Probab. Comput. 32(1): 1-44 (2023)- [j17]Tereza Klimosová, Maya Stein:
Antipaths in oriented graphs. Discret. Math. 346(9): 113515 (2023) - [j16]Marthe Bonamy, Oscar Defrain, Tereza Klimosová, Aurélie Lagoutte, Jonathan Narboni:
On Vizing's edge colouring question. J. Comb. Theory B 159: 126-139 (2023) - [c5]Tereza Klimosová, Vibha Sahlot:
3-Coloring C4 or C3-Free Diameter Two Graphs. WADS 2023: 547-560 - [i12]Tereza Klimosová, Vibha Sahlot:
3-Coloring C4 or C3-free Diameter Two Graphs. CoRR abs/2307.15036 (2023) - 2022
- [j15]Vít Jelínek, Tereza Klimosová, Tomás Masarík, Jana Novotná, Aneta Pokorná:
On 3-Coloring of (2P4, C5)-Free Graphs. Algorithmica 84(6): 1526-1547 (2022) - [j14]Tereza Klimosová, Stéphan Thomassé:
Edge-partitioning 3-edge-connected graphs into paths. J. Comb. Theory B 156: 250-293 (2022) - [j13]Andrzej Grzesik, Tereza Klimosová, Marcin Pilipczuk, Michal Pilipczuk:
Polynomial-time Algorithm for Maximum Weight Independent Set on P6-free Graphs. ACM Trans. Algorithms 18(1): 4:1-4:57 (2022) - 2021
- [j12]Andrzej Grzesik, Tereza Klimosová, Marcin Pilipczuk, Michal Pilipczuk:
Covering Minimal Separators and Potential Maximal Cliques in $P_t$-Free Graphs. Electron. J. Comb. 28(1): 1 (2021) - [j11]Thomas Bellitto, Tereza Klimosová, Martin Merker, Marcin Witkowski, Yelena Yuditsky:
Counterexamples to Thomassen's Conjecture on Decomposition of Cubic Graphs. Graphs Comb. 37(6): 2595-2599 (2021) - [j10]Tereza Klimosová, Stéphan Thomassé:
Edge-decomposing graphs into coprime forests. J. Graph Theory 97(1): 21-33 (2021) - [c4]Vít Jelínek, Tereza Klimosová, Tomás Masarík, Jana Novotná, Aneta Pokorná:
On 3-Coloring of (2P4, C5)-Free Graphs. WG 2021: 388-401 - [i11]Marthe Bonamy, Oscar Defrain, Tereza Klimosová, Aurélie Lagoutte, Jonathan Narboni:
On Vizing's edge colouring question. CoRR abs/2107.07900 (2021) - 2020
- [j9]Tereza Klimosová, Josef Malík, Tomás Masarík, Jana Novotná, Daniël Paulusma, Veronika Slívová:
Colouring (Pr + Ps)-Free Graphs. Algorithmica 82(7): 1833-1858 (2020) - [j8]Tereza Klimosová, Diana Piguet, Václav Rozhon:
A version of the Loebl-Komlós-Sós conjecture for skew trees. Eur. J. Comb. 88: 103106 (2020) - [i10]Andrzej Grzesik, Tereza Klimosová, Marcin Pilipczuk, Michal Pilipczuk:
Covering minimal separators and potential maximal cliques in Pt-free graphs. CoRR abs/2003.12345 (2020) - [i9]Vít Jelínek, Tereza Klimosová, Tomás Masarík, Jana Novotná, Aneta Pokorná:
Note on 3-Coloring of (2P4, C5)-Free Graphs. CoRR abs/2011.06173 (2020)
2010 – 2019
- 2019
- [c3]Andrzej Grzesik, Tereza Klimosová, Marcin Pilipczuk, Michal Pilipczuk:
Polynomial-time algorithm for Maximum Weight Independent Set on P6-free graphs. SODA 2019: 1257-1271 - 2018
- [c2]Tereza Klimosová, Josef Malík, Tomás Masarík, Jana Novotná, Daniël Paulusma, Veronika Slívová:
Colouring (P_r+P_s)-Free Graphs. ISAAC 2018: 5:1-5:13 - [i8]Tereza Klimosová, Stéphan Thomassé:
Edge-decomposing graphs into coprime forests. CoRR abs/1803.03704 (2018) - [i7]Tereza Klimosová, Josef Malík, Tomás Masarík, Jana Novotná, Daniël Paulusma, Veronika Slívová:
Colouring (P_r+P_s)-Free Graphs. CoRR abs/1804.11091 (2018) - 2017
- [j7]Roman Glebov, Carlos Hoppen, Tereza Klimosová, Yoshiharu Kohayakawa, Daniel Král', Hong Liu:
Densities in large permutations and parameter testing. Eur. J. Comb. 60: 89-99 (2017) - [j6]Tereza Klimosová, Diana Piguet, Václav Rozhon:
A skew version of the Loebl-Komlós-Sós conjecture. Electron. Notes Discret. Math. 61: 743-749 (2017) - [j5]Tereza Klimosová, Stéphan Thomassé:
Decomposing graphs into paths and trees. Electron. Notes Discret. Math. 61: 751-757 (2017) - [i6]Andrzej Grzesik, Tereza Klimosová, Marcin Pilipczuk, Michal Pilipczuk:
Polynomial-time algorithm for Maximum Weight Independent Set on $P_6$-free graphs. CoRR abs/1707.05491 (2017) - 2016
- [j4]Maria Chudnovsky, Zdenek Dvorák, Tereza Klimosová, Paul D. Seymour:
Immersion in four-edge-connected graphs. J. Comb. Theory B 116: 208-218 (2016) - 2015
- [j3]Roman Glebov, Andrzej Grzesik, Tereza Klimosová, Daniel Král:
Finitely forcible graphons and permutons. J. Comb. Theory B 110: 112-135 (2015) - 2014
- [j2]Zdenek Dvorák, Tereza Klimosová:
Strong Immersions and Maximum Degree. SIAM J. Discret. Math. 28(1): 177-187 (2014) - [c1]Tereza Klimosová, Daniel Král':
Hereditary properties of permutations are strongly testable. SODA 2014: 1164-1173 - [i5]Roman Glebov, Tereza Klimosová, Daniel Král:
Infinite dimensional finitely forcible graphon. CoRR abs/1404.2743 (2014) - [i4]Roman Glebov, Carlos Hoppen, Tereza Klimosová, Yoshiharu Kohayakawa, Daniel Král, Hong Liu:
Large permutations and parameter testing. CoRR abs/1412.5622 (2014) - 2013
- [i3]Zdenek Dvorák, Tereza Klimosová:
Strong immersions and maximum degree. CoRR abs/1304.0728 (2013) - [i2]Maria Chudnovsky, Zdenek Dvorák, Tereza Klimosová, Paul D. Seymour:
Immersion in four-edge-connected graphs. CoRR abs/1308.0827 (2013) - 2012
- [j1]Isolde Adler, Tomas Gavenciak, Tereza Klimosová:
Hypertree-depth and minors in hypergraphs. Theor. Comput. Sci. 463: 84-95 (2012) - [i1]Tereza Klimosová, Daniel Král:
Hereditary properties of permutations are strongly testable. CoRR abs/1208.2624 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
