{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T15:09:28Z","timestamp":1787497768786,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030604394","type":"print"},{"value":"9783030604400","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":"https:\/\/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":"https:\/\/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-60440-0_20","type":"book-chapter","created":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T05:03:18Z","timestamp":1602738198000},"page":"248-260","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Finding Large Matchings in 1-Planar Graphs of Minimum Degree 3"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9003-3783","authenticated-orcid":false,"given":"Therese","family":"Biedl","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7791-3604","authenticated-orcid":false,"given":"Fabian","family":"Klute","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,10,9]]},"reference":[{"issue":"1","key":"20_CR1","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"BS Baker","year":"1994","unstructured":"Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41(1), 153\u2013180 (1994). https:\/\/doi.org\/10.1145\/174644.174650","journal-title":"J. ACM"},{"issue":"1","key":"20_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00224-005-1254-y","volume":"39","author":"H Bast","year":"2006","unstructured":"Bast, H., Mehlhorn, K., Sch\u00e4fer, G., Tamaki, H.: Matching algorithms are fast in sparse random graphs. Theor. Comput. Syst. 39(1), 3\u201314 (2006). https:\/\/doi.org\/10.1007\/s00224-005-1254-y","journal-title":"Theor. Comput. Syst."},{"key":"20_CR3","unstructured":"Berge, C.: Graphs and Hypergraphs, 2nd edn. North-Holland (1976). Translated from Graphes et Hypergraphes, Dunod (1970)"},{"issue":"1","key":"20_CR4","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1006\/jagm.2000.1132","volume":"38","author":"T Biedl","year":"2001","unstructured":"Biedl, T., Bose, P., Demaine, E.D., Lubiw, A.: Efficient algorithms for Petersen\u2019s matching theorem. J. Algorithms 38(1), 110\u2013134 (2001). https:\/\/doi.org\/10.1006\/jagm.2000.1132","journal-title":"J. Algorithms"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Biedl, T., Klute, F.: Finding large matchings in 1-planar graphs of minimum degree 3 (2020). CoRR 2002.11818. http:\/\/arxiv.org\/abs\/2002.11818","DOI":"10.1007\/978-3-030-60440-0_20"},{"key":"20_CR6","unstructured":"Biedl, T., Wittnebel, J.: Matchings in 1-planar graphs with large minimum degree (2019). CoRR 1911.04603. http:\/\/arxiv.org\/abs\/1911.04603"},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"KS Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13, 335\u2013379 (1976). https:\/\/doi.org\/10.1016\/S0022-0000(76)80045-1","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"20_CR8","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0196-6774(89)90012-6","volume":"10","author":"N Chiba","year":"1989","unstructured":"Chiba, N., Nishizeki, T.: The Hamiltonian cycle problem is linear-time solvable for $$4$$-connected planar graphs. J. Algorithms 10(2), 187\u2013211 (1989). https:\/\/doi.org\/10.1016\/0196-6774(89)90012-6","journal-title":"J. Algorithms"},{"issue":"1","key":"20_CR9","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s004930170002","volume":"21","author":"R Cole","year":"2001","unstructured":"Cole, R., Ost, K., Schirra, S.: Edge-coloring bipartite multigraphs in $$O(E\\log D)$$ time. Combinatorica 21(1), 5\u201312 (2001). https:\/\/doi.org\/10.1007\/s004930170002","journal-title":"Combinatorica"},{"issue":"6","key":"20_CR10","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1145\/1101821.1101823","volume":"52","author":"ED Demaine","year":"2005","unstructured":"Demaine, E.D., Fomin, F.V., Hajiaghayi, M., Thilikos, D.M.: Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs. J. ACM 52(6), 866\u2013893 (2005). https:\/\/doi.org\/10.1145\/1101821.1101823","journal-title":"J. ACM"},{"key":"20_CR11","series-title":"Graduate Texts in Mathematics","volume-title":"Graph Theory","author":"R Diestel","year":"2012","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173, 4th edn. Springer, Heidelberg (2012)","edition":"4"},{"key":"20_CR12","doi-asserted-by":"publisher","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69B","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J.: Maximum matchings and a polyhedron with 0,1-vertices. J. Res. Natl. Bur. Stan. 69B, 125\u2013130 (1965)","journal-title":"J. Res. Natl. Bur. Stan."},{"issue":"32","key":"20_CR13","doi-asserted-by":"publisher","first-page":"4092","DOI":"10.1016\/j.tcs.2010.06.012","volume":"412","author":"R Franke","year":"2011","unstructured":"Franke, R., Rutter, I., Wagner, D.: Computing large matchings in planar graphs with fixed minimum degree. Theor. Comput. Sci. 412(32), 4092\u20134099 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2010.06.012","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"20_CR14","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). https:\/\/doi.org\/10.1007\/s00453-007-0010-x","journal-title":"Algorithmica"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Hall, M., Jr.: An algorithm for distinct representatives. Am. Math. Mon. 63, 716\u2013717 (1956)","DOI":"10.2307\/2309562"},{"key":"20_CR16","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"JE Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An $$n^{5\/2}$$ algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2, 225\u2013231 (1973). https:\/\/doi.org\/10.1137\/0202019","journal-title":"SIAM J. Comput."},{"issue":"4","key":"20_CR17","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"JE Hopcroft","year":"1974","unstructured":"Hopcroft, J.E., Tarjan, R.E.: Efficient planarity testing. J. ACM 21(4), 549\u2013568 (1974). https:\/\/doi.org\/10.1145\/321850.321852","journal-title":"J. ACM"},{"key":"20_CR18","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.cosrev.2017.06.002","volume":"25","author":"SG Kobourov","year":"2017","unstructured":"Kobourov, S.G., Liotta, G., Montecchiani, F.: An annotated bibliography on 1-planarity. Comput. Sci. Rev. 25, 49\u201367 (2017). https:\/\/doi.org\/10.1016\/j.cosrev.2017.06.002","journal-title":"Comput. Sci. Rev."},{"key":"20_CR19","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching Theory. Annals of Discrete Mathematics, p. 29. North-Holland Publishing Co., Amsterdam (1986)"},{"key":"20_CR20","doi-asserted-by":"publisher","unstructured":"Micali, S., Vazirani, V.V.: An $${O(\\sqrt{|V|}|E|)}$$ algoithm for finding maximum matching in general graphs. In: Proceedings of the 21st Annual Symposium on Foundations of Computer Science (FOCS 1980), pp. 17\u201327. IEEE Computer Society (1980). https:\/\/doi.org\/10.1109\/SFCS.1980.12","DOI":"10.1109\/SFCS.1980.12"},{"issue":"3","key":"20_CR21","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0012-365X(79)90133-X","volume":"28","author":"T Nishizeki","year":"1979","unstructured":"Nishizeki, T., Baybars, I.: Lower bounds on the cardinality of the maximum matchings of planar graphs. Discrete Math. 28(3), 255\u2013267 (1979). https:\/\/doi.org\/10.1016\/0012-365X(79)90133-X","journal-title":"Discrete Math."},{"key":"20_CR22","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF02392606","volume":"15","author":"J Petersen","year":"1891","unstructured":"Petersen, J.: Die Theorie der regul\u00e4ren graphs (The theory of regular graphs). Acta Math. 15, 193\u2013220 (1891)","journal-title":"Acta Math."},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"Schaefer, M.: Crossing Numbers of Graphs. CRC Press, Boca Raton (2017)","DOI":"10.1201\/9781315152394"},{"key":"20_CR24","doi-asserted-by":"publisher","first-page":"99","DOI":"10.2307\/1992980","volume":"82","author":"WT Tutte","year":"1956","unstructured":"Tutte, W.T.: A theorem on planar graphs. Trans. Am. Math. Soc. 82, 99\u2013116 (1956). https:\/\/doi.org\/10.2307\/1992980","journal-title":"Trans. Am. Math. Soc."},{"key":"20_CR25","unstructured":"Vazirani, V.V.: A simplification of the MV matching algorithm and its proof. CoRR, abs\/1210.4594 (2012). http:\/\/arxiv.org\/abs\/1210.4594"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-60440-0_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T14:01:50Z","timestamp":1710252110000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-60440-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030604394","9783030604400"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-60440-0_20","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":"9 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leeds","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"24 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"46","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algorithms.leeds.ac.uk\/wg2020\/","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":"94","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":"32","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":"34% - 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.7","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.1","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)"}}]}}