research
∙
08/01/2023
Structural Parameterizations of the Biclique-Free Vertex Deletion Problem
In this work, we study the Biclique-Free Vertex Deletion problem: Given ...
share
research
∙
02/01/2023
Parameterized Algorithms for Colored Clustering
In the Colored Clustering problem, one is asked to cluster edge-colored ...
research
∙
04/29/2022
Single-Peaked Opinion Updates
We consider opinion diffusion for undirected networks with sequential up...
research
∙
03/31/2022
Finding Balance-Fair Short Paths in Graphs
The computation of short paths in graphs with edge lengths is a pillar o...
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
∙
01/28/2022
Placing Green Bridges Optimally, with Habitats Inducing Cycles
Choosing the placement of wildlife crossings (i.e., green bridges) to re...
research
∙
12/06/2021
Modification-Fair Cluster Editing
The classic Cluster Editing problem (also known as Correlation Clusterin...
research
∙
05/14/2021
Optimal Virtual Network Embeddings for Tree Topologies
The performance of distributed and data-centric applications often criti...
research
∙
05/11/2021
Parameterized Algorithms for Diverse Multistage Problems
The world is rarely static – many problems need not only be solved once ...
research
∙
02/08/2021
Placing Green Bridges Optimally, with a Multivariate Analysis
We study the problem of placing wildlife crossings, such as green bridge...
research
∙
07/02/2020
Approximating Sparse Quadratic Programs
Given a matrix A ∈ℝ^n× n, we consider the problem of maximizing x^TAx su...
research
∙
01/09/2020
Parameterized Complexity of Geodetic Set
A vertex set S of a graph G is geodetic if every vertex of G lies on a s...
research
∙
02/19/2018
