Georg Anegg

Publications

DAG Scheduling in the BSP Model
with P. A. Papp, A. N. Yzelman
[arXiv]
submitted


Partitioning Hypergraphs is Hard: Models, Inapproximability, and Applications
with P. A. Papp, A. N. Yzelman
[arXiv]
SPAA 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] [SOSA talk]
SOSA 2021


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