{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:18:39Z","timestamp":1725535119366},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642028816"},{"type":"electronic","value":"9783642028823"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02882-3_50","type":"book-chapter","created":{"date-parts":[[2009,7,10]],"date-time":"2009-07-10T10:49:21Z","timestamp":1247222961000},"page":"506-515","source":"Crossref","is-referenced-by-count":8,"title":["Popular Matchings: Structure and Algorithms"],"prefix":"10.1007","author":[{"given":"Eric","family":"McDermid","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert W.","family":"Irving","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"50_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, D.J., Irving, R.W., Kavitha, T., Mehlhorn, K.: Popular matchings. SIAM Journal on Computing\u00a037, 1030\u20131045 (2007)","DOI":"10.1137\/06067328X"},{"key":"50_CR2","doi-asserted-by":"crossref","unstructured":"Abraham, D.J., Kavitha, T.: Dynamic matching markets and voting paths. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol.\u00a04059, pp. 65\u201376. Springer, Heidelberg (2006)","DOI":"10.1007\/11785293_9"},{"key":"50_CR3","doi-asserted-by":"crossref","unstructured":"Huang, C.-C., Kavitha, T., Michail, D., Nasre, M.: Bounded unpopularity matchings. In: Gudmundsson, J. (ed.) SWAT 2008. LNCS, vol.\u00a05124, pp. 127\u2013137. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-69903-3_13"},{"key":"50_CR4","doi-asserted-by":"crossref","unstructured":"Irving, R.W., Kavitha, T., Mehlhorn, K., Michail, D., Paluch, K.: Rank-maximal matchings. ACM Transactions on Algorithms\u00a02, 602\u2013610 (2006)","DOI":"10.1145\/1198513.1198520"},{"key":"50_CR5","unstructured":"Kavitha, T., Nasre, M.: Optimal Popular Matchings. In: Proceedings of MATCH-UP: Matching Under Preferences - Algorithms and Complexity, satellite workshop of ICALP 2008 (2008)"},{"key":"50_CR6","doi-asserted-by":"crossref","unstructured":"Mahdian, M.: Random popular matchings. In: 7th ACM Conference on Electronic Commerce, pp. 238\u2013242 (2006)","DOI":"10.1145\/1134707.1134733"},{"key":"50_CR7","doi-asserted-by":"crossref","unstructured":"Manlove, D.F., Sng, C.T.S.: Popular Matchings in the capacitated house allocation problem. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 492\u2013503. Springer, Heidelberg (2006)","DOI":"10.1007\/11841036_45"},{"key":"50_CR8","doi-asserted-by":"crossref","unstructured":"McCutchen, R.: The least-unpopularity-factor and least-unpopularity-margin criteria for matching problems with one-sided preferences. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol.\u00a04957, pp. 593\u2013604. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-78773-0_51"},{"key":"50_CR9","unstructured":"McDermid, E., Irving, R.: Popular Matchings: Structure and Algorithms, Technical Report TR-2008-292, Department of Computing Science, University of Glasgow (November 2008)"},{"key":"50_CR10","doi-asserted-by":"crossref","unstructured":"Mestre, J.: Weighted popular matchings. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 715\u2013726. Springer, Heidelberg (2006)","DOI":"10.1007\/11786986_62"}],"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-02882-3_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T03:10:08Z","timestamp":1552101008000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02882-3_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642028816","9783642028823"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02882-3_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}