{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:33:25Z","timestamp":1759638805540},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642169250"},{"type":"electronic","value":"9783642169267"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16926-7_7","type":"book-chapter","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T07:48:26Z","timestamp":1289375306000},"page":"51-62","source":"Crossref","is-referenced-by-count":5,"title":["On Stable Matchings and Flows"],"prefix":"10.1007","author":[{"given":"Tam\u00e1s","family":"Fleiner","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"7_CR1","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1287\/moor.27.3.485.310","volume":"27","author":"M. Ba\u00efou","year":"2002","unstructured":"Ba\u00efou, M., Balinski, M.: The stable allocation (or ordinal transportation) problem. Math. Oper. Res.\u00a027(3), 485\u2013503 (2002)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"7_CR2","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1145\/1077464.1077474","volume":"1","author":"K. Cechl\u00e1rov\u00e1","year":"2005","unstructured":"Cechl\u00e1rov\u00e1, K., Fleiner, T.: On a generalization of the stable roommates problem. ACM Trans. Algorithms\u00a01(1), 143\u2013156 (2005)","journal-title":"ACM Trans. Algorithms"},{"key":"7_CR3","unstructured":"Dean, B.C., Munshi, S.: Faster algorithms for stable allocation problems. In: Proceedings of the MATCH-UP (Matching Under Preferences) Workshop at ICALP 2008, Reykjavik, pp. 133\u2013144 (2008)"},{"issue":"1","key":"7_CR4","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1287\/moor.28.1.103.14256","volume":"28","author":"T. Fleiner","year":"2003","unstructured":"Fleiner, T.: A fixed point approach to stable matchings and some applications. Mathematics of Operations Research\u00a028(1), 103\u2013126 (2003)","journal-title":"Mathematics of Operations Research"},{"key":"7_CR5","unstructured":"Fleiner, T.: On stable matchings and flows. Technical Report TR-2009-11, Egerv\u00e1ry Research Group, Budapest (2009), \n                    \n                      http:\/\/www.cs.elte.hu\/egres"},{"issue":"1","key":"7_CR6","doi-asserted-by":"publisher","first-page":"9","DOI":"10.2307\/2312726","volume":"69","author":"D. Gale","year":"1962","unstructured":"Gale, D., Shapley, L.S.: College admissions and stability of marriage. Amer. Math. Monthly\u00a069(1), 9\u201315 (1962)","journal-title":"Amer. Math. Monthly"},{"key":"7_CR7","volume-title":"Stable marriage and its relation to other combinatorial problems","author":"D.E. Knuth","year":"1997","unstructured":"Knuth, D.E.: Stable marriage and its relation to other combinatorial problems. American Mathematical Society, Providence (1997); An introduction to the mathematical analysis of algorithms, Translated from the French by Martin Goldstein and revised by the author"},{"issue":"3","key":"7_CR8","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1257\/aer.98.3.897","volume":"98","author":"M. Ostrovsky","year":"2006","unstructured":"Ostrovsky, M.: Stability in supply chain networks. American Economic Review\u00a098(3), 897\u2013923 (2006)","journal-title":"American Economic Review"},{"issue":"2","key":"7_CR9","doi-asserted-by":"publisher","first-page":"425","DOI":"10.2307\/1913160","volume":"54","author":"A.E. Roth","year":"1986","unstructured":"Roth, A.E.: On the allocation of residents to rural hospitals: a general property of two-sided matching markets. Econometrica\u00a054(2), 425\u2013427 (1986)","journal-title":"Econometrica"},{"key":"7_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CCOL052139015X","volume-title":"Two-sided matching","author":"A.E. Roth","year":"1990","unstructured":"Roth, A.E., Oliveria Sotomayor, M.A.: Two-sided matching. Cambridge University Press, Cambridge (1990); A study in game-theoretic modeling and analysis, With a foreword by Robert Aumann"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A. Tarski","year":"1955","unstructured":"Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pacific J. of Math.\u00a05, 285\u2013310 (1955)","journal-title":"Pacific J. of Math."}],"container-title":["Lecture Notes in Computer Science","Graph Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16926-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T04:50:32Z","timestamp":1553230232000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16926-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642169250","9783642169267"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16926-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}