Brief Announcement: Local Deal-Agreement Based Monotonic Distributed Algorithms for Load Balancing in General Graphs. - Yefim Dinitz; Shlomi Dolev; Manish Kumar 011 (SSS, 2020)

Local Deal-Agreement Based Monotonic Distributed Algorithms for Load Balancing in General Graphs. - Yefim Dinitz; Shlomi Dolev; Manish Kumar 011 (CoRR, 2020)

Polynomial Time k-Shortest Multi-criteria Prioritized and All-Criteria-Disjoint Paths - (Extended Abstract). - Yefim Dinitz; Shlomi Dolev; Manish Kumar 011 (CSCML, 2021)

Polynomial Time Prioritized Multi-Criteria k-Shortest Paths and k-Disjoint All-Criteria-Shortest Paths. - Yefim Dinitz; Shlomi Dolev; Manish Kumar 011 (CoRR, 2021)

Randomness for Randomness Testing. - Daniel Berend; Shlomi Dolev; Manish Kumar 011 (CSCML, 2022)

Brief Announcement: Distributed Reconfiguration of Spanning Trees. - Siddharth Gupta 002; Manish Kumar 011; Shreyas Pai (SSS, 2022)

Distributed Reconfiguration of Spanning Trees. - Siddharth Gupta 002; Manish Kumar 011; Shreyas Pai (CoRR, 2022)

Partially Disjoint k Shortest Paths. - Yefim Dinitz; Shlomi Dolev; Manish Kumar 011; Baruch Schieber (CoRR, 2022)

Shape Formation and Locomotion with Joint Movements in the Amoebot Model. - Andreas Padalkin; Manish Kumar 011; Christian Scheideler (CoRR, 2023)

Local Deal-Agreement Algorithms for Load Balancing in Dynamic General Graphs. - Yefim Dinitz; Shlomi Dolev; Manish Kumar 011 (Theory Comput. Syst., 2023)

Partially Disjoint Shortest Paths and Near-Shortest Paths Trees. - Yefim Dinitz; Shlomi Dolev; Manish Kumar 011; Baruch Schieber (SSS, 2024)

Reconfiguring Shortest Paths in Graphs. - Kshitij Gajjar; Agastya Vibhuti Jha; Manish Kumar 011; Abhiruk Lahiri (Algorithmica, 2024)

Reconfiguration and locomotion with joint movements in the amoebot model. - Andreas Padalkin; Manish Kumar 011; Christian Scheideler (Auton. Robots, 2025)