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 ...
share
research
∙
04/06/2022
Efficient Bayesian Network Structure Learning via Parameterized Local Search on Topological Orderings
In Bayesian Network Structure Learning (BNSL), one is given a variable s...
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
∙
07/09/2021
Preventing Small (𝐬,𝐭)-Cuts by Protecting Edges
We introduce and study Weighted Min (s,t)-Cut Prevention, where we are g...
research
∙
05/20/2021
On the Parameterized Complexity of Polytree Learning
A Bayesian network is a directed acyclic graph that represents statistic...
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
∙
04/30/2020
Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis
We study the problem of learning the structure of an optimal Bayesian ne...
research
∙
02/20/2020
Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized by Distance to Low-Degree Graphs
Given an undirected graph G and integers c and k, the Maximum Edge-Color...
research
∙
01/11/2019
Destroying Bicolored P_3s by Deleting Few Edges
We introduce and study the Bicolored P_3 Deletion problem defined as fol...
research
∙
11/23/2018
Your Rugby Mates Don't Need to Know your Colleagues: Triadic Closure with Edge Colors
Given an undirected graph G=(V,E) the NP-hard Strong Triadic Closure (ST...
research
∙
03/02/2018