default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 51 matches
- 2024
- Barun Gorain, Partha Sarathi Mandal, Kaushik Mondal, Supantha Pandit:
Collaborative dispersion by silent robots. J. Parallel Distributed Comput. 188: 104852 (2024) - Barun Gorain, Tanvir Kaur, Kaushik Mondal:
Distance-2-Dispersion with Termination by a Strong Team. CALDAM 2024: 44-58 - Ashish Saxena, Barun Gorain, Subhrangsu Mandal, Kaushik Mondal:
Brief Announcement: Pebble Guided Rendezvous Despite Fault. SSS 2024: 121-125 - Bibhuti Das, Barun Gorain, Kaushik Mondal, Krishnendu Mukhopadhyaya, Supantha Pandit:
Optimal Dispersion of Silent Robots in a Ring. CoRR abs/2408.05491 (2024) - Sajal K. Das, Amit Kumar Dhar, Barun Gorain, Madhuri Mahawar:
Collision-free Exploration by Mobile Agents Using Pebbles. CoRR abs/2410.17542 (2024) - Tanvir Kaur, Barun Gorain, Kaushik Mondal:
Efficient D-2-D with a Strong Group: Arbitrary Initial Configuration and No Global Knowledge. CoRR abs/2410.19468 (2024) - 2023
- 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) - 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) - Barun Gorain, Avery Miller, Andrzej Pelc:
Four shades of deterministic leader election in anonymous networks. Distributed Comput. 36(4): 419-449 (2023) - Barun Gorain, Shaswati Patra, Rishi Ranjan Singh:
Graph Covering Using Bounded Size Subgraphs. CALDAM 2023: 415-426 - Adri Bhattacharya, Barun Gorain, Partha Sarathi Mandal:
Pebble Guided Treasure Hunt in Plane. NETYS 2023: 141-156 - Amit Kumar Dhar, Barun Gorain, Madhuri Mahawar:
Sweep Coverage with Faults. RAIT 2023: 1-6 - Adri Bhattacharya, Barun Gorain, Partha Sarathi Mandal:
Pebble guided Treasure Hunt in Plane. CoRR abs/2305.06067 (2023) - 2022
- Barun Gorain, Kaushik Mondal, Himadri Nayak, Supantha Pandit:
Pebble guided optimal treasure hunt in anonymous graphs. Theor. Comput. Sci. 922: 61-80 (2022) - Barun Gorain, Kaushik Mondal, Supantha Pandit:
Distributed Dominating Sets in Interval Graphs. COCOON 2022: 508-520 - Adri Bhattacharya, Barun Gorain, Partha Sarathi Mandal:
Treasure Hunt in Graph Using Pebbles. SSS 2022: 99-113 - Barun Gorain, Partha Sarathi Mandal, Kaushik Mondal, Supantha Pandit:
Collaborative Dispersion by Silent Robots. SSS 2022: 254-269 - Barun Gorain, Kaushik Mondal, Supantha Pandit:
Distributed Connected Dominating Sets in Unit Square and Disk Graphs. TAMC 2022: 346-358 - Barun Gorain, Partha Sarathi Mandal, Kaushik Mondal, Supantha Pandit:
Collaborative Dispersion by Silent Robots. CoRR abs/2202.05710 (2022) - Adri Bhattacharya, Barun Gorain, Partha Sarathi Mandal:
Treasure Hunt in Graph using Pebbles. CoRR abs/2209.00857 (2022) - 2021
- Barun Gorain, Andrzej Pelc:
Short labeling schemes for topology recognition in wireless tree networks. Theor. Comput. Sci. 861: 23-44 (2021) - Barun Gorain, Andrzej Pelc:
Finding the size and the diameter of a radio network using short labels. Theor. Comput. Sci. 864: 20-33 (2021) - 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) - Barun Gorain, Kaushik Mondal, Himadri Nayak, Supantha Pandit:
Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs. SIROCCO 2021: 222-239 - Barun Gorain, Kaushik Mondal, Supantha Pandit:
Distributed Independent Sets in Interval and Segment Intersection Graphs. SOFSEM 2021: 175-188 - Barun Gorain, Avery Miller, Andrzej Pelc:
Four Shades of Deterministic Leader Election in Anonymous Networks. SPAA 2021: 265-274 - Barun Gorain, Kaushik Mondal, Himadri Nayak, Supantha Pandit:
Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs. CoRR abs/2103.05933 (2021) - 2020
- Barun Gorain, Avery Miller, Andrzej Pelc:
Four Shades of Deterministic Leader Election in Anonymous Networks. CoRR abs/2009.06149 (2020) - 2019
- Barun Gorain, Partha Sarathi Mandal:
Approximation Algorithms for Barrier Sweep Coverage. Int. J. Found. Comput. Sci. 30(3): 425-448 (2019) - Barun Gorain, Andrzej Pelc:
Deterministic Graph Exploration with Advice. ACM Trans. Algorithms 15(1): 8:1-8:17 (2019)
skipping 21 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-12-09 08:22 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint