There has been a recent surge of interest in incorporating fairness aspects into classical
clustering problems. Two recently introduced variants of the k-Center problem in this spirit are …

There has been a recent surge of interest in incorporating fairness aspects into classical
clustering problems. Two recently introduced variants of the k-Center problem in this spirit are …

A well-known conjecture of Füredi, Kahn, and Seymour (1993) on non-uniform hypergraph
matching states that for any hypergraph with edge weights w, there exists a matching M such …

As more and more decisions are made in an automated fashion, there has been a surge of
interest in incorporating fairness aspects into algorithms by design. In this thesis, we …

Fair clustering enjoyed a surge of interest recently. One appealing way of integrating fairness
aspects into classical clustering problems is by introducing multiple covering constraints. …

We study the balanced k-way hypergraph partitioning problem, with a special focus on its
practical applications to manycore scheduling. Given a hypergraph on n nodes, our goal is to …

We study the problem of scheduling an arbitrary computational DAG on a fixed number of
processors while minimizing the makespan. While previous works have mostly studied this …

We study the problem of efficiently scheduling a computational DAG on multiple processors.
The majority of previous works have developed and compared algorithms for this problem in …

We study the problem of efficiently scheduling a computational DAG on multiple processors.
While previous works have mostly studied this problem in rather simple models, we instead …

Recent progress on robust clustering led to constant-factor approximations for Robust Matroid
Center. After a first combinatorial 7-approximation that is based on a matroid intersection …