2 papers
cs.CG2026
A Fixed-Parameter Algorithm for Extending Upward Planar Drawings
Vera Chekan, Robert Ganian, Viktoriia Korchemna
An upward planar drawing of a directed acyclic graph is a planar drawing where every edge is pointed upward from its tail to head. Upward planar drawings are among the most natural…
cs.DS2025
Tight Bounds for some Classical Problems Parameterized by Cutwidth
Narek Bojikian, Vera Chekan, Stefan Kratsch
Cutwidth is a widely studied parameter that quantifies how well a graph can be decomposed along small edge-cuts. It complements pathwidth, which captures decomposition by small ver…