{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T19:26:55Z","timestamp":1725823615642},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662476710"},{"type":"electronic","value":"9783662476727"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-47672-7_30","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T10:07:39Z","timestamp":1434708459000},"page":"367-379","source":"Crossref","is-referenced-by-count":4,"title":["Popular Matchings with Two-Sided Preferences and One-Sided Ties"],"prefix":"10.1007","author":[{"given":"\u00c1gnes","family":"Cseh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chien-Chung","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Telikepalli","family":"Kavitha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"issue":"4","key":"30_CR1","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1137\/06067328X","volume":"37","author":"DJ Abraham","year":"2007","unstructured":"Abraham, D.J., Irving, R.W., Kavitha, T., Mehlhorn, K.: Popular matchings. SIAM Journal on Computing 37(4), 1030\u20131045 (2007)","journal-title":"SIAM Journal on Computing"},{"key":"30_CR2","unstructured":"Berman, P., Karpinski, M., Scott, A.D.: Approximation hardness of short symmetric instances of MAX-3SAT. Electronic Colloquium on Computational Complexity Report, number 49 (2003)"},{"key":"30_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-642-13073-1_10","volume-title":"Algorithms and Complexity","author":"P Bir\u00f3","year":"2010","unstructured":"Bir\u00f3, P., Irving, R.W., Manlove, D.F.: Popular Matchings in the Marriage and Roommates Problems. In: Calamoneri, T., Diaz, J. (eds.) CIAC 2010. LNCS, vol. 6078, pp. 97\u2013108. Springer, Heidelberg (2010)"},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"517","DOI":"10.4153\/CJM-1958-052-0","volume":"10","author":"A Dulmage","year":"1958","unstructured":"Dulmage, A., Mendelsohn, N.: Coverings of bipartite graphs. Canadian Journal of Mathematics 10, 517\u2013534 (1958)","journal-title":"Canadian Journal of Mathematics"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1002\/bs.3830200304","volume":"20","author":"P G\u00e4rdenfors","year":"1975","unstructured":"G\u00e4rdenfors, P.: Match making: assignments based on bilateral preferences. Behavioural Science 20, 166\u2013173 (1975)","journal-title":"Behavioural Science"},{"key":"30_CR6","unstructured":"Graham, R.L., Gr\u00f6tschel, M., Lovasz, L., (eds.) The Handbook of Combinatorics, chapter 3, Matchings and Extensions, by W. R. Pulleyblank, pp. 179\u2013232. North Holland (1995)"},{"key":"30_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1007\/978-3-642-22006-7_56","volume-title":"Automata, Languages and Programming","author":"C-C Huang","year":"2011","unstructured":"Huang, C.-C., Kavitha, T.: Popular Matchings in the Stable Marriage Problem. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part I. LNCS, vol. 6755, pp. 666\u2013677. Springer, Heidelberg (2011)"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Kavitha, T.: Popularity vs Maximum cardinality in the stable marriage setting. In: Proceedings of the 23rd SODA, pp. 123\u2013134 (2012)","DOI":"10.1137\/1.9781611973099.11"},{"key":"30_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1007\/978-3-642-02927-1_48","volume-title":"Automata, Languages and Programming","author":"T Kavitha","year":"2009","unstructured":"Kavitha, T., Mestre, J., Nasre, M.: Popular Mixed Matchings. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol. 5555, pp. 574\u2013584. Springer, Heidelberg (2009)"},{"issue":"14","key":"30_CR10","doi-asserted-by":"publisher","first-page":"3181","DOI":"10.1016\/j.dam.2009.06.004","volume":"157","author":"T Kavitha","year":"2009","unstructured":"Kavitha, T., Nasre, M.: Note: Optimal popular matchings. Discrete Applied Mathematics 157(14), 3181\u20133186 (2009)","journal-title":"Discrete Applied Mathematics"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Mahdian, M.: Random popular matchings. In: Proceedings of the 7th EC, pp. 238\u2013242 (2006)","DOI":"10.1145\/1134707.1134733"},{"key":"30_CR12","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":"DF 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. 4168, pp. 492\u2013503. Springer, Heidelberg (2006)"},{"key":"30_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/978-3-540-78773-0_51","volume-title":"LATIN 2008: Theoretical Informatics","author":"RM McCutchen","year":"2008","unstructured":"McCutchen, R.M.: The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol. 4957, pp. 593\u2013604. Springer, Heidelberg (2008)"},{"key":"30_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/978-3-642-02882-3_50","volume-title":"Computing and Combinatorics","author":"E McDermid","year":"2009","unstructured":"McDermid, E., Irving, R.W.: Popular Matchings: Structure and Algorithms. In: Ngo, H.Q. (ed.) COCOON 2009. LNCS, vol. 5609, pp. 506\u2013515. Springer, Heidelberg (2009)"},{"key":"30_CR15","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. 4051, pp. 715\u2013726. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47672-7_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T06:49:21Z","timestamp":1559198961000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-47672-7_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662476710","9783662476727"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47672-7_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}