My main research interest is designing approximation algorithms for various Combinatorial Optimization problems, in particular (fair) clustering and scheduling.

Publications

DAG Scheduling in the BSP Model
with P. A. Papp, A. N. Yzelman
[arXiv]
SOFSEM 2025 (Best Paper)

Efficient Multi-Processor Scheduling in Increasingly Realistic Models
with P. A. Papp, A. Karanasiou, A. N. Yzelman
[arXiv]
SPAA 2024

Partitioning Hypergraphs is Hard: Models, Inapproximability, and Applications
with P. A. Papp, A. N. Yzelman
[arXiv]
SPAA 2023

Techniques for Designing Approximation Algorithms for Fair Clustering Problems
[ETH Research Collection]
Doctoral Thesis, 2023

A Simple Combinatorial Algorithm for Robust Matroid Center
with L. Vargas Koch, R. Zenklusen
[arXiv]
SOSA 2023

Techniques for Generalized Colorful k-Center Problems
with L. Vargas Koch, R. Zenklusen
[arXiv]
ESA 2022

Simpler and Stronger Approaches for Non-Uniform Hypergraph Matching and the Füredi, Kahn, and Seymour Conjecture
with H. Angelidakis, R. Zenklusen
[arXiv] [conference presentation]
SOSA 2021

A Technique for Obtaining True Approximations for k-Center with Covering Constraints
with H. Angelidakis, A. Kurpisz, R. Zenklusen
[arXiv (journal version)] [conference presentation] [poster]
IPCO 2020 (conference), Mathematical Programming 2022 (journal)