Frank Sommer

Publication Activity (10 Years)

Years Active: 2018-2024
Publications (10 Years): 46

Top Topics

Experimental Comparison

Parameterized Complexity

Top Venues

Publications

Jannik Schestag, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
On Critical Node Problems with Vulnerable Vertices. J. Graph Algorithms Appl. 28 (1) (2024)
Emanuel Herrendorf, Christian Komusiewicz, Nils Morawietz, Frank Sommer
On the Complexity of Community-Aware Network Sparsification. MFCS (2024)
Emanuel Herrendorf, Christian Komusiewicz, Nils Morawietz, Frank Sommer
On the Complexity of Community-aware Network Sparsification. CoRR (2024)
Bodo Manthey, Nils Morawietz, Jesse van Rhijn, Frank Sommer
Complexity of Local Search for Euclidean Clustering Problems. CoRR (2023)
Christian Komusiewicz, Pascal Kunz, Frank Sommer, Manuel Sorge
On Computing Optimal Tree Ensembles. ICML (2023)
Tomohiro Koana, Christian Komusiewicz, Frank Sommer
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs. Algorithmica 85 (7) (2023)
Emmanuel Arrighi, Niels Grüttemeier, Nils Morawietz, Frank Sommer, Petra Wolf
Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic Temporal Graphs. SOFSEM (2023)
Christian Komusiewicz, Pascal Kunz, Frank Sommer, Manuel Sorge
On Computing Optimal Tree Ensembles. CoRR (2023)
Christian Komusiewicz, Jannis Schramek, Frank Sommer
On the Group Coverage Centrality Problem: Parameterized Complexity and Heuristics. ACDA (2023)
Nils Jakob Eckstein, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
Destroying Multicolored Paths and Cycles in Edge-Colored Graphs. Discret. Math. Theor. Comput. Sci. 25 (2023)
Matthias Bentert, Jannik Schestag, Frank Sommer
On the Complexity of Finding a Sparse Connected Spanning Subgraph in a non-Uniform Failure Model. CoRR (2023)
Jaroslav Garvardt, Christian Komusiewicz, Frank Sommer
The Parameterized Complexity of s-Club with Triangle and Seed Constraints. Theory Comput. Syst. 67 (5) (2023)
Matthias Bentert, Jannik Schestag, Frank Sommer
On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure Model. IPEC (2023)
Tomohiro Koana, Christian Komusiewicz, Frank Sommer
Essentially Tight Kernels for (Weakly) Closed Graphs. Algorithmica 85 (6) (2023)
Luca Pascal Staus, Christian Komusiewicz, Nils Morawietz, Frank Sommer
Exact Algorithms for Group Closeness Centrality. ACDA (2023)
Jaroslav Garvardt, Christian Komusiewicz, Frank Sommer
The Parameterized Complexity of s-Club with Triangle and Seed Constraints. CoRR (2022)
Tomohiro Koana, Christian Komusiewicz, Frank Sommer
Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems. SIAM J. Discret. Math. 36 (4) (2022)
Tomohiro Koana, Christian Komusiewicz, André Nichterlein, Frank Sommer
Covering Many (or Few) Edges with k Vertices in Sparse Graphs. CoRR (2022)
Emmanuel Arrighi, Niels Grüttemeier, Nils Morawietz, Frank Sommer, Petra Wolf
Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge Periodic Temporal Graphs. CoRR (2022)
Niels Grüttemeier, Philipp Heinrich Keßler, Christian Komusiewicz, Frank Sommer
Efficient Branch-and-Bound Algorithms for Finding Triangle-Constrained 2-Clubs. CoRR (2022)
Jaroslav Garvardt, Christian Komusiewicz, Frank Sommer
The Parameterized Complexity of s-Club with Triangle and Seed Constraints. IWOCA (2022)
Jannik Schestag, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
On Critical Node Problems with Vulnerable Vertices. IWOCA (2022)
Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
Colored cut games. Theor. Comput. Sci. 936 (2022)
Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs. Theory Comput. Syst. 66 (5) (2022)
Tomohiro Koana, Christian Komusiewicz, André Nichterlein, Frank Sommer
Covering Many (Or Few) Edges with k Vertices in Sparse Graphs. STACS (2022)
Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer
Preventing Small $\mathbf {(s, t)}$-Cuts by Protecting Edges. WG (2021)
Christian Komusiewicz, Frank Sommer
Enumerating connected induced subgraphs: Improved delay and experimental comparison. Discret. Appl. Math. 303 (2021)
Tomohiro Koana, Christian Komusiewicz, Frank Sommer
Essentially Tight Kernels For (Weakly) Closed Graphs. ISAAC (2021)
Tomohiro Koana, Christian Komusiewicz, Frank Sommer
Essentially Tight Kernels for (Weakly) Closed Graphs. CoRR (2021)
Nils Jakob Eckstein, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
Destroying Multicolored Paths and Cycles in Edge-Colored Graphs. CoRR (2021)
Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer
Preventing Small (s, t)-Cuts by Protecting Edges. CoRR (2021)
Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag, Frank Sommer
Destroying Bicolored $P_3$s by Deleting Few Edges. Discret. Math. Theor. Comput. Sci. 23 (1) (2021)
Tomohiro Koana, Christian Komusiewicz, Frank Sommer
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs. ISAAC (2020)
Tomohiro Koana, Christian Komusiewicz, Frank Sommer
Exploiting c-Closure in Kernelization Algorithms for Graph Problems. ESA (2020)
Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer
String Factorizations Under Various Collision Constraints. CPM (2020)
Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
Colored Cut Games. FSTTCS (2020)
Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs. SOFSEM (2020)
Tomohiro Koana, Christian Komusiewicz, Frank Sommer
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs. CoRR (2020)
Frank Sommer, Christian Komusiewicz
Parameterized algorithms for Module Map problems. Discret. Appl. Math. 283 (2020)
Tomohiro Koana, Christian Komusiewicz, Frank Sommer
Exploiting $\mathbf{c}$-Closure in Kernelization Algorithms for Graph Problems. CoRR (2020)
Christian Komusiewicz, Frank Sommer
FixCon: A Generic Solver for Fixed-Cardinality Subgraph Problems. ALENEX (2020)
Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag, Frank Sommer
s by Deleting Few Edges. CiE (2019)
Markus Brill, Piotr Faliszewski, Frank Sommer, Nimrod Talmon
Approximation Algorithms for BalancedCC Multiwinner Rules. AAMAS (2019)
Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag, Frank Sommer
s by Deleting Few Edges. CoRR (2019)
Christian Komusiewicz, Frank Sommer
Enumerating Connected Induced Subgraphs: Improved Delay and Experimental Comparison. SOFSEM (2019)
Frank Sommer, Christian Komusiewicz
Parameterized Algorithms for Module Map Problems. ISCO (2018)