default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSubhash Bhagat
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Abhinav Chakraborty, Subhash Bhagat
, Krishnendu Mukhopadhyaya:
Gathering Over Heterogeneous Meeting Nodes. Comput. J. 67(5): 1794-1813 (2024)- [j6]Subhash Bhagat, Andrzej Pelc:
Deterministic rendezvous in infinite trees. Theor. Comput. Sci. 984: 114313 (2024) - [c16]Debasish Pattanayak, Subhash Bhagat, Sruti Gan Chaudhuri, Anisur Rahaman Molla:
Maximal Independent Set via Mobile Agents. ICDCN 2024: 74-83 - [c15]Subhash Bhagat, Paulomi Dey, Rajarshi Ray:
Collision-Free Linear Time Mutual Visibility for Asynchronous Fat Robots. ICDCN 2024: 84-93 - [i8]Subhash Bhagat, Andrzej Pelc:
Deterministic Collision-Free Exploration of Unknown Anonymous Graphs. CoRR abs/2401.13044 (2024) - 2023
- [j5]Subhash Bhagat, Abhinav Chakraborty, Bibhuti Das, Krishnendu Mukhopadhyaya:
Optimal Gathering Over Weber Meeting Nodes in Infinite Grid. Int. J. Found. Comput. Sci. 34(1): 25-49 (2023) - [i7]Subhash Bhagat, Andrzej Pelc:
Exploring Wedges of an Oriented Grid by an Automaton with Pebbles. CoRR abs/2302.00052 (2023) - 2022
- [j4]Subhash Bhagat, Abhinav Chakraborty, Bibhuti Das, Krishnendu Mukhopadhyaya:
Gathering over Meeting Nodes in Infinite Grid*. Fundam. Informaticae 187(1): 1-30 (2022) - [j3]Bibhuti Das, Abhinav Chakraborty, Subhash Bhagat, Krishnendu Mukhopadhyaya:
k-Circle formation by disoriented asynchronous robots. Theor. Comput. Sci. 916: 40-61 (2022) - [c14]Subhash Bhagat, Andrzej Pelc:
How to Meet at a Node of Any Connected Graph. DISC 2022: 11:1-11:16 - [i6]Subhash Bhagat, Abhinav Chakraborty, Bibhuti Das, Krishnendu Mukhopadhyaya:
Optimal Gathering over Meeting Nodes in Infinite Grid. CoRR abs/2202.03350 (2022) - [i5]Subhash Bhagat, Andrzej Pelc:
Deterministic Rendezvous in Infinite Trees. CoRR abs/2203.05160 (2022) - 2021
- [j2]Subhash Bhagat, Bibhuti Das, Abhinav Chakraborty, Krishnendu Mukhopadhyaya:
k-Circle Formation and k-epf by Asynchronous Robots. Algorithms 14(2): 62 (2021) - [c13]Subhash Bhagat, Anisur Rahaman Molla:
Min-Max Gathering of Oblivious Robots. SPAA 2021: 420-422 - [i4]Subhash Bhagat, Abhinav Chakraborty, Bibhuti Das, Krishnendu Mukhopadhyaya:
Gathering over Meeting Nodes in Infinite Grid. CoRR abs/2112.06506 (2021) - 2020
- [c12]Subhash Bhagat, Abhinav Chakraborty, Bibhuti Das, Krishnendu Mukhopadhyaya:
Gathering over Meeting Nodes in Infinite Grid. CALDAM 2020: 318-330 - [c11]Subhash Bhagat, Paola Flocchini, Krishnendu Mukhopadhyaya, Nicola Santoro:
Weak robots performing conflicting tasks without knowing who is in their team. ICDCN 2020: 29:1-29:6 - [c10]Subhash Bhagat:
Optimum Algorithm for the Mutual Visibility Problem. WALCOM 2020: 31-42
2010 – 2019
- 2019
- [c9]Subhash Bhagat, Krishnendu Mukhopadhyaya:
Mutual Visibility by Robots with Persistent Memory. FAW 2019: 144-155 - [c8]Subhash Bhagat, Sruti Gan Chaudhuri, Krishnendu Mukhopadhyaya:
Mutual Visibility for Asynchronous Robots. SIROCCO 2019: 336-339 - [p1]Subhash Bhagat, Krishnendu Mukhopadhyaya, Srabani Mukhopadhyaya:
Computation Under Restricted Visibility. Distributed Computing by Mobile Entities 2019: 134-183 - 2018
- [c7]Subhash Bhagat, Sruti Gan Chaudhuri, Krishnendu Mukhopadhyaya:
Gathering of Opaque Robots in 3D Space. ICDCN 2018: 2:1-2:10 - 2017
- [c6]Subhash Bhagat, Krishnendu Mukhopadhyaya:
Optimum Gathering of Asynchronous Robots. CALDAM 2017: 37-49 - [c5]Subhash Bhagat, Krishnendu Mukhopadhyaya:
Fault-tolerant Gathering of Semi-synchronous Robots. ICDCN 2017: 6 - [c4]Subhash Bhagat, Krishnendu Mukhopadhyaya:
Optimum Algorithm for Mutual Visibility Among Asynchronous Robots with Lights. SSS 2017: 341-355 - [c3]Subhash Bhagat, Krishnendu Mukhopadhyaya:
Gathering Asynchronous Robots in the Presence of Obstacles. WALCOM 2017: 279-291 - [i3]Subhash Bhagat, Krishnendu Mukhopadhyaya:
Mutual Visibility by Robots with Persistent Memory. CoRR abs/1708.02825 (2017) - 2016
- [j1]Subhash Bhagat, Sruti Gan Chaudhuri, Krishnendu Mukhopadhyaya:
Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement. J. Discrete Algorithms 36: 50-62 (2016) - [c2]Subhash Bhagat, Sruti Gan Chaudhuri, Krishnendu Mukhopadhyaya:
Formation of General Position by Asynchronous Mobile Robots Under One-Axis Agreement. WALCOM 2016: 80-91 - [i2]Subhash Bhagat, Sruti Gan Chaudhuri, Krishnendu Mukhopadhyaya:
A Get-Together for Deaf and Dumb Robots in Three dimensional Space. CoRR abs/1604.00498 (2016) - 2015
- [c1]Subhash Bhagat, Sruti Gan Chaudhuri, Krishnendu Mukhopadhyaya:
Fault-Tolerant Gathering of Asynchronous Oblivious Mobile Robots under One-Axis Agreement. WALCOM 2015: 149-160 - 2014
- [i1]Subhash Bhagat, Sruti Gan Chaudhuri, Krishnendu Mukhopadhyaya:
Formation of General Position by Asynchronous Mobile Robots. CoRR abs/1408.2072 (2014)
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-08-20 20:26 CEST 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:
