Simpler and Stronger Approaches for Non-Uniform Hypergraph Matching and the Füredi, Kahn, and Seymour Conjecture. - Georg Anegg; Haris Angelidakis; Rico Zenklusen (SOSA, 2021)

Techniques for Generalized Colorful k-Center Problems. - Georg Anegg; Laura Vargas Koch; Rico Zenklusen (ESA, 2022)

A technique for obtaining true approximations for k-center with covering constraints. - Georg Anegg; Haris Angelidakis; Adam Kurpisz; Rico Zenklusen (Math. Program., 2022)

A Simple Combinatorial Algorithm for Robust Matroid Center. - Georg Anegg; Laura Vargas Koch; Rico Zenklusen (SOSA, 2023)

Partitioning Hypergraphs is Hard: Models, Inapproximability, and Applications. - Pál András Papp; Georg Anegg; Albert-Jan Nicholas Yzelman (SPAA, 2023)

Efficient Multi-Processor Scheduling in Increasingly Realistic Models (Brief Summary). - Pál András Papp; Georg Anegg; Aikaterini Karanasiou; Albert-Jan Nicholas Yzelman (IPDPS (Workshops), 2024)

Efficient Multi-Processor Scheduling in Increasingly Realistic Models. - Pál András Papp; Georg Anegg; Aikaterini Karanasiou; Albert-Jan Nicholas Yzelman (SPAA, 2024)

DAG Scheduling in the BSP Model. - Pál András Papp; Georg Anegg; Albert-Jan Yzelman (SOFSEM (2), 2025)