| 2026 | WALCOM | Generalizing Brooks' Theorem via Partial Coloring Is Hard Classically and Locally. | Jan Bok, Avinandan Das, Anna Gujgiczer, Nikola Jedlickov |
| 2025 | MFCS | Computational Complexity of Covering Regular Trees. | Jan Bok, Jir Fiala, Nikola Jedlickov, Jan Kratochvl |
| 2024 | IWOCA | Resolving Sets in Temporal Graphs. | Jan Bok, Antoine Dailly, Tuomo Lehtil |
| 2023 | WG | Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract). | Jan Bok, Jir Fiala, Nikola Jedlickov, Jan Kratochvl, Michaela Seifrtov |
| 2022 | IWOCA | List Covering of Regular Multigraphs. | Jan Bok, Jir Fiala, Nikola Jedlickov, Jan Kratochvl, Pawel Rzazewski |
| 2022 | LATIN | Min Orderings and List Homomorphism Dichotomies for Signed and Unsigned Graphs. | Jan Bok, Richard C. Brewster, Pavol Hell, Nikola Jedlickov, Arash Rafiey |
| 2021 | CSR | Injective Colouring for H-Free Graphs. | Jan Bok, Nikola Jedlickov, Barnaby Martin, Danil Paulusma, Siani Smith |
| 2021 | FCT | Computational Complexity of Covering Disconnected Multigraphs. | Jan Bok, Jir Fiala, Nikola Jedlickov, Jan Kratochvl, Michaela Seifrtov |
| 2021 | MFCS | Computational Complexity of Covering Multigraphs with Semi-Edges: Small Cases. | Jan Bok, Jir Fiala, Petr Hlinen, Nikola Jedlickov, Jan Kratochvl |
| 2020 | ESA | Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs. | Jan Bok, Nikola Jedlickov, Barnaby Martin, Danil Paulusma, Siani Smith |
| 2020 | MFCS | List Homomorphism Problems for Signed Graphs. | Jan Bok, Richard C. Brewster, Toms Feder, Pavol Hell, Nikola Jedlickov |
| 2015 | ICORES | Selection-based Approach to Cooperative Interval Games. | Jan Bok, Milan Hladk |
| 2015 | ICORES | Selection-Based Approach to Cooperative Interval Games. | Jan Bok, Milan Hladk |