Approximate Dynamic Balanced Graph Partitioning. - Harald Räcke; Stefan Schmid 001; Ruslan Zabrodin (SPAA, 2022)

Polylog-Competitive Algorithms for Dynamic Balanced Graph Partitioning for Ring Demands. - Harald Räcke; Stefan Schmid 001; Ruslan Zabrodin (SPAA, 2023)

Tight Bounds for Online Balanced Partitioning in the Generalized Learning Model. - Harald Räcke; Stefan Schmid 001; Ruslan Zabrodin (SPAA, 2025)