default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBarun Gorain
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Barun Gorain, Partha Sarathi Mandal
, Kaushik Mondal, Supantha Pandit:
Collaborative dispersion by silent robots. J. Parallel Distributed Comput. 188: 104852 (2024)- [c22]Barun Gorain, Tanvir Kaur, Kaushik Mondal:
Distance-2-Dispersion with Termination by a Strong Team. CALDAM 2024: 44-58 - [c21]Ashish Saxena, Barun Gorain, Subhrangsu Mandal, Kaushik Mondal:
Brief Announcement: Pebble Guided Rendezvous Despite Fault. SSS 2024: 121-125 - [i13]Bibhuti Das, Barun Gorain, Kaushik Mondal, Krishnendu Mukhopadhyaya, Supantha Pandit:
Optimal Dispersion of Silent Robots in a Ring. CoRR abs/2408.05491 (2024) - 2023
- [j13]Amit Kumar Dhar, Barun Gorain, Kaushik Mondal, Shaswati Patra, Rishi Ranjan Singh:
Edge exploration of anonymous graph by mobile agent with external help. Computing 105(2): 483-506 (2023) - [j12]Barun Gorain, Arya Tanmay Gupta, Swapnil A. Lokhande, Kaushik Mondal, Supantha Pandit:
Burning and w-burning of geometric graphs. Discret. Appl. Math. 336: 83-98 (2023) - [j11]Barun Gorain, Avery Miller, Andrzej Pelc:
Four shades of deterministic leader election in anonymous networks. Distributed Comput. 36(4): 419-449 (2023) - [c20]Barun Gorain, Shaswati Patra, Rishi Ranjan Singh:
Graph Covering Using Bounded Size Subgraphs. CALDAM 2023: 415-426 - [c19]Adri Bhattacharya, Barun Gorain, Partha Sarathi Mandal:
Pebble Guided Treasure Hunt in Plane. NETYS 2023: 141-156 - [c18]Amit Kumar Dhar, Barun Gorain, Madhuri Mahawar:
Sweep Coverage with Faults. RAIT 2023: 1-6 - [i12]Adri Bhattacharya, Barun Gorain, Partha Sarathi Mandal:
Pebble guided Treasure Hunt in Plane. CoRR abs/2305.06067 (2023) - 2022
- [j10]Barun Gorain, Kaushik Mondal, Himadri Nayak, Supantha Pandit:
Pebble guided optimal treasure hunt in anonymous graphs. Theor. Comput. Sci. 922: 61-80 (2022) - [c17]Barun Gorain, Kaushik Mondal, Supantha Pandit:
Distributed Dominating Sets in Interval Graphs. COCOON 2022: 508-520 - [c16]Adri Bhattacharya, Barun Gorain, Partha Sarathi Mandal:
Treasure Hunt in Graph Using Pebbles. SSS 2022: 99-113 - [c15]Barun Gorain, Partha Sarathi Mandal, Kaushik Mondal, Supantha Pandit:
Collaborative Dispersion by Silent Robots. SSS 2022: 254-269 - [c14]Barun Gorain, Kaushik Mondal, Supantha Pandit:
Distributed Connected Dominating Sets in Unit Square and Disk Graphs. TAMC 2022: 346-358 - [i11]Barun Gorain, Partha Sarathi Mandal, Kaushik Mondal, Supantha Pandit:
Collaborative Dispersion by Silent Robots. CoRR abs/2202.05710 (2022) - [i10]Adri Bhattacharya, Barun Gorain, Partha Sarathi Mandal:
Treasure Hunt in Graph using Pebbles. CoRR abs/2209.00857 (2022) - 2021
- [j9]Barun Gorain, Andrzej Pelc:
Short labeling schemes for topology recognition in wireless tree networks. Theor. Comput. Sci. 861: 23-44 (2021) - [j8]Barun Gorain, Andrzej Pelc:
Finding the size and the diameter of a radio network using short labels. Theor. Comput. Sci. 864: 20-33 (2021) - [j7]Faith Ellen, Barun Gorain, Avery Miller, Andrzej Pelc:
Constant-Length Labeling Schemes for Deterministic Radio Broadcast. ACM Trans. Parallel Comput. 8(3): 14:1-14:17 (2021) - [c13]Barun Gorain, Kaushik Mondal, Himadri Nayak, Supantha Pandit:
Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs. SIROCCO 2021: 222-239 - [c12]Barun Gorain, Kaushik Mondal, Supantha Pandit:
Distributed Independent Sets in Interval and Segment Intersection Graphs. SOFSEM 2021: 175-188 - [c11]Barun Gorain, Avery Miller, Andrzej Pelc:
Four Shades of Deterministic Leader Election in Anonymous Networks. SPAA 2021: 265-274 - [i9]Barun Gorain, Kaushik Mondal, Himadri Nayak, Supantha Pandit:
Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs. CoRR abs/2103.05933 (2021) - 2020
- [i8]Barun Gorain, Avery Miller, Andrzej Pelc:
Four Shades of Deterministic Leader Election in Anonymous Networks. CoRR abs/2009.06149 (2020)
2010 – 2019
- 2019
- [j6]Barun Gorain, Partha Sarathi Mandal:
Approximation Algorithms for Barrier Sweep Coverage. Int. J. Found. Comput. Sci. 30(3): 425-448 (2019) - [j5]Barun Gorain, Andrzej Pelc:
Deterministic Graph Exploration with Advice. ACM Trans. Algorithms 15(1): 8:1-8:17 (2019) - [c10]Amit Kumar Dhar, Barun Gorain, Kaushik Mondal, Shaswati Patra, Rishi Ranjan Singh:
Edge Exploration of a Graph by Mobile Agent. COCOA 2019: 142-154 - [c9]Faith Ellen, Barun Gorain, Avery Miller, Andrzej Pelc:
Constant-Length Labeling Schemes for Deterministic Radio Broadcast. SPAA 2019: 171-178 - 2018
- [c8]Barun Gorain, Andrzej Pelc:
Finding the Size of a Radio Network with Short Labels. ICDCN 2018: 10:1-10:10 - 2017
- [j4]Barun Gorain, Partha Sarathi Mandal:
Solving energy issues for sweep coverage in wireless sensor networks. Discret. Appl. Math. 228: 130-139 (2017) - [j3]Barun Gorain, Partha Sarathi Mandal, Krishnendu Mukhopadhyaya:
Generalized Bounded Tree Cover of a Graph. J. Graph Algorithms Appl. 21(3): 265-280 (2017) - [c7]Barun Gorain, Andrzej Pelc:
Deterministic Graph Exploration with Advice. ICALP 2017: 132:1-132:14 - [c6]Barun Gorain, Andrzej Pelc:
Short Labeling Schemes for Topology Recognition in Wireless Tree Networks. SIROCCO 2017: 37-52 - [i7]Barun Gorain, Andrzej Pelc:
Leader Election in Trees with Customized Advice. CoRR abs/1702.03534 (2017) - [i6]Barun Gorain, Andrzej Pelc:
Short Labeling Schemes for Topology Recognition in Wireless Tree Networks. CoRR abs/1704.01927 (2017) - [i5]Barun Gorain, Partha Sarathi Mandal:
Approximation Algorithms for Barrier Sweep Coverage. CoRR abs/1704.02436 (2017) - [i4]Barun Gorain, Andrzej Pelc:
Finding the Size of a Radio Network with Short Labels. CoRR abs/1704.08713 (2017) - [i3]Faith Ellen, Barun Gorain, Avery Miller, Andrzej Pelc:
Constant-Length Labeling Schemes for Deterministic Radio Broadcast. CoRR abs/1710.03178 (2017) - 2016
- [c5]Barun Gorain, Partha Sarathi Mandal, Krishnendu Mukhopadhyaya:
Approximation Algorithms for Generalized Bounded Tree Cover. WALCOM 2016: 263-273 - [i2]Barun Gorain, Andrzej Pelc:
Deterministic Graph Exploration with Advice. CoRR abs/1607.01657 (2016) - 2015
- [j2]Barun Gorain, Partha Sarathi Mandal:
Approximation algorithm for sweep coverage on graph. Inf. Process. Lett. 115(9): 712-718 (2015) - [c4]Barun Gorain, Partha Sarathi Mandal:
Energy Efficient Sweep Coverage with Mobile and Static Sensors. CALDAM 2015: 275-285 - 2014
- [j1]Barun Gorain, Partha Sarathi Mandal:
Approximation algorithms for sweep coverage in wireless sensor networks. J. Parallel Distributed Comput. 74(8): 2699-2707 (2014) - [c3]Barun Gorain, Partha Sarathi Mandal:
Line sweep coverage in wireless sensor networks. COMSNETS 2014: 1-6 - 2013
- [c2]Barun Gorain, Partha Sarathi Mandal, Sandip Das:
POSTER: Approximation Algorithm for Minimizing the Size of Coverage Hole in Wireless Sensor Networks. ICDCN 2013: 463-464 - [c1]Barun Gorain, Partha Sarathi Mandal:
Point and area sweep coverage in wireless sensor networks. WiOpt 2013: 140-145 - 2012
- [i1]Barun Gorain, Partha Sarathi Mandal:
Optimal Covering with Mobile Sensors in an Unbounded Region. CoRR abs/1211.0157 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-31 20:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
