Academic Background

• Ph. D., Indian Statistical Institute, Kolkata, 1997.

              Title: New Topologies and Parallel Algorithms for Static Interconnection Networks.

• Master of Science in Applied Mathematics, University of Calcutta, 1990.

             Specialization: Cybernetics and Advanced Computer Science

             (Stood First class First)

•  Bachelor of Science in Mathematics (Hons.), St. Xavier’s College, Kolkata, University of Calcutta, 1987.

Research Experience

• During July, 2004 to July, 2005, Worked as the Principal Investigator (PI) of the project “Fast algorithms for DNA Sequencing and Mapping”, funded by the Department of Science and Technology, Govt. of India, under Women Scientist Scheme at Indian Statistical Institute, Kolkata.
• During July 16, 1999 to July 15, 2004, worked as a Research Associate in the Advanced Computing and Microelectronics Unit, Indian Statistical Institute, Kolkata.
• During January 1999 to March 1999, worked as Post Doctoral Associate with Professor Sartaj Sahni of CISE Dept., University of Florida, Gainesville, on the development of Parallel Algorithms.
• During November 9 to December 4, 1998, attended the ICTP-UNU Microprocessor Laboratory Fifth Course on basic VLSI Design Techniques, at  Abdus Salam International Centre for Theoretical Physics, Trieste, Italy. The Workshop dealt with Full Custom IC Design using CAD tools.
• During September 1991 to August 1998, worked as a Research Fellow (Institute JRF and SRF) in the field of Parallel Computing, in the Advanced Computing and Microelectronics Unit, Indian Statistical Institute, Kolkata.

• Received National Scholarship for the Madhyamik Examination in 1982.
• Stood First Class First in the M. Sc. in Applied Mathematics, University of Calcutta, 1989.
• Awarded fellowship for attending the ICTP-UNU Microprocessor Laboratory Fifth Course on Basic VLSI Design Technique, held at ICTP, Trieste, Italy, 1998.
• Received the Best Paper Award for the paper “Painting an Area by Swarm of Mobile Robots with Limited Visibility” in the International Conference on Information Processing, August 10-12, 2012, Bengaluru, India.
• Received Significant Contribution Award, 2013-14, awarded by Computer Society of India.

Papers in Refereed International Journals

1. M. Sardar, D. Das and S. Mukhopadhyaya, “Grid Exploration by a Swarm of Autonomous Robots with Minimum Repetitions,” Theoretical Computer Science (Elsevier), Vol. 933, October, 2022, pp. 67 – 87.  (SCOPUS, SCIE)

https://doi.org/10.1016/j.tcs.2022.08.029

2. Arun Kumar Sadhu and Srabani Mukhopadhyaya, “Partition of a Swarm of Robots into Size-balanced Groups in Presence of Line Obstacles,” International Journal of Parallel, Emergent and Distributed Systems, Vol. 37, Issue 3, Taylor & Francis, March, 2022, pp. 344-368. (SCOPUS, ESCI)

(DOI: 10.1080/17445760.2022.2042535)

3. D. Das, S. Mukhopadhyaya, D. Nandi, “Swarm-based Painting of An Area Cluttered with Obstacles,” International Journal of Parallel, Emergent and Distributed Systems, Vol. 36, Issue 4, pp. 359-379, 2021. (SCOPUS, ESCI)

DOI: https://doi.org/10.1080/17445760.2021.1879071

4. D. Das, S. Mukhopadhyaya, “Distributed Algorithm for Painting by a Swarm of Robots under Limited Visibility,” Journal of Advanced Robotic Systems, (SAGE Publication), Vol. 15, Issue: 5, September, 2018. (SCOPUS, SCIE)

5. Ananya Saha, B. Sau and S. Mukhopadhyaya, “A Taxonomy on Rigidity of Graphs,” Indian Journal of Science and Technology, Vol. 10, Issue: 32, August, 2017.  (ISSN: 0974-5645)

6. Deepanwita Das and Srabani Mukhopadhyaya, “Distributed Painting by a Swarm of Robots with Unlimited Sensing Capabilities and Its Simulation”, International Journal of Information Processing (IJIP), (ISSN: 0973-8215), Vol. – 7, No. – 3, pp. 1- 15, 2013.

7. S. Sur-Kolay, S. Banerjee, S. Mukhopadhyaya, C. A. Murthy, “A Genetic  Algorithm for the Double Digest Problem,” International Journal of Bioinformatics Research and Applications (IJBRA), vol. 5, no. 5, pp. 570-592, 2009. (ISSN online: 1744-5493 ISSN print: 1744-5485 ) (SCOPUS)

