{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:44:37Z","timestamp":1742931877127,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030678982"},{"type":"electronic","value":"9783030678999"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","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":[[2021]]},"DOI":"10.1007\/978-3-030-67899-9_21","type":"book-chapter","created":{"date-parts":[[2021,1,28]],"date-time":"2021-01-28T00:05:55Z","timestamp":1611792355000},"page":"272-281","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Cops and Robber on Butterflies and Solid Grids"],"prefix":"10.1007","author":[{"given":"Sheikh Shakil","family":"Akhtar","sequence":"first","affiliation":[]},{"given":"Sandip","family":"Das","sequence":"additional","affiliation":[]},{"given":"Harmender","family":"Gahlawat","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,28]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0166-218X(84)90073-8","volume":"8","author":"M Aigner","year":"1984","unstructured":"Aigner, M., Fromme, M.: A game of cops and robbers. Discrete Appl. Math. 8, 1\u201312 (1984)","journal-title":"Discrete Appl. Math."},{"key":"21_CR2","first-page":"5","volume":"59","author":"B Alspach","year":"2006","unstructured":"Alspach, B.: Sweeping and searching in graphs: a brief survey. Matematiche 59, 5\u201337 (2006)","journal-title":"Matematiche"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/j.jcta.2017.06.009","volume":"152","author":"P Balister","year":"2017","unstructured":"Balister, P., Bollobas, B., Narayanan, B., Shaw, A.: Catching a fast robber on the grid. J. Combin. Theory Ser. A 152, 341\u2013352 (2017)","journal-title":"J. Combin. Theory Ser. A"},{"key":"21_CR4","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-981-10-0251-9_1","volume-title":"Computational Intelligence, Cyber Security and Computational Models","author":"A Bonato","year":"2016","unstructured":"Bonato, A., Inerney, F.M.: The game of wall cops and robbers. In: Senthilkumar, M., Ramasamy, V., Sheen, S., Veeramani, C., Bonato, A., Batten, L. (eds.) Computational Intelligence, Cyber Security and Computational Models. AISC, vol. 412, pp. 3\u201313. Springer, Singapore (2016). https:\/\/doi.org\/10.1007\/978-981-10-0251-9_1"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Bonato, A., Nowakowski, R.: The Game of Cops and Robbers on Graphs. American Mathematical Society (2011)","DOI":"10.1090\/stml\/061"},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1006\/aama.1993.1019","volume":"14","author":"A Berarducci","year":"1993","unstructured":"Berarducci, A., Intrigila, B.: On the cop number of a graph. Adv. Appl. Math. 14, 389\u2013403 (1993)","journal-title":"Adv. Appl. Math."},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-319-74180-2_21","volume-title":"Algorithms and Discrete Applied Mathematics","author":"S Das","year":"2018","unstructured":"Das, S., Gahlawat, H.: Variations of cops and robbers game on grids. In: Panda, B.S., Goswami, P.P. (eds.) CALDAM 2018. LNCS, vol. 10743, pp. 249\u2013259. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-74180-2_21"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1016\/j.tcs.2009.12.010","volume":"411","author":"F Fomin","year":"2010","unstructured":"Fomin, F., Golovach, P., Kratochvil, J., Nisse, N., Suchan, K.: Pursuing a fast robber on a graph. Theor. Comput. Sci. 411, 1167\u20131181 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0304-3975(95)80026-6","volume":"143","author":"AS Goldstein","year":"1995","unstructured":"Goldstein, A.S., Reingold, E.M.: The complexity of pursuit on a graph. Theor. Comput. Sci. 143, 93\u2013112 (1995)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"21_CR10","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/j.disc.2017.09.011","volume":"341","author":"SA Hosseini","year":"2018","unstructured":"Hosseini, S.A., Mohar, B.: Game of cops and robbers in oriented quotients of the integer grid. Discrete Math. 341(2), 439\u2013450 (2018)","journal-title":"Discrete Math."},{"key":"21_CR11","unstructured":"Isaza, A., Lu, J., Bulitko, V., Greiner, R.: A cover-based approach to multi-agent moving target pursuit. In: Proceedings of The 4th Conference on Artificial Intelligence and Interactive Digital Entertainment (2008)"},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1137\/S0895480104442169","volume":"1","author":"V Isler","year":"2006","unstructured":"Isler, V., Kannan, S., Khanna, S.: Randomized pursuit-evasion with local visibility. SIAM J. Discrete Math. 1, 26\u201341 (2006)","journal-title":"SIAM J. Discrete Math."},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/j.jctb.2014.11.002","volume":"111","author":"WB Kinnersley","year":"2015","unstructured":"Kinnersley, W.B.: Cops and robbers is EXPTIME-complete. J. Combin. Theory Ser. B 111, 201\u2013220 (2015)","journal-title":"J. Combin. Theory Ser. B"},{"key":"21_CR14","volume-title":"Introduction to Parallel Algorithms and Architectures","author":"F Leighton","year":"1992","unstructured":"Leighton, F.: Introduction to Parallel Algorithms and Architectures. Morgan Kaufmann, Burlington (1992)"},{"key":"21_CR15","unstructured":"Luccio, F., Pagli, L.: Cops and robber on grids and tori. ArXiv e-prints. arXiv:1708.08255 (2017)"},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0166-218X(87)90034-5","volume":"17","author":"M Maamoun","year":"1987","unstructured":"Maamoun, M., Meyniel, H.: On a game of policemen and robber. Discrete Appl. Math. 17, 307\u2013309 (1987)","journal-title":"Discrete Appl. Math."},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.disc.2010.10.002","volume":"311","author":"A Mehrabian","year":"2011","unstructured":"Mehrabian, A.: The capture time of grids. Discrete Math. 311, 102\u2013105 (2011)","journal-title":"Discrete Math."},{"key":"21_CR18","first-page":"253","volume":"43","author":"R Nowakowski","year":"1983","unstructured":"Nowakowski, R., Winkler, P.: Vertex-to-vertex pursuit in a graph. Discrete Math. 43, 253\u2013259 (1983)","journal-title":"Discrete Math."},{"key":"21_CR19","unstructured":"Quilliot, A.: Th\u00e9se d\u2019Etat. Ph.D. thesis, Universit\u00e9 de Paris VI (1983)"},{"key":"21_CR20","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1006\/jctb.1993.1027","volume":"58","author":"PD Seymour","year":"1993","unstructured":"Seymour, P.D., Thomas, R.: Graph searching and a min-max theorem for tree-width. J. Combin. Theory Ser. B 58, 22\u201333 (1993)","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-67899-9_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,28]],"date-time":"2021-01-28T00:12:45Z","timestamp":1611792765000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-67899-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030678982","9783030678999"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-67899-9_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"28 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rupnagar","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 February 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 February 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iitrpr.ac.in\/caldam2021\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair and OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"82","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,8","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,21","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}