| Publication | Date of Publication | Type |
|---|
Optimal dispersion of silent robots in a ring
Theoretical Computer Science | 2026-09-14 | Paper |
Balanced dispersion on time-varying dynamic graphs
Journal of Computer and System Sciences | 2026-08-03 | Paper |
Pebble guided rendezvous despite fault
Theoretical Computer Science | 2026-07-13 | Paper |
Mobile agents on chordal graphs: maximum independent set and beyond
Theoretical Computer Science | 2025-11-01 | Paper |
Path connected dynamic graphs with a study of dispersion and exploration
Theoretical Computer Science | 2025-08-01 | Paper |
Distributed independent sets in interval and segment intersection graphs
International Journal of Foundations of Computer Science | 2025-02-05 | Paper |
A further study on weak Byzantine gathering of mobile agents
Theoretical Computer Science | 2024-12-02 | Paper |
| Distance-2-dispersion with termination by a strong team | 2024-05-31 | Paper |
Distributed dominating sets in interval graphs
Lecture Notes in Computer Science | 2023-08-10 | Paper |
Distributed connected dominating sets in unit square and disk graphs
Lecture Notes in Computer Science | 2023-08-04 | Paper |
Collaborative dispersion by silent robots
Lecture Notes in Computer Science | 2023-06-12 | Paper |
Burning and \(w\)-burning of geometric graphs
Discrete Applied Mathematics | 2023-06-05 | Paper |
Edge exploration of anonymous graph by mobile agent with external help
Computing | 2023-03-24 | Paper |
| Demand-aware network designs of bounded degree | 2023-02-03 | Paper |
| Dynamically optimal self-adjusting single-source tree networks | 2022-10-13 | Paper |
Pebble guided optimal treasure hunt in anonymous graphs
Theoretical Computer Science | 2022-06-13 | Paper |
Burning grids and intervals
(available as arXiv preprint) | 2022-03-24 | Paper |
| Distributed independent sets in interval and segment intersection graphs | 2022-03-24 | Paper |
Pebble guided near optimal treasure hunt in anonymous graphs
(available as arXiv preprint) | 2022-03-22 | Paper |
Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots
Theoretical Computer Science | 2021-09-27 | Paper |
Efficient dispersion on an anonymous ring in the presence of weak Byzantine robots
(available as arXiv preprint) | 2021-07-08 | Paper |
Demand-aware network designs of bounded degree
Distributed Computing | 2020-06-15 | Paper |
Demand-aware network designs of bounded degree
Distributed Computing | 2020-06-15 | Paper |
| Edge exploration of a graph by mobile agent | 2020-05-13 | Paper |
NP-Completeness Results for Graph Burning on Geometric Graphs
(available as arXiv preprint) | 2020-03-17 | Paper |
