| 2026 | ESA | Revisiting Graph Modification via Disk Scaling: From One Radius to Interval-Based Radii. | Thomas Depian, Frank Sommer |
| 2026 | WG | Preventing Small Global Cuts by Protecting Edges. | Christian Komusiewicz, Zhenwei Liu, Nils Morawietz, Frank Sommer |
| 2025 | AAAI | Witty: An Efficient Solver for Computing Minimum-Size Decision Trees. | Luca Pascal Staus, Christian Komusiewicz, Frank Sommer, Manuel Sorge |
| 2025 | ICML | Optimal Decision Tree Pruning Revisited: Algorithms and Complexity. | Juha Harviainen, Frank Sommer, Manuel Sorge, Stefan Szeider |
| 2025 | ICML | Learning Minimum-Size BDDs: Towards Efficient Exact Algorithms. | Christian Komusiewicz, Andr Schidler, Frank Sommer, Manuel Sorge, Luca Pascal Staus |
| 2025 | WADS | Fantastic Flips and Where to Find Them: A General Framework for Parameterized Local Search on Partitioning Problems. | Niels Grttemeier, Nils Morawietz, Frank Sommer |
| 2025 | WG | Polynomial-Size Enumeration Kernelizations for Long Path Enumeration. | Christian Komusiewicz, Diptapriyo Majumdar, Frank Sommer |
| 2024 | ESA | SubModST: A Fast Generic Solver for Submodular Maximization with Size Constraints. | Henning Martin Woydt, Christian Komusiewicz, Frank Sommer |
| 2024 | ISAAC | Complexity of Local Search for Euclidean Clustering Problems. | Bodo Manthey, Nils Morawietz, Jesse van Rhijn, Frank Sommer |
| 2024 | MFCS | On the Complexity of Community-Aware Network Sparsification. | Emanuel Herrendorf, Christian Komusiewicz, Nils Morawietz, Frank Sommer |
| 2023 | ICML | On Computing Optimal Tree Ensembles. | Christian Komusiewicz, Pascal Kunz, Frank Sommer, Manuel Sorge |
| 2023 | SOFSEM | Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic Temporal Graphs. | Emmanuel Arrighi, Niels Grttemeier, Nils Morawietz, Frank Sommer, Petra Wolf |
| 2022 | IWOCA | The Parameterized Complexity of s-Club with Triangle and Seed Constraints. | Jaroslav Garvardt, Christian Komusiewicz, Frank Sommer |
| 2022 | IWOCA | On Critical Node Problems with Vulnerable Vertices. | Jannik Schestag, Niels Grttemeier, Christian Komusiewicz, Frank Sommer |
| 2022 | STACS | Covering Many (Or Few) Edges with k Vertices in Sparse Graphs. | Tomohiro Koana, Christian Komusiewicz, Andr Nichterlein, Frank Sommer |
| 2021 | ISAAC | Essentially Tight Kernels For (Weakly) Closed Graphs. | Tomohiro Koana, Christian Komusiewicz, Frank Sommer |
| 2021 | WG | Preventing Small (s,t)Cuts by Protecting Edges. | Niels Grttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer |
| 2020 | ALENEX | FixCon: A Generic Solver for Fixed-Cardinality Subgraph Problems. | Christian Komusiewicz, Frank Sommer |
| 2020 | CPM | String Factorizations Under Various Collision Constraints. | Niels Grttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer |
| 2020 | ESA | Exploiting c-Closure in Kernelization Algorithms for Graph Problems. | Tomohiro Koana, Christian Komusiewicz, Frank Sommer |
| 2020 | ISAAC | Computing Dense and Sparse Subgraphs of Weakly Closed Graphs. | Tomohiro Koana, Christian Komusiewicz, Frank Sommer |
| 2020 | SOFSEM | Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs. | Nils Morawietz, Niels Grttemeier, Christian Komusiewicz, Frank Sommer |
| 2019 | CiE | Destroying Bicolored P | Niels Grttemeier, Christian Komusiewicz, Jannik Schestag, Frank Sommer |
| 2019 | SOFSEM | Enumerating Connected Induced Subgraphs: Improved Delay and Experimental Comparison. | Christian Komusiewicz, Frank Sommer |