30 citations · 100 across the 41 of their papers we have counts for
4 papers · 1 filter
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…
Parameterized Local Search for Max -Cut
Jaroslav Garvardt, Niels Grüttemeier, Christian Komusiewicz +1
In the NP-hard Max -Cut problem, one is given an undirected edge-weighted graph and aims to color the vertices of with colors such that the total weight of edges wit…
Maximizing Phylogenetic Diversity under Ecological Constraints: A Parameterized Complexity Study
Christian Komusiewicz, Jannik Schestag
In the NP-hard Optimizing PD with Dependencies (PDD) problem, the input consists of a phylogenetic tree over a set of taxa , a food-web that describes the prey-predator rela…
On the Complexity of Community-aware Network Sparsification
Emanuel Herrendorf, Christian Komusiewicz, Nils Morawietz +1
Network sparsification is the task of reducing the number of edges of a given graph while preserving some crucial graph property. In community-aware network sparsification, the pre…