{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T20:34:29Z","timestamp":1764102869072,"version":"3.37.3"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2017,8,7]],"date-time":"2017-08-07T00:00:00Z","timestamp":1502064000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002990","name":"Deutsche Telekom Stiftung","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002990","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Icelandic Research Fund","award":["152679-051"],"award-info":[{"award-number":["152679-051"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s10107-017-1183-y","type":"journal-article","created":{"date-parts":[[2017,8,7]],"date-time":"2017-08-07T06:33:25Z","timestamp":1502087605000},"page":"209-229","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Popular edges and dominant matchings"],"prefix":"10.1007","volume":"172","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4991-2599","authenticated-orcid":false,"given":"\u00c1gnes","family":"Cseh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Telikepalli","family":"Kavitha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,7]]},"reference":[{"key":"1183_CR1","doi-asserted-by":"crossref","unstructured":"Bir\u00f3, P., Irving, R.W., Manlove, D.F.: Popular matchings in the marriage and roommates problems. In: Proceedings of 7th CIAC, pp. 97\u2013108 (2010)","DOI":"10.1007\/978-3-642-13073-1_10"},{"key":"1183_CR2","doi-asserted-by":"crossref","unstructured":"Cseh, \u00c1., Huang, C.-C., Kavitha, T.: Popular matchings with two-sided preferences and one-sided ties. In: Proceedings of 42nd ICALP, pp. 367\u2013379 (2015)","DOI":"10.1007\/978-3-662-47672-7_30"},{"key":"1183_CR3","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/S0304-3975(03)00319-0","volume":"306","author":"VMF Dias","year":"2003","unstructured":"Dias, V.M.F., da Fonseca, G.D., de Figueiredo, C.M.H., Szwarcfiter, J.L.: The stable marriage problem with restricted pairs. Theor. Comput. Sci. 306, 391\u2013405 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"1183_CR4","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0022-0000(92)90048-N","volume":"45","author":"T Feder","year":"1992","unstructured":"Feder, T.: A new fixed point approach for stable networks and stable marriages. J. Comput. Syst. Sci. 45, 233\u2013284 (1992)","journal-title":"J. Comput. Syst. Sci."},{"key":"1183_CR5","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/BF01240738","volume":"11","author":"T Feder","year":"1994","unstructured":"Feder, T.: Network flow and 2-satisfiability. Algorithmica 11, 291\u2013319 (1994)","journal-title":"Algorithmica"},{"key":"1183_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.S.: College admissions and the stability of marriage. Am. Math. Mon. 69, 9\u201315 (1962)","journal-title":"Am. Math. Mon."},{"key":"1183_CR7","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0166-218X(85)90074-5","volume":"11","author":"D Gale","year":"1985","unstructured":"Gale, D., Sotomayor, M.: Some remarks on the stable matching problem. Discrete Appl. Math. 11, 223\u2013232 (1985)","journal-title":"Discrete Appl. Math."},{"key":"1183_CR8","doi-asserted-by":"crossref","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. Behav. Sci. 20, 166\u2013173 (1975)","journal-title":"Behav. Sci."},{"key":"1183_CR9","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. MIT Press, Cambridge (1989)"},{"key":"1183_CR10","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1016\/j.ic.2012.10.012","volume":"222","author":"C-C Huang","year":"2013","unstructured":"Huang, C.-C., Kavitha, T.: Popular matchings in the stable marriage problem. Inf. Comput. 222, 180\u2013194 (2013)","journal-title":"Inf. Comput."},{"key":"1183_CR11","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1145\/28869.28871","volume":"34","author":"RW Irving","year":"1987","unstructured":"Irving, R.W., Leather, P., Gusfield, D.: An efficient algorithm for the \u201coptimal\u201d stable marriage. J. ACM 34, 532\u2013543 (1987)","journal-title":"J. ACM"},{"key":"1183_CR12","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1137\/120902562","volume":"43","author":"T Kavitha","year":"2014","unstructured":"Kavitha, T.: A size-popularity tradeoff in the stable marriage problem. SIAM J. Comput. 43, 52\u201371 (2014)","journal-title":"SIAM J. Comput."},{"key":"1183_CR13","doi-asserted-by":"crossref","unstructured":"Knuth, D.: Mariages Stables. Les Presses de L\u2019Universit\u00e9 de Montr\u00e9al, 1976. English translation in Stable Marriage and its Relation to Other Combinatorial Problems, volume 10 of CRM Proceedings and Lecture Notes, American Mathematical Society (1997)","DOI":"10.1090\/crmp\/010"},{"issue":"3","key":"1183_CR14","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/s10878-009-9287-9","volume":"22","author":"E McDermid","year":"2011","unstructured":"McDermid, E., Irving, R.W.: Popular matchings: structure and algorithms. J. Comb. Optim. 22(3), 339\u2013359 (2011)","journal-title":"J. Comb. Optim."},{"key":"1183_CR15","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF01586041","volume":"54","author":"UG Rothblum","year":"1992","unstructured":"Rothblum, U.G.: Characterization of stable matchings as extreme points of a polytope. Math. Program. 54, 57\u201367 (1992)","journal-title":"Math. Program."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-017-1183-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-017-1183-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-017-1183-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T22:53:55Z","timestamp":1569970435000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-017-1183-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,7]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["1183"],"URL":"https:\/\/doi.org\/10.1007\/s10107-017-1183-y","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2017,8,7]]}}}