Frank Sommer

CoRR, 2024

2023

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

[BibT_eX]

[DOI]

Jaroslav Garvardt

Theory Comput. Syst., October, 2023

Computing Dense and Sparse Subgraphs of Weakly Closed Graphs.

[BibT_eX]

[DOI]

Algorithmica, July, 2023

Essentially Tight Kernels for (Weakly) Closed Graphs.

[BibT_eX]

[DOI]

Algorithmica, June, 2023

Destroying Multicolored Paths and Cycles in Edge-Colored Graphs.

[BibT_eX]

[DOI]

Nils Jakob Eckstein

Discret. Math. Theor. Comput. Sci., 2023

Complexity of Local Search for Euclidean Clustering Problems.

[BibT_eX]

[DOI]

CoRR, 2023

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

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Matthias Bentert

Jannik Schestag

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

On Computing Optimal Tree Ensembles.

[BibT_eX]

[DOI]

Pascal Kunz

Manuel Sorge

Proceedings of the International Conference on Machine Learning, 2023

Exact Algorithms for Group Closeness Centrality.

[BibT_eX]

[DOI]

Luca Pascal Staus

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

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

[BibT_eX]

[DOI]

Jannis Schramek

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

2022

Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., December, 2022

On Hard Subgraph Problems: Parameterized Algorithms and Efficient Implementations.

[BibT_eX]

[DOI]

PhD thesis, 2022

Colored cut games.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

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

[BibT_eX]

[DOI]

Theory Comput. Syst., 2022

Efficient Branch-and-Bound Algorithms for Finding Triangle-Constrained 2-Clubs.

[BibT_eX]

[DOI]

Philipp Heinrich Keßler

CoRR, 2022

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

[BibT_eX]

[DOI]

André Nichterlein

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

On Critical Node Problems with Vulnerable Vertices.

[BibT_eX]

[DOI]

Jannik Schestag

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

2021

Destroying Bicolored P<sub>3</sub>s by Deleting Few Edges.

[BibT_eX]

[DOI]

Jannik Schestag

Discret. Math. Theor. Comput. Sci., 2021

Enumerating connected induced subgraphs: Improved delay and experimental comparison.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

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

[BibT_eX]

[DOI]

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

2020

Parameterized algorithms for Module Map problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

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

[BibT_eX]

[DOI]

CoRR, 2020

String Factorizations Under Various Collision Constraints.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]