Dr. Frank Sommer

For a complete overview, please visit my Google Scholar profileExternal link, my DBLP pageExternal link, or the list below.

Conference and Journal Publications

2026

Journal Publications

• Emmanuel Arrighi, Niels Grüttemeier, Nils Morawietz, Frank Sommer, and Petra Wolf: Multi-parameter analysis of finding minors and induced subgraphs in edge-periodic temporal graphs. Discrete Applied Mathematics..
• Anton Herrmann, Christian Komusiewicz, Nils Morawietz, and Frank Sommer: Temporal dominating set and temporal vertex cover under the lens of degree restrictions. Theoretical Computer Science.

Conference Publications

• Thomas Depian, and Frank Sommer: Revisiting Graph Modification via Disk Scaling: From One Radius to Interval-Based Radii. ESA 2026.
• Robert Ganian, Frank Sommer, and Manuel Sorge: Tractability via Low Dimensionality: The Parameterized Complexity of Training Quantized Neural Networks. ICLR 2026.
• Juha Harviainen, Frank Sommer, and Manuel Sorge: Exact and Approximate Algorithms for Polytree Learning. ICML 2026.
• Christian Komusiewicz, Zhenwei Liu, Nils Morawietz, and Frank Sommer: Preventing Small Global Cuts by Protecting Edges. WG 2026.

2025

Conference Publications

• Niels Grüttemeier, Nils Morawietz, and Frank Sommer: Fantastic Flips and Where to Find Them: A General Framework for Parameterized Local Search on Partitioning Problems. WADS 2025.
• Juha Harviainen, Frank Sommer, and Manuel Sorge: Improving Decision Trees through the Lens of Parameterized Local Search. NeurIPS 2025.
• Juha Harviainen, Frank Sommer, Manuel Sorge, and Stefan Szeider: Optimal Decision Tree Pruning Revisited: Algorithms and Complexity. ICML 2025.
• Anton Herrmann, Christian Komusiewicz, Nils Morawietz, and Frank Sommer: Temporal Dominating Set and Temporal Vertex Cover Under the Lense of Degree Restrictions. SAND 2025.
• Anton Herrmann, Christian Komusiewicz, Nils Morawietz, and Frank Sommer: Timeline Problems in Temporal Graphs: Vertex Cover vs. Dominating Set. IPEC 2025.
• Christian Komusiewicz, Diptapriyo Majumdar, and Frank Sommer: Polynomial-Size Enumeration Kernelizations for Long Path Enumeration. WG 2025.
• Christian Komusiewicz, André Schidler, Frank Sommer, Manuel Sorge, and Luca Pascal Staus: Learning Minimum-Size BDDs: Towards Efficient Exact Algorithms. ICML 2025.
• Luca Pascal Staus, Christian Komusiewicz, Frank Sommer, and Manuel Sorge: Witty: An Efficient Solver for Computing Minimum-Size Decision Trees. AAAI 2025.

2024

Journal Publications

• Niels Grüttemeier, Philipp Heinrich Keßler, Christian Komusiewicz, and Frank Sommer: Efficient branch-and-bound algorithms for finding triangle-constrained 2-clubs. Journal of Combinatorial Optimization.
• Jannik Schestag, Niels Grüttemeier, Christian Komusiewicz, and Frank Sommer: On Critical Node Problems with Vulnerable Vertices. Journal of Graph Algorithms and Applications.

Conference Publications

• Emanuel Herrendorf, Christian Komusiewicz, Nils Morawietz, and Frank Sommer: On the Complexity of Community-Aware Network Sparsification. MFCS 2024.
• Bodo Manthey, Nils Morawietz, Jesse van Rhijn, and Frank Sommer: Complexity of Local Search for Euclidean Clustering Problems. ISAAC 2024.
• Henning Martin Woydt, Christian Komusiewicz, and Frank Sommer: SubModST: A Fast Generic Solver for Submodular Maximization with Size Constraints. ESA 2024.

2023

Journal Publications

