Komusiewicz, Christian

11 publications

ICML 2025 Learning Minimum-Size BDDs: Towards Efficient Exact Algorithms Christian Komusiewicz, Andre Schidler, Frank Sommer, Manuel Sorge, Luca Pascal Staus
AAAI 2025 Witty: An Efficient Solver for Computing Minimum-Size Decision Trees Luca Pascal Staus, Christian Komusiewicz, Frank Sommer, Manuel Sorge
ICML 2023 On Computing Optimal Tree Ensembles Christian Komusiewicz, Pascal Kunz, Frank Sommer, Manuel Sorge
IJCAI 2023 Parameterized Local Search for Max C-Cut Jaroslav Garvardt, Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
JAIR 2022 Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis Niels Grüttemeier, Christian Komusiewicz
AAAI 2021 Efficient Bayesian Network Structure Learning via Parameterized Local Search on Topological Orderings Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
IJCAI 2021 On the Parameterized Complexity of Polytree Learning Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
IJCAI 2020 Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis Niels Grüttemeier, Christian Komusiewicz
AAAI 2017 Systematic Exploration of Larger Local Search Neighborhoods for the Minimum Vertex Cover Problem Maximilian Katzmann, Christian Komusiewicz
IJCAI 2015 H-Index Manipulation by Merging Articles: Models, Theory, and Experiments René van Bevern, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Toby Walsh
AAAI 2010 Exact Algorithms and Experiments for Hierarchical Tree Clustering Sepp Hartung, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann