Amalgam Width of Matroids. - Lukás Mach; Tomas Toufar (IPEC, 2013)

Parameterized complexity of fair deletion problems II. - Dusan Knop; Tomás Masarík; Tomás Toufar (CoRR, 2018)

Parameterized Complexity of Fair Vertex Evaluation Problems. - Dusan Knop; Tomás Masarík; Tomás Toufar (MFCS, 2019)

Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity. - Dusan Knop; Martin Koutecký; Tomás Masarík; Tomás Toufar (Log. Methods Comput. Sci., 2019)

Parameterized complexity of fair deletion problems. - Tomás Masarík; Tomás Toufar (Discret. Appl. Math., 2020)

Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. - Pavel Dvorák; Andreas Emil Feldmann; Dusan Knop; Tomás Masarík; Tomás Toufar; Pavel Veselý 001 (SIAM J. Discret. Math., 2021)

Target Set Selection in Dense Graph Classes. - Pavel Dvorák; Dusan Knop; Tomás Toufar (SIAM J. Discret. Math., 2022)