Approximation Algorithms for BalancedCC Multiwinner Rules. - Markus Brill; Piotr Faliszewski; Frank Sommer; Nimrod Talmon (AAMAS, 2019)

FixCon: A Generic Solver for Fixed-Cardinality Subgraph Problems. - Christian Komusiewicz; Frank Sommer (ALENEX, 2020)

String Factorizations Under Various Collision Constraints. - Niels Grüttemeier; Christian Komusiewicz; Nils Morawietz; Frank Sommer (CPM, 2020)

Exploiting $ mathbf{c}$-Closure in Kernelization Algorithms for Graph Problems. - Tomohiro Koana; Christian Komusiewicz; Frank Sommer (CoRR, 2020)

Parameterized algorithms for Module Map problems. - Frank Sommer; Christian Komusiewicz (Discret. Appl. Math., 2020)

Preventing Small (s,t)Cuts by Protecting Edges. - Niels Grüttemeier; Christian Komusiewicz; Nils Morawietz; Frank Sommer (WG, 2021)

Enumerating connected induced subgraphs: Improved delay and experimental comparison. - Christian Komusiewicz; Frank Sommer (Discret. Appl. Math., 2021)

Destroying Bicolored P3s by Deleting Few Edges. - Niels Grüttemeier; Christian Komusiewicz; Jannik Schestag; Frank Sommer (Discret. Math. Theor. Comput. Sci., 2021)

Covering Many (Or Few) Edges with k Vertices in Sparse Graphs. - Tomohiro Koana; Christian Komusiewicz; André Nichterlein; Frank Sommer (STACS, 2022)

Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs. - Nils Morawietz; Niels Grüttemeier; Christian Komusiewicz; Frank Sommer (Theory Comput. Syst., 2022)

Colored cut games. - Nils Morawietz; Niels Grüttemeier; Christian Komusiewicz; Frank Sommer (Theor. Comput. Sci., 2022)

On Hard Subgraph Problems: Parameterized Algorithms and Efficient Implementations. - Frank Sommer (2022)

Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems. - Tomohiro Koana; Christian Komusiewicz; Frank Sommer (SIAM J. Discret. Math., 2022)

On the Group Coverage Centrality Problem: Parameterized Complexity and Heuristics. - Christian Komusiewicz; Jannis Schramek; Frank Sommer (ACDA, 2023)

Exact Algorithms for Group Closeness Centrality. - Luca Pascal Staus; Christian Komusiewicz; Nils Morawietz; Frank Sommer (ACDA, 2023)

On Computing Optimal Tree Ensembles. - Christian Komusiewicz; Pascal Kunz 001; Frank Sommer; Manuel Sorge (ICML, 2023)

On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure Model. - Matthias Bentert; Jannik Schestag; Frank Sommer (IPEC, 2023)

Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic Temporal Graphs. - Emmanuel Arrighi; Niels Grüttemeier; Nils Morawietz; Frank Sommer; Petra Wolf 002 (SOFSEM, 2023)

Destroying Multicolored Paths and Cycles in Edge-Colored Graphs. - Nils Jakob Eckstein; Niels Grüttemeier; Christian Komusiewicz; Frank Sommer (Discret. Math. Theor. Comput. Sci., 2023)

Essentially Tight Kernels for (Weakly) Closed Graphs. - Tomohiro Koana; Christian Komusiewicz; Frank Sommer (Algorithmica, 2023)

Computing Dense and Sparse Subgraphs of Weakly Closed Graphs. - Tomohiro Koana; Christian Komusiewicz; Frank Sommer (Algorithmica, 2023)

The Parameterized Complexity of s-Club with Triangle and Seed Constraints. - Jaroslav Garvardt; Christian Komusiewicz; Frank Sommer (Theory Comput. Syst., 2023)

SubModST: A Fast Generic Solver for Submodular Maximization with Size Constraints. - Henning Martin Woydt; Christian Komusiewicz; Frank Sommer (ESA, 2024)

Complexity of Local Search for Euclidean Clustering Problems. - Bodo Manthey; Nils Morawietz; Jesse van Rhijn; Frank Sommer (ISAAC, 2024)

On the Complexity of Community-Aware Network Sparsification. - Emanuel Herrendorf; Christian Komusiewicz; Nils Morawietz; Frank Sommer (MFCS, 2024)

On Critical Node Problems with Vulnerable Vertices. - Jannik Schestag; Niels Grüttemeier; Christian Komusiewicz; Frank Sommer (J. Graph Algorithms Appl., 2024)

Experimental Data and Code for SubModST: A Fast Generic Solver for Submodular Maximization with Size Constraints. - Henning Martin Woydt; Christian Komusiewicz; Frank Sommer (Zenodo, 2024)

Efficient branch-and-bound algorithms for finding triangle-constrained 2-clubs. - Niels Grüttemeier; Philipp Heinrich Keßler; Christian Komusiewicz; Frank Sommer (J. Comb. Optim., 2024)

Witty: An Efficient Solver for Computing Minimum-Size Decision Trees. - Luca Pascal Staus; Christian Komusiewicz; Frank Sommer; Manuel Sorge (AAAI, 2025)

Temporal Dominating Set and Temporal Vertex Cover Under the Lense of Degree Restrictions. - Anton Herrmann; Christian Komusiewicz; Nils Morawietz; Frank Sommer (SAND, 2025)

Fantastic Flips and Where to Find Them: A General Framework for Parameterized Local Search on Partitioning Problems. - Niels Grüttemeier; Nils Morawietz; Frank Sommer (WADS, 2025)

Polynomial-Size Enumeration Kernelizations for Long Path Enumeration. - Christian Komusiewicz; Diptapriyo Majumdar; Frank Sommer (CoRR, 2025)

Optimal Decision Tree Pruning Revisited: Algorithms and Complexity. - Juha Harviainen; Frank Sommer; Manuel Sorge; Stefan Szeider (CoRR, 2025)

Fantastic Flips and Where to Find Them: A General Framework for Parameterized Local Search on Partitioning Problem. - Niels Grüttemeier; Nils Morawietz; Frank Sommer (CoRR, 2025)

Multi-parameter analysis of finding minors and induced subgraphs in edge-periodic temporal graphs. - Emmanuel Arrighi; Niels Grüttemeier; Nils Morawietz; Frank Sommer; Petra Wolf 002 (Discret. Appl. Math., 2026)