{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:28:18Z","timestamp":1725863298624},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319449524"},{"type":"electronic","value":"9783319449531"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-44953-1_52","type":"book-chapter","created":{"date-parts":[[2016,8,22]],"date-time":"2016-08-22T11:12:23Z","timestamp":1471864343000},"page":"832-840","source":"Crossref","is-referenced-by-count":0,"title":["Morphing Between Stable Matching Problems"],"prefix":"10.1007","author":[{"given":"Ciaran","family":"McCreesh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"Prosser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Trimble","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,23]]},"reference":[{"key":"52_CR1","doi-asserted-by":"crossref","first-page":"036113","DOI":"10.1103\/PhysRevE.71.036113","volume":"71","author":"V Batagelj","year":"2005","unstructured":"Batagelj, V., Brandes, U.: Efficient generation of large random networks. Phys. Rev. E 71, 036113 (2005)","journal-title":"Phys. Rev. E"},{"key":"52_CR2","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1145\/364520.364540","volume":"7","author":"R Durstenfeld","year":"1964","unstructured":"Durstenfeld, R.: Algorithm 235: random permutation. CACM 7, 420 (1964)","journal-title":"CACM"},{"key":"52_CR3","doi-asserted-by":"crossref","first-page":"9","DOI":"10.2307\/2312726","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Mon. 69, 9\u201315 (1962)","journal-title":"Am. Math. Mon."},{"key":"52_CR4","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0166-218X(85)90074-5","volume":"11","author":"D Gale","year":"1985","unstructured":"Gale, D., Sotomayor, M.: Some remarks on the stable matching problem. Discrete Appl. Math. 11, 223\u2013232 (1985)","journal-title":"Discrete Appl. Math."},{"key":"52_CR5","unstructured":"Gent, I.P., Hoos, H.H., Prosser, P., Walsh, T.: Morphing: combining structure and randomness. In: Proceedings of the Sixteenth National Conference on Artificial Intelligence, pp. 654\u2013660 (1999)"},{"key":"52_CR6","volume-title":"The Stable Marriage Problem: Structure and Algorithms","author":"D Gusfield","year":"1989","unstructured":"Gusfield, D., Irving, R.W.: The Stable Marriage Problem: Structure and Algorithms. The MIT Press, Cambridge (1989)"},{"issue":"4","key":"52_CR7","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1016\/0196-6774(85)90033-1","volume":"6","author":"WR Irving","year":"1985","unstructured":"Irving, W.R.: An efficient algorithm for the stable roommates problem. J. Algorithms 6(4), 577\u2013595 (1985)","journal-title":"J. Algorithms"},{"key":"52_CR8","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of small-world networks. Nature 393, 440\u2013442 (1998)","journal-title":"Nature"},{"key":"52_CR9","series-title":"Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1142\/8591","volume-title":"Algorithmics of Matching under Preferences","author":"D Manlove","year":"2013","unstructured":"Manlove, D.: Algorithmics of Matching under Preferences. Theoretical Computer Science, vol. 2. World Scientific, Singapore (2013)"},{"key":"52_CR10","doi-asserted-by":"crossref","unstructured":"Mertens, S.: Random stable matchings. J. Stat. Mech. Theory Exp. (10), P10008 (2005)","DOI":"10.1088\/1742-5468\/2005\/10\/P10008"},{"issue":"6","key":"52_CR11","doi-asserted-by":"crossref","first-page":"P06034","DOI":"10.1088\/1742-5468\/2015\/06\/P06034","volume":"2015","author":"S Mertens","year":"2015","unstructured":"Mertens, S.: Small random instances of the stable roommates problem. J. Stat. Mech. Theory Exp. 2015(6), P06034 (2015)","journal-title":"J. Stat. Mech. Theory Exp."},{"issue":"1","key":"52_CR12","doi-asserted-by":"crossref","first-page":"P01020","DOI":"10.1088\/1742-5468\/2015\/01\/P01020","volume":"2015","author":"S Mertens","year":"2015","unstructured":"Mertens, S.: Stable roommates problem with random preferences. J. Stat. Mech. Theory Exp. 2015(1), P01020 (2015)","journal-title":"J. Stat. Mech. Theory Exp."},{"key":"52_CR13","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1137\/0219004","volume":"19","author":"C Ng","year":"1990","unstructured":"Ng, C., Hirschberg, D.S.: Lower bounds for the stable marriage problem and its variants. SIAM J. Comput. 19, 71\u201377 (1990)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"52_CR14","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1002\/rsa.3240050307","volume":"5","author":"B Pittel","year":"1994","unstructured":"Pittel, B., Irving, R.W.: An upper bound for the solvability of a random stable roommates instance. Random Struct. Algorithms 5(3), 465\u2013487 (1994)","journal-title":"Random Struct. Algorithms"},{"key":"52_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/978-3-319-07046-9_2","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"P Prosser","year":"2014","unstructured":"Prosser, P.: Stable roommates and constraint programming. In: Simonis, H. (ed.) CPAIOR 2014. LNCS, vol. 8451, pp. 15\u201328. Springer, Heidelberg (2014)"},{"issue":"6","key":"52_CR16","doi-asserted-by":"crossref","first-page":"991","DOI":"10.1086\/261272","volume":"92","author":"AE Roth","year":"1984","unstructured":"Roth, A.E.: The evolution of the labor market for medical interns and residents: a case study in game theory. J. Polit. Econ. 92(6), 991\u20131016 (1984)","journal-title":"J. Polit. Econ."},{"key":"52_CR17","series-title":"Econometric Society Monographs","doi-asserted-by":"crossref","DOI":"10.1017\/CCOL052139015X","volume-title":"Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis","author":"AE Roth","year":"1990","unstructured":"Roth, A.E., Sotomayor, M.A.O.: Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis. Econometric Society Monographs, vol. 18. Cambridge University Press, Cambridge (1990)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44953-1_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T17:07:55Z","timestamp":1498324075000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44953-1_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319449524","9783319449531"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44953-1_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}