{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:12:39Z","timestamp":1725495159891},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540429852"},{"type":"electronic","value":"9783540456780"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45678-3_27","type":"book-chapter","created":{"date-parts":[[2007,11,15]],"date-time":"2007-11-15T11:12:14Z","timestamp":1195125134000},"page":"308-319","source":"Crossref","is-referenced-by-count":2,"title":["Tight Bounds on Maximal and Maximum Matchings"],"prefix":"10.1007","author":[{"given":"Therese","family":"Biedl","sequence":"first","affiliation":[]},{"given":"Erik D.","family":"Demaine","sequence":"additional","affiliation":[]},{"given":"Christian A.","family":"Duncan","sequence":"additional","affiliation":[]},{"given":"Rudolf","family":"Fleischer","sequence":"additional","affiliation":[]},{"given":"Stephen G.","family":"Kobourov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,12,4]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"C. Berge. Two theorems in graph theory. Proc. Nat. Acad. Sci. U. S. A., 43:842\u2013844, 1957. 311","DOI":"10.1073\/pnas.43.9.842"},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1006\/jagm.2000.1132","volume":"38","author":"T. Biedl","year":"2001","unstructured":"T. Biedl, P. Bose, E. Demaine, and A. Lubiw. Effcient algorithms for Petersen\u2019s theorem. J. Algorithms, 38:110\u2013134, 2001.","journal-title":"J. Algorithms"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"J. Bondy and U. Murty. Graph Theory and Applications. Amerian Elsevier Publishing Co., 1976.","DOI":"10.1007\/978-1-349-03521-2"},{"key":"27_CR4","unstructured":"R. Cole, K. Ost, and S. Schirra. Edge-coloring bipartite multigraphs in O(E logD) time. Technical Report TR1999-792, Department of Computer Science, New York University, September 1999."},{"key":"27_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-46648-7_19","volume-title":"Graph Drawing (GD\u201999)","author":"C. Duncan","year":"1999","unstructured":"C. Duncan, M. Goodrich, and S. Kobourov. Planarity-preserving clustering and embedding for large planar graphs. In Graph Drawing (GD\u201999), volume 1731 of Lecture Notes in Computer Science, pages 186\u2013196. Springer-Verlag, 1999. Accepted for publication in Computational Geometry: Theory and Applications."},{"key":"27_CR6","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","volume":"10","author":"P. Hall","year":"1935","unstructured":"P. Hall. On representation of subsets. Journal of the London Mathematical Society, 10:26\u201330, 1935.","journal-title":"Journal of the London Mathematical Society"},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J. E. Hopcroft","year":"1973","unstructured":"J. E. Hopcroft and R. M. Karp. An n 5\/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput., 2:225\u2013231, 1973.","journal-title":"SIAM J. Comput."},{"issue":"3","key":"27_CR8","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1142\/S0218195997000132","volume":"7","author":"G. Kant","year":"1997","unstructured":"G. Kant. A more compact visibility representation. Internat. J. Comput. Geom. Appl., 7(3):197\u2013210, 1997.","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/BF01456961","volume":"77","author":"D. K\u00f6nig","year":"1916","unstructured":"D. K\u00f6nig. \u00dcber Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre. Mathematische Annalen, 77:453\u2013465, 1916.","journal-title":"Mathematische Annalen"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"S. Micali and V. V. Vazirani. An O(p\u221a V. E ) algorithm for finding maximum matching in general graphs. In 21st Annual Symposium on Foundations of Computer Science, pages 17\u201327, New York, 1980. Institute of Electrical and Electronics Engineers Inc. (IEEE).","DOI":"10.1109\/SFCS.1980.12"},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF02392606","volume":"15","author":"J. Petersen","year":"1891","unstructured":"J. Petersen. Die Theorie der regul\u00e4ren graphs (The theory of regular graphs). Acta Mathematica, 15:193\u2013220, 1891.","journal-title":"Acta Mathematica"},{"issue":"3","key":"27_CR12","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1137\/S0097539796299266","volume":"28","author":"A. Schrijver","year":"1999","unstructured":"A. Schrijver. Bipartite edge coloring in O(\u0394m) time. SIAM J. Comput., 28(3):841\u2013846, 1999.","journal-title":"SIAM J. Comput."},{"key":"27_CR13","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1112\/jlms\/s1-22.2.107","volume":"22","author":"W. T. Tutte","year":"1947","unstructured":"W. T. Tutte. The factorization of linear graphs. Journal of the London Mathematical Society, 22:107\u2013111, 1947.","journal-title":"Journal of the London Mathematical Society"},{"key":"27_CR14","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1090\/S0002-9947-1956-0081471-8","volume":"82","author":"W. T. Tutte","year":"1956","unstructured":"W. T. Tutte. A theorem on planar graphs. Trans. Amer. Math. Soc., 82:99\u2013116, 1956.","journal-title":"Trans. Amer. Math. Soc."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45678-3_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T09:18:31Z","timestamp":1556961511000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45678-3_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429852","9783540456780"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45678-3_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]}}}