{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:43:14Z","timestamp":1742992994133,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642112683"},{"type":"electronic","value":"9783642112690"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-11269-0_25","type":"book-chapter","created":{"date-parts":[[2009,12,1]],"date-time":"2009-12-01T08:36:15Z","timestamp":1259656575000},"page":"300-311","source":"Crossref","is-referenced-by-count":0,"title":["Stable Assignment with Couples: Parameterized Complexity and Local Search"],"prefix":"10.1007","author":[{"given":"D\u00e1niel","family":"Marx","sequence":"first","affiliation":[]},{"given":"Ildik\u00f3","family":"Schlotter","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"volume-title":"Local Search in Combinatorial Optimization","year":"1997","key":"25_CR1","unstructured":"Aarts, E.H.L., Lenstra, J.K. (eds.): Local Search in Combinatorial Optimization. Wiley, New York (1997)"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N. Alon","year":"1995","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color-coding. J. ACM\u00a042, 844\u2013856 (1995)","journal-title":"J. ACM"},{"key":"25_CR3","unstructured":"Bir\u00f3, P., McDermid, E.J.: Matching with couples is hard, but extra beds help (manuscript) (2009)"},{"key":"25_CR4","unstructured":"Fellows, M.R., Fomin, F.V., Lokshtanov, D., Rosamond, F.A., Saurabh, S., Villanger, Y.: Local search: Is brute-force avoidable? In: IJCAI 2009 (2009)"},{"key":"25_CR5","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"key":"25_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 the stability of marriage. American Mathematical Monthly\u00a069, 9\u201315 (1962)","journal-title":"American Mathematical Monthly"},{"key":"25_CR7","doi-asserted-by":"publisher","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.\u00a011, 223\u2013232 (1985)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"25_CR8","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1002\/nav.20202","volume":"54","author":"C.A. Glass","year":"2007","unstructured":"Glass, C.A., Kellerer, H.: Parallel machine scheduling with job assignment restrictions. Naval Research Logistics\u00a054(3), 250\u2013257 (2007)","journal-title":"Naval Research Logistics"},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1007\/978-3-540-70575-8_54","volume-title":"Automata, Languages and Programming","author":"A. Krokhin","year":"2008","unstructured":"Krokhin, A., Marx, D.: On the hardness of losing weight. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 662\u2013673. Springer, Heidelberg (2008)"},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.jet.2004.04.006","volume":"121","author":"B. Klaus","year":"2005","unstructured":"Klaus, B., Klijn, F.: Stable matchings and preferences of couples. J. Econ. Theory\u00a0121, 75\u2013106 (2005)","journal-title":"J. Econ. Theory"},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1007\/11786986_57","volume-title":"Automata, Languages and Programming","author":"D. Marx","year":"2006","unstructured":"Marx, D.: A parameterized view on matroid optimization problems. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 656\u2013667. Springer, Heidelberg (2006)"},{"key":"25_CR12","first-page":"7","volume":"3","author":"D. Marx","year":"2008","unstructured":"Marx, D.: Local Search. Parameterized Complexity News\u00a03, 7\u20138 (2008)","journal-title":"Parameterized Complexity News"},{"issue":"1","key":"25_CR13","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.orl.2007.02.008","volume":"36","author":"D. Marx","year":"2008","unstructured":"Marx, D.: Searching the k-change neighborhood for TSP is W[1]-hard. Oper. Res. Lett.\u00a036(1), 31\u201336 (2008)","journal-title":"Oper. Res. Lett."},{"key":"25_CR14","unstructured":"McDermid, E.J., Manlove, D.F.: Keeping partners together: Algorithmic results for the Hospitals\/Residents problem with couples. To appear in J. of Comb. Opt."},{"key":"25_CR15","doi-asserted-by":"publisher","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, Oxford (2006)"},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0196-6774(90)90007-2","volume":"11","author":"E. Ronn","year":"1990","unstructured":"Ronn, E.: NP-Complete stable matching problems. J. Algorithms\u00a011, 285\u2013304 (1990)","journal-title":"J. Algorithms"},{"key":"25_CR17","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1086\/261272","volume":"92","author":"A.E. Roth","year":"1984","unstructured":"Roth, A.E.: The evolution of the labor market for medical interns and residents: a case study in game theory. J. Polit. Econ.\u00a092, 991\u20131016 (1984)","journal-title":"J. Polit. Econ."},{"key":"25_CR18","doi-asserted-by":"crossref","DOI":"10.1017\/CCOL052139015X","volume-title":"Two Sided Matching: A Study in Game-Theoretic Modelling and Analysis","author":"A.E. Roth","year":"1990","unstructured":"Roth, A.E., Sotomayor, M.: Two Sided Matching: A Study in Game-Theoretic Modelling and Analysis. Cambridge University Press, Cambridge (1990)"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11269-0_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,18]],"date-time":"2023-02-18T00:35:03Z","timestamp":1676680503000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-11269-0_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642112683","9783642112690"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11269-0_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}