Optimal Covering with Mobile Sensors in an Unbounded Region - Barun Gorain; Partha Sarathi Mandal 001 (CoRR, 2012)

POSTER: Approximation Algorithm for Minimizing the Size of Coverage Hole in Wireless Sensor Networks. - Barun Gorain; Partha Sarathi Mandal 001; Sandip Das 001 (ICDCN, 2013)

Point and area sweep coverage in wireless sensor networks. - Barun Gorain; Partha Sarathi Mandal 001 (WiOpt, 2013)

Line sweep coverage in wireless sensor networks. - Barun Gorain; Partha Sarathi Mandal 001 (COMSNETS, 2014)

Approximation algorithms for sweep coverage in wireless sensor networks. - Barun Gorain; Partha Sarathi Mandal 001 (J. Parallel Distributed Comput., 2014)

Energy Efficient Sweep Coverage with Mobile and Static Sensors. - Barun Gorain; Partha Sarathi Mandal 001 (CALDAM, 2015)

Approximation algorithm for sweep coverage on graph. - Barun Gorain; Partha Sarathi Mandal 001 (Inf. Process. Lett., 2015)

Approximation Algorithms for Generalized Bounded Tree Cover. - Barun Gorain; Partha Sarathi Mandal 001; Krishnendu Mukhopadhyaya (WALCOM, 2016)

Leader Election in Trees with Customized Advice. - Barun Gorain; Andrzej Pelc (CoRR, 2017)

Solving energy issues for sweep coverage in wireless sensor networks. - Barun Gorain; Partha Sarathi Mandal 001 (Discret. Appl. Math., 2017)

Generalized Bounded Tree Cover of a Graph. - Barun Gorain; Partha Sarathi Mandal 001; Krishnendu Mukhopadhyaya (J. Graph Algorithms Appl., 2017)

Finding the Size of a Radio Network with Short Labels. - Barun Gorain; Andrzej Pelc (ICDCN, 2018)

Edge Exploration of a Graph by Mobile Agent. - Amit Kumar Dhar; Barun Gorain; Kaushik Mondal 001; Shaswati Patra; Rishi Ranjan Singh (COCOA, 2019)

Approximation Algorithms for Barrier Sweep Coverage. - Barun Gorain; Partha Sarathi Mandal 001 (Int. J. Found. Comput. Sci., 2019)

Deterministic Graph Exploration with Advice. - Barun Gorain; Andrzej Pelc (ACM Trans. Algorithms, 2019)

Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs. - Barun Gorain; Kaushik Mondal 001; Himadri Nayak; Supantha Pandit (SIROCCO, 2021)

Distributed Independent Sets in Interval and Segment Intersection Graphs. - Barun Gorain; Kaushik Mondal 001; Supantha Pandit (SOFSEM, 2021)

Short labeling schemes for topology recognition in wireless tree networks. - Barun Gorain; Andrzej Pelc (Theor. Comput. Sci., 2021)

Finding the size and the diameter of a radio network using short labels. - Barun Gorain; Andrzej Pelc (Theor. Comput. Sci., 2021)

Constant-Length Labeling Schemes for Deterministic Radio Broadcast. - Faith Ellen; Barun Gorain; Avery Miller; Andrzej Pelc (ACM Trans. Parallel Comput., 2021)

Distributed Dominating Sets in Interval Graphs. - Barun Gorain; Kaushik Mondal 001; Supantha Pandit (COCOON, 2022)

Treasure Hunt in Graph Using Pebbles. - Adri Bhattacharya; Barun Gorain; Partha Sarathi Mandal 001 (SSS, 2022)

Distributed Connected Dominating Sets in Unit Square and Disk Graphs. - Barun Gorain; Kaushik Mondal 001; Supantha Pandit (TAMC, 2022)

Pebble guided optimal treasure hunt in anonymous graphs. - Barun Gorain; Kaushik Mondal 001; Himadri Nayak; Supantha Pandit (Theor. Comput. Sci., 2022)

Graph Covering Using Bounded Size Subgraphs. - Barun Gorain; Shaswati Patra; Rishi Ranjan Singh (CALDAM, 2023)

Pebble Guided Treasure Hunt in Plane. - Adri Bhattacharya; Barun Gorain; Partha Sarathi Mandal 001 (NETYS, 2023)

Sweep Coverage with Faults. - Amit Kumar Dhar; Barun Gorain; Madhuri Mahawar (RAIT, 2023)

Edge exploration of anonymous graph by mobile agent with external help. - Amit Kumar Dhar; Barun Gorain; Kaushik Mondal 001; Shaswati Patra; Rishi Ranjan Singh (Computing, 2023)

Burning and w-burning of geometric graphs. - Barun Gorain; Arya Tanmay Gupta; Swapnil A. Lokhande; Kaushik Mondal 001; Supantha Pandit (Discret. Appl. Math., 2023)

Four shades of deterministic leader election in anonymous networks. - Barun Gorain; Avery Miller; Andrzej Pelc (Distributed Comput., 2023)

Distance-2-Dispersion with Termination by a Strong Team. - Barun Gorain; Tanvir Kaur; Kaushik Mondal 001 (CALDAM, 2024)

Brief Announcement: Pebble Guided Rendezvous Despite Fault. - Ashish Saxena; Barun Gorain; Subhrangsu Mandal; Kaushik Mondal 001 (SSS, 2024)

Optimal Dispersion of Silent Robots in a Ring. - Bibhuti Das 001; Barun Gorain; Kaushik Mondal 001; Krishnendu Mukhopadhyaya; Supantha Pandit (CoRR, 2024)

Efficient D-2-D with a Strong Group: Arbitrary Initial Configuration and No Global Knowledge. - Tanvir Kaur; Barun Gorain; Kaushik Mondal 001 (CoRR, 2024)

Collaborative dispersion by silent robots. - Barun Gorain; Partha Sarathi Mandal 001; Kaushik Mondal 001; Supantha Pandit (J. Parallel Distributed Comput., 2024)

Collision-free Exploration by Mobile Agents Using Pebbles. - Sajal K. Das 001; Amit Kumar Dhar; Barun Gorain; Madhuri Mahawar (ICDCN, 2025)

Forest Covers and Bounded Forest Covers. - Daya Ram Gaur; Barun Gorain; Shaswati Patra; Rishi Ranjan Singh (SOFSEM (1), 2025)

Distributed Independent Sets in Interval and Segment Intersection Graphs. - Nirmala Bhatt; Barun Gorain; Kaushik Mondal 001; Supantha Pandit (Int. J. Found. Comput. Sci., 2025)