{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T06:15:01Z","timestamp":1759990501679},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,8,29]],"date-time":"2012-08-29T00:00:00Z","timestamp":1346198400000},"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":[[2014,3]]},"DOI":"10.1007\/s00453-012-9672-0","type":"journal-article","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T12:28:29Z","timestamp":1346156909000},"page":"545-570","source":"Crossref","is-referenced-by-count":14,"title":["Sex-Equal Stable Matchings: Complexity and Exact Algorithms"],"prefix":"10.1007","volume":"68","author":[{"given":"Eric","family":"McDermid","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert W.","family":"Irving","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,8,29]]},"reference":[{"issue":"1\u20132","key":"9672_CR1","first-page":"1","volume":"11","author":"H. Bodlaender","year":"1993","unstructured":"Bodlaender, H.: A tourist guide through treewidth. Acta Cybern. 11(1\u20132), 1\u201323 (1993)","journal-title":"Acta Cybern."},{"issue":"1","key":"9672_CR2","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/s00453-009-9307-2","volume":"58","author":"C. Cheng","year":"2010","unstructured":"Cheng, C.: Understanding the generalized median stable matchings. Algorithmica 58(1), 34\u201351 (2010)","journal-title":"Algorithmica"},{"key":"9672_CR3","doi-asserted-by":"crossref","first-page":"2396","DOI":"10.1016\/j.disc.2007.05.007","volume":"308","author":"K. Edwards","year":"2008","unstructured":"Edwards, K., Farr, G.: Planarization and fragmentability of some classes of graphs. Discrete Math. 308, 2396\u20132406 (2008)","journal-title":"Discrete Math."},{"key":"9672_CR4","unstructured":"Feder, T.: Stable networks and product graphs. Ph.D. Thesis, Stanford University, 1990 (Published in Memoirs of the American Mathematical Society, 116(555), (1995))"},{"key":"9672_CR5","doi-asserted-by":"crossref","first-page":"9","DOI":"10.2307\/2312726","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."},{"issue":"1","key":"9672_CR6","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1137\/0216010","volume":"16","author":"D. Gusfield","year":"1987","unstructured":"Gusfield, D.: Three fast algorithms for four problems in stable marriage. SIAM J. Comput. 16(1), 111\u2013128 (1987)","journal-title":"SIAM J. Comput."},{"key":"9672_CR7","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":"9672_CR8","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."},{"issue":"3","key":"9672_CR9","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1137\/0215048","volume":"15","author":"R.W. Irving","year":"1986","unstructured":"Irving, R.W., Leather, P.: The complexity of counting stable marriages. SIAM J. Comput. 15(3), 655\u2013667 (1986)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"9672_CR10","first-page":"532","volume":"34","author":"R.W. Irving","year":"1987","unstructured":"Irving, R.W., Leather, P., Gusfield, D.: An efficient algorithm for the \u201coptimal\u201d stable marriage. J.\u00a0ACM 34(3), 532\u2013543 (1987)","journal-title":"J.\u00a0ACM"},{"key":"9672_CR11","doi-asserted-by":"crossref","unstructured":"Iwama, K., Miyazaki, S., Yanagisawa, H.: Approximation algorithms for the sex-equal stable marriage problem. ACM Trans. Algorithms 7(1), Article No. 2 (2010)","DOI":"10.1145\/1868237.1868239"},{"issue":"1","key":"9672_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.8.1.1","volume":"8","author":"D.S. Johnson","year":"1983","unstructured":"Johnson, D.S., Niemi, K.A.: On knapsacks, partitions, and a new dynamic programming technique for trees. Math. Oper. Res. 8(1), 1\u201314 (1983)","journal-title":"Math. Oper. Res."},{"key":"9672_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF03167200","volume":"10","author":"A. Kato","year":"1993","unstructured":"Kato, A.: Complexity of the sex-equal stable marriage problem. Jpn. J. Ind. Appl. Math. 10, 1\u201319 (1993)","journal-title":"Jpn. J. Ind. Appl. Math."},{"key":"9672_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/978-3-642-02882-3_32","volume-title":"Proceedings of COCOON\u201909: The 15th International Computing and Combinatorics Conference","author":"S. Kijima","year":"2009","unstructured":"Kijima, S., Nemoto, T.: Finding a level ideal of a poset. In: Proceedings of COCOON\u201909: The 15th International Computing and Combinatorics Conference. Lecture Notes in Computer Science, pp. 317\u2013327. Springer, Berlin (2009)"},{"key":"9672_CR15","volume-title":"Mariages Stables","author":"D.E. Knuth","year":"1976","unstructured":"Knuth, D.E.: Mariages Stables. Les Presses de L\u2019Universit\u00e9 de Montr\u00e9al, Montr\u00e9al (1976)"},{"issue":"1","key":"9672_CR16","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.disopt.2010.07.004","volume":"8","author":"D. Marx","year":"2011","unstructured":"Marx, D., Schlotter, I.: Stable assignment with couples: parameterized complexity and local search. Discrete Optim. 8(1), 25\u201340 (2011)","journal-title":"Discrete Optim."},{"issue":"1","key":"9672_CR17","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1007\/s00453-009-9326-z","volume":"58","author":"D. Marx","year":"2010","unstructured":"Marx, D., Schlotter, I.: Parameterized complexity and local search approaches for the stable marriage problem with ties. Algorithmica 58(1), 170\u2013187 (2010)","journal-title":"Algorithmica"},{"key":"9672_CR18","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, London (2006)"},{"issue":"4","key":"9672_CR19","doi-asserted-by":"crossref","first-page":"874","DOI":"10.1287\/moor.23.4.874","volume":"23","author":"C. Teo","year":"1998","unstructured":"Teo, C., Sethuraman, J.: The geometry of fractional stable matchings and its applications. Math. Oper. Res. 23(4), 874\u2013891 (1998)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"9672_CR20","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0211023","volume":"11","author":"J. Valdes","year":"1982","unstructured":"Valdes, J., Tarjan, R.E., Lawler, E.L.: The recognition of series parallel digraphs. SIAM J. Comput. 11(2), 298\u2013313 (1982)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"9672_CR21","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/j.dam.2007.03.023","volume":"156","author":"G.J. Woeginger","year":"2008","unstructured":"Woeginger, G.J.: Open problems around exact algorithms. Discrete Appl. Math. 156(3), 397\u2013405 (2008)","journal-title":"Discrete Appl. Math."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-012-9672-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-012-9672-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-012-9672-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T01:22:24Z","timestamp":1562116944000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-012-9672-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,29]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,3]]}},"alternative-id":["9672"],"URL":"https:\/\/doi.org\/10.1007\/s00453-012-9672-0","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8,29]]}}}