1 citations · 2 across the 5 of their papers we have counts for
6 papers
Reconfiguration and Locomotion with Joint Movements in the Amoebot Model
Andreas Padalkin, Manish Kumar, Christian Scheideler
We are considering the geometric amoebot model where a set of amoebots is placed on the triangular grid. An amoebot is able to send information to its neighbors, and to move vi…
Partially Disjoint k Shortest Paths
Yefim Dinitz, Shlomi Dolev, Manish Kumar +1
A solution of the shortest paths problem may output paths that are identical up to a single edge. On the other hand, a solution of the independent shortest paths problem co…
Distributed Reconfiguration of Spanning Trees
Siddharth Gupta, Manish Kumar, Shreyas Pai
In a reconfiguration problem, given a problem and two feasible solutions of the problem, the task is to find a sequence of transformations to reach from one solution to the other s…
Reconfiguring Shortest Paths in Graphs
Kshitij Gajjar, Agastya Vibhuti Jha, Manish Kumar +1
Reconfiguring two shortest paths in a graph means modifying one shortest path to the other by changing one vertex at a time so that all the intermediate paths are also shortest pat…
Polynomial Time -Shortest Multi-Criteria Prioritized and All-Criteria-Disjoint Paths
Yefim Dinitz, Shlomi Dolev, Manish Kumar
The shortest secure path (routing) problem in communication networks has to deal with multiple attack layers e.g., man-in-the-middle, eavesdropping, packet injection, packet insert…
Local Deal-Agreement Based Monotonic Distributed Algorithms for Load Balancing in General Graphs
Yefim Dinitz, Shlomi Dolev, Manish Kumar
In computer networks, participants may cooperate in processing tasks, so that loads are balanced among them. We present local distributed algorithms that (repeatedly) use local imb…