{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T15:55:17Z","timestamp":1771689317456,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642382321","type":"print"},{"value":"9783642382338","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38233-8_27","type":"book-chapter","created":{"date-parts":[[2013,5,15]],"date-time":"2013-05-15T12:57:16Z","timestamp":1368622636000},"page":"324-335","source":"Crossref","is-referenced-by-count":12,"title":["Capacitated Rank-Maximal Matchings"],"prefix":"10.1007","author":[{"given":"Katarzyna","family":"Paluch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-540-30551-4_3","volume-title":"Algorithms and Computation","author":"D.J. Abraham","year":"2004","unstructured":"Abraham, D.J., Cechl\u00e1rov\u00e1, K., Manlove, D.F., Mehlhorn, K.: Pareto Optimality in House Allocation Problems. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 3\u201315. Springer, Heidelberg (2004)"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/11944874_19","volume-title":"Internet and Network Economics","author":"D.J. Abraham","year":"2006","unstructured":"Abraham, D.J., Chen, N., Kumar, V., Mirrokni, V.S.: Assignment Problems in Rental Markets. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol.\u00a04286, pp. 198\u2013213. Springer, Heidelberg (2006)"},{"issue":"4","key":"27_CR3","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1137\/06067328X","volume":"37","author":"D.J. Abraham","year":"2007","unstructured":"Abraham, D.J., Irving, R.W., Kavitha, T., Mehlhorn, K.: Popular Matchings. SIAM J. Comput.\u00a037(4), 1030\u20131045 (2007)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"27_CR4","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1007\/s00453-010-9434-9","volume":"61","author":"C.-C. Huang","year":"2011","unstructured":"Huang, C.-C., Kavitha, T., Michail, D., Nasre, M.: Bounded Unpopularity Matchings. Algorithmica\u00a061(3), 738\u2013757 (2011)","journal-title":"Algorithmica"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Gabow, H.N.: An Efficient Reduction Technique for Degree-Constrained Subgraph and Bidirected Network Flow Problems STOC, pp. 448\u2013456 (1983)","DOI":"10.1145\/800061.808776"},{"key":"27_CR6","unstructured":"Irving, R.W.: Greedy matchings. Technical report TR-2003-136, University of Glasgow (April 2003)"},{"issue":"4","key":"27_CR7","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1145\/1198513.1198520","volume":"2","author":"R.W. Irving","year":"2006","unstructured":"Irving, R.W., Kavitha, T., Mehlhorn, K., Michail, D., Paluch, K.E.: Rank-maximal matchings. ACM Transactions on Algorithms\u00a02(4), 602\u2013610 (2006)","journal-title":"ACM Transactions on Algorithms"},{"key":"27_CR8","volume-title":"Matching Theory. Ann. Discrete Math.","author":"L. Lovasz","year":"1986","unstructured":"Lovasz, L., Plummer, M.D.: Matching Theory. Ann. Discrete Math., vol.\u00a029. North-Holland, Amsterdam (1986)"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Mahdian, M.: Random popular matchings. In: ACM Conference on Electronic Commerce, pp. 238\u2013242 (2006)","DOI":"10.1145\/1134707.1134733"},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1007\/11841036_45","volume-title":"Algorithms \u2013 ESA 2006","author":"D.F. Manlove","year":"2006","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)"},{"key":"27_CR11","unstructured":"Mehlhorn, K., Michail, D.: Network Problems with Non-Polynomial Weights and Applications (2005) (manuscript)"},{"issue":"1-2","key":"27_CR12","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.tcs.2007.08.004","volume":"389","author":"D. Michail","year":"2007","unstructured":"Michail, D.: Reducing rank-maximal to maximum weight matching. Theor. Comput. Sci.\u00a0389(1-2), 125\u2013132 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"27_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/11786986_62","volume-title":"Automata, Languages and Programming","author":"J. Mestre","year":"2006","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)"},{"key":"27_CR14","doi-asserted-by":"publisher","first-page":"536","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. Math. Econom.\u00a04, 536\u2013546 (1977)","journal-title":"J. Math. Econom."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38233-8_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T01:34:17Z","timestamp":1557711257000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38233-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642382321","9783642382338"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38233-8_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}