Barun Gorain

J. Parallel Distributed Comput., 2024

Forest Covers and Bounded Forest Covers.

[BibT_eX]

[DOI]

CoRR, 2024

Efficient D-2-D with a Strong Group: Arbitrary Initial Configuration and No Global Knowledge.

[BibT_eX]

[DOI]

Tanvir Kaur

CoRR, 2024

Optimal Dispersion of Silent Robots in a Ring.

[BibT_eX]

[DOI]

Bibhuti Das

Krishnendu Mukhopadhyaya

CoRR, 2024

Brief Announcement: Pebble Guided Rendezvous Despite Fault.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 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

Four shades of deterministic leader election in anonymous networks.

[BibT_eX]

[DOI]

Avery Miller

Distributed Comput., December, 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

Sweep Coverage with Faults.

[BibT_eX]

[DOI]

Amit Kumar Dhar

Madhuri Mahawar

Proceedings of the 5th International Conference on Recent Advances in Information Technology, 2023

Pebble Guided Treasure Hunt in Plane.

[BibT_eX]

[DOI]

Adri Bhattacharya

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

Graph Covering Using Bounded Size Subgraphs.

[BibT_eX]

[DOI]

Shaswati Patra

Rishi Ranjan Singh

Proceedings of the Algorithms and Discrete Applied Mathematics, 2023

2022

Pebble guided optimal treasure hunt in anonymous graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 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

Treasure Hunt in Graph Using Pebbles.

[BibT_eX]

[DOI]

Adri Bhattacharya

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

Constant-Length Labeling Schemes for Deterministic Radio Broadcast.

[BibT_eX]

[DOI]

ACM Trans. Parallel Comput., 2021

Finding the size and the diameter of a radio network using short labels.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Short labeling schemes for topology recognition in wireless tree networks.

[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

2019

Deterministic Graph Exploration with Advice.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2019

Approximation Algorithms for Barrier Sweep Coverage.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2019

Edge Exploration of a Graph by Mobile Agent.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2019

2018

Finding the Size of a Radio Network with Short Labels.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Distributed Computing and Networking, 2018

2017

Generalized Bounded Tree Cover of a Graph.

[BibT_eX]

[DOI]

Krishnendu Mukhopadhyaya

J. Graph Algorithms Appl., 2017

Solving energy issues for sweep coverage in wireless sensor networks.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Leader Election in Trees with Customized Advice.

[BibT_eX]

[DOI]

CoRR, 2017

2016

Approximation Algorithms for Generalized Bounded Tree Cover.

[BibT_eX]

[DOI]

Krishnendu Mukhopadhyaya

Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

2015

Approximation algorithm for sweep coverage on graph.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

Energy Efficient Sweep Coverage with Mobile and Static Sensors.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2015

2014

Approximation algorithms for sweep coverage in wireless sensor networks.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2014

Line sweep coverage in wireless sensor networks.

[BibT_eX]

[DOI]

Proceedings of the Sixth International Conference on Communication Systems and Networks, 2014

2013

Point and area sweep coverage in wireless sensor networks.

[BibT_eX]

[DOI]

Proceedings of the 11th International Symposium and Workshops on Modeling and Optimization in Mobile, 2013

POSTER: Approximation Algorithm for Minimizing the Size of Coverage Hole in Wireless Sensor Networks.

[BibT_eX]

[DOI]

Sandip Das

Proceedings of the Distributed Computing and Networking, 14th International Conference, 2013

2012

Optimal Covering with Mobile Sensors in an Unbounded Region

[BibT_eX]

[DOI]