{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T09:58:43Z","timestamp":1767261523989,"version":"3.48.0"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031252105"},{"type":"electronic","value":"9783031252112"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-25211-2_24","type":"book-chapter","created":{"date-parts":[[2023,1,25]],"date-time":"2023-01-25T19:02:42Z","timestamp":1674673362000},"page":"309-320","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Cops and\u00a0Robber on\u00a0Oriented Graphs with\u00a0Respect to\u00a0Push Operation"],"prefix":"10.1007","author":[{"given":"Sandip","family":"Das","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Harmender","family":"Gahlawat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ashwin","family":"Ramgopal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uma Kant","family":"Sahoo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sagnik","family":"Sen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,26]]},"reference":[{"issue":"3","key":"24_CR1","doi-asserted-by":"publisher","first-page":"1120","DOI":"10.1137\/17M1112406","volume":"48","author":"I Abraham","year":"2019","unstructured":"Abraham, I., Gavoille, C., Gupta, A., Neiman, O., Talwar, K.: Cops, robbers, and threatening skeletons: Padded decomposition for minor-free graphs. SIAM J. Comput. 48(3), 1120\u20131145 (2019)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"24_CR2","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. Discret. Appl. Math. 8(1), 1\u201312 (1984)","journal-title":"Discret. Appl. Math."},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s00446-016-0274-y","volume":"30","author":"D Angelo","year":"2017","unstructured":"Angelo, D., Navarra, A., Nisse, N.: A unified approach for gathering and exclusive searching on rings under weak assumptions. Distrib. Comput. 30, 17\u201348 (2017)","journal-title":"Distrib. Comput."},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Belmonte, R., Golovach, P.A., Heggernes, P., van\u2019t Hof, P., Kami\u0144ski, M., Paulusma, D.: Detecting fixed patterns in chordal graphs in polynomial time. Algorithmica 69(3), 501\u2013521 (2014)","DOI":"10.1007\/s00453-013-9748-5"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"103383","DOI":"10.1016\/j.ejc.2021.103383","volume":"97","author":"P Bradshaw","year":"2021","unstructured":"Bradshaw, P., Hosseini, S.A., Turcotte, J.: Cops and robbers on directed and undirected abelian Cayley graphs. Eur. J. Comb. 97, 103383 (2021)","journal-title":"Eur. J. Comb."},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-662-45174-8_9","volume-title":"Distributed Computing","author":"J Czyzowicz","year":"2014","unstructured":"Czyzowicz, J., G\u0105sieniec, L., Gorry, T., Kranakis, E., Martin, R., Pajak, D.: Evacuating robots via unknown exit in a disk. In: Kuhn, F. (ed.) DISC 2014. LNCS, vol. 8784, pp. 122\u2013136. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45174-8_9"},{"issue":"1","key":"24_CR7","first-page":"201","volume":"17","author":"E Darlington","year":"2016","unstructured":"Darlington, E., Gibbons, C., Guy, K., Hauswald, J.: Cops and robbers on oriented graphs. Rose-Hulman Undergraduate Math. J. 17(1), 201\u2013209 (2016)","journal-title":"Rose-Hulman Undergraduate Math. J."},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.tcs.2021.07.016","volume":"888","author":"S Das","year":"2021","unstructured":"Das, S., Gahlawat, H., Sahoo, U.K., Sen, S.: Cops and robber on some families of oriented graphs. Theor. Comput. Sci. 888, 31\u201340 (2021)","journal-title":"Theor. Comput. Sci."},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.tcs.2021.01.012","volume":"857","author":"SGH de la Maza","year":"2021","unstructured":"de la Maza, S.G.H., Hosseini, S.A., Knox, F., Mohar, B., Reed, B.: Cops and robbers on oriented toroidal grids. Theoret. Comput. Sci. 857, 166\u2013176 (2021)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"24_CR10","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1002\/jgt.3190190208","volume":"19","author":"DC Fisher","year":"1995","unstructured":"Fisher, D.C., Ryan, J.: Tournament games and positive tournaments. J. Graph Theory 19(2), 217\u2013236 (1995)","journal-title":"J. Graph Theory"},{"issue":"4","key":"24_CR11","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1002\/jgt.20591","volume":"69","author":"A Frieze","year":"2012","unstructured":"Frieze, A., Krivelevich, M., Loh, P.: Variations on cops and robbers. J. Graph Theory 69(4), 383\u2013402 (2012)","journal-title":"J. Graph Theory"},{"issue":"10\u201311","key":"24_CR12","doi-asserted-by":"publisher","first-page":"1557","DOI":"10.1016\/j.disc.2010.01.015","volume":"310","author":"T Gaven\u010diak","year":"2010","unstructured":"Gaven\u010diak, T.: Cop-win graphs with maximum capture-time. Discret. Math. 310(10\u201311), 1557\u20131563 (2010)","journal-title":"Discret. Math."},{"issue":"1","key":"24_CR13","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. Theoret. Comput. Sci. 143(1), 93\u2013112 (1995)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"24_CR14","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/S0004-3702(00)00078-3","volume":"124","author":"G Gottlob","year":"2000","unstructured":"Gottlob, G., Leone, N., Scarcello, F.: A comparison of structural CSP decomposition methods. Artif. Intell. 124(2), 243\u2013282 (2000)","journal-title":"Artif. Intell."},{"issue":"3","key":"24_CR15","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1145\/382780.382783","volume":"48","author":"G Gottlob","year":"2001","unstructured":"Gottlob, G., Leone, N., Scarcello, F.: The complexity of acyclic conjunctive queries. J. ACM 48(3), 431\u2013498 (2001)","journal-title":"J. ACM"},{"issue":"19\u201320","key":"24_CR16","doi-asserted-by":"publisher","first-page":"2492","DOI":"10.1016\/j.disc.2005.12.038","volume":"306","author":"G Hahn","year":"2006","unstructured":"Hahn, G., MacGillivray, G.: A note on $$k$$-cop, $$l$$-robber games on graphs. Discret. Math. 306(19\u201320), 2492\u20132497 (2006)","journal-title":"Discret. Math."},{"issue":"3","key":"24_CR17","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0195-6698(87)80034-3","volume":"8","author":"YO Hamidoune","year":"1987","unstructured":"Hamidoune, Y.O.: On a pursuit game on Cayley digraphs. Eur. J. Comb. 8(3), 289\u2013295 (1987)","journal-title":"Eur. J. Comb."},{"key":"24_CR18","unstructured":"Hosseini, S.A.: Game of cops and robbers on Eulerian digraphs. Ph.D. thesis, Simon Fraser University (2018)"},{"issue":"2","key":"24_CR19","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. Discret. Math. 341(2), 439\u2013450 (2018)","journal-title":"Discret. Math."},{"key":"24_CR20","doi-asserted-by":"crossref","unstructured":"Isaza, A., Lu, J., Bulitko, V., Greiner, R.: A cover-based approach to multi-agent moving target pursuit. In: Proceedings of the Fourth Artificial Intelligence and Interactive Digital Entertainment Conference, pp. 54\u201359. AAAI Press (2008)","DOI":"10.1609\/aiide.v4i1.18672"},{"key":"24_CR21","unstructured":"Khatri, D., et al.: A study of cops and robbers in oriented graphs. arXiv:1811.06155 (2019)"},{"key":"24_CR22","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. Comb. Theory Ser. B 111, 201\u2013220 (2015)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"9","key":"24_CR23","doi-asserted-by":"publisher","first-page":"2508","DOI":"10.1016\/j.disc.2018.05.025","volume":"341","author":"WB Kinnersley","year":"2018","unstructured":"Kinnersley, W.B.: Bounds on the length of a game of cops and robbers. Discret. Math. 341(9), 2508\u20132518 (2018)","journal-title":"Discret. Math."},{"key":"24_CR24","doi-asserted-by":"crossref","unstructured":"Klein, K., Suri, S.: Catch me if you can: Pursuit and capture in polygonal environments with obstacles. In: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI 2012), vol. 26, pp. 2010\u20132016 (2012)","DOI":"10.1609\/aaai.v26i1.8375"},{"key":"24_CR25","first-page":"65","volume":"51","author":"WF Klostermeyer","year":"1999","unstructured":"Klostermeyer, W.F.: Pushing vertices and orienting edges. Ars Combinatoria 51, 65\u201376 (1999)","journal-title":"Ars Combinatoria"},{"issue":"1","key":"24_CR26","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1002\/(SICI)1097-0118(199805)28:1<13::AID-JGT2>3.0.CO;2-I","volume":"28","author":"WF Klostermeyer","year":"1998","unstructured":"Klostermeyer, W.F., et al.: Hamiltonicity and reversing arcs in digraphs. J. Graph Theory 28(1), 13\u201330 (1998)","journal-title":"J. Graph Theory"},{"issue":"3","key":"24_CR27","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1002\/jgt.22129","volume":"86","author":"P Loh","year":"2017","unstructured":"Loh, P., Oh, S.: Cops and robbers on planar directed graphs. J. Graph Theory 86(3), 329\u2013340 (2017)","journal-title":"J. Graph Theory"},{"key":"24_CR28","first-page":"33","volume":"57","author":"G MacGillivray","year":"2000","unstructured":"MacGillivray, G., Wood, K.L.B.: Re-orienting tournaments by pushing vertices. Ars Combinatoria 57, 33\u201347 (2000)","journal-title":"Ars Combinatoria"},{"key":"24_CR29","first-page":"134","volume":"54","author":"KM Mosesian","year":"1972","unstructured":"Mosesian, K.M.: Strongly Basable graphs (Russian). Akad. Nauk. Armian. SSR Dokl. 54, 134\u2013138 (1972)","journal-title":"Akad. Nauk. Armian. SSR Dokl."},{"key":"24_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1007\/978-3-030-11072-7_19","volume-title":"Distributed Computing by Mobile Entities","author":"N Nisse","year":"2019","unstructured":"Nisse, N.: Network decontamination. In: Flocchini, P., Prencipe, G., Santoro, N. (eds.) Distributed Computing by Mobile Entities. LNCS, vol. 11340, pp. 516\u2013548. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-11072-7_19"},{"key":"24_CR31","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/BFb0070400","volume-title":"Theory and Applications of Graphs","author":"TD Parsons","year":"1978","unstructured":"Parsons, T.D.: Pursuit-evasion in a graph. In: Alavi, Y., Lick, D.R. (eds.) Theory and Applications of Graphs. Lecture Notes in Mathematics, vol. 642, pp. 426\u2013441. Springer, Heidelberg (1978). https:\/\/doi.org\/10.1007\/BFb0070400"},{"key":"24_CR32","unstructured":"Parsons, T.D.: The search number of a connected graph. In: Proceedings of the Ninth Southeastern Conference on Combinatorics, Graph Theory, and Computing, vol. XXI, pp. 549\u2013554. Utilitas Mathematica (1978)"},{"key":"24_CR33","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF00337921","volume":"2","author":"O Pretzel","year":"1985","unstructured":"Pretzel, O.: On graphs that can be oriented as diagrams of ordered sets. Order 2, 25\u201340 (1985)","journal-title":"Order"},{"key":"24_CR34","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/BF00390104","volume":"3","author":"O Pretzel","year":"1986","unstructured":"Pretzel, O.: On reordering graphs by pushing down maximal vertices. Order 3, 135\u2013153 (1986)","journal-title":"Order"},{"key":"24_CR35","doi-asserted-by":"crossref","unstructured":"Pretzel, O.: Orientations and edge functions on graphs. In: Surveys in Combinatorics. London Mathematical Society Lecture Notes, vol. 66, pp. 161\u2013185 (1991)","DOI":"10.1017\/CBO9780511666216.007"},{"issue":"1","key":"24_CR36","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. Comb. Theory Ser. B 58(1), 22\u201333 (1993)","journal-title":"J. Comb. Theory Ser. B"},{"key":"24_CR37","unstructured":"Slivova, V.: Cops and robber game on directed complete graphs. Bachelor\u2019s thesis, Charles University in Prague (2015)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-25211-2_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T09:55:43Z","timestamp":1767261343000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-25211-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031252105","9783031252112"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-25211-2_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"26 January 2023","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":"Gandhinagar","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 February 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 February 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/caldam2023.daiict.ac.in\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}