{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T15:19:56Z","timestamp":1777562396725,"version":"3.51.4"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030398804","type":"print"},{"value":"9783030398811","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-39881-1_4","type":"book-chapter","created":{"date-parts":[[2020,1,27]],"date-time":"2020-01-27T03:02:33Z","timestamp":1580094153000},"page":"31-42","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Optimum Algorithm for the Mutual Visibility Problem"],"prefix":"10.1007","author":[{"given":"Subhash","family":"Bhagat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,20]]},"reference":[{"key":"4_CR1","unstructured":"Di Luna, G.A., Flocchini, P., Poloni, F., Santoro, N., Viglietta, G.: The mutual visibility problem for oblivious robots. In: Proceedings 26th Canadian Conference on Computational Geometry (CCCG 2014) (2014)"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Vaidyanathan, R., Busch, C., Trahan, J.L., Sharma, G., Rai, S.: Logarithmic-time complete visibility for robots with lights. In: Proceedings Parallel and Distributed Processing Symposium (IPDPS), pp. 375\u2013384 (2015)","DOI":"10.1109\/IPDPS.2015.52"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-319-03578-9_16","volume-title":"Structural Information and Communication Complexity","author":"P Flocchini","year":"2013","unstructured":"Flocchini, P., Santoro, N., Viglietta, G., Yamashita, M.: Rendezvous of two robots with constant memory. In: Moscibroda, T., Rescigno, A.A. (eds.) SIROCCO 2013. LNCS, vol. 8179, pp. 189\u2013200. Springer, Cham (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-319-03578-9_16"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-319-30139-6_7","volume-title":"WALCOM: Algorithms and Computation","author":"S Bhagat","year":"2016","unstructured":"Bhagat, S., Chaudhuri, S.G., Mukhopadhyaya, K.: Formation of general position by asynchronous mobile robots under one-axis agreement. In: Kaykobad, M., Petreschi, R. (eds.) WALCOM 2016. LNCS, vol. 9627, pp. 80\u201391. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-30139-6_7"},{"issue":"1","key":"4_CR5","doi-asserted-by":"publisher","first-page":"32","DOI":"10.15803\/ijnc.8.1_32","volume":"8","author":"A Aljohani","year":"2018","unstructured":"Aljohani, A., Sharma, G.: Complete visibility for mobile robots with lights tolerating faults. Int. J. Netw. Comput. 8(1), 32\u201352 (2018)","journal-title":"Int. J. Netw. Comput."},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-319-69084-1_18","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"G Sharma","year":"2017","unstructured":"Sharma, G., Vaidyanathan, R., Trahan, J.L.: Constant-time complete visibility for asynchronous robots with lights. In: Spirakis, P., Tsigas, P. (eds.) SSS 2017. LNCS, vol. 10616, pp. 265\u2013281. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-69084-1_18"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-319-69084-1_24","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"S Bhagat","year":"2017","unstructured":"Bhagat, S., Mukhopadhyaya, K.: Optimum algorithm for mutual visibility among asynchronous robots with lights. In: Spirakis, P., Tsigas, P. (eds.) SSS 2017. LNCS, vol. 10616, pp. 341\u2013355. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-69084-1_24"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-030-05529-5_5","volume-title":"Networked Systems","author":"G Sharma","year":"2019","unstructured":"Sharma, G., Busch, C., Mukhopadhyay, S.: Complete visibility for oblivious robots in $$\\cal{O}(N)$$ time. In: Podelski, A., Ta\u00efani, F. (eds.) NETYS 2018. LNCS, vol. 11028, pp. 67\u201384. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-05529-5_5"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-319-75172-6_15","volume-title":"WALCOM: Algorithms and Computation","author":"A Aljohani","year":"2018","unstructured":"Aljohani, A., Poudel, P., Sharma, G.: Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement. In: Rahman, M.S., Sung, W.-K., Uehara, R. (eds.) WALCOM 2018. LNCS, vol. 10755, pp. 169\u2013182. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-75172-6_15"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Sharma, G.: Mutual visibility for robots with lights tolerating light faults. In: Proceedings IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), pp. 829\u2013836 (2018)","DOI":"10.1109\/IPDPSW.2018.00130"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Sharma, G., Vaidyanathan, R., Trahan, J.L., Busch, C., Rai, S.: O(log N)-time complete visibility for asynchronous robots with lights. In: Proceedings Parallel and Distributed Processing Symposium (IPDPS), pp. 513\u2013522 (2017)","DOI":"10.1109\/IPDPS.2017.51"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-319-49259-9_26","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"G Sharma","year":"2016","unstructured":"Sharma, G., Vaidyanathan, R., Trahan, J.L., Busch, C., Rai, S.: Complete visibility for robots with lights in O(1) Time. In: Bonakdarpour, B., Petit, F. (eds.) SSS 2016. LNCS, vol. 10083, pp. 327\u2013345. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-49259-9_26"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-319-28472-9_15","volume-title":"Algorithms for Sensor Systems","author":"G Sharma","year":"2015","unstructured":"Sharma, G., Busch, C., Mukhopadhyay, S.: Mutual visibility with an optimal number of colors. In: Bose, P., G\u0105sieniec, L.A., R\u00f6mer, K., Wattenhofer, R. (eds.) ALGOSENSORS 2015. LNCS, vol. 9536, pp. 196\u2013210. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-28472-9_15"},{"key":"4_CR14","unstructured":"Sharma, G., Busch, C., Mukhopadhyay, S.: Bounds on mutual visibility algorithms. In: Proceedings 27th Canadian Conference on Computational Geometry (CCCG 2015) (2015)"},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/j.ic.2016.09.005","volume":"254","author":"GA Di Luna","year":"2017","unstructured":"Di Luna, G.A., Flocchini, P., Gan Chaudhuri, S., Poloni, F., Santoro, N., Viglietta, G.: Mutual visibility by luminous robots without collisions. Inf. Comput. 254, 392\u2013418 (2017)","journal-title":"Inf. Comput."},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-030-18126-0_13","volume-title":"Frontiers in Algorithmics","author":"S Bhagat","year":"2019","unstructured":"Bhagat, S., Mukhopadhyaya, K.: Mutual visibility by robots with persistent memory. In: Chen, Y., Deng, X., Lu, M. (eds.) FAW 2019. LNCS, vol. 11458, pp. 144\u2013155. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-18126-0_13"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-030-24922-9_24","volume-title":"Structural Information and Communication Complexity","author":"S Bhagat","year":"2019","unstructured":"Bhagat, S., Gan Chaudhuri, S., Mukhopadhyaya, K.: Mutual visibility for asynchronous robots. In: Censor-Hillel, K., Flammini, M. (eds.) SIROCCO 2019. LNCS, vol. 11639, pp. 336\u2013339. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-24922-9_24"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-39881-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,19]],"date-time":"2020-02-19T19:05:10Z","timestamp":1582139110000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-39881-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030398804","9783030398811"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-39881-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"20 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 March 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.comp.nus.edu.sg\/~walcom20\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}