Clustered Planarity: Clusters with Few Outgoing Edges. - Vít Jelínek; Ondrej Suchý 001; Marek Tesar 001; Tomás Vyskocil (GD, 2008)

The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree. - Vít Jelínek; Eva Jelínková; Jan Kratochvíl; Bernard Lidický; Marek Tesar 001; Tomás Vyskocil (GD, 2009)

Complexity of Locally Injective Homomorphism to the Theta Graphs. - Bernard Lidický; Marek Tesar 001 (IWOCA, 2010)

Locally Injective Homomorphism to the Simple Weight Graphs. - Ondrej Bílka; Bernard Lidický; Marek Tesar 001 (TAMC, 2011)

Dichotomy of the H-Quasi-Cover Problem. - Jirí Fiala 001; Marek Tesar 001 (CSR, 2013)

Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree. - Steven Chaplick; Jirí Fiala 001; Pim van 't Hof; Daniël Paulusma; Marek Tesar 001 (FCT, 2013)

Computational Complexity of Covering Three-Vertex Multigraphs. - Jan Kratochvíl; Jan Arne Telle; Marek Tesar 001 (MFCS (2), 2014)

Rainbow colouring of split graphs. - L. Sunil Chandran; Deepak Rajendraprasad; Marek Tesar 001 (Discret. Appl. Math., 2017)