| 2026 | SODA | A Logic-based Algorithmic Meta-Theorem for Treedepth: Single Exponential FPT Time and Polynomial Space. | Benjamin Bergougnoux, Vera Chekan, Giannos Stamoulis |
| 2026 | WG | Tight Bounds for Some W[1]-Hard Problems Parameterized by Multi-Clique-Width. | Benjamin Bergougnoux, Vera Chekan, Stefan Kratsch |
| 2025 | ESA | Tight Bounds for Some Classical Problems Parameterized by Cutwidth. | Narek Bojikian, Vera Chekan, Stefan Kratsch |
| 2023 | ESA | Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. | Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kant, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen |
| 2023 | MFCS | Tight Algorithmic Applications of Clique-Width Generalizations. | Vera Chekan, Stefan Kratsch |
| 2023 | STACS | Tight Bounds for Connectivity Problems Parameterized by Cutwidth. | Narek Bojikian, Vera Chekan, Falko Hegerfeld, Stefan Kratsch |
| 2022 | WG | Polychromatic Colorings of Unions of Geometric Hypergraphs. | Vera Chekan, Torsten Ueckerdt |
| 2021 | SOFSEM | Drawing Two Posets. | Guido Brckner, Vera Chekan |