{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:35:28Z","timestamp":1758267328695},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,8,11]],"date-time":"2009-08-11T00:00:00Z","timestamp":1249948800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1007\/s00453-009-9347-7","type":"journal-article","created":{"date-parts":[[2009,8,10]],"date-time":"2009-08-10T15:47:22Z","timestamp":1249919242000},"page":"19-33","source":"Crossref","is-referenced-by-count":4,"title":["Housing Markets Through Graphs"],"prefix":"10.1007","volume":"58","author":[{"given":"Katar\u00edna","family":"Cechl\u00e1rov\u00e1","sequence":"first","affiliation":[]},{"given":"Tam\u00e1s","family":"Fleiner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,8,11]]},"reference":[{"key":"9347_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-540-30551-4_3","volume-title":"Algorithms and Computation, ISAAC 2004","author":"D. Abraham","year":"2004","unstructured":"Abraham, D., Cechl\u00e1rov\u00e1, K., Manlove, D., Mehlhorn, K.: Pareto optimality in house allocation problems. In: Fleischer, R., Trippen, G. (eds.) Algorithms and Computation, ISAAC 2004, Hong Kong, December 2004. Lecture Notes in Computer Science, vol. 3341, pp. 3\u201315. Springer, Berlin (2004)"},{"key":"9347_CR2","doi-asserted-by":"crossref","unstructured":"Abraham, D., Blum, A., Sandholm, T.: Clearing algorithms for barter exchange markets: enabling nationwide kidney exchanges. In: EC\u201907, 11\u201315 June 2007. San Diego, California","DOI":"10.1145\/1250910.1250954"},{"key":"9347_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-21893-8","volume-title":"Existence and Optimality of Competitive Equilibria","author":"Ch. Aliprantis","year":"1989","unstructured":"Aliprantis, Ch., Brown, D., Burkinshaw, O.: Existence and Optimality of Competitive Equilibria. Springer, Berlin (1989)"},{"issue":"3","key":"9347_CR4","first-page":"353","volume":"31","author":"K. Cechl\u00e1rov\u00e1","year":"2002","unstructured":"Cechl\u00e1rov\u00e1, K., Hajdukov\u00e1, J.: Computational complexity of stable partitions with \u212c-preferences. Int. J. Game Theory 31(3), 353\u2013364 (2002)","journal-title":"Int. J. Game Theory"},{"key":"9347_CR5","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/s001820000053","volume":"29","author":"K. Cechl\u00e1rov\u00e1","year":"2001","unstructured":"Cechl\u00e1rov\u00e1, K., Romero Medina, A.: Stability in coalition formation games. Int. J. Game Theory 29, 487\u2013494 (2001)","journal-title":"Int. J. Game Theory"},{"issue":"5","key":"9347_CR6","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/j.ipl.2003.08.008","volume":"88","author":"S. Fekete","year":"2003","unstructured":"Fekete, S., Skutella, M., Woeginger, G.: The complexity of economic equilibria for house allocation markets. Inf. Process. Lett. 88(5), 219\u2013223 (2003)","journal-title":"Inf. Process. Lett."},{"key":"9347_CR7","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman, San Francisco (1979)"},{"key":"9347_CR8","series-title":"Foundations of Computing","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. Foundations of Computing. MIT Press, Cambridge (1989)"},{"key":"9347_CR9","doi-asserted-by":"crossref","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 J. Comput. 2, 225\u2013231 (1973)","journal-title":"SIAM J. Comput."},{"key":"9347_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/3-540-48523-6_41","volume-title":"Proceedings of ICALP \u201999","author":"K. Iwama","year":"1999","unstructured":"Iwama, K., Manlove, D., Miyazaki, S., Morita, Y.: Stable marriage with incomplete lists and ties. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) Proceedings of ICALP \u201999. Lecture Notes in Computer Science, vol. 1644, pp. 443\u2013452. Springer, Berlin (1999)"},{"key":"9347_CR11","unstructured":"Karzanov, A.V.: On finding maximum flows in network with special structure and some applications (in Russian). In: Matematicheskije Voprosy Upravlenija Proizvodstva, vol. 5, pp. 81\u201394. Moscow (1973)"},{"key":"9347_CR12","volume-title":"Combinatorial Optimization: Theory and Algorithms","author":"B. Korte","year":"2008","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms. Springer, Berlin (2008)"},{"issue":"4","key":"9347_CR13","doi-asserted-by":"crossref","first-page":"861","DOI":"10.1287\/moor.1040.0106","volume":"29","author":"T. Quint","year":"2004","unstructured":"Quint, T., Wako, J.: On houseswapping, the strict core, segmentation and linear programming. Math. Oper. Res. 29(4), 861\u2013877 (2004)","journal-title":"Math. Oper. Res."},{"key":"9347_CR14","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0196-6774(90)90007-2","volume":"11","author":"E. Ronn","year":"1990","unstructured":"Ronn, E.: NP-complete stable matching problems. J. Algorithms 11, 285\u2013304 (1990)","journal-title":"J. Algorithms"},{"key":"9347_CR15","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0304-4068(77)90004-0","volume":"4","author":"A.E. Roth","year":"1977","unstructured":"Roth, A.E., Postlewaite, A.: Weak versus strong domination in a market with indivisible goods. J.\u00a0Math. Econ. 4, 131\u2013137 (1977)","journal-title":"J.\u00a0Math. Econ."},{"key":"9347_CR16","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0304-4068(74)90033-0","volume":"1","author":"L. Shapley","year":"1974","unstructured":"Shapley, L., Scarf, H.: On cores and indivisibility. J. Math. Econ. 1, 23\u201337 (1974)","journal-title":"J. Math. Econ."},{"key":"9347_CR17","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-4068(84)90017-X","volume":"13","author":"J. Wako","year":"1984","unstructured":"Wako, J.: A note on the strong core of a market with indivisible goods. J. Math. Econ. 13, 189\u2013194 (1984)","journal-title":"J. Math. Econ."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-009-9347-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-009-9347-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-009-9347-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:04Z","timestamp":1559137504000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-009-9347-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8,11]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["9347"],"URL":"https:\/\/doi.org\/10.1007\/s00453-009-9347-7","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,8,11]]}}}