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 graphsExternal link. Discrete Applied MathematicsExternal link.  (arXiv versionExternal link).
• Anton Herrmann, Christian Komusiewicz, Nils Morawietz, and Frank Sommer: Temporal Dominating Set and Temporal Vertex Cover under the Lens of Degree RestrictionsExternal link, Theoretical Computer ScienceExternal link.

Conference Publications

• Thomas Depian, and Frank Sommer: Revisiting Graph Modification via Disk Scaling: From One Radius to Interval-Based RadiiExternal link. In Proceedings of the 34th Annual European Symposium on Algorithms.                 ESA 2026External link. (arXiv versionExternal link).
• Robert Ganian, Frank Sommer, and Manuel Sorge: Tractability via Low Dimensionality: The Parameterized Complexity of Training Quantized Neural NetworksExternal link. ICLR 2026External link.
• Juha Harviainen, Frank Sommer, and Manuel Sorge: Exact and Approximate Algorithms for Polytree LearningExternal link. ICML 2026External link. (arXiv versionExternal link).
• Christian Komusiewicz, Zhenwei Liu, Nils Morawietz, and Frank Sommer: Preventing Small Global Cuts by Protecting EdgesExternal link. WG'26External link.

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 ProblemsExternal link. WADS'25External link. (arXiv versionExternal link).
• Juha Harviainen, Frank Sommer, and Manuel Sorge: Improving Decision Trees through the Lens of Parameterized Local SearchExternal link. NeurIPS 2025External link. (arXiv versionExternal link). (Code and DataExternal link).
• Juha Harviainen, Frank Sommer, Manuel Sorge, and Stefan Szeider: Optimal Decision Tree Pruning Revisited: Algorithms and ComplexityExternal link. ICML 2025External link. (arXiv versionExternal link).
• Anton Herrmann, Christian Komusiewicz, Nils Morawietz, and Frank Sommer: Temporal Dominating Set and Temporal Vertex Cover under the Lense of Degree RestrictionsExternal link. SAND'25External link.
• Anton Herrmann, Christian Komusiewicz, Nils Morawietz, and Frank Sommer: Timeline Problems in Temporal Graphs: Vertex Cover vs. Dominating SetExternal link. IPEC'25External link. (arXiv versionExternal link).
• Christian Komusiewicz, Diptapriyo Majumdar, and Frank Sommer: Polynomial-Size Enumeration Kernelizations for Long Path EnumerationExternal link. WG'25External link. (arXiv versionExternal link).
• Christian Komusiewicz, André Schidler, Frank Sommer, Manuel Sorge, Luca Pascal Staus: Learning Minimum-Size BDDs: Towards Efficient Exact AlgorithmsExternal link. ICML 2025External link. (Code and DataExternal link).
• Luca Staus, Christian Komusiewicz, Frank Sommer and Manuel Sorge: Witty: An Efficient Solver for Computing Minimum-Size Decision TreesExternal link. AAAI'25External link. (arXiv versionExternal link). (Code and DataExternal link).

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-clubsExternal link.                                                               Journal of Combinatorial OptimizationExternal link. (arXiv versionExternal link).
• Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag, and Frank Sommer. On Critical Node Problems with Vulnerable VerticesExternal link. Journal of Graph Algorithms and ApplicationsExternal link.

Conference Publications

• Emanuel Herrendorf, Christian Komusiewicz, Nils Morawietz, and Frank Sommer. On the Complexity of Community-Aware Network SparsificationExternal link. MFCS'24External link. (arXiv versionExternal link).
• Bodo Manthey, Nils Morawietz, Jesse van Rhijn, and Frank Sommer: Complexity of Local Search for Euclidean Clustering ProblemsExternal link. ISAAC 2024External link. (arXiv versionExternal link).
• Henning Martin Woydt, Christian Komusiewicz, and Frank Sommer: SubModST: A Fast Generic Solver for Submodular Maximization with Size ConstraintsExternal link. ESA'24External link. (Code and DataExternal link).

2023

Journal Publications

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

Conference Publications

• Emmanuel Arrighi, Niels Grüttemeier, Nils Morawietz, Frank Sommer, and Petra Wolf: Finding Minors and Subgraphs in Edge-Periodic Temporal GraphsExternal link. SOFSEM'23External link. (arXiv versionExternal link).
• Matthias Bentert, Jannik Schestag, and Frank Sommer: On the Complexity of Finding a Sparse Connected Spanning Subgraph in a non-Uniform Failure ModelExternal link. IPEC'23External link. (arXiv versionExternal link).
• Christian Komusiewicz, Pascal Kunz, Frank Sommer, and Manuel Sorge: Computing Optimal Tree EnsemblesExternal link. ICML'23External link. (arXiv versionExternal link).
• Christian Komusiewicz, Jannis Schramek, and Frank Sommer: On the Group Coverage Centrality Problem: Parameterized Complexity and HeuristicsExternal link.  ACDA'23External link.
• Luca Pascal Staus, Christian Komusiewicz, Nils Morawietz, and Frank Sommer: Exact Algorithms for Group Closeness CentralityExternal link. ACDA'23External link.

