Author

M. Nöllenburg

h-index 29 View on Semantic Scholar

We have 2 of 222 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Aug 2026

The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern

It is shown that Pattern Avoidance is $\Sigma_2^{\textsf{P}}$-complete and furthermore remains intractable (in both the classical and parameterized sense) even under a variety of severe restrictions to both the pattern $P$ and the graph $G$.

Thomas Depian, S. D. Fink, Alexander Firbas et al. · 0 citations

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