research
∙
03/10/2023
DAG Scheduling in the BSP Model
We study the problem of scheduling an arbitrary computational DAG on a f...
share
research
∙
11/07/2022
A Simple Combinatorial Algorithm for Robust Matroid Center
Recent progress on robust clustering led to constant-factor approximatio...
research
∙
08/17/2022
Partitioning Hypergraphs is Hard: Models, Inapproximability, and Applications
We study the balanced k-way hypergraph partitioning problem, with a spec...
research
∙
07/06/2022
Techniques for Generalized Colorful k-Center Problems
Fair clustering enjoyed a surge of interest recently. One appealing way ...
research
∙
09/01/2020
Simpler and Stronger Approaches for Non-Uniform Hypergraph Matching and the Füredi, Kahn, and Seymour Conjecture
A well-known conjecture of Füredi, Kahn, and Seymour (1993) on non-unifo...
research
∙
07/08/2020
