{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:12:15Z","timestamp":1725563535360},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642157806"},{"type":"electronic","value":"9783642157813"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15781-3_11","type":"book-chapter","created":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T11:40:03Z","timestamp":1283341203000},"page":"123-134","source":"Crossref","is-referenced-by-count":3,"title":["Robust Matchings and Matroid Intersections"],"prefix":"10.1007","author":[{"given":"Ryo","family":"Fujita","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yusuke","family":"Kobayashi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuhisa","family":"Makino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","first-page":"69","volume-title":"Combinatorial Structures and Their Applications","author":"J. Edmonds","year":"1970","unstructured":"Edmonds, J.: Submodular Functions, Matroids, and Certain Polyhedra. In: Guy, R., Hanani, H., Sauer, N., Sch\u00f6nheim, J. (eds.) Combinatorial Structures and Their Applications, pp. 69\u201387. Gordon and Breach, New York (1970)"},{"key":"11_CR2","unstructured":"Fukunaga, T., Halldorsson, M., Nagamochi, H.: Robust cost colorings. In: SODA 2008, pp. 1204\u20131212 (2008)"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1137\/0204035","volume":"4","author":"M.R. Garey","year":"1975","unstructured":"Garey, M.R., Johnson, D.S.: Complexity results for multiprocessor scheduling under resource constraints. SIAM J. Compt.\u00a04, 397\u2013411 (1975)","journal-title":"SIAM J. Compt."},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1137\/S0895480198332156","volume":"15","author":"R. Hassin","year":"2002","unstructured":"Hassin, R., Rubinstein, S.: Robust matchings. SIAM J. Discrete Math.\u00a015, 530\u2013537 (2002)","journal-title":"SIAM J. Discrete Math."},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1145\/1150334.1150341","volume":"2","author":"R. Hassin","year":"2006","unstructured":"Hassin, R., Segev, D.: Robust subgraphs for trees and paths. ACM Transactions on Algorithms\u00a02, 263\u2013281 (2006)","journal-title":"ACM Transactions on Algorithms"},{"key":"11_CR6","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/net.1975.5.1.45","volume":"5","author":"R.M. Karp","year":"1975","unstructured":"Karp, R.M.: On the computational complexity of combinatorial problems. Networks\u00a05, 45\u201368 (1975)","journal-title":"Networks"},{"key":"11_CR7","volume-title":"Combinatorial Optimization","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15781-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,19]],"date-time":"2019-03-19T06:25:47Z","timestamp":1552976747000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15781-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157806","9783642157813"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15781-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}