{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:23:51Z","timestamp":1758273831046},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642140303"},{"type":"electronic","value":"9783642140310"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14031-0_15","type":"book-chapter","created":{"date-parts":[[2010,6,28]],"date-time":"2010-06-28T09:50:06Z","timestamp":1277718606000},"page":"120-129","source":"Crossref","is-referenced-by-count":1,"title":["Triangle-Free 2-Matchings Revisited"],"prefix":"10.1007","author":[{"given":"Maxim","family":"Babenko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexey","family":"Gusakov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilya","family":"Razenshteyn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","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 logD) time. Combinatorica\u00a021, 5\u201312 (2001)","journal-title":"Combinatorica"},{"key":"15_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BFb0120901","volume":"13","author":"G. Cornu\u00e9jols","year":"1980","unstructured":"Cornu\u00e9jols, G., Pulleyblank, W.R.: Perfect triangle-free 2-matchings. Mathematical Programming Studies\u00a013, 1\u20137 (1980)","journal-title":"Mathematical Programming Studies"},{"issue":"1","key":"15_CR3","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/BF02579340","volume":"3","author":"G. Cornu\u00e9jols","year":"1983","unstructured":"Cornu\u00e9jols, G., Pulleyblank, W.R.: Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem. Combinatorica\u00a03(1), 35\u201352 (1983)","journal-title":"Combinatorica"},{"issue":"4","key":"15_CR4","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An n 5\/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing\u00a02(4), 225\u2013231 (1973)","journal-title":"SIAM Journal on Computing"},{"key":"15_CR5","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching Theory. Akad\u00e9miai Kiad\u00f3, North Holland (1986)"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Micali, S., Vazirani, V.: An $O(\\sqrt{|V|}.|E|)$ algorithm for finding maximum matching in general graphs. In: Proc. 21st IEEE Symp. Foundations of Computer Science, pp. 248\u2013255 (1980)","DOI":"10.1109\/SFCS.1980.12"},{"key":"15_CR7","volume-title":"Combinatorial Optimization","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization. Springer, Berlin (2003)"},{"issue":"1","key":"15_CR8","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/1385-7258(79)90012-X","volume":"41","author":"M. Voorhoeve","year":"1979","unstructured":"Voorhoeve, M.: A lower bound for the permanents of certain (0, 1)-matrices. Nederl. Akad. Wetensch. Indag. Math.\u00a041(1), 83\u201386 (1979)","journal-title":"Nederl. Akad. Wetensch. Indag. Math."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14031-0_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:46:40Z","timestamp":1606186000000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14031-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642140303","9783642140310"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14031-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}