Georg Anegg

Publication Activity (10 Years)

Years Active: 2020-2024
Publications (10 Years): 15

Top Topics

Constraint Programming

Computationally Inexpensive

Multi Processor

Top Venues

Publications

Pál András Papp, Georg Anegg, Aikaterini Karanasiou, Albert-Jan Nicholas Yzelman
Efficient Multi-Processor Scheduling in Increasingly Realistic Models. SPAA (2024)
Pál András Papp, Georg Anegg, Aikaterini Karanasiou, A. N. Yzelman
Efficient Multi-Processor Scheduling in Increasingly Realistic Models. CoRR (2024)
Pál András Papp, Georg Anegg, Aikaterini Karanasiou, Albert-Jan Nicholas Yzelman
Efficient Multi-Processor Scheduling in Increasingly Realistic Models (Brief Summary). IPDPS (Workshops) (2024)
Pál András Papp, Georg Anegg, A. N. Yzelman
DAG Scheduling in the BSP Model. CoRR (2023)
Pál András Papp, Georg Anegg, Albert-Jan Nicholas Yzelman
Partitioning Hypergraphs is Hard: Models, Inapproximability, and Applications. SPAA (2023)
Georg Anegg, Laura Vargas Koch, Rico Zenklusen
A Simple Combinatorial Algorithm for Robust Matroid Center. SOSA (2023)
Georg Anegg, Laura Vargas Koch, Rico Zenklusen
Techniques for Generalized Colorful k-Center Problems. CoRR (2022)
Georg Anegg, Laura Vargas Koch, Rico Zenklusen
A Simple Combinatorial Algorithm for Robust Matroid Center. CoRR (2022)
Georg Anegg, Laura Vargas Koch, Rico Zenklusen
Techniques for Generalized Colorful k-Center Problems. ESA (2022)
Pál András Papp, Georg Anegg, A. N. Yzelman
Partitioning Hypergraphs is Hard: Models, Inapproximability, and Applications. CoRR (2022)
Georg Anegg, Haris Angelidakis, Adam Kurpisz, Rico Zenklusen
A technique for obtaining true approximations for k-center with covering constraints. Math. Program. 192 (1) (2022)
Georg Anegg, Haris Angelidakis, Rico Zenklusen
Simpler and Stronger Approaches for Non-Uniform Hypergraph Matching and the Füredi, Kahn, and Seymour Conjecture. SOSA (2021)
Georg Anegg, Haris Angelidakis, Rico Zenklusen
Simpler and Stronger Approaches for Non-Uniform Hypergraph Matching and the Füredi, Kahn, and Seymour Conjecture. CoRR (2020)
Georg Anegg, Haris Angelidakis, Adam Kurpisz, Rico Zenklusen
A Technique for Obtaining True Approximations for k-Center with Covering Constraints. CoRR (2020)
Georg Anegg, Haris Angelidakis, Adam Kurpisz, Rico Zenklusen
A Technique for Obtaining True Approximations for k-Center with Covering Constraints. IPCO (2020)