default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKrishnendu Mukhopadhyaya
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j23]Abhinav Chakraborty, Subhash Bhagat
, Krishnendu Mukhopadhyaya:
Gathering Over Heterogeneous Meeting Nodes. Comput. J. 67(5): 1794-1813 (2024)- [c33]Abhinav Chakraborty, Krishnendu Mukhopadhyaya:
Parking Problem by Oblivious Mobile Robots in Infinite Grids. ICDCIT 2024: 68-84 - [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
- [j22]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) - [j21]Kaustav Bose, Abhinav Chakraborty, Krishnendu Mukhopadhyaya:
Mutual visibility by fat robots with slim omnidirectional camera. J. Parallel Distributed Comput. 180: 104716 (2023) - [c32]Bibhuti Das, Krishnendu Mukhopadhyaya:
Uniform k-Circle Formation by Fat Robots. SSS 2023: 359-373 - [i12]Abhinav Chakraborty, Krishnendu Mukhopadhyaya:
Parking Problem by Oblivious Mobile Robots in Infinite Grids. CoRR abs/2310.09813 (2023) - 2022
- [j20]Subhash Bhagat, Abhinav Chakraborty, Bibhuti Das, Krishnendu Mukhopadhyaya:
Gathering over Meeting Nodes in Infinite Grid*. Fundam. Informaticae 187(1): 1-30 (2022) - [j19]Bibhuti Das, Abhinav Chakraborty, Subhash Bhagat, Krishnendu Mukhopadhyaya:
k-Circle formation by disoriented asynchronous robots. Theor. Comput. Sci. 916: 40-61 (2022) - [c31]Abhinav Chakraborty, Krishnendu Mukhopadhyaya:
Pattern Formation Problems for Mobile Robots. ICDCN 2022: 236-237 - [c30]Bibhuti Das, Krishnendu Mukhopadhyaya:
k-Circle Formation by Oblivious Mobile Robots. ICDCN 2022: 238-239 - [i11]Subhash Bhagat, Abhinav Chakraborty, Bibhuti Das, Krishnendu Mukhopadhyaya:
Optimal Gathering over Meeting Nodes in Infinite Grid. CoRR abs/2202.03350 (2022) - [i10]Kaustav Bose, Abhinav Chakraborty, Krishnendu Mukhopadhyaya:
Mutual Visibility by Fat Robots with Slim Omnidirectional Camera. CoRR abs/2206.07416 (2022) - 2021
- [j18]Subhash Bhagat, Bibhuti Das, Abhinav Chakraborty, Krishnendu Mukhopadhyaya:
k-Circle Formation and k-epf by Asynchronous Robots. Algorithms 14(2): 62 (2021) - [i9]Subhash Bhagat, Abhinav Chakraborty, Bibhuti Das, Krishnendu Mukhopadhyaya:
Gathering over Meeting Nodes in Infinite Grid. CoRR abs/2112.06506 (2021) - 2020
- [j17]Krishnendu Mukhopadhyaya, Shin-Ichi Nakano:
Guest Editors' Foreword. J. Graph Algorithms Appl. 24(2): 63-64 (2020) - [c29]Subhash Bhagat, Abhinav Chakraborty, Bibhuti Das, Krishnendu Mukhopadhyaya:
Gathering over Meeting Nodes in Infinite Grid. CALDAM 2020: 318-330 - [c28]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 - [i8]Moumita Mondal, Sruti Gan Chaudhuri, Ayan Dutta, Krishnendu Mukhopadhyaya, Punyasha Chatterjee:
Uniform Circle Formation By Oblivious Swarm Robots. CoRR abs/2012.07113 (2020)
2010 – 2019
- 2019
- [c27]Subhash Bhagat, Krishnendu Mukhopadhyaya:
Mutual Visibility by Robots with Persistent Memory. FAW 2019: 144-155 - [c26]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 - [e1]Gautam K. Das, Partha Sarathi Mandal, Krishnendu Mukhopadhyaya, Shin-Ichi Nakano:
WALCOM: Algorithms and Computation - 13th International Conference, WALCOM 2019, Guwahati, India, February 27 - March 2, 2019, Proceedings. Lecture Notes in Computer Science 11355, Springer 2019, ISBN 978-3-030-10563-1 [contents] - 2018
- [c25]Subhash Bhagat, Sruti Gan Chaudhuri, Krishnendu Mukhopadhyaya:
Gathering of Opaque Robots in 3D Space. ICDCN 2018: 2:1-2:10 - 2017
- [j16]Barun Gorain, Partha Sarathi Mandal, Krishnendu Mukhopadhyaya:
Generalized Bounded Tree Cover of a Graph. J. Graph Algorithms Appl. 21(3): 265-280 (2017) - [c24]Subhash Bhagat, Krishnendu Mukhopadhyaya:
Optimum Gathering of Asynchronous Robots. CALDAM 2017: 37-49 - [c23]Subhash Bhagat, Krishnendu Mukhopadhyaya:
Fault-tolerant Gathering of Semi-synchronous Robots. ICDCN 2017: 6 - [c22]Subhash Bhagat, Krishnendu Mukhopadhyaya:
Optimum Algorithm for Mutual Visibility Among Asynchronous Robots with Lights. SSS 2017: 341-355 - [c21]Subhash Bhagat, Krishnendu Mukhopadhyaya:
Gathering Asynchronous Robots in the Presence of Obstacles. WALCOM 2017: 279-291 - [i7]Subhash Bhagat, Krishnendu Mukhopadhyaya:
Mutual Visibility by Robots with Persistent Memory. CoRR abs/1708.02825 (2017) - 2016
- [j15]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) - [c20]Subhash Bhagat, Sruti Gan Chaudhuri, Krishnendu Mukhopadhyaya:
Formation of General Position by Asynchronous Mobile Robots Under One-Axis Agreement. WALCOM 2016: 80-91 - [c19]Barun Gorain, Partha Sarathi Mandal, Krishnendu Mukhopadhyaya:
Approximation Algorithms for Generalized Bounded Tree Cover. WALCOM 2016: 263-273 - [i6]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
- [j14]Sruti Gan Chaudhuri, Krishnendu Mukhopadhyaya:
Leader election and gathering for asynchronous fat robots without common chirality. J. Discrete Algorithms 33: 171-192 (2015) - [c18]Avik Chatterjee, Sruti Gan Chaudhuri, Krishnendu Mukhopadhyaya:
Gathering Asynchronous Swarm Robots under Nonuniform Limited Visibility. ICDCIT 2015: 174-180 - [c17]Subhash Bhagat, Sruti Gan Chaudhuri, Krishnendu Mukhopadhyaya:
Fault-Tolerant Gathering of Asynchronous Oblivious Mobile Robots under One-Axis Agreement. WALCOM 2015: 149-160 - [i5]Buddhadeb Sau, Srabani Mukhopadhyaya, Krishnendu Mukhopadhyaya:
MAINT: Localization of Mobile Sensors with Energy Control. CoRR abs/1511.03524 (2015) - 2014
- [i4]Sruti Gan Chaudhuri, Swapnil Ghike, Shrainik Jain, Krishnendu Mukhopadhyaya:
Pattern Formation for Asynchronous Robots without Agreement in Chirality. CoRR abs/1403.2625 (2014) - [i3]Subhash Bhagat, Sruti Gan Chaudhuri, Krishnendu Mukhopadhyaya:
Formation of General Position by Asynchronous Mobile Robots. CoRR abs/1408.2072 (2014) - 2013
- [c16]Suparno Datta, Ayan Dutta, Sruti Gan Chaudhuri, Krishnendu Mukhopadhyaya:
Circle Formation by Asynchronous Transparent Fat Robots. ICDCIT 2013: 195-207 - [c15]Buddhadeb Sau, Krishnendu Mukhopadhyaya:
Localizability of Wireless Sensor Networks: Beyond Wheel Extension. SSS 2013: 326-340 - [i2]Buddhadeb Sau, Krishnendu Mukhopadhyaya:
Localizability of Wireless Sensor Networks: Beyond Wheel Extension. CoRR abs/1308.6464 (2013) - 2012
- [c14]Ayan Dutta, Sruti Gan Chaudhuri, Suparno Datta, Krishnendu Mukhopadhyaya:
Circle Formation by Asynchronous Fat Robots with Limited Visibility. ICDCIT 2012: 83-93 - [i1]Sruti Gan Chaudhuri, Krishnendu Mukhopadhyaya:
Leader Election and Gathering for Asynchronous Transparent Fat Robots without Chirality. CoRR abs/1208.4484 (2012) - 2011
- [j13]Debashis Mondal, Abhay Kumar, Arijit Bishnu, Krishnendu Mukhopadhyaya, Subhas C. Nandy:
Measuring the Quality of Surveillance in a Wireless Sensor Network. Int. J. Found. Comput. Sci. 22(4): 983-998 (2011) - 2010
- [j12]Subhas C. Nandy, Krishnendu Mukhopadhyaya, Bhargab B. Bhattacharya:
Recognition of largest empty orthoconvex polygon in a point set. Inf. Process. Lett. 110(17): 746-752 (2010) - [c13]Swapnil Ghike, Krishnendu Mukhopadhyaya:
A Distributed Algorithm for Pattern Formation by Autonomous Robots, with No Agreement on Coordinate Compass. ICDCIT 2010: 157-169 - [c12]Sruti Gan Chaudhuri, Krishnendu Mukhopadhyaya:
Gathering Asynchronous Transparent Fat Robots. ICDCIT 2010: 170-175
2000 – 2009
- 2008
- [c11]Subhas C. Nandy, Krishnendu Mukhopadhyaya, Bhargab B. Bhattacharya:
Recognition of Largest Empty Orthoconvex Polygon in a Point Set. CCCG 2008 - 2007
- [j11]Partha Sarathi Mandal, Krishnendu Mukhopadhyaya:
Mobile Agent Based Checkpointing with Concurrent Initiations. Int. J. Found. Comput. Sci. 18(5): 1107-1122 (2007) - [j10]Partha Sarathi Mandal, Krishnendu Mukhopadhyaya:
Self-stabilizing algorithm for checkpointing in a distributed system. J. Parallel Distributed Comput. 67(7): 816-829 (2007) - [c10]Partha Sarathi Mandal, Krishnendu Mukhopadhyaya:
Checkpointing Using Mobile Agents in Distributed Systems. ICCTA 2007: 39-45 - 2006
- [j9]Partha Sarathi Mandal, Krishnendu Mukhopadhyaya:
Performance analysis of different checkpointing and recovery schemes using stochastic model. J. Parallel Distributed Comput. 66(1): 99-107 (2006) - [c9]Buddhadeb Sau, Srabani Mukhopadhyaya, Krishnendu Mukhopadhyaya:
Localization Control to Locate Mobile Sensors. ICDCIT 2006: 81-88 - 2005
- [c8]Partha Sarathi Mandal, Krishnendu Mukhopadhyaya:
Self-stabilizing Checkpointing Algorithm in Ring Topology. IWDC 2005: 141-146 - 2004
- [j8]Partha Sarathi Mandal, Krishnendu Mukhopadhyaya:
Concurrent checkpoint initiation and recovery algorithms on asynchronous ring network. J. Parallel Distributed Comput. 64(5): 649-661 (2004) - [c7]Buddhadeb Sau, Krishnendu Mukhopadhyaya:
Locating Objects in a Sensor Grid. IWDC 2004: 526-531 - 2003
- [c6]Partha Sarathi Mandal, Krishnendu Mukhopadhyaya:
Estimating Checkpointing, Rollback and Recovery Overheads. IWDC 2003: 56-65 - 2002
- [c5]Srabani Mukhopadhyaya, Krishnendu Mukhopadhyaya:
A 2-D Random Walk Based Mobility Model for Location Tracking. HiPC 2002: 357-366 - 2000
- [j7]Nabanita Das, Krishnendu Mukhopadhyaya, Jayasree Dattagupta:
O(n) routing in rearrangeable networks. J. Syst. Archit. 46(6): 529-542 (2000)
1990 – 1999
- 1997
- [j6]Srabani Sen Gupta, Rajib K. Das, Krishnendu Mukhopadhyaya, Bhabani P. Sinha:
A Family of Network Topologies with Multiple Loops and Logarithmic Diameter. Parallel Comput. 22(14): 2047-2064 (1997) - 1996
- [c4]Subhas C. Nandy, Krishnendu Mukhopadhyaya, Bhargab B. Bhattacharya:
Shooter Location Problem. CCCG 1996: 93-98 - 1995
- [j5]Debasish Das, Krishnendu Mukhopadhyaya, Bhabani P. Sinha:
Implementation of Four Common Functions on an LNS Co-Processor. IEEE Trans. Computers 44(1): 155-161 (1995) - [j4]Krishnendu Mukhopadhyaya, Bhabani P. Sinha:
Fault-Tolerant Routing in Distributed Loop Networks. IEEE Trans. Computers 44(12): 1452-1456 (1995) - 1994
- [j3]Rajib K. Das, Krishnendu Mukhopadhyaya, Bhabani P. Sinha:
A New Family of Bridged and Twisted Hypercubes. IEEE Trans. Computers 43(10): 1240-1247 (1994) - 1992
- [j2]Krishnendu Mukhopadhyaya, Bhabani P. Sinha:
Hamiltonian Graphs with Minimum Number of Edges for Fault-Tolerant Topologies. Inf. Process. Lett. 44(2): 95-99 (1992) - [j1]Krishnendu Mukhopadhyaya, Bhabani P. Sinha:
Reliability analysis of networks using stochastic model. Inf. Sci. 65(3): 225-237 (1992) - [c3]Rajib K. Das, Krishnendu Mukhopadhyaya, Bhabani P. Sinha:
Brdiged and Twisted Hypercubes with Reduced Diameters. ICPP (1) 1992: 72-75 - [c2]Nabanita Das, Krishnendu Mukhopadhyaya, Jayasree Dattagupta:
A Versatile External Control Method for Self-Routable Permutations in Benes Network. ICPP (1) 1992: 123-126 - 1991
- [c1]Nabanita Das, Krishnendu Mukhopadhyaya, Jayasree Dattagupta:
On Self-Routable Permutations in Benes Network. ICPP (1) 1991: 270-273
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-09-18 23:40 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:
