default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarek Tesar 0001
Person information
- affiliation: Charles University, Prague, Czech Republic
Other persons with the same name
- Marek Tesar 0002
![[0000-0001-7771-2880]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0001-7771-2880")
— The University of Auckland, New Zealand
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j4]L. Sunil Chandran, Deepak Rajendraprasad, Marek Tesar:
Rainbow colouring of split graphs. Discret. Appl. Math. 216: 98-113 (2017)- 2016
- [j3]Jan Kratochvíl, Jan Arne Telle, Marek Tesar:
Computational complexity of covering three-vertex multigraphs. Theor. Comput. Sci. 609: 104-117 (2016) - 2015
- [j2]Steven Chaplick, Jirí Fiala, Pim van 't Hof, Daniël Paulusma, Marek Tesar:
Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree. Theor. Comput. Sci. 590: 86-95 (2015) - 2014
- [c7]Jan Kratochvíl, Jan Arne Telle, Marek Tesar:
Computational Complexity of Covering Three-Vertex Multigraphs. MFCS (2) 2014: 493-504 - [i2]L. Sunil Chandran, Deepak Rajendraprasad, Marek Tesar:
Rainbow Colouring of Split Graphs. CoRR abs/1404.4478 (2014) - [i1]Steven Chaplick, Jirí Fiala, Pim van 't Hof, Daniël Paulusma, Marek Tesar:
Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree. CoRR abs/1408.6676 (2014) - 2013
- [j1]Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický, Marek Tesar, Tomás Vyskocil:
The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree. Graphs Comb. 29(4): 981-1005 (2013) - [c6]Jirí Fiala, Marek Tesar:
Dichotomy of the H-Quasi-Cover Problem. CSR 2013: 310-321 - [c5]Steven Chaplick, Jirí Fiala, Pim van 't Hof, Daniël Paulusma, Marek Tesar:
Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree. FCT 2013: 121-132 - 2011
- [c4]Ondrej Bílka, Bernard Lidický, Marek Tesar:
Locally Injective Homomorphism to the Simple Weight Graphs. TAMC 2011: 471-482 - 2010
- [c3]Bernard Lidický, Marek Tesar:
Complexity of Locally Injective Homomorphism to the Theta Graphs. IWOCA 2010: 326-336
2000 – 2009
- 2009
- [c2]Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický, Marek Tesar, Tomás Vyskocil:
The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree. GD 2009: 304-315 - 2008
- [c1]Vít Jelínek, Ondrej Suchý, Marek Tesar, Tomás Vyskocil:
Clustered Planarity: Clusters with Few Outgoing Edges. GD 2008: 102-113
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-09-05 02:08 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:
