Barun Gorain

Orcid: 0000-0003-2296-3222

According to our database1, Barun Gorain authored at least 32 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Distance-2-Dispersion with Termination by a Strong Team.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2024

2023
Four shades of deterministic leader election in anonymous networks.
Distributed Comput., December, 2023

Burning and w-burning of geometric graphs.
Discret. Appl. Math., September, 2023

Edge exploration of anonymous graph by mobile agent with external help.
Computing, February, 2023

Sweep Coverage with Faults.
Proceedings of the 5th International Conference on Recent Advances in Information Technology, 2023

Pebble Guided Treasure Hunt in Plane.
Proceedings of the Networked Systems - 11th International Conference, 2023

Graph Covering Using Bounded Size Subgraphs.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2023

2022
Pebble guided optimal treasure hunt in anonymous graphs.
Theor. Comput. Sci., 2022

Distributed Connected Dominating Sets in Unit Square and Disk Graphs.
Proceedings of the Theory and Applications of Models of Computation, 2022

Collaborative Dispersion by Silent Robots.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2022

Treasure Hunt in Graph Using Pebbles.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2022

Distributed Dominating Sets in Interval Graphs.
Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

2021
Constant-Length Labeling Schemes for Deterministic Radio Broadcast.
ACM Trans. Parallel Comput., 2021

Finding the size and the diameter of a radio network using short labels.
Theor. Comput. Sci., 2021

Short labeling schemes for topology recognition in wireless tree networks.
Theor. Comput. Sci., 2021

Distributed Independent Sets in Interval and Segment Intersection Graphs.
Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021

Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs.
Proceedings of the Structural Information and Communication Complexity, 2021

2019
Deterministic Graph Exploration with Advice.
ACM Trans. Algorithms, 2019

Approximation Algorithms for Barrier Sweep Coverage.
Int. J. Found. Comput. Sci., 2019

Edge Exploration of a Graph by Mobile Agent.
Proceedings of the Combinatorial Optimization and Applications, 2019

2018
Finding the Size of a Radio Network with Short Labels.
Proceedings of the 19th International Conference on Distributed Computing and Networking, 2018

2017
Generalized Bounded Tree Cover of a Graph.
J. Graph Algorithms Appl., 2017

Solving energy issues for sweep coverage in wireless sensor networks.
Discret. Appl. Math., 2017

Leader Election in Trees with Customized Advice.
CoRR, 2017

2016
Approximation Algorithms for Generalized Bounded Tree Cover.
Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

2015
Approximation algorithm for sweep coverage on graph.
Inf. Process. Lett., 2015

Energy Efficient Sweep Coverage with Mobile and Static Sensors.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2015

2014
Approximation algorithms for sweep coverage in wireless sensor networks.
J. Parallel Distributed Comput., 2014

Line sweep coverage in wireless sensor networks.
Proceedings of the Sixth International Conference on Communication Systems and Networks, 2014

2013
Point and area sweep coverage in wireless sensor networks.
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.
Proceedings of the Distributed Computing and Networking, 14th International Conference, 2013

2012
Optimal Covering with Mobile Sensors in an Unbounded Region
CoRR, 2012


  Loading...