Georg Anegg - RankMe

16 papers A 1B 3Journal 8Unranked 4

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