Manish Kumar

Orcid: 0000-0003-0620-3303

Affiliations:
  • Bar-Ilan University, Ramat Gan, Israel
  • Ben-Gurion University of the Negev, Israel (PhD 2022)


According to our database1, Manish Kumar authored at least 13 papers between 2020 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Reconfiguring Shortest Paths in Graphs.
Algorithmica, October, 2024

Partially Disjoint Shortest Paths and Near-Shortest Paths Trees.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2024

Reconfiguration and Locomotion with Joint Movements in the Amoebot Model.
Proceedings of the 3rd Symposium on Algorithmic Foundations of Dynamic Networks, 2024

2023
Local Deal-Agreement Algorithms for Load Balancing in Dynamic General Graphs.
Theory Comput. Syst., April, 2023

Shape Formation and Locomotion with Joint Movements in the Amoebot Model.
CoRR, 2023

2022
Partially Disjoint k Shortest Paths.
CoRR, 2022

Distributed Reconfiguration of Spanning Trees.
CoRR, 2022

Brief Announcement: Distributed Reconfiguration of Spanning Trees.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2022

Randomness for Randomness Testing.
Proceedings of the Cyber Security, Cryptology, and Machine Learning, 2022

2021
Polynomial Time Prioritized Multi-Criteria k-Shortest Paths and k-Disjoint All-Criteria-Shortest Paths.
CoRR, 2021

Polynomial Time k-Shortest Multi-criteria Prioritized and All-Criteria-Disjoint Paths - (Extended Abstract).
Proceedings of the Cyber Security Cryptography and Machine Learning, 2021

2020
Local Deal-Agreement Based Monotonic Distributed Algorithms for Load Balancing in General Graphs.
CoRR, 2020

Brief Announcement: Local Deal-Agreement Based Monotonic Distributed Algorithms for Load Balancing in General Graphs.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2020


  Loading...