{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:12:07Z","timestamp":1743066727210,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031492747"},{"type":"electronic","value":"9783031492754"}],"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-49275-4_1","type":"book-chapter","created":{"date-parts":[[2024,1,8]],"date-time":"2024-01-08T12:02:46Z","timestamp":1704715366000},"page":"3-17","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Cops and\u00a0Robbers on\u00a01-Planar Graphs"],"prefix":"10.1007","author":[{"given":"Stephane","family":"Durocher","sequence":"first","affiliation":[]},{"given":"Shahin","family":"Kamali","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4778-3703","authenticated-orcid":false,"given":"Myroslav","family":"Kryven","sequence":"additional","affiliation":[]},{"given":"Fengyi","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Amirhossein","family":"Mashghdoust","sequence":"additional","affiliation":[]},{"given":"Avery","family":"Miller","sequence":"additional","affiliation":[]},{"given":"Pouria","family":"Zamani Nezhad","sequence":"additional","affiliation":[]},{"given":"Ikaro","family":"Penha Costa","sequence":"additional","affiliation":[]},{"given":"Timothy","family":"Zapp","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,1,6]]},"reference":[{"issue":"1","key":"1_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 Applied Mathematics 8(1), 1\u201312 (1984)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"1_CR2","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1007\/s00453-015-0002-1","volume":"74","author":"C Auer","year":"2016","unstructured":"Auer, C., Bachmaier, C., Brandenburg, F.J., Glei\u00dfner, A., Hanauer, K., Neuwirth, D., Reislhuber, J.: Outer $$1$$-planar graphs. Algorithmica 74(4), 1293\u20131320 (2016)","journal-title":"Algorithmica"},{"issue":"1","key":"1_CR3","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1002\/jgt.22187","volume":"88","author":"J Bar\u00e1t","year":"2018","unstructured":"Bar\u00e1t, J., T\u00f3th, G.: Improvements on the density of maximal 1-planar graphs. Journal of Graph Theory 88(1), 101\u2013109 (2018)","journal-title":"Journal of Graph Theory"},{"doi-asserted-by":"crossref","unstructured":"Bekos, M.A., Didimo, W., Liotta, G., Mehrabi, S., Montecchiani, F.: On rac drawings of 1-planar graphs. Theoret. Comput. Sci. 689, 48\u201357 (2017) 10.1016\/j.tcs.2017.05.039, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397517304851","key":"1_CR4","DOI":"10.1016\/j.tcs.2017.05.039"},{"key":"1_CR5","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. Advances in Applied Mathematics 14, 389\u2013403 (1993)","journal-title":"Advances in Applied Mathematics"},{"key":"1_CR6","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.: The Game of Cops and Robbers on Graphs. American Mathematical Society, Student mathematical library (2011)"},{"issue":"1","key":"1_CR7","doi-asserted-by":"publisher","first-page":"79","DOI":"10.4310\/JOC.2022.v13.n1.a4","volume":"13","author":"A Bonato","year":"2019","unstructured":"Bonato, A., Breen, J., Brimkov, B., Carlson, J., English, S., Geneson, J.T., Hogben, L., Perry, K.E., Reinhart, C.: Optimizing the trade-off between number of cops and capture time in cops and robbers. Journal of Combinatorics 13(1), 79\u2013203 (2019)","journal-title":"Journal of Combinatorics"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"47","DOI":"10.4310\/JOC.2020.v11.n1.a3","volume":"11","author":"A Bonato","year":"2020","unstructured":"Bonato, A., Mohar, B.: Topological directions in cops and robbers. Journal of Combinatorics 11, 47\u201364 (2020)","journal-title":"Journal of Combinatorics"},{"doi-asserted-by":"crossref","unstructured":"Brandenburg, F.J., Eppstein, D., Glei\u00dfner, A., Goodrich, M.T., Hanauer, K., Reislhuber, J.: On the density of maximal 1-planar graphs. In: Graph Drawing. pp. 327\u2013338. Springer, Berlin Heidelberg, Berlin, Heidelberg (2013)","key":"1_CR9","DOI":"10.1007\/978-3-642-36763-2_29"},{"doi-asserted-by":"crossref","unstructured":"Chaplick, S., Kryven, M., Liotta, G., L\u00f6ffler, A., Wolff, A.: Beyond outerplanarity. In: In Proceedings of the International Symposium on Graph Drawing and Network Visualization (GD). pp. 546\u2013559. Springer (2018)","key":"1_CR10","DOI":"10.1007\/978-3-319-73915-1_42"},{"issue":"8","key":"1_CR11","doi-asserted-by":"publisher","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-cop win graphs. Discrete Mathematics 312(8), 1421\u20131425 (2012)","journal-title":"Discrete Mathematics"},{"issue":"1","key":"1_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3301281","volume":"52","author":"W Didimo","year":"2019","unstructured":"Didimo, W., Liotta, G., Montecchiani, F.: A survey on graph drawing beyond planarity. ACM Comput. Surv. 52(1), 1\u201337 (2019)","journal-title":"ACM Comput. Surv."},{"unstructured":"Durocher, S., Kamali, S., Kryven, M., Liu, F., Mashghdoust, A., Miller, A., Nezhad, P.Z., Costa, I.P., Zapp, T.: Cops and robbers on 1-planar graphs (2023), arXiv:2309.01001","key":"1_CR13"},{"unstructured":"Eppstein, D.: $$k$$-planar graphs and genus. Computer Science Stack Exchange (2015), https:\/\/mathoverflow.net\/questions\/221968\/k-planar-graphs-and-genus Accessed: 2023\u201306-06","key":"1_CR14"},{"doi-asserted-by":"crossref","unstructured":"Erde, J., Lehner, F.: Improved bounds on the cop number of a graph drawn on a surface. In: Extended Abstracts of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb). pp. 111\u2013116. Springer International Publishing (2021)","key":"1_CR15","DOI":"10.1007\/978-3-030-83823-2_18"},{"doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Golovach, P.A., Kratochv\u00edl, J., Nisse, N., Suchan, K.: Pursuing a fast robber on a graph. Theoret. Comput. Sci. 411(7), 1167\u20131181 (2010) 10.1016\/j.tcs.2009.12.010, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397509008342","key":"1_CR16","DOI":"10.1016\/j.tcs.2009.12.010"},{"doi-asserted-by":"publisher","unstructured":"Gahlawat, H., Zehavi, M.: Parameterized Analysis of the Cops and Robber Game. In: Leroux, J., Lombardy, S., Peleg, D. (eds.) 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), vol. 272, pp. 49:1\u201349:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2023). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2023.49, https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2023\/18583","key":"1_CR17","DOI":"10.4230\/LIPIcs.MFCS.2023.49"},{"issue":"1","key":"1_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-007-0010-x","volume":"49","author":"A Grigoriev","year":"2007","unstructured":"Grigoriev, A., Bodlaender, H.L.: Algorithms for graphs embeddable with few crossings per edge. Algorithmica 49(1), 1\u201311 (2007)","journal-title":"Algorithmica"},{"doi-asserted-by":"crossref","unstructured":"Hong, S.H., Tokuyama, T.: Beyond Planar Graphs. Communications of NII Shonan Meetings (2020)","key":"1_CR19","DOI":"10.1007\/978-981-15-6533-5"},{"issue":"2","key":"1_CR20","first-page":"40","volume":"5","author":"G Joret","year":"2010","unstructured":"Joret, G., Kami\u0144ski, M., Theis, D.O.: The cops and robber game on graphs with forbidden (induced) subgraphs. Contributions to Discrete Mathematics 5(2), 40\u201351 (2010)","journal-title":"Contributions to Discrete Mathematics"},{"doi-asserted-by":"crossref","unstructured":"Kalai, G., Nevo, E., Novik, I.: Bipartite rigidity. Transactions of the American Mathematical Society 368(8), 5515\u20135545 (2016), https:\/\/www.jstor.org\/stable\/tranamermathsoci.368.8.5515","key":"1_CR21","DOI":"10.1090\/tran\/6512"},{"doi-asserted-by":"crossref","unstructured":"Korzhik, V.P., Mohar, B.: Minimal obstructions for 1-immersions and hardness of 1-planarity testing. In: Proceedings of the 16th International Symposium on Graph Drawing (GD). Lecture Notes in Computer Science, vol. 5417, pp. 302\u2013312. Springer (2008)","key":"1_CR22","DOI":"10.1007\/978-3-642-00219-9_29"},{"key":"1_CR23","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.comgeo.2017.07.001","volume":"66","author":"A Lubiw","year":"2017","unstructured":"Lubiw, A., Snoeyink, J., Vosoughpour, H.: Visibility graphs, dismantlability, and the cops and robbers game. Computational Geometry 66, 14\u201327 (2017)","journal-title":"Computational Geometry"},{"unstructured":"Maurer, A., McCauley, J., Valeva, S., Beveridge, A., Islar, V., Saraswat, V.: Cops and Robbers on Planar Graphs. In: Summer 2010 Interdisciplinary Research Experience for Undergraduates (2010)","key":"1_CR24"},{"issue":"1","key":"1_CR25","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0012-365X(97)00165-9","volume":"186","author":"S Neufeld","year":"1998","unstructured":"Neufeld, S., Nowakowski, R.: A game of cops and robbers played on products of graphs. Discrete Mathematics 186(1), 253\u2013268 (1998)","journal-title":"Discrete Mathematics"},{"key":"1_CR26","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0012-365X(83)90160-7","volume":"43","author":"RJ Nowakowski","year":"1983","unstructured":"Nowakowski, R.J., Winkler, P.: Vertex-to-vertex pursuit in a graph. Discrete Mathematics 43, 235\u2013239 (1983)","journal-title":"Discrete Mathematics"},{"unstructured":"Quilliot, A.: Jeux et pointes fixes sur les graphes. Ph.D. thesis, Universit\u00e9 de Paris VI (1978)","key":"1_CR27"},{"issue":"1","key":"1_CR28","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0095-8956(85)90093-0","volume":"38","author":"A Quilliot","year":"1985","unstructured":"Quilliot, A.: A short note about pursuit games played on a graph with a given genus. Journal of Combinatorial Theory, Series B 38(1), 89\u201392 (1985)","journal-title":"Journal of Combinatorial Theory, Series B"},{"doi-asserted-by":"crossref","unstructured":"Ringel, G.: Ein sechsfarbenproblem auf der kugel. In: Abhandlungen aus dem Mathematischen Seminar der Universit\u00e4t Hamburg. vol. 29, pp. 107\u2013117. Springer (1965)","key":"1_CR29","DOI":"10.1007\/BF02996313"},{"doi-asserted-by":"crossref","unstructured":"Schr\u00f6der, B.S.W.: The Copnumber of a Graph is Bounded by [3\/2 genus (G)] + 3, pp. 243\u2013263. Birkh\u00e4user Boston (2001)","key":"1_CR30","DOI":"10.1007\/978-1-4612-1370-3_14"},{"doi-asserted-by":"crossref","unstructured":"Schumacher, V.H.: Zur struktur 1-planarer graphen. Mathematische Nachrichten 125(1), 291\u2013300 (1986) 10.1002\/mana.19861250122, https:\/\/onlinelibrary.wiley.com\/doi\/abs\/10.1002\/mana.19861250122","key":"1_CR31","DOI":"10.1002\/mana.19861250122"},{"issue":"1","key":"1_CR32","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/mana.19861250122","volume":"125","author":"VH Schumacher","year":"1986","unstructured":"Schumacher, V.H.: Zur struktur 1-planarer graphen. Mathematische Nachrichten 125(1), 291\u2013300 (1986)","journal-title":"Mathematische Nachrichten"},{"key":"1_CR33","doi-asserted-by":"publisher","first-page":"1527","DOI":"10.1137\/090746835","volume":"24","author":"Y Suzuki","year":"2010","unstructured":"Suzuki, Y.: Re-embeddings of maximum 1-planar graphs. SIAM Journal on Discrete Mathematics 24, 1527\u20131540 (2010)","journal-title":"SIAM Journal on Discrete Mathematics"},{"doi-asserted-by":"crossref","unstructured":"Wood, D.R., Telle, J.A.: Planar decompositions and the crossing number of graphs with an excluded minor. In: Proceedings of the 14th International Symposium on Graph Drawing (GD). pp. 150\u2013161. Springer (2007)","key":"1_CR34","DOI":"10.1007\/978-3-540-70904-6_16"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49275-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,8]],"date-time":"2024-01-08T12:02:58Z","timestamp":1704715378000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49275-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031492747","9783031492754"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49275-4_1","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":"6 January 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Isola delle Femmine, Palermo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"20 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/gd2023.ing.unipg.it\/\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"100","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":"31","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":"7","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":"31% - 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":"13","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":"11 posters, 2 abstracts of invited talks, and 1 contest report are also included in the GD 2023 proceedings","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)"}}]}}