Establishing Herd Immunity is Hard Even in Simple Geometric Networks. - Michal Dvorák 001; Dusan Knop; Simon Schierreich (WAW, 2023)

On the Complexity of Target Set Selection in Simple Geometric Networks. - Michal Dvorák 001; Dusan Knop; Simon Schierreich (Discret. Math. Theor. Comput. Sci., 2024)

Pathfinding in Self-Deleting Graphs. - Michal Dvorák 001; Dusan Knop; Michal Opler; Jan Pokorný 001; Ondrej Suchý 001; Krisztina Szilágyi (ISAAC, 2025)

Practical approach to 2-Euclidean Preferences. - Michal Dvorák 001; Dusan Knop; Jan Pokorný 001; Martin Slavík (CoRR, 2025)

Parameterized Complexity of Scheduling Problems in Robotic Process Automation. - Michal Dvorák 001; Antonín Novák; Premysl Sucha; Dusan Knop; Claire Hanen (CoRR, 2026)