Publication

Journal Publications


  1. Edge Exploration of Anonymous Graph By Mobile Agent with External Help, Amit K Dhar, Barun Gorain, Kaushik Mondal, Shaswati Patra, Rishi Ranjan Singh, Computing (Accepted).

  2. Pebble guided optimal treasure hunt in anonymous graphs, Barun Gorain, Kaushik Mondal, Himadri Nayak, Supantha Pandit, Theor. Comput. Sci. 922: 61-80 (2022)

  3. Short Labeling Schemes for Topology Recognition in Wireless Tree Networks , Barun Gorain, Andrzej Pelc, Theor. Comput. Sci. 861: 23-44 (2021) .

  4. Finding the Size and the Diameter of a Radio Network Using Short Labels, Barun Gorain, Andrzej Pelc, Theor. Comput. Sci. 864: 20-33 (2021) .

  5. Constant-Length Labeling Schemes for Deterministic Radio Broadcast Faith Ellen, Barun Gorain, Avery Miller, and Andrzej Pelc, ACM Transactions on Parallel Computing, (Accepted)

  6. Deterministic Graph Exploration with Advice, Barun Gorain and Andrzej Pelc, ACM Transactions on Algorithms (TALG) 15 (1), 8.

  7. Approximation Algorithms for Barrier Sweep Coverage, Barun Gorain and Partha Sarathi Mandal, International Journal of Foundations of Computer Science, 30(3): 425-448 (2019)

  8. Generalized Bounded Tree Cover of a Graph, Barun Gorain, Partha Sarathi Mandal and Krishnendu Mukhopadhyaya, Journal of Graph Algorithm and Application, 21(3): 265-280 (2017).

  9. Solving Energy Issues for Sweep Coverage in Wireless Sensor Networks, Barun Gorain and Partha Sarathi Mandal,, Discrete Applied Mathematics 228:130-139(2017)

  10. Approximation Algorithm for Sweep Coverage on Graph, Barun Gorain and Partha Sarathi Mandal, Information Processing Letters (Elsevier), Vol. 115, Issue 9, pp. 712-718, September 2015.

  11. Approximation Algorithms for Sweep Coverage in Wireless Sensor Networks , Barun Gorain and Partha Sarathi Mandal, Journal of Parallel and Distributed Computing (Elsevier), Vol. 74, Issue 8, pp. 2699-2707, August 2014.

Conference Publications


  1. Treasure Hunt in Graph Using Pebbles, Adri Bhattacharya, Barun Gorain, Partha Sarathi Mandal: SSS 2022: 99-113.

  2. Collaborative Dispersion by Silent Robots., Barun Gorain, Partha Sarathi Mandal, Kaushik Mondal, Supantha Pandit: SSS 2022: 254-269

  3. Four Shades of Deterministic Leader Election in Anonymous Networks

Barun Gorain, Avery Miller, Andrzej Pelc: ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2021), accepted.

  1. Pebble Guided Near Optimal Treasure Hunt on Anonymous Graph Barun Gorain, Kaushik Mondal, Himadri Nayak, Supantha Pandit, 28th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2021), Accepted.

  2. Distributed Independent Set In Interval and Segment Intersection Graphs Barun Gorain, Kaushik Mondal, Supantha Pandit, 47th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2021), 175-188.

  3. Edge Exploration of a Graph by Mobile agent. Amit Kumar Dhar, Barun Gorain, Kaushik Mondal, Shaswati Patra, and Rishi Ranjan Singh: COCOA 2019, 142-154.

  4. Constant-Length Labeling Schemes for Deterministic Radio Broadcast. Faith Ellen, Barun Gorain, Avery Miller, Andrzej Pelc: SPAA 2019: 171-178 (Received Best Paper Award)

  5. Finding the Size of a Radio Network with Short Labels Barun Gorain and Andrzej Pelc, in Proc. of 19th International Conference on Distributed Computing and Networking (ICDCN'18), 10:1-10:10.

  6. Short Labeling Schemes for Topology Recognition in Wireless Tree Networks Barun Gorain and Andrzej Pelc, International Colloquium on Structural Information and Communication Complexity (SIROCCO 2017), June 2017, Porquerolles, France.

  7. Deterministic Graph Exploration with Advice, Barun Gorain, Andrzej Pelc, International Colloquium on Automata, Languages and Programming, (ICALP 2017), University of Warsaw. July 10–14, 2017.

  8. Approximation Algorithms for Generalized Bounded Tree Cover Barun Gorain, Partha Sarathi Mandal and Krishnendu Mukhopadhyaya, in Proc. of 10th International Workshop on Algorithms and Computation (WALCOM 2016), Lecture Notes in Computer Science (LNCS-9627) Springer-Verlag), Kathmandu, Nepal, March 29-31, 2016.

  9. Energy Efficient Sweep Coverage with Mobile and Static Sensors Barun Gorain and Partha Sarathi Mandal, in Proc. of International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2015), Lecture Notes in Computer Science (LNCS-8959) (Springer-Verlag), IIT Kanpur, India, pp. 275-285, Feb 8-10, 2015.

  10. Brief Announcement: Sweep Coverage with Mobile and Static Sensors, Barun Gorain and Partha Sarathi Mandal in the Proc. of 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2014), Lecture Notes in Computer Science (LNCS-8756)(Springer-Verlag), Paderborn, Germany, pp. 346-348, Sep 28 - Oct 1, 2014.

  11. Line Sweep Coverage in Wireless Sensor Networks, Barun Gorain and Partha Sarathi Mandal, in Proc. 6th international conference on COMmunication System & NETworks (COMSNET'14), (IEEE Xplore), Bangalore, India, January 7-10, 2014.

  12. Point and Area Sweep Coverage in Wireless Sensor Networks, Barun Gorain and Partha Sarathi Mandal, in Proc. of 11th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'13), (IEEE Xplore), Tsukuba Science City, Japan, pp. 140-145, May 13-17, 2013.

  13. Poster Abstract: Approximation Algorithm for Minimizing the Size of a Coverage Hole in Wireless Sensor Networks, Barun Gorain, Partha Sarathi Mandal and Sandip Das, in Proc. of 14th International Conference on Distributed Computing and Networking (ICDCN'13), Lecture Notes in Computer Science , (LNCS-7730), (Springer-Verlag), TIFR, Mumbai, India, pp. 463-464, Jan 3-6,2013.

  14. Optimal Covering with Mobile Sensors in an Unbounded Region, Barun Gorain and Partha Sarathi Mandal, in Proc. of 8th International Conference on Wireless Communication and Sensor Networks (WCSN'12), Phitsanulok, Thailand, December 19-23, 2012.