Drawing Two Posets. - Guido Brückner; Vera Chekan (SOFSEM, 2021)

Polychromatic Colorings of Unions of Geometric Hypergraphs. - Vera Chekan; Torsten Ueckerdt (WG, 2022)

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 (ESA, 2023)

Tight Algorithmic Applications of Clique-Width Generalizations. - Vera Chekan; Stefan Kratsch (MFCS, 2023)

Tight Bounds for Connectivity Problems Parameterized by Cutwidth. - Narek Bojikian; Vera Chekan; Falko Hegerfeld; Stefan Kratsch (STACS, 2023)

Heuristic Algorithms for the Approximation of Mutual Coherence. - Gregor Betz; Vera Chekan; Tamara Mchedlidze (CoRR, 2023)

Half-integral Erdös-Pósa property for non-null S-T paths. - Vera Chekan; Colin Geniet; Meike Hatzel; Michal Pilipczuk; Marek Sokolowski 001; Michal T. Seweryn; Marcin Witkowski (CoRR, 2024)

Tight Bounds for some Classical Problems Parameterized by Cutwidth. - Narek Bojikian; Vera Chekan; Stefan Kratsch (CoRR, 2025)