8. S. Mukhopadhyaya and Bhabani P. Sinha, “Efficient Algorithms for Some Common Applications on GHCC,” Journal of Interconnection Networks (World Scientific Publishing Company), Vol. 6, No. 4, December 2005. (SCOPUS)

9. G. Venkataraman, S. Sahni and S. Mukhopadhyaya, “A blocked all pair shortest-paths algorithm,” ACM Jr. on Experimental Algorithmics, vol. 8, 2003. (SCOPUS)

10. S. Sen Gupta and B. P. Sinha, “A Simple O(log N) Time Parallel Algorithm for Testing Isomorphism of Maximal Outerplanar Graphs,” Journal of Parallel and Distributed Computing  (Academic Press), vol.  56, no. 2, pp. 143-155, Feb. 1999. (SCOPUS, SCI)

11. S. Sen Gupta, R. K. Das, K. Mukhopadhyaya and B. P. Sinha, “A Family of  Network Topologies with Multiple Loops and Logarithmic Diameter,” Parallel Computing (Elsevier Science), vol. 22, pp. 2047 - 2064, 1997. (SCOPUS, SCI)

12.  S. Sen Gupta, K. Mukhopadhyaya, B. B. Bhattacharya and B. P.  Sinha, “Geometric Classification of Triangulations and their Enumerations in a Convex Polygon,” Computers and Mathematics with Applications (Elsevier Science), vol. 27, No. 7, pp. 99-115, 1994. (SCOPUS, SCI)

Chapters in Edited Volumes/ International Conferences Proceedings

