Monotone Clustered Level Planarity

Simon D. Fink; Matthias Pfretzschner; Ignaz Rutter; Marie Diana Sieper

Home/Archive/arXiv

arXiv · 2607.17930

Monotone Clustered Level Planarity

Simon D. Fink·Matthias Pfretzschner·Ignaz Rutter·Marie Diana Sieper

View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider the combination of the two constrained planarity problems Level- and Clustered Planarity. Traditionally, level-planar drawings with convex clusters have been studied in this setting. Fink et al. (EuroCG 2024) recently introduced a different way of combining level- and clustered planarity by mimicking a classic characterization of clustered planarity in the level-planar setting: The problem (y-)monotone Clustered Level Planarity (mCLP) seeks a level-planar drawing in which it is possible to augment each cluster with edges that do not cross cluster boundaries so that it becomes connected while maintaining level-planarity. This is in line with previous research on clustered planarity that poses certain requirements on the augmentation edges that make each cluster connected, e.g., that they form a path. Fink et al. (EuroCG 2024) showed that mCLP is NP-complete even for biconnected single-source graphs and instances with a constant number of levels and clusters. We further classify the parameterized complexity of the mCLP problem by, on the one hand, showing hardness even for instances that consist of a forest with trees of bounded size, no isolated vertices, and a small constant number of either clusters or levels. This excludes fixed-parameter tractability for almost all graph-structural parameters, except for vertex cover, even in conjunction with the number of clusters. We complement this by showing fixed-parameter tractability when parameterizing by the vertex cover number and the number of clusters. A major obstacle is the fact that mCLP is non-hereditary, i.e., subinstances of yes-instances may be no-instances and vice versa, which makes it challenging to apply usual reduction techniques.

Explore related subjects

cs.DS cs.CG

Keep this discovery

BibTeX RIS

Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter, Marie Diana Sieper. 2026-07-20. Monotone Clustered Level Planarity. https://arxiv.org/abs/2607.17930

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Quasi-Monte Carlo Beyond Hardy-Krause II: $(1 + \varepsilon)n$ Samples Suffice

Numerical integration studies how well one can estimate the integral of a function $f$ over $[0,1)^d$ using $n$ sample points. The two classical methods, Monte Carlo (MC) and quasi-Monte Carlo (QMC), have complementary strengths and weaknesses, and a fundamental question is to design an approach that combines the benefits of both. Recently, building on the transference principle in discrepancy theory, Bansal and Jiang~\cite{BJ25a} gave a randomized QMC method that bridges MC and QMC guarantees using only i.i.d.\ samples. Their method also goes beyond the classical Koksma--Hlawka inequality: it achieves integration error $\widetilde{O}_d(\sigma_{\mathsf{SO}}(f)/n)$, where the smoothed-out variation $\sigma_{\mathsf{SO}}(f)$ can be substantially smaller than the Hardy--Krause variation that governs the classical bound. However, their algorithm requires $n^2$ i.i.d.\ samples as input, and this quadratic blowup is inherent to any method based on the transference principle. In this work, we bypass the quadratic blowup: for any constant $\varepsilon > 0$, we show that $(1+\varepsilon)n$ i.i.d.\ samples suffice to both obtain the beyond-Hardy--Krause guarantee of~\cite{BJ25a}, resolving an open problem posed there, and to produce low-discrepancy point sequences. Our algorithms are variants of the online Haar-thinning method of Dwivedi, Feldheim, Gurel-Gurevich, and Ramdas~\cite{DFG+19}.

cs.DS↗

arXiv2026

A deterministic $(1+\varepsilon)^n$ approximation for the permanent of a nonnegative matrix

For every fixed $0<\varepsilon\le1$, we give a deterministic strongly polynomial algorithm that, given a nonnegative matrix $A\in\mathbb{R}_{\ge0}^{n\times n}$, returns $Q$ satisfying $\operatorname{per} A\le Q\le(1+\varepsilon)^n\operatorname{per} A$.

cs.DS↗

arXiv2026

Single-Exponential Algorithms and a Polynomial Kernel for Strong Connectivity Augmentation

Strong Connectivity Augmentation (SCA) asks whether a directed acyclic graph can be made strongly connected by adding at most $k$ prescribed links whose total weight is within a given budget. Klinkby, Misra, and Saurabh (SODA 2021) gave an $O^*(2^{O(k\log k)})$-time algorithm and asked whether the problem admits a single-exponential parameterized algorithm and a polynomial kernel. We answer both questions affirmatively: SCA can be solved in $O^*(9^k)$ time and admits a polynomial kernel with $O(k^4)$ vertices and $O(k^{16})$ bits. For unweighted SCA, we obtain $O^*(4^k)$ time and a kernel with $O(k^3)$ vertices. Our algorithms are based on a particularly simple reduction to Strongly Connected Spanning Subgraph with two edge costs.

cs.DS↗