{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T20:06:31Z","timestamp":1768680391775,"version":"3.49.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1007\/s00453-009-9356-6","type":"journal-article","created":{"date-parts":[[2009,8,28]],"date-time":"2009-08-28T14:57:51Z","timestamp":1251471471000},"page":"137-150","source":"Crossref","is-referenced-by-count":23,"title":["Circular Stable Matching and 3-way Kidney Transplant"],"prefix":"10.1007","volume":"58","author":[{"given":"Chien-Chung","family":"Huang","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,8,29]]},"reference":[{"key":"9356_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, D., Blum, A., Sandholm, T.: Clearing algorithms for barter exchange markets: Enabling nationwide kidney exchanges. In: ACM E-commerce (2007)","DOI":"10.1145\/1250910.1250954"},{"key":"9356_CR2","author":"P. Bir\u00f3","year":"2009","unstructured":"Bir\u00f3, P., McDermid, E.: Three-sided stable matchings with cyclic preferences. Algorithmica (2009). doi: 10.1007\/s00453-009-9315-2 , this issue","journal-title":"Algorithmica"},{"issue":"1\u20133","key":"9356_CR3","first-page":"1","volume":"289","author":"E. Boros","year":"2004","unstructured":"Boros, E., Gurvich, V., Jaslar, S., Krasner, D.: Stable matchings in three-sided systems with cyclic preferences. Discrete Math. 289(1\u20133), 1\u201310 (2004)","journal-title":"Discrete Math."},{"key":"9356_CR4","unstructured":"Cechl\u00e1rov\u00e1, K., Fleiner, T., Manlove, D.: The kidney exchange game. In: The 8th International Symposium on Operations Research in Slovenia, pp. 77\u201383 (2005)"},{"issue":"1","key":"9356_CR5","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.mathsocsci.2006.03.005","volume":"52","author":"K. Eriksson","year":"2006","unstructured":"Eriksson, K., Sj\u00f6strand, J., Strimling, P.: Three-dimensional stable matching with cyclic preferences. Math. Soc. Sci. 52(1), 77\u201387 (2006)","journal-title":"Math. Soc. Sci."},{"issue":"1","key":"9356_CR6","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","volume":"69","author":"D. Gale","year":"1962","unstructured":"Gale, D., Shapley, L.: College admissions and the stability of marriage. Am. Math. Monthly 69(1), 9\u201315 (1962)","journal-title":"Am. Math. Monthly"},{"key":"9356_CR7","volume-title":"Computers and Intractability","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability. Freeman, New York (1979)"},{"issue":"8","key":"9356_CR8","first-page":"1914\u20131921","volume":"5","author":"S. Gentry","year":"2004","unstructured":"Gentry, S., Segev, D., Montgomery, R.: A comparison of populations served by kidney paired donation and list paired donation. Am. J. Transplant. 5(8), 1914\u20131921 (2004)","journal-title":"Am. J. Transplant."},{"key":"9356_CR9","volume-title":"The Stable Marriage Problem","author":"D. Gusfield","year":"1989","unstructured":"Gusfield, D., Irving, R.: The Stable Marriage Problem. MIT Press, Cambridge (1989)"},{"key":"9356_CR10","unstructured":"Huang, C.-C.: Two\u2019s company, three\u2019s a crowd: stable family and threesome roommates problems. In: 15th Annual European Symposium on Algorithms (ESA) (2007)"},{"key":"9356_CR11","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0166-218X(92)00179-P","volume":"48","author":"R. Irving","year":"1994","unstructured":"Irving, R.: Stable marriage and indifference. Discrete Appl. Math. 48, 261\u2013272 (1994)","journal-title":"Discrete Appl. Math."},{"key":"9356_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ipl.2007.02.003","volume":"103","author":"R. Irving","year":"2007","unstructured":"Irving, R.: The cycle roommates problem: a hard case of kidney exchange. Inform. Process. Lett. 103, 1\u20134 (2007)","journal-title":"Inform. Process. Lett."},{"key":"9356_CR13","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1137\/0215048","volume":"15","author":"R. Irving","year":"1986","unstructured":"Irving, R., Leather, P.: The complexity of counting stable marriages. SIAM J. Comput. 15, 655\u2013667 (1986)","journal-title":"SIAM J. Comput."},{"key":"9356_CR14","doi-asserted-by":"crossref","unstructured":"Karp, R.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85\u2013103 (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"9356_CR15","unstructured":"Knuth, D.: Mariages stables et leurs relations avec d\u2019autre probl\u00e8mes combinatoires. Les Presses de l\u2019universit\u00e9 de Montr\u00e9al (1976)"},{"issue":"2","key":"9356_CR16","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1137\/0404023","volume":"4","author":"C. Ng","year":"1991","unstructured":"Ng, C., Hirschberg, D.: Three-dimensional stable matching problems. SIAM J. Discrete Math. 4(2), 245\u2013252 (1991)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"9356_CR17","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1162\/0033553041382157","volume":"119","author":"A. Roth","year":"2004","unstructured":"Roth, A., Sonmez, T., Utku Unver, M.: Kidney exchange. Quart. J. Econ. 119(2), 457\u2013488 (2004)","journal-title":"Quart. J. Econ."},{"issue":"5","key":"9356_CR18","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1097\/01.tp.0000195775.77081.25","volume":"81","author":"A. Roth","year":"2006","unstructured":"Roth, A., Sonmez, T., Utku Unver, M.: Increasing the opportunity of live kidney donation by matching for two and three way exchanges. Transplantation 81(5), 773\u2013782 (2006)","journal-title":"Transplantation"},{"issue":"3","key":"9356_CR19","doi-asserted-by":"crossref","first-page":"828","DOI":"10.1257\/aer.97.3.828","volume":"97","author":"A. Roth","year":"2007","unstructured":"Roth, A., Sonmez, T., Utku Unver, M.: Efficient kidney exchange: coincidence of wants in markets with compatibility-based preferences. Am. Econ. Rev. 97(3), 828\u2013851 (2007)","journal-title":"Am. Econ. Rev."},{"issue":"15","key":"9356_CR20","doi-asserted-by":"crossref","first-page":"1883","DOI":"10.1001\/jama.293.15.1883","volume":"293","author":"D. Segev","year":"2005","unstructured":"Segev, D., Gentry, S., Waren, D., Reeb, B., Montgomery, R.: Kidney paired donation and optimizing the use of live donor organs. J. Am. Med. Assoc. 293(15), 1883\u20131890 (2005)","journal-title":"J. Am. Med. Assoc."},{"issue":"4","key":"9356_CR21","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1137\/S0097539789169483","volume":"23","author":"A. Subramanian","year":"1994","unstructured":"Subramanian, A.: A new approach to stable matching problems. SIAM J. Comput. 23(4), 671\u2013700 (1994)","journal-title":"SIAM J. Comput."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-009-9356-6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T08:01:53Z","timestamp":1558512113000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-009-9356-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8,29]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["9356"],"URL":"https:\/\/doi.org\/10.1007\/s00453-009-9356-6","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,8,29]]}}}