Frank Sommer

According to our database, Frank Sommer authored at least 36 papers between 2018 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

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

Discret. Appl. Math., 2026

2025

The Parameter Report: An Orientation Guide for Data-Driven Parameterization.

Christian Komusiewicz, Nils Morawietz, Frank Sommer, Luca Pascal Staus

CoRR, September, 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, June, 2025

Optimal Decision Tree Pruning Revisited: Algorithms and Complexity.

Juha Harviainen, Frank Sommer, Manuel Sorge, Stefan Szeider

CoRR, March, 2025

Polynomial-Size Enumeration Kernelizations for Long Path Enumeration.

Christian Komusiewicz, Diptapriyo Majumdar, Frank Sommer

CoRR, February, 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

Proceedings of the 19th International Symposium on Algorithms and Data Structures, 2025

Temporal Dominating Set and Temporal Vertex Cover Under the Lense of Degree Restrictions.

Anton Herrmann, Christian Komusiewicz, Nils Morawietz, Frank Sommer

Proceedings of the 4th Symposium on Algorithmic Foundations of Dynamic Networks, 2025

Witty: An Efficient Solver for Computing Minimum-Size Decision Trees.

Luca Pascal Staus, Christian Komusiewicz, Frank Sommer, Manuel Sorge

Proceedings of the AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25, 2025

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., October, 2024

Experimental Data and Code for SubModST: A Fast Generic Solver for Submodular Maximization with Size Constraints.

Henning Martin Woydt, Christian Komusiewicz, Frank Sommer

Dataset, June, 2024

On the Complexity of Community-Aware Network Sparsification.

Emanuel Herrendorf, Christian Komusiewicz, Nils Morawietz, Frank Sommer

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

Complexity of Local Search for Euclidean Clustering Problems.

Bodo Manthey, Nils Morawietz, Jesse van Rhijn, Frank Sommer

Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

SubModST: A Fast Generic Solver for Submodular Maximization with Size Constraints.

Henning Martin Woydt, Christian Komusiewicz, Frank Sommer

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

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

Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic Temporal Graphs.

Emmanuel Arrighi, Niels Grüttemeier, Nils Morawietz, Frank Sommer, Petra Wolf

Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure Model.

Matthias Bentert, Jannik Schestag, Frank Sommer

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

On Computing Optimal Tree Ensembles.

Christian Komusiewicz, Pascal Kunz, Frank Sommer, Manuel Sorge

Proceedings of the International Conference on Machine Learning, 2023

Exact Algorithms for Group Closeness Centrality.

Luca Pascal Staus, Christian Komusiewicz, Nils Morawietz, Frank Sommer

Proceedings of the SIAM Conference on Applied and Computational Discrete Algorithms, 2023

On the Group Coverage Centrality Problem: Parameterized Complexity and Heuristics.

Christian Komusiewicz, Jannis Schramek, Frank Sommer

Proceedings of the SIAM Conference on Applied and Computational Discrete Algorithms, 2023

2022

On Hard Subgraph Problems: Parameterized Algorithms and Efficient Implementations.

Frank Sommer

PhD thesis, 2022

Covering Many (Or Few) Edges with k Vertices in Sparse Graphs.

Tomohiro Koana, Christian Komusiewicz, André Nichterlein, Frank Sommer

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

On Critical Node Problems with Vulnerable Vertices.

Jannik Schestag, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer

Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

The Parameterized Complexity of s-Club with Triangle and Seed Constraints.

Jaroslav Garvardt, Christian Komusiewicz, Frank Sommer

Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

2021

Preventing Small (s,t)Cuts by Protecting Edges.

Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

Essentially Tight Kernels For (Weakly) Closed Graphs.

Tomohiro Koana, Christian Komusiewicz, Frank Sommer

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

2020

Exploiting $\mathbf{c}$-Closure in Kernelization Algorithms for Graph Problems.

Tomohiro Koana, Christian Komusiewicz, Frank Sommer

CoRR, 2020

Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs.

Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer

Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

Computing Dense and Sparse Subgraphs of Weakly Closed Graphs.

Tomohiro Koana, Christian Komusiewicz, Frank Sommer

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Colored Cut Games.

Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer

Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

Exploiting c-Closure in Kernelization Algorithms for Graph Problems.

Tomohiro Koana, Christian Komusiewicz, Frank Sommer

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

String Factorizations Under Various Collision Constraints.

Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer

Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

FixCon: A Generic Solver for Fixed-Cardinality Subgraph Problems.

Christian Komusiewicz, Frank Sommer

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2020

2019

Enumerating Connected Induced Subgraphs: Improved Delay and Experimental Comparison.

Christian Komusiewicz, Frank Sommer

Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019

Destroying Bicolored P₃s by Deleting Few Edges.

Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag, Frank Sommer

Proceedings of the Computing with Foresight and Industry, 2019

Approximation Algorithms for BalancedCC Multiwinner Rules.

Markus Brill, Piotr Faliszewski, Frank Sommer, Nimrod Talmon

Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

2018

Parameterized Algorithms for Module Map Problems.

Frank Sommer, Christian Komusiewicz

Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018