2022

Journal Publications

• Tomohiro Koana, Christian Komusiewicz, and Frank Sommer: Exploiting c-Closure in Kernelization Algorithms for Graph ProblemsExternal link. SIAM Journal on Discrete MathematicsExternal link. (arXiv versionExternal link).
• Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, and Frank Sommer: Colored cut gamesExternal link. Theoretical Computer ScienceExternal link.
• Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, and Frank Sommer: Refined Parameterizations for Computing Colored Cuts in Edge-Colored GraphsExternal link. Theory of Computing SystemsExternal link.

Conference Publications

• Jaroslav Garvardt, Christian Komusiewicz, and Frank Sommer: The Parameterized Complexity of s-Club with Triangle and Seed ConstraintsExternal link. IWOCA'22External link. (arXiv versionExternal link).
• Tomohiro Koana, Christian Komusiewicz, André Nichterlein, and Frank Sommer: Covering Many (or Few) Edges with k Vertices in Sparse GraphsExternal link. STACS'22External link. (arXiv versionExternal link).
• Jannik Schestag, Niels Grüttemeier, Christian Komusiewicz, and Frank Sommer: On Critical Node Problems with Vulnerable VerticesExternal link. IWOCA'22External link.

2021

Journal Publications

• Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag, and Frank Sommer: Destroying Bicolored P3s by Deleting Few EdgesExternal link. Discrete Mathematics & Theoretical Computer ScienceExternal link. (arXiv versionExternal link).
• Christian Komusiewicz and Frank Sommer: Enumerating Connected Induced Subgraphs: Improved Delay and Experimental ComparisonExternal link. Discrete Applied MathematicsExternal link.

Conference Publications

• Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, and Frank Sommer: Preventing Small (s,t)-Cuts by Protecting EdgesExternal link. WG'21External link. (arXiv versionExternal link).
• Tomohiro Koana, Christian Komusiewicz, and Frank Sommer: Essentially Tight Kernels for (Weakly) Closed GraphsExternal link. ISAAC'21External link. (arXiv versionExternal link).

2020

Journal Publications

• Frank Sommer and Christian Komusiewicz: Parameterized Algorithms for Module Map ProblemsExternal link. Discrete Applied MathematicsExternal link.

Conference Publications

• Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, and Frank Sommer: String Factorizations under Various Collision ConstraintsExternal link. CPM'20External link.
• Tomohiro Koana, Christian Komusiewicz, and Frank Sommer: Computing Dense and Sparse Subgraphs of Weakly Closed GraphsExternal link. ISAAC'20External link. (arXiv versionExternal link).
• Tomohiro Koana, Christian Komusiewicz, and Frank Sommer: Exploiting c-Closure in Kernelization Algorithms for Graph ProblemsExternal link. ESA'20External link. (arXiv versionExternal link).
• Christian Komusiewicz and Frank Sommer: FixCon: A Generic Solver for Fixed-Cardinality Subgraph ProblemsExternal link. ALENEX ’20External link. 
• Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, and Frank Sommer.                                       Colored cut gamesExternal link. FSTTCS'20External link.
• Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, and Frank Sommer: Refined Parameterizations for Computing Colored Cuts in Edge-Colored GraphsExternal link. SOFSEM'20External link.

2019

Conference Publications

• Markus Brill, Piotr Faliszewski, Frank Sommer, and Nimrod Talmon: Approximation Algorithms for BalancedCC Multiwinner RulesExternal link. AAMAS'19External link.
• Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag and Frank Sommer: Destroying Bicolored P3s by Deleting Few EdgesExternal link. CiE'19External link. (arXiv versionExternal link).
• Christian Komusiewicz and Frank Sommer: Enumerating Connected Induced Subgraphs: Improved Delay and Experimental ComparisonExternal link. SOFSEM'19External link.

2018

Conference Publications

• Frank Sommer and Christian Komusiewicz: Parameterized Algorithms for Module Map ProblemsExternal link.  ISCO'18External link.

PhD Thesis

2022

• Frank Sommer: On Hard Subgraph Problems: Parameterized Algorithms and Efficient ImplementationsExternal link. Dissertation, Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, November 2022.