Vera Chekan

17 papers A* 1A 3B 3Journal 10
YearRankTypeTitle / Venue / Authors
2026 A* conf
A Logic-based Algorithmic Meta-Theorem for Treedepth: Single Exponential FPT Time and Polynomial Space.
SODA
Benjamin Bergougnoux, Vera Chekan, Giannos Stamoulis
2025 J jnl
A Logic-based Algorithmic Meta-Theorem for Treedepth: Single Exponential FPT Time and Polynomial Space.
CoRR
Benjamin Bergougnoux, Vera Chekan, Giannos Stamoulis
2025 J jnl
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth.
ACM Trans. Comput. Theory
Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen
2025 A conf
Tight Bounds for Some Classical Problems Parameterized by Cutwidth.
ESA
Narek Bojikian, Vera Chekan, Stefan Kratsch
2025 J jnl
Tight Bounds for some Classical Problems Parameterized by Cutwidth.
CoRR
Narek Bojikian, Vera Chekan, Stefan Kratsch
2024 J jnl
Half-integral Erdös-Pósa property for non-null
CoRR
Vera Chekan, Colin Geniet, Meike Hatzel, Michal Pilipczuk, Marek Sokolowski, Michal T. Seweryn, Marcin Witkowski
2023 J jnl
Heuristic Algorithms for the Approximation of Mutual Coherence.
CoRR
Gregor Betz, Vera Chekan, Tamara Mchedlidze
2023 A conf
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth.
ESA
Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen
2023 J jnl
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth.
CoRR
Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen
2023 B conf
Tight Algorithmic Applications of Clique-Width Generalizations.
MFCS
Vera Chekan, Stefan Kratsch
2023 J jnl
Tight Algorithmic Applications of Clique-Width Generalizations.
CoRR
Vera Chekan, Stefan Kratsch
2023 A conf
Tight Bounds for Connectivity Problems Parameterized by Cutwidth.
STACS
Narek Bojikian, Vera Chekan, Falko Hegerfeld, Stefan Kratsch
2022 B conf
Polychromatic Colorings of Unions of Geometric Hypergraphs.
WG
Vera Chekan, Torsten Ueckerdt
2022 J jnl
Tight Bounds for Connectivity Problems Parameterized by Cutwidth.
CoRR
Narek Bojikian, Vera Chekan, Falko Hegerfeld, Stefan Kratsch
2021 B conf
Drawing Two Posets.
SOFSEM
Guido Brückner, Vera Chekan
2021 J jnl
Polychromatic Colorings of Unions of Geometric Hypergraphs.
CoRR
Vera Chekan, Torsten Ueckerdt
2020 J jnl
Drawing Two Posets.
CoRR
Guido Brückner, Vera Chekan