research
∙
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...
share
research
∙
06/07/2023
On Computing Optimal Tree Ensembles
Random forests and, more generally, (decision-)tree ensembles are widely...
research
∙
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 ...
research
∙
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...
research
∙
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...
research
∙
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...
research
∙
07/09/2021
Preventing Small (𝐬,𝐭)-Cuts by Protecting Edges
We introduce and study Weighted Min (s,t)-Cut Prevention, where we are g...
research
∙
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...
research
∙
03/05/2021
Essentially Tight Kernels for (Weakly) Closed Graphs
We study kernelization of classic hard graph problems when the input gra...
research
∙
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...
research
∙
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...
research
∙
01/11/2019