Jul 2026
Two-Layer Drawings with a Tree on Top: Vertex Splits and Fixed-Parameter Algorithms
This paper investigates the parameterized complexity of this problem and obtains an ETH-tight single-exponential algorithm for the classical unconstrained version of the problem, improving upon the previous $O^*(2^{k\cdot k})$ algorithms.
Alexander Firbas, R. Ganian, Sylvain Meunier et al.
· arXiv.org · 0 citations