Frank Sommer - RankMe

66 papers A* 4A 5B 13C 4Journal 35Unranked 4

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Multi-parameter analysis of finding minors and induced subgraphs in edge-periodic temporal graphs. Discret. Appl. Math. Emmanuel Arrighi, Niels Grüttemeier, Nils Morawietz, Frank Sommer, Petra Wolf
2026	J	`jnl`	Revisiting Graph Modification via Disk Scaling: From One Radius to Interval-Based Radii. CoRR Thomas Depian, Frank Sommer
2025	J	`jnl`	Fantastic Flips and Where to Find Them: A General Framework for Parameterized Local Search on Partitioning Problem. CoRR Niels Grüttemeier, Nils Morawietz, Frank Sommer
2025	B	`conf`	Fantastic Flips and Where to Find Them: A General Framework for Parameterized Local Search on Partitioning Problems. WADS Niels Grüttemeier, Nils Morawietz, Frank Sommer
2025	J	`jnl`	Improving Decision Trees through the Lens of Parameterized Local Search. CoRR Juha Harviainen, Frank Sommer, Manuel Sorge
2025	A*	`conf`	Learning Minimum-Size BDDs: Towards Efficient Exact Algorithms. ICML Christian Komusiewicz, André Schidler, Frank Sommer, Manuel Sorge, Luca Pascal Staus
2025	A*	`conf`	Optimal Decision Tree Pruning Revisited: Algorithms and Complexity. ICML Juha Harviainen, Frank Sommer, Manuel Sorge, Stefan Szeider
2025	J	`jnl`	Optimal Decision Tree Pruning Revisited: Algorithms and Complexity. CoRR Juha Harviainen, Frank Sommer, Manuel Sorge, Stefan Szeider
2025	B	`conf`	Polynomial-Size Enumeration Kernelizations for Long Path Enumeration. WG Christian Komusiewicz, Diptapriyo Majumdar, Frank Sommer
2025	J	`jnl`	Polynomial-Size Enumeration Kernelizations for Long Path Enumeration. CoRR Christian Komusiewicz, Diptapriyo Majumdar, Frank Sommer
2025	—	`conf`	Temporal Dominating Set and Temporal Vertex Cover Under the Lense of Degree Restrictions. SAND Anton Herrmann, Christian Komusiewicz, Nils Morawietz, Frank Sommer
2025	J	`jnl`	The Parameter Report: An Orientation Guide for Data-Driven Parameterization. CoRR Christian Komusiewicz, Nils Morawietz, Frank Sommer, Luca Pascal Staus
2025	B	`conf`	Timeline Problems in Temporal Graphs: Vertex Cover vs. Dominating Set. IPEC Anton Herrmann, Christian Komusiewicz, Nils Morawietz, Frank Sommer
2025	J	`jnl`	Timeline Problems in Temporal Graphs: Vertex Cover vs. Dominating Set. CoRR Anton Herrmann, Christian Komusiewicz, Nils Morawietz, Frank Sommer
2025	A*	`conf`	Witty: An Efficient Solver for Computing Minimum-Size Decision Trees. AAAI Luca Pascal Staus, Christian Komusiewicz, Frank Sommer, Manuel Sorge
2024	B	`conf`	Complexity of Local Search for Euclidean Clustering Problems. ISAAC Bodo Manthey, Nils Morawietz, Jesse van Rhijn, Frank Sommer
2024	J	`jnl`	Efficient branch-and-bound algorithms for finding triangle-constrained 2-clubs. J. Comb. Optim. Niels Grüttemeier, Philipp Heinrich Keßler, Christian Komusiewicz, Frank Sommer
2024	J	`jnl`	On Critical Node Problems with Vulnerable Vertices. J. Graph Algorithms Appl. Jannik Schestag, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
2024	B	`conf`	On the Complexity of Community-Aware Network Sparsification. MFCS Emanuel Herrendorf, Christian Komusiewicz, Nils Morawietz, Frank Sommer
2024	J	`jnl`	On the Complexity of Community-aware Network Sparsification. CoRR Emanuel Herrendorf, Christian Komusiewicz, Nils Morawietz, Frank Sommer
2024	A	`conf`	SubModST: A Fast Generic Solver for Submodular Maximization with Size Constraints. ESA Henning Martin Woydt, Christian Komusiewicz, Frank Sommer
2024	J	`jnl`	Witty: An Efficient Solver for Computing Minimum-Size Decision Trees. CoRR Luca Pascal Staus, Christian Komusiewicz, Frank Sommer, Manuel Sorge
2023	J	`jnl`	Complexity of Local Search for Euclidean Clustering Problems. CoRR Bodo Manthey, Nils Morawietz, Jesse van Rhijn, Frank Sommer
2023	J	`jnl`	Computing Dense and Sparse Subgraphs of Weakly Closed Graphs. Algorithmica Tomohiro Koana, Christian Komusiewicz, Frank Sommer
2023	J	`jnl`	Destroying Multicolored Paths and Cycles in Edge-Colored Graphs. Discret. Math. Theor. Comput. Sci. Nils Jakob Eckstein, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
2023	J	`jnl`	Essentially Tight Kernels for (Weakly) Closed Graphs. Algorithmica Tomohiro Koana, Christian Komusiewicz, Frank Sommer
2023	—	`conf`	Exact Algorithms for Group Closeness Centrality. ACDA Luca Pascal Staus, Christian Komusiewicz, Nils Morawietz, Frank Sommer
2023	B	`conf`	Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic Temporal Graphs. SOFSEM Emmanuel Arrighi, Niels Grüttemeier, Nils Morawietz, Frank Sommer, Petra Wolf
2023	A*	`conf`	On Computing Optimal Tree Ensembles. ICML Christian Komusiewicz, Pascal Kunz, Frank Sommer, Manuel Sorge
2023	J	`jnl`	On Computing Optimal Tree Ensembles. CoRR Christian Komusiewicz, Pascal Kunz, Frank Sommer, Manuel Sorge
2023	B	`conf`	On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure Model. IPEC Matthias Bentert, Jannik Schestag, Frank Sommer
2023	J	`jnl`	On the Complexity of Finding a Sparse Connected Spanning Subgraph in a non-Uniform Failure Model. CoRR Matthias Bentert, Jannik Schestag, Frank Sommer
2023	—	`conf`	On the Group Coverage Centrality Problem: Parameterized Complexity and Heuristics. ACDA Christian Komusiewicz, Jannis Schramek, Frank Sommer
2023	J	`jnl`	The Parameterized Complexity of s-Club with Triangle and Seed Constraints. Theory Comput. Syst. Jaroslav Garvardt, Christian Komusiewicz, Frank Sommer
2022	J	`jnl`	Colored cut games. Theor. Comput. Sci. Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
2022	A	`conf`	Covering Many (Or Few) Edges with k Vertices in Sparse Graphs. STACS Tomohiro Koana, Christian Komusiewicz, André Nichterlein, Frank Sommer
2022	J	`jnl`	Covering Many (or Few) Edges with k Vertices in Sparse Graphs. CoRR Tomohiro Koana, Christian Komusiewicz, André Nichterlein, Frank Sommer
2022	J	`jnl`	Efficient Branch-and-Bound Algorithms for Finding Triangle-Constrained 2-Clubs. CoRR Niels Grüttemeier, Philipp Heinrich Keßler, Christian Komusiewicz, Frank Sommer
2022	J	`jnl`	Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems. SIAM J. Discret. Math. Tomohiro Koana, Christian Komusiewicz, Frank Sommer
2022	J	`jnl`	Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge Periodic Temporal Graphs. CoRR Emmanuel Arrighi, Niels Grüttemeier, Nils Morawietz, Frank Sommer, Petra Wolf
2022	C	`conf`	On Critical Node Problems with Vulnerable Vertices. IWOCA Jannik Schestag, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
2022	—	`—`	On Hard Subgraph Problems: Parameterized Algorithms and Efficient Implementations. Frank Sommer
2022	J	`jnl`	Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs. Theory Comput. Syst. Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
2022	C	`conf`	The Parameterized Complexity of s-Club with Triangle and Seed Constraints. IWOCA Jaroslav Garvardt, Christian Komusiewicz, Frank Sommer
2022	J	`jnl`	The Parameterized Complexity of s-Club with Triangle and Seed Constraints. CoRR Jaroslav Garvardt, Christian Komusiewicz, Frank Sommer
2021	J	`jnl`	Destroying Bicolored P Discret. Math. Theor. Comput. Sci. Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag, Frank Sommer
2021	J	`jnl`	Destroying Multicolored Paths and Cycles in Edge-Colored Graphs. CoRR Nils Jakob Eckstein, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
2021	J	`jnl`	Enumerating connected induced subgraphs: Improved delay and experimental comparison. Discret. Appl. Math. Christian Komusiewicz, Frank Sommer
2021	B	`conf`	Essentially Tight Kernels For (Weakly) Closed Graphs. ISAAC Tomohiro Koana, Christian Komusiewicz, Frank Sommer
2021	J	`jnl`	Essentially Tight Kernels for (Weakly) Closed Graphs. CoRR Tomohiro Koana, Christian Komusiewicz, Frank Sommer
2021	J	`jnl`	Preventing Small (s, t)-Cuts by Protecting Edges. CoRR Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer
2021	B	`conf`	Preventing Small (s,t)Cuts by Protecting Edges. WG Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer
2020	—	`conf`	Colored Cut Games. FSTTCS Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
2020	B	`conf`	Computing Dense and Sparse Subgraphs of Weakly Closed Graphs. ISAAC Tomohiro Koana, Christian Komusiewicz, Frank Sommer
2020	J	`jnl`	Computing Dense and Sparse Subgraphs of Weakly Closed Graphs. CoRR Tomohiro Koana, Christian Komusiewicz, Frank Sommer
2020	J	`jnl`	Exploiting $\mathbf{c}$-Closure in Kernelization Algorithms for Graph Problems. CoRR Tomohiro Koana, Christian Komusiewicz, Frank Sommer
2020	A	`conf`	Exploiting c-Closure in Kernelization Algorithms for Graph Problems. ESA Tomohiro Koana, Christian Komusiewicz, Frank Sommer
2020	A	`conf`	FixCon: A Generic Solver for Fixed-Cardinality Subgraph Problems. ALENEX Christian Komusiewicz, Frank Sommer
2020	J	`jnl`	Parameterized algorithms for Module Map problems. Discret. Appl. Math. Frank Sommer, Christian Komusiewicz
2020	B	`conf`	Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs. SOFSEM Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
2020	B	`conf`	String Factorizations Under Various Collision Constraints. CPM Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer
2019	A	`conf`	Approximation Algorithms for BalancedCC Multiwinner Rules. AAMAS Markus Brill, Piotr Faliszewski, Frank Sommer, Nimrod Talmon
2019	C	`conf`	Destroying Bicolored P CiE Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag, Frank Sommer
2019	J	`jnl`	Destroying Bicolored P CoRR Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag, Frank Sommer
2019	B	`conf`	Enumerating Connected Induced Subgraphs: Improved Delay and Experimental Comparison. SOFSEM Christian Komusiewicz, Frank Sommer
2018	C	`conf`	Parameterized Algorithms for Module Map Problems. ISCO Frank Sommer, Christian Komusiewicz