Showing cs.DSShow 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.DS2024
Witty: An Efficient Solver for Computing Minimum-Size Decision Trees
Luca Pascal Staus, Christian Komusiewicz, Frank Sommer +1
Decision trees are a classic model for summarizing and classifying data. To enhance interpretability and generalization properties, it has been proposed to favor small decision tre…