1. Soumyak Biswas, Pratyaksha Sinha and Srabani Mukhopadhyaya, “Performance analysis of Assembling algorithms under various models of synchrony and mobility,” in Proc. IEEE World Conference on Applied Intelligence and Computing (AIC 2023), July 29-30, 2023.
2. Sadhu A., Mukhopadhyaya S., “Assembling of robots in presence of line obstacles with direction-only axes agreement,” Journal of Physics Conference Series (JPCS), Vol. 1950 (1):012078, August 2021.  DOI:10.1088/1742-6596/1950/1/012078
3. D. Das, S. Mukhopadhyaya, M. Ghosh., “Synchronizing Asynchronous Mobile Robots with Limited Visibility Using Lights,” Journal of Physics Conference Series (JPCS), Vol. 1950 (1):012015, August 2021.
4. Bhagat, S., Mukhopadhyaya, K. & Mukhopadhyaya, S., “Computing Under Restricted Visibility. In Flocchini, P., Prencipe, G. & Santoro, N. (Eds.), Distributed Computing by Mobile Entities, LNCS 11340 (pp. 134-183). Springer Nature Switzerland, 2019.
5. Arun K. Sadhu, Madhumita Sardar, Deepanwita Das and Srabani Mukhopadhyaya, “Gathering in Discrete Domain: State-of-the-Art,” AISC series on Advanced Computing and Communication Technologies, Vol. 702, pp.11-18, Springer Singapore, July, 2018.  [ISSN: 2194-5357] https://www.springer.com/us/book/9789811306792
6. Deepanwita Das and Srabani Mukhopadhyaya, “Suitability of CORDA Model for Area Coverage Problem”  AISC Series on 'Advanced Computing & Communication Technologies', Vol. 562, pp 3 – 9, Springer Singapore, 2017 [DOI: https://doi.org/10.1007/978-981-10-4603-2, ISBN 978-981-10-4602-5]
7. Maitry Sinha and Srabani Mukhopadhyaya, “Optimal Tree search by a Swarm of Mobile Robots”, ICICT 2016, Bangkok, Thailand, December 12-13, 2016. (Proceeding is to be published by Springer)
8. Maitry Sinha and Srabani Mukhopadhyaya, “Classification of Robot Swarm Models in Discrete Domain” in Proc. 9^th ICACCT 2015, Advanced Computing and Communication Technologies- 452, R. K. Choudhary et al. (eds), Springer AISC Series on 'Advanced Computing & Communication Technologies' pp. 205-212,  Springer 2016 [ISBN 978-981-10-1023-1]
9. D. Das and S. Mukhopadhyaya, “Multi-robot Assembling Along a Boundary of a Given Region in Presence of Opaque Line Obstacles,” in Proc. ICICA, 2015, Springer AISC Series on 'Advanced Computing & Communication Technologies,' Chennai. pp. 21-29. DOI: 10.1007/978-981-10-1645-5-3.  [ISBN: 978-981-10-1644-8]
10. D. Das, S. Mukhopadhyaya and D. Nandi, Techniques in Multi-Robot Coverage - A Comparative Survey, Handbook of Research on Design, Control and Modeling of Swarm Robotics, Chapter 27, IGI Global, pp 770-791. [DOI: 10.4018/978-1-4666-9572-6.ch27].
11. Deepanwita Das and Srabani Mukhopadhyaya, “Painting an Area by Swarm of Mobile Robots with Limited Visibility,” in Proc. Sixth International Conference on Information Processing, 2012, Communications in Computer and Information Science (CCIS-292), pp. 446-455, Springer, Bengaluru, India, 2012. [ISBN: 978-3-642-31685-2]
12. Mrityunjay Ghosh and S. Mukhopadhyaya, “Cache Oblivious Algorithm of Average Filtering in Image Processing,” in Proc. IEEE/IAPR Int. Conf. on Informatics, Electronics & Vision, 2012 (ICIEV 2012), Dhaka, Bangladesh, 2012.
13. Deepanwita Das and S. Mukhopadhyaya, “An Algorithm for painting an Area by Swarm of Mobile Robots,” in Proc. International Conference on Control, Automation and Robotics (CAR 2011), 2011, Global science and technology Forum, Singapore, 2011.
14. B. Sau, S. Mukhopadhyaya and K. Mukhopadhyaya, “Localization Control to Locate Mobile Sensors,” in Proc.  3rd International Conference on Distributed Computing and Internet Technology (ICDCIT 2006), Lecture Notes in Computer Science (LNCS-4317), Springer, Bhubaneswar, India, 2006.
15. S. Sur-Kolay, S. Banerjee, S. Mukhopadhyaya, C. A. Murthy, “A Genetic  Algorithm for the Double Digest Problem,'' in Proc. First International Conference on Pattern Recognition and Machine Intelligence, 2005, Lecture Notes in Computer Science, Springer Verlag, Kolkata, 2005.
16. S. Mukhopadhyaya and K. Mukhopadhyaya, “A 2-dimensional Random Walk Based Mobility Model for Location Tracking,”  in Proc. 9th International Conference on High Performance Computing,  Lecture Notes in Computer Science (LNCS), Springer Verlag, 2002.
17. G. Venkataraman, S. Sahni and S. Mukhopadhyaya, “A Blocked All Pair Shortest-paths Algorithm,” in Proc. Scandinavian Workshop on Algorithms and Theory, Lecture Notes in Computer Science, vol. 1851, Editor: Magnus Halldorsson, Springer Verlag, pp. 419-432, 2000.
18. S. Sen Gupta and B. P. Sinha, “Mapping algorithms on the  Generalized Hypercube-connected-cycles,” in Recent Advances in Computing and Communications (Proc. of ADCOM, 2000). Tata McGraw-Hill, pp. 228-235, 2000.
19. S. Sen Gupta, D. Das and B. P. Sinha, “The Generalized Hypercube-Connected Cycle: An Efficient Network Topology,” in Proc. International Conference on High Performance Computing (HiPC) (IEEE Press), pp. 182-187, December 19-22, 1996, Trivandrum.
20. S. Sen Gupta, D. Das and B. P. Sinha, “A Fast Parallel Algorithm for Polynomial Interpolation Using Lagrange's Formula,” in Proc. International Conference on High Performance Computing (HiPC) (Tata McGraw-Hill), pp. 701-706, December, 1995, New Delhi.
21. S. Sen Gupta, R. K. Das, K. Mukhopadhyaya and B. P. Sinha, “A New Family of Low-diameter Network Topologies with Multiple Loops,” in Proc. First International Workshop on Parallel Processing (Tata McGraw-Hill), pp. 41-46, December 26-31, 1994, Bangalore.

National Conference

1. S.  Sengupta, K.  Mukhopadhyaya, B.  B.  Bhattacharya and B.  P.  Sinha, “Geometric Classification Seminar on Theoretical Computer Science, IIT Kharagpur, June 16- 18, 1993, pp. 245-256.

Papers in Recognized and Reputed Magazines/Journals

1. S. Mukhopadhyaya and B. Sau, “Rigidity of Graphs,” CSI Communication,  pp. 16 – 17, May, 2014, ISSN-0970-647X
2. S. Mukhopadhyaya, “Generating Random Numbers and their Applications in Computing,” CSI Communications, pp. 26 – 27, December, 2014. ISSN: 09070-647X