A Technique for Obtaining True Approximations for k-Center with Covering Constraints G Anegg, H Angelidakis, A Kurpisz, R Zenklusen International conference on integer programming and combinatorial …, 2020 | 51 | 2020 |
Partitioning hypergraphs is hard: Models, inapproximability, and applications PA Papp, G Anegg, AJN Yzelman Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and …, 2023 | 6 | 2023 |
Techniques for Generalized Colorful -Center Problems G Anegg, LV Koch, R Zenklusen arXiv preprint arXiv:2207.02609, 2022 | 6 | 2022 |
DAG Scheduling in the BSP Model PA Papp, G Anegg, AN Yzelman arXiv preprint arXiv:2303.05989, 2023 | 4 | 2023 |
Simpler and Stronger Approaches for Non-Uniform Hypergraph Matching and the Füredi, Kahn, and Seymour Conjecture∗ G Anegg, H Angelidakis, R Zenklusen Symposium on Simplicity in Algorithms (SOSA), 196-203, 2021 | 4 | 2021 |
A Simple Combinatorial Algorithm for Robust Matroid Center G Anegg, LV Koch, R Zenklusen Symposium on Simplicity in Algorithms (SOSA), 96-102, 2023 | 1 | 2023 |
Efficient Multi-Processor Scheduling in Increasingly Realistic Models PA Papp, G Anegg, A Karanasiou, AN Yzelman arXiv preprint arXiv:2404.15246, 2024 | | 2024 |
Efficient Multi-Processor Scheduling in Increasingly Realistic Models P András Papp, G Anegg, A Karanasiou, AN Yzelman arXiv e-prints, arXiv: 2404.15246, 2024 | | 2024 |
DAG Scheduling in the BSP Model P András Papp, G Anegg, AN Yzelman arXiv e-prints, arXiv: 2303.05989, 2023 | | 2023 |
Techniques for Designing Approximation Algorithms for Fair Clustering Problems G Anegg ETH Zurich, 2023 | | 2023 |