research
∙
07/05/2023
Approximate Turing kernelization and lower bounds for domination problems
An α-approximate polynomial Turing kernelization is a polynomial-time al...
share
research
∙
06/07/2023
On Computing Optimal Tree Ensembles
Random forests and, more generally, (decision-)tree ensembles are widely...
research
∙
02/01/2023
Parameterized Algorithms for Colored Clustering
In the Colored Clustering problem, one is asked to cluster edge-colored ...
research
∙
01/25/2023
In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks?
A temporal graph has an edge set that may change over discrete time step...
research
∙
04/06/2022
Disentangling the Computational Complexity of Network Untangling
We study the network untangling problem introduced by Rozenshtein, Tatti...
research
∙
03/11/2022
Vertex Cover and Feedback Vertex Set Above and Below Structural Guarantees
Vertex Cover parameterized by the solution size k is the quintessential ...
research
∙
11/17/2021
Bipartite Temporal Graphs and the Parameterized Complexity of Multistage 2-Coloring
We consider the algorithmic complexity of recognizing bipartite temporal...
research
∙
07/09/2021
Most Classic Problems Remain NP-hard on Relative Neighborhood Graphs and their Relatives
Proximity graphs have been studied for several decades, motivated by app...
research
∙
11/06/2017
