Vera Chekan

According to our database, Vera Chekan authored at least 9 papers between 2021 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

A Logic-based Algorithmic Meta-Theorem for Treedepth: Single Exponential FPT Time and Polynomial Space.

Benjamin Bergougnoux, Vera Chekan, Giannos Stamoulis

Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025

Tight Bounds for Some Classical Problems Parameterized by Cutwidth.

Narek Bojikian, Vera Chekan, Stefan Kratsch

Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

2024

Half-integral Erdös-Pósa property for non-null <i>S</i>-<i>T</i> paths.

Vera Chekan, Colin Geniet, Meike Hatzel, Michal Pilipczuk, Marek Sokolowski, Michal T. Seweryn, Marcin Witkowski

CoRR, 2024

2023

Heuristic Algorithms for the Approximation of Mutual Coherence.

Gregor Betz, Vera Chekan, Tamara Mchedlidze

CoRR, 2023

Tight Bounds for Connectivity Problems Parameterized by Cutwidth.

Narek Bojikian, Vera Chekan, Falko Hegerfeld, Stefan Kratsch

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

Tight Algorithmic Applications of Clique-Width Generalizations.

Vera Chekan, Stefan Kratsch

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

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

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

Polychromatic Colorings of Unions of Geometric Hypergraphs.

Vera Chekan, Torsten Ueckerdt

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

2021

Drawing Two Posets.

Guido Brückner, Vera Chekan

Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021