Kaushik Mondal

Proceedings of the 25th International Conference on Distributed Computing and Networking, 2024

Distance-2-Dispersion with Termination by a Strong Team.

[BibT_eX]

[DOI]

Tanvir Kaur

Proceedings of the Algorithms and Discrete Applied Mathematics, 2024

2023

Burning and w-burning of geometric graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., September, 2023

Edge exploration of anonymous graph by mobile agent with external help.

[BibT_eX]

[DOI]

Computing, February, 2023

Distance-2-Dispersion: Dispersion with Further Constraints.

[BibT_eX]

[DOI]

Tanvir Kaur

Proceedings of the Networked Systems - 11th International Conference, 2023

Fast Deterministic Gathering with Detection on Arbitrary Graphs: The Power of Many Robots.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Parallel and Distributed Processing Symposium, 2023

2022

Push-Down Trees: Optimal Self-Adjusting Complete Trees.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2022

Demand-Aware Network Design With Minimal Congestion and Route Lengths.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2022

Pebble guided optimal treasure hunt in anonymous graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Area Convergence of Monoculus Robots With Additional Capabilities.

[BibT_eX]

[DOI]

Comput. J., 2022

Distributed Connected Dominating Sets in Unit Square and Disk Graphs.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2022

Collaborative Dispersion by Silent Robots.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2022

Distributed Dominating Sets in Interval Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

2021

Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Distributed Independent Sets in Interval and Segment Intersection Graphs.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021

Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2021

Byzantine Dispersion on Graphs.

[BibT_eX]

[DOI]

Proceedings of the 35th IEEE International Parallel and Distributed Processing Symposium, 2021

Burning Grids and Intervals.

[BibT_eX]

[DOI]

Arya Tanmay Gupta

Swapnil A. Lokhande

Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

2020

Demand-aware network designs of bounded degree.

[BibT_eX]

[DOI]

Distributed Comput., 2020

Efficient Dispersion on an Anonymous Ring in the Presence of Byzantine Robots.

[BibT_eX]

[DOI]

CoRR, 2020

NP-completeness Results for Graph Burning on Geometric Graphs.

[BibT_eX]

[DOI]

Arya Tanmay Gupta

Swapnil A. Lokhande

CoRR, 2020

Dynamically Optimal Self-adjusting Single-Source Tree Networks.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

Efficient Dispersion on an Anonymous Ring in the Presence of Weak Byzantine Robots.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2020

2019

Gathering of mobile robots with weak multiplicity detection in presence of crash-faults.

[BibT_eX]

[DOI]

H. Ramesh

J. Parallel Distributed Comput., 2019

Edge Exploration of a Graph by Mobile Agent.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2019

2018

A robust deterministic approach to node localisation using NLOS signal.

[BibT_eX]

[DOI]

Int. J. Commun. Networks Distributed Syst., 2018

2017

Range-Free Mobile Sensor Localization and a Novel Obstacle Detection Technique.

[BibT_eX]

[DOI]

Wirel. Pers. Commun., 2017

Convergence of Even Simpler Robots without Position Information.

[BibT_eX]

[DOI]

Proceedings of the Networked Systems - 5th International Conference, 2017

Fault-Tolerant Gathering of Mobile Robots with Weak Multiplicity Detection.

[BibT_eX]

[DOI]

H. Ramesh

Proceedings of the 18th International Conference on Distributed Computing and Networking, 2017

2016

Path planning algorithms for mobile anchors towards range-free localization.

[BibT_eX]

[DOI]

Arindam Karmakar

J. Parallel Distributed Comput., 2016

Convergence of Even Simpler Robots without Location Information.

[BibT_eX]

[DOI]

CoRR, 2016

2015

Analysis of Multiple-Bound Signals Towards Localization: A Theoretical Approach.

[BibT_eX]

[DOI]

Wirel. Pers. Commun., 2015

Path Planning Algorithm for Mobile Anchor in Connected Sensor Networks.

[BibT_eX]

[DOI]

Arindam Karmakar

Proceedings of the Distributed Computing and Internet Technology, 2015

2014

Designing Path Planning Algorithms for Mobile Anchor towards Range-Free Localization.

[BibT_eX]

[DOI]

Arindam Karmakar

CoRR, 2014

2013

Range-Free Mobile Node Localization Using Static Anchor.

[BibT_eX]

[DOI]

Proceedings of the Wireless Algorithms, Systems, and Applications, 2013

Localization Based on Two-Bound Reflected Signals in Wireless Sensor Networks.

[BibT_eX]

[DOI]

Arjun Talwar

Proceedings of the Distributed Computing and Internet Technology, 2013

2012

Localization in Presence of Multipath Effect in Wireless Sensor Networks.

[BibT_eX]

[DOI]