• Jaroslav Garvardt, Christian Komusiewicz, and Frank Sommer: The Parameterized Complexity of s-Club with Triangle and Seed Constraints. Theory of Computing Systems.
• Nils Jakob Eckstein, Niels Grüttemeier, Christian Komusiewicz, and Frank Sommer: Destroying Multicolored Paths and Cycles in Edge-Colored Graphs. Discrete Mathematics & Theoretical Computer Science.
• Tomohiro Koana, Christian Komusiewicz, and Frank Sommer: Computing Dense and Sparse Subgraphs of Weakly Closed Graphs. Algorithmica.
• Tomohiro Koana, Christian Komusiewicz, and Frank Sommer: Essentially Tight Kernels for (Weakly) Closed Graphs. Algorithmica.

Conference Publications

• Emmanuel Arrighi, Niels Grüttemeier, Nils Morawietz, Frank Sommer, and Petra Wolf: Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic Temporal Graphs. SOFSEM 2023.
• Matthias Bentert, Jannik Schestag, and Frank Sommer: On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure Model. IPEC 2023.
• Christian Komusiewicz, Pascal Kunz, Frank Sommer, and Manuel Sorge: On Computing Optimal Tree Ensembles. ICML 2023.
• Christian Komusiewicz, Jannis Schramek, and Frank Sommer: On the Group Coverage Centrality Problem: Parameterized Complexity and Heuristics. ACDA 2023.
• Luca Pascal Staus, Christian Komusiewicz, Nils Morawietz, Frank Sommer: Exact Algorithms for Group Closeness Centrality. ACDA 2023.

2022

Journal Publications

• Tomohiro Koana, Christian Komusiewicz, and Frank Sommer: Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems. SIAM Journal on Discrete Mathematics.
• Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, and Frank Sommer:
  Colored cut games. Theoretical Computer Science.
• Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, and Frank Sommer:
  Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs. Theory of Computing Systems.

Conference Publications

• Jaroslav Garvardt, Christian Komusiewicz, and Frank Sommer: The Parameterized Complexity of s-Club with Triangle and Seed Constraints. IWOCA 2022.
• Tomohiro Koana, Christian Komusiewicz, André Nichterlein, and Frank Sommer: Covering Many (Or Few) Edges with k Vertices in Sparse Graphs. STACS 2022.
• Jannik Schestag, Niels Grüttemeier, Christian Komusiewicz, and Frank Sommer: On Critical Node Problems with Vulnerable Vertices. IWOCA 2022.

2021

Journal Publications

• Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag, and Frank Sommer: Destroying Bicolored P3s by Deleting Few Edges. Discrete Mathematics & Theoretical Computer Science.
• Christian Komusiewicz, and Frank Sommer: Enumerating connected induced subgraphs: Improved delay and experimental comparison. Discrete Applied Mathematics.

Conference Publications

• Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, and Frank Sommer: Preventing Small (s,t)-Cuts by Protecting Edges. WG 2021.
• Tomohiro Koana, Christian Komusiewicz, and Frank Sommer: Essentially Tight Kernels For (Weakly) Closed Graphs. ISAAC 2021.

2020

Journal Publications

• Frank Sommer, and Christian Komusiewicz: Parameterized algorithms for Module Map problems. Discrete Applied Mathematics.

Conference Publications

• Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, and Frank Sommer: String Factorizations Under Various Collision Constraints. CPM 2020.
• Tomohiro Koana, Christian Komusiewicz, and Frank Sommer: Computing Dense and Sparse Subgraphs of Weakly Closed Graphs. ISAAC 2020.
• Tomohiro Koana, Christian Komusiewicz, and Frank Sommer: Exploiting c-Closure in Kernelization Algorithms for Graph Problems. ESA 2020.
• Christian Komusiewicz, and Frank Sommer: FixCon: A Generic Solver for Fixed-Cardinality Subgraph Problems. ALENEX 2020.
• Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, and Frank Sommer: Colored Cut Games. FSTTCS 2020.
• Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, and Frank Sommer: Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs. SOFSEM 2020.

2019

Conference Publications

• Markus Brill, Piotr Faliszewski, Frank Sommer, and Nimrod Talmon: Approximation Algorithms for BalancedCC Multiwinner Rules. AAMAS 2019.
• Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag, and Frank Sommer: Destroying Bicolored P3s by Deleting Few Edges. CiE 2019
• Christian Komusiewicz, and Frank Sommer: Enumerating Connected Induced Subgraphs: Improved Delay and Experimental Comparison. SOFSEM 2019.

2018

Conference Publications

• Frank Sommer, and Christian Komusiewicz: Parameterized Algorithms for Module Map Problems. ISCO 2018.