Showing 2025Show all
2 papers · 1 filter
cs.DS2025
A Complexity Analysis of the c-Closed Vertex Deletion Problem
Lisa Lehner, Christian Komusiewicz, Luca Pascal Staus
A graph is -closed when every pair of nonadjacent vertices has at most common neighbors. In -Closed Vertex Deletion, the input is a graph and an integer and we…
cs.CC2025
The Parameter Report: An Orientation Guide for Data-Driven Parameterization
Christian Komusiewicz, Nils Morawietz, Frank Sommer +1
A strength of parameterized algorithmics is that each problem can be parameterized by an essentially inexhaustible set of parameters. Usually, the choice of the considered paramete…