Georg Anegg

According to our database, Georg Anegg authored at least 8 papers between 2021 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2025

DAG Scheduling in the BSP Model.

Pál András Papp, Georg Anegg, Albert-Jan Yzelman

Proceedings of the SOFSEM 2025: Theory and Practice of Computer Science, 2025

2024

Efficient Multi-Processor Scheduling in Increasingly Realistic Models.

Pál András Papp, Georg Anegg, Aikaterini Karanasiou, Albert-Jan Nicholas Yzelman

Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024

Efficient Multi-Processor Scheduling in Increasingly Realistic Models (Brief Summary).

Pál András Papp, Georg Anegg, Aikaterini Karanasiou, Albert-Jan Nicholas Yzelman

Proceedings of the IEEE International Parallel and Distributed Processing Symposium, 2024

2023

Partitioning Hypergraphs is Hard: Models, Inapproximability, and Applications.

Pál András Papp, Georg Anegg, Albert-Jan Nicholas Yzelman

Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

A Simple Combinatorial Algorithm for Robust Matroid Center.

Georg Anegg, Laura Vargas Koch, Rico Zenklusen

Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

2022

A technique for obtaining true approximations for k-center with covering constraints.

Georg Anegg, Haris Angelidakis, Adam Kurpisz, Rico Zenklusen

Math. Program., 2022

Techniques for Generalized Colorful k-Center Problems.

Georg Anegg, Laura Vargas Koch, Rico Zenklusen

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

Simpler and Stronger Approaches for Non-Uniform Hypergraph Matching and the Füredi, Kahn, and Seymour Conjecture.

Georg Anegg, Haris Angelidakis, Rico Zenklusen

Proceedings of the 4th Symposium on Simplicity in Algorithms, 2021