Author of the publication

Brief Announcement: Deterministic Lower Bound for Dynamic Balanced Graph Partitioning.

, , and . PODC, page 461-463. ACM, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Locality in Online Algorithms., , , , , and . CoRR, (2021)On Polynomial-Time Congestion-Free Software-Defined Network Updates., , , , and . Networking, page 1-9. IEEE, (2019)Brief Announcement: Temporal Locality in Online Algorithms., , , , , and . DISC, volume 246 of LIPIcs, page 52:1-52:3. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Optimal Online Balanced Graph Partitioning., , and . INFOCOM, page 1-9. IEEE, (2021)Waypoint Routing in Special Networks., , , , and . Networking, page 496-504. IFIP, (2018)Traffic engineering with joint link weight and segment optimization., , , , and . CoNEXT, page 313-327. ACM, (2021)Maximally Resilient Replacement Paths for a Family of Product Graphs., , , and . OPODIS, volume 184 of LIPIcs, page 26:1-26:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Competitive clustering of stochastic communication patterns on a ring., , , and . Computing, 101 (9): 1369-1390 (2019)Brief Announcement: Deterministic Lower Bound for Dynamic Balanced Graph Partitioning., , and . PODC, page 461-463. ACM, (2020)Local Fast Segment Rerouting on Hypercubes., , , and . OPODIS, volume 125 of LIPIcs, page 13:1-13:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)