Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree.

S. Chaplick, J. Fiala, P. van 't Hof, D. Paulusma, and M. Tesar. Theor. Comput. Sci., (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Viktoria Tesar

Michael Tesar

Jonas Tesarz

Waltraud Tesarz

Iwiza Tesari

Other publications of authors with the same name

Locally Injective Homomorphism to the Simple Weight Graphs.O. Bílka, B. Lidický, and M. Tesar. TAMC, volume 6648 of Lecture Notes in Computer Science, page 471-482. Springer, (2011)Rainbow colouring of split graphs.L. Chandran, D. Rajendraprasad, and M. Tesar. Discret. Appl. Math., (2017)Complexity of Locally Injective Homomorphism to the Theta Graphs.B. Lidický, and M. Tesar. IWOCA, volume 6460 of Lecture Notes in Computer Science, page 326-336. Springer, (2010)Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree.S. Chaplick, J. Fiala, P. van 't Hof, D. Paulusma, and M. Tesar. FCT, volume 8070 of Lecture Notes in Computer Science, page 121-132. Springer, (2013)Building Skills for the Future: Teaching High School Students to Utilize Remote Sensing of Wildfires.S. Amici, and M. Tesar. Remote. Sens., 12 (21): 3635 (2020)Computational Complexity of Covering Three-Vertex Multigraphs.J. Kratochvíl, J. Telle, and M. Tesar. MFCS (2), volume 8635 of Lecture Notes in Computer Science, page 493-504. Springer, (2014)Dichotomy of the H-Quasi-Cover Problem.J. Fiala, and M. Tesar. CSR, volume 7913 of Lecture Notes in Computer Science, page 310-321. Springer, (2013)Clustered Planarity: Clusters with Few Outgoing Edges.V. Jelínek, O. Suchý, M. Tesar, and T. Vyskocil. GD, volume 5417 of Lecture Notes in Computer Science, page 102-113. Springer, (2008)Computational complexity of covering three-vertex multigraphs.J. Kratochvíl, J. Telle, and M. Tesar. Theor. Comput. Sci., (2016)Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree.S. Chaplick, J. Fiala, P. van 't Hof, D. Paulusma, and M. Tesar. Theor. Comput. Sci., (2015)

BibSonomy

Disambiguation of "Tesar, Marek"

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree.

Please choose a person to relate this publication to

Viktoria Tesar

Michael Tesar

Jonas Tesarz

Waltraud Tesarz

Iwiza Tesari

Other publications of authors with the same name

Disambiguation

BibSonomy

Disambiguation of "Tesar, Marek"

copydeleteadd this publication to your clipboardcommunity posthistory of this postURLDOIBibTeXEndNoteAPAChicagoDIN 1505HarvardMSOffice XML Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree.

Please choose a person to relate this publication to

Viktoria Tesar

Michael Tesar

Jonas Tesarz

Waltraud Tesarz

Iwiza Tesari

Other publications of authors with the same name

Disambiguation

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree.