Frank Sommer | DeepAI

DeepAI AI Chat

Featured Co-authors

Manuel Sorge
28 publications
Christian Komusiewicz
25 publications
Tomohiro Koana
21 publications
André Nichterlein
20 publications
Matthias Bentert
19 publications
Petra Wolf
13 publications
Niels Grüttemeier
11 publications
Pascal Kunz
9 publications
Nils Morawietz
6 publications
Emmanuel Arrighi
4 publications
Jannik Schestag
3 publications

∙ 08/08/2023

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

We study a generalization of the classic Spanning Tree problem that allo...

0 Matthias Bentert, et al. ∙

∙ 06/07/2023

On Computing Optimal Tree Ensembles

Random forests and, more generally, (decision-)tree ensembles are widely...

0 Christian Komusiewicz, et al. ∙

∙ 11/03/2022

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

In the Vertex Triangle 2-Club problem, we are given an undirected graph ...

0 Niels Grüttemeier, et al. ∙

∙ 03/14/2022

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

We study the computational complexity of determining structural properti...

0 Emmanuel Arrighi, et al. ∙

∙ 01/14/2022

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

The s-Club problem asks, for a given undirected graph G, whether G conta...

0 Jaroslav Garvardt, et al. ∙

∙ 01/14/2022

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

We study the following two fixed-cardinality optimization problems (a ma...

0 Tomohiro Koana, et al. ∙

∙ 07/09/2021

Preventing Small (𝐬,𝐭)-Cuts by Protecting Edges

We introduce and study Weighted Min (s,t)-Cut Prevention, where we are g...

0 Niels Grüttemeier, et al. ∙

∙ 04/07/2021

Destroying Multicolored Paths and Cycles in Edge-Colored Graphs

We study the computational complexity of c-Colored P_ℓ Deletion and c-Co...

0 Nils Jakob Eckstein, et al. ∙

∙ 03/05/2021

Essentially Tight Kernels for (Weakly) Closed Graphs

We study kernelization of classic hard graph problems when the input gra...

0 Tomohiro Koana, et al. ∙

∙ 07/10/2020

Computing Dense and Sparse Subgraphs of Weakly Closed Graphs

A graph G is weakly γ-closed if every induced subgraph of G contains one...

0 Tomohiro Koana, et al. ∙

∙ 05/08/2020

Exploiting 𝐜-Closure in Kernelization Algorithms for Graph Problems

A graph is c-closed if every pair of vertices with at least c common nei...

0 Tomohiro Koana, et al. ∙

∙ 01/11/2019

Destroying Bicolored P_3s by Deleting Few Edges

We introduce and study the Bicolored P_3 Deletion problem defined as fol...

0 Niels Grüttemeier, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world