1 citations · 1 across the 2 of their papers we have counts for
3 papers · 1 filter
Short Graph Sketches Suffice for Error-resilient Leader Verification in CONGEST
Pawel Garncarek, Tomasz Jurdziński, Dariusz Kowalski +1
Locally Checkable Proofs (LCPs) enable the verification of global graph properties using locally checkable certificates assigned by a prover. Recently, this framework was extended…
Asynchronous Gathering of Opaque Robots with Mobility Faults
Subhajit Pramanick, Saswata Jana, Partha Sarathi Mandal +1
We consider the fundamental benchmarking problem of gathering in an -fault system consisting of robots, of which at most might fail at any execution, under asynchron…
Time-optimal Asynchronous Minimal Vertex Covering by Myopic Robots
Saswata Jana, Subhajit Pramanick, Adri Bhattacharya +1
In a connected graph with an autonomous robot swarm with limited visibility, it is natural to ask whether the robots can be deployed to certain vertices satisfying a given property…