{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T09:44:48Z","timestamp":1766137488309,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030549206"},{"type":"electronic","value":"9783030549213"}],"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"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-54921-3_12","type":"book-chapter","created":{"date-parts":[[2020,7,29]],"date-time":"2020-07-29T11:04:28Z","timestamp":1596020668000},"page":"203-219","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Cops and Robbers on Dynamic Graphs: Offline and Online Case"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Balev","sequence":"first","affiliation":[]},{"given":"Juan Luis","family":"Laredo Jim\u00e9nez","sequence":"additional","affiliation":[]},{"given":"Ioannis","family":"Lamprou","sequence":"additional","affiliation":[]},{"given":"Yoann","family":"Pign\u00e9","sequence":"additional","affiliation":[]},{"given":"Eric","family":"Sanlaville","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,28]]},"reference":[{"key":"12_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":"12_CR2","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0166-218X(84)90012-X","volume":"9","author":"T Andrae","year":"1984","unstructured":"Andrae, T.: Note on a pursuit game played on graphs. Discrete Appl. Math. 9, 111\u2013115 (1984)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"12_CR3","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(4), 389\u2013403 (1993)","journal-title":"Adv. Appl. Math."},{"key":"12_CR4","unstructured":"Berwanger, D.: Graph games with perfect information, Preprint (2013)"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.tcs.2008.02.004","volume":"399","author":"L Blin","year":"2008","unstructured":"Blin, L., Fraigniaud, P., Nisse, N., Vial, S.: Distributed chasing of network intruders. Theor. Comput. Sci. 399, 12\u201337 (2008)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"12_CR6","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/j.jctb.2012.10.002","volume":"103","author":"B Bollob\u00e1s","year":"2013","unstructured":"Bollob\u00e1s, B., Kun, G., Leader, I.: Cops and robbers in a random graph. J. Comb. Theory Ser. B 103(2), 226\u2013236 (2013)","journal-title":"J. Comb. Theory Ser. B"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"3834","DOI":"10.1016\/j.tcs.2010.07.003","volume":"411","author":"A Bonato","year":"2010","unstructured":"Bonato, A., Chiniforooshan, E., Pralat, P.: Cops and Robbers from a distance. Theor. Comput. Sci. 411, 3834\u20133844 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR8","doi-asserted-by":"publisher","DOI":"10.1090\/stml\/061","volume-title":"The Game of Cops and Robbers on Graphs","author":"A Bonato","year":"2011","unstructured":"Bonato, A., Nowakowski, R.J.: The Game of Cops and Robbers on Graphs. American Mathematical Society, Providence (2011)"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Bonato, A., MacGillivray, G.: Characterizations and algorithms for generalized cops and robbers games arXiv:1704.05655 (2017)","DOI":"10.1201\/9781315212135-2"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1080\/15427951.2007.10129149","volume":"4","author":"A Bonato","year":"2007","unstructured":"Bonato, A., Pralat, P., Wang, C.: Pursuit-evasion in models of complex networks. Internet Math. 4, 419\u2013436 (2007)","journal-title":"Internet Math."},{"key":"12_CR11","unstructured":"Casteigts, A.: A journey through dynamic networks (with excursions). Universit\u00e9 de Bordeaux, Habilitation \u00e0 diriger des recherches (2018)"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-642-22450-8_27","volume-title":"Ad-hoc, Mobile, and Wireless Networks","author":"A Casteigts","year":"2011","unstructured":"Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. In: Frey, H., Li, X., Ruehrup, S. (eds.) ADHOC-NOW 2011. LNCS, vol. 6811, pp. 346\u2013359. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22450-8_27"},{"key":"12_CR13","doi-asserted-by":"crossref","first-page":"1421","DOI":"10.1016\/j.disc.2012.01.002","volume":"312","author":"NE Clarke","year":"2012","unstructured":"Clarke, N.E., MacGillivray, G.: Characterizations of $$k$$-copwin graphs. Discrete Math. 312, 1421\u20131425 (2012)","journal-title":"Discrete Math."},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-030-38919-2_6","volume-title":"SOFSEM 2020: Theory and Practice of Computer Science","author":"T Erlebach","year":"2020","unstructured":"Erlebach, T., Spooner, J.T.: A game of cops and robbers on graphs with periodic edge-connectivity. In: Chatzigeorgiou, A., et al. (eds.) SOFSEM 2020. LNCS, vol. 12011, pp. 64\u201375. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-38919-2_6"},{"key":"12_CR15","first-page":"65","volume":"59","author":"SL Fitzpatrick","year":"2001","unstructured":"Fitzpatrick, S.L., Nowakowski, R.J.: Copnumber of graphs with strong isometric dimension two. Ars Comb. 59, 65\u201373 (2001)","journal-title":"Ars Comb."},{"issue":"3","key":"12_CR16","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/0166-218X(87)90033-3","volume":"17","author":"P Frankl","year":"1987","unstructured":"Frankl, P.: Cops and robbers in graphs with large girth and Cayley graphs. Discrete Appl. Math. 17(3), 301\u2013305 (1987)","journal-title":"Discrete Appl. Math."},{"key":"12_CR17","doi-asserted-by":"crossref","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. Discrete Math. 306, 2492\u20132497 (2006)","journal-title":"Discrete Math."},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.physrep.2012.03.001","volume":"519","author":"P Holme","year":"2012","unstructured":"Holme, P., Saram\u00e4ki, J.: Temporal networks. Phys. Rep. 519, 97\u2013125 (2012)","journal-title":"Phys. Rep."},{"key":"12_CR19","unstructured":"Kehagias, A., Konstantinidis, G.: Cops and robbers, game theory and Zermelo\u2019s early results, preprint, arXiv:1407.1647 (2014)"},{"key":"12_CR20","unstructured":"Khaliq, I., Imran, G.: Reachability games revisited. In: SOFTENG, pp. 129\u2013132 (2016)"},{"key":"12_CR21","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/j.jctb.2014.11.002","volume":"111","author":"W Kinnersley","year":"2015","unstructured":"Kinnersley, W.: Cops and robbers is EXPTIME-complete. J. Comb. Theory Ser. B 111, 201\u2013220 (2015)","journal-title":"J. Comb. Theory Ser. B"},{"key":"12_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1007\/978-3-642-31585-5_54","volume-title":"Automata, Languages, and Programming","author":"A Kosowski","year":"2012","unstructured":"Kosowski, A., Li, B., Nisse, N., Suchan, K.: k-chordal graphs: from cops and robber to compact routing via treewidth. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012. LNCS, vol. 7392, pp. 610\u2013622. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31585-5_54"},{"key":"12_CR23","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1002\/jgt.20642","volume":"71","author":"L Lu","year":"2012","unstructured":"Lu, L., Peng, X.: On Meyniel\u2019s conjecture of the cop number. J. Graph Theory 71, 192\u2013205 (2012)","journal-title":"J. Graph Theory"},{"key":"12_CR24","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1002\/rsa.20338","volume":"37","author":"T Luczak","year":"2010","unstructured":"Luczak, T., Pralat, P.: Chasing robbers on random graphs: zigzag theorem. Random Struct. Algorithms 37, 516\u2013524 (2010)","journal-title":"Random Struct. Algorithms"},{"issue":"3","key":"12_CR25","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(3), 307\u2013309 (1987)","journal-title":"Discrete Appl. Math."},{"key":"12_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/3-540-36387-4_2","volume-title":"Automata Logics, and Infinite Games","author":"R Mazala","year":"2002","unstructured":"Mazala, R.: Infinite games. In: Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.) Automata Logics, and Infinite Games. LNCS, vol. 2500, pp. 23\u201338. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36387-4_2"},{"key":"12_CR27","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1080\/15427951.2016.1177801","volume":"12","author":"O Michail","year":"2016","unstructured":"Michail, O.: An introduction to temporal graphs: an algorithmic perspective. Internet Math. 12, 239\u2013280 (2016)","journal-title":"Internet Math."},{"issue":"2","key":"12_CR28","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1145\/3156693","volume":"61","author":"O Michail","year":"2018","unstructured":"Michail, O., Spirakis, P.G.: Elements of the theory of dynamic networks. Commun. ACM 61(2), 72\u201372 (2018)","journal-title":"Commun. ACM"},{"key":"12_CR29","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0012-365X(83)90160-7","volume":"43","author":"R Nowakowski","year":"1983","unstructured":"Nowakowski, R., Winkler, P.: Vertex-to-vertex pursuit in a graph. Discrete Math. 43, 235\u2013239 (1983)","journal-title":"Discrete Math."},{"issue":"2","key":"12_CR30","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1002\/rsa.20587","volume":"48","author":"P Pralat","year":"2016","unstructured":"Pralat, P., Wormald, N.: Meyniel\u2019s conjecture holds for random graphs. Random Struct. Algorithms 48(2), 396\u2013421 (2016)","journal-title":"Random Struct. Algorithms"},{"key":"12_CR31","unstructured":"Quillot, A.: \u00c9tude de quelques probl\u00e9mes sur les graphes et hypergraphes et applications \u00e0 la th\u00e9orie des jeux \u00e0 information compl\u00e9te. Th\u00e9se, UPMC, Paris (1980)"},{"key":"12_CR32","doi-asserted-by":"publisher","first-page":"1438","DOI":"10.1137\/100812963","volume":"25","author":"A Scott","year":"2011","unstructured":"Scott, A., Sudakov, B.: A bound for the cops and robbers problem. SIAM J. Discrete Math. 25, 1438\u20131442 (2011)","journal-title":"SIAM J. Discrete Math."},{"key":"12_CR33","unstructured":"Sugihara, K., Suzuki, I.: On a pursuit-evasion problem related to motion coordination of mobile robots. In: 21st Annual Hawaii International Conference on System Sciences, vol. 4, pp. 218\u2013226 (1988)"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-54921-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T02:44:08Z","timestamp":1619232248000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-54921-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030549206","9783030549213"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-54921-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"28 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SIROCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Structural Information and Communication Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paderborn","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"29 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sirocco2020.cs.uni-paderborn.de\/","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","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41","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":"19","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":"46% - 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":"3","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":"11","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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}