default search action
Frank Sommer
Person information
- affiliation: University of Jena, Germany
- affiliation (PhD 2022): University of Marburg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j12]Niels Grüttemeier
, Philipp Heinrich Keßler, Christian Komusiewicz
Efficient branch-and-bound algorithms for finding triangle-constrained 2-clubs. J. Comb. Optim. 48(3): 16 (2024) - [j11]Jannik Schestag, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer:
On Critical Node Problems with Vulnerable Vertices. J. Graph Algorithms Appl. 28(1): 1-26 (2024) - [c23]Henning Martin Woydt, Christian Komusiewicz, Frank Sommer:
SubModST: A Fast Generic Solver for Submodular Maximization with Size Constraints. ESA 2024: 102:1-102:18 - [c22]Bodo Manthey, Nils Morawietz, Jesse van Rhijn, Frank Sommer:
Complexity of Local Search for Euclidean Clustering Problems. ISAAC 2024: 48:1-48:16 - [c21]Emanuel Herrendorf, Christian Komusiewicz, Nils Morawietz, Frank Sommer:
On the Complexity of Community-Aware Network Sparsification. MFCS 2024: 60:1-60:18 - [i14]Emanuel Herrendorf, Christian Komusiewicz, Nils Morawietz, Frank Sommer:
On the Complexity of Community-aware Network Sparsification. CoRR abs/2402.15494 (2024) - 2023
- [j10]Tomohiro Koana
Essentially Tight Kernels for (Weakly) Closed Graphs. Algorithmica 85(6): 1706-1735 (2023) - [j9]Tomohiro Koana
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs. Algorithmica 85(7): 2156-2187 (2023) - [j8]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) - [j7]Jaroslav Garvardt
The Parameterized Complexity of s-Club with Triangle and Seed Constraints. Theory Comput. Syst. 67(5): 1050-1081 (2023) - [c20]Luca Pascal Staus
Exact Algorithms for Group Closeness Centrality. ACDA 2023: 1-12 - [c19]Christian Komusiewicz, Jannis Schramek, Frank Sommer:
On the Group Coverage Centrality Problem: Parameterized Complexity and Heuristics. ACDA 2023: 13-24 - [c18]Christian Komusiewicz, Pascal Kunz, Frank Sommer, Manuel Sorge:
On Computing Optimal Tree Ensembles. ICML 2023: 17364-17374 - [c17]Matthias Bentert, Jannik Schestag, Frank Sommer:
On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure Model. IPEC 2023: 4:1-4:12 - [c16]Emmanuel Arrighi
Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic Temporal Graphs. SOFSEM 2023: 283-297 - [i13]Christian Komusiewicz, Pascal Kunz, Frank Sommer, Manuel Sorge:
On Computing Optimal Tree Ensembles. CoRR abs/2306.04423 (2023) - [i12]Matthias Bentert, Jannik Schestag, Frank Sommer:
On the Complexity of Finding a Sparse Connected Spanning Subgraph in a non-Uniform Failure Model. CoRR abs/2308.04575 (2023) - [i11]Bodo Manthey, Nils Morawietz, Jesse van Rhijn, Frank Sommer:
Complexity of Local Search for Euclidean Clustering Problems. CoRR abs/2312.14916 (2023) - 2022
- [b1]Frank Sommer:
On Hard Subgraph Problems: Parameterized Algorithms and Efficient Implementations. University of Marburg, Germany, 2022, pp. 1-301 - [j6]Nils Morawietz
Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs. Theory Comput. Syst. 66(5): 1019-1045 (2022) - [j5]Tomohiro Koana, Christian Komusiewicz, Frank Sommer
Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems. SIAM J. Discret. Math. 36(4): 2798-2821 (2022) - [j4]Nils Morawietz
Colored cut games. Theor. Comput. Sci. 936: 13-32 (2022) - [c15]Jaroslav Garvardt, Christian Komusiewicz
The Parameterized Complexity of s-Club with Triangle and Seed Constraints. IWOCA 2022: 313-326 - [c14]Jannik Schestag, Niels Grüttemeier
On Critical Node Problems with Vulnerable Vertices. IWOCA 2022: 494-508 - [c13]Tomohiro Koana, Christian Komusiewicz, André Nichterlein, Frank Sommer:
Covering Many (Or Few) Edges with k Vertices in Sparse Graphs. STACS 2022: 42:1-42:18 - [i10]Tomohiro Koana, Christian Komusiewicz, André Nichterlein, Frank Sommer:
Covering Many (or Few) Edges with k Vertices in Sparse Graphs. CoRR abs/2201.05465 (2022) - [i9]Jaroslav Garvardt, Christian Komusiewicz, Frank Sommer:
The Parameterized Complexity of s-Club with Triangle and Seed Constraints. CoRR abs/2201.05654 (2022) - [i8]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 abs/2203.07401 (2022) - [i7]Niels Grüttemeier, Philipp Heinrich Keßler, Christian Komusiewicz, Frank Sommer:
Efficient Branch-and-Bound Algorithms for Finding Triangle-Constrained 2-Clubs. CoRR abs/2211.01701 (2022) - 2021
- [j3]Christian Komusiewicz
Enumerating connected induced subgraphs: Improved delay and experimental comparison. Discret. Appl. Math. 303: 262-282 (2021) - [j2]Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag, Frank Sommer:
Destroying Bicolored P3s by Deleting Few Edges. Discret. Math. Theor. Comput. Sci. 23(1) (2021) - [c12]Tomohiro Koana, Christian Komusiewicz, Frank Sommer:
Essentially Tight Kernels For (Weakly) Closed Graphs. ISAAC 2021: 35:1-35:15 - [c11]Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer:
Preventing Small (s,t)Cuts by Protecting Edges. WG 2021: 143-155 - [i6]Tomohiro Koana, Christian Komusiewicz, Frank Sommer:
Essentially Tight Kernels for (Weakly) Closed Graphs. CoRR abs/2103.03914 (2021) - [i5]Nils Jakob Eckstein, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer:
Destroying Multicolored Paths and Cycles in Edge-Colored Graphs. CoRR abs/2104.03138 (2021) - [i4]Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer:
Preventing Small (s, t)-Cuts by Protecting Edges. CoRR abs/2107.04482 (2021) - 2020
- [j1]Frank Sommer, Christian Komusiewicz
Parameterized algorithms for Module Map problems. Discret. Appl. Math. 283: 396-416 (2020) - [c10]Christian Komusiewicz, Frank Sommer:
FixCon: A Generic Solver for Fixed-Cardinality Subgraph Problems. ALENEX 2020: 12-26 - [c9]Niels Grüttemeier
String Factorizations Under Various Collision Constraints. CPM 2020: 17:1-17:14 - [c8]Tomohiro Koana
Exploiting c-Closure in Kernelization Algorithms for Graph Problems. ESA 2020: 65:1-65:17 - [c7]Nils Morawietz
Colored Cut Games. FSTTCS 2020: 30:1-30:17 - [c6]Tomohiro Koana
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs. ISAAC 2020: 20:1-20:17 - [c5]Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz
Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs. SOFSEM 2020: 248-259 - [i3]Tomohiro Koana, Christian Komusiewicz, Frank Sommer:
Exploiting $\mathbf{c}$-Closure in Kernelization Algorithms for Graph Problems. CoRR abs/2005.03986 (2020) - [i2]Tomohiro Koana, Christian Komusiewicz, Frank Sommer:
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs. CoRR abs/2007.05630 (2020)
2010 – 2019
- 2019
- [c4]Markus Brill, Piotr Faliszewski, Frank Sommer, Nimrod Talmon:
Approximation Algorithms for BalancedCC Multiwinner Rules. AAMAS 2019: 494-502 - [c3]Niels Grüttemeier, Christian Komusiewicz
Destroying Bicolored P3s by Deleting Few Edges. CiE 2019: 193-204 - [c2]Christian Komusiewicz
Enumerating Connected Induced Subgraphs: Improved Delay and Experimental Comparison. SOFSEM 2019: 272-284 - [i1]Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag, Frank Sommer:
Destroying Bicolored P3s by Deleting Few Edges. CoRR abs/1901.03627 (2019) - 2018
- [c1]Frank Sommer
Parameterized Algorithms for Module Map Problems. ISCO 2018: 376-388
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: