All Stories

  1. Tight Bounds for Online Balanced Partitioning in the Generalized Learning Model

    Article • July 2025, ACM (Association for Computing Machinery)

    Ruslan Zabrodin

  2. Polylog-Competitive Algorithms for Dynamic Balanced Graph Partitioning for Ring Demands

    Article • June 2023, ACM (Association for Computing Machinery)

    Ruslan Zabrodin, Stefan Schmid

  3. Approximate Dynamic Balanced Graph Partitioning

    Article • July 2022, ACM (Association for Computing Machinery)

    Ruslan Zabrodin