Improved lower bounds on parity vertex colourings of binary trees. - Jan Soukup (CoRR, 2019)

On longest palindromic subwords of finite binary words. - Jan Petr; Jan Soukup (Discret. Math., 2021)

On Approximately Strategy-Proof Tournament Rules for Collusions of Size at Least Three. - David Miksaník; Ariel Schvartzman; Jan Soukup (ADT, 2024)

Many Views of Planar Point Sets. - Jan Kyncl; Jan Soukup (WG, 2024)

Extending Simple Monotone Drawings. - Jan Kyncl; Jan Soukup (IWOCA, 2025)

Connected matchings. - Oswin Aichholzer; Sergio Cabello; Viola Mészáros; Patrick Schnider; Jan Soukup (Comput. Geom., 2025)