{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T03:54:50Z","timestamp":1754020490554},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2017,10,27]],"date-time":"2017-10-27T00:00:00Z","timestamp":1509062400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s00453-017-0382-5","type":"journal-article","created":{"date-parts":[[2017,10,27]],"date-time":"2017-10-27T08:39:47Z","timestamp":1509093587000},"page":"2551-2573","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Stable Matching Games: Manipulation via Subgraph Isomorphism"],"prefix":"10.1007","volume":"80","author":[{"given":"Sushmita","family":"Gupta","sequence":"first","affiliation":[]},{"given":"Sanjukta","family":"Roy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,10,27]]},"reference":[{"key":"382_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, D.J., Blum, A., Sandholm, T.: Clearing algorithms for barter exchange markets: enabling nationwide kidney exchanges. In: Proceedings of the 8th ACM Conference on Electronic Commerce (EC), pp. 295\u2013304 (2007)","DOI":"10.1145\/1250910.1250954"},{"key":"382_CR2","doi-asserted-by":"crossref","DOI":"10.1017\/CCOL052139015X","volume-title":"Two-Sided Matching: A Study in Game Theoretic Modeling and Analysis","author":"AE Roth","year":"1990","unstructured":"Roth, A.E., Oliveira Sotomayor, M.A.: Two-Sided Matching: A Study in Game Theoretic Modeling and Analysis. Cambridge University Press, Cambridge (1990)"},{"issue":"1","key":"382_CR3","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(1), 9\u201315 (1962)","journal-title":"Am. Math. Mon."},{"key":"382_CR4","volume-title":"The Stable Marriage Problem-Structure and Algorithm","author":"D Gusfield","year":"1989","unstructured":"Gusfield, D., Irving, R.W.: The Stable Marriage Problem-Structure and Algorithm. MIT Press, Cambridge (1989)"},{"key":"382_CR5","doi-asserted-by":"crossref","unstructured":"Manlove, D.F.: Algorithmics of matching under preferences, volume\u00a02 of Theoretical Computer Science. World Scientific (2013)","DOI":"10.1142\/8591"},{"issue":"2","key":"382_CR6","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1587\/transinf.E92.D.116","volume":"E92\u2013D","author":"H Kobayashi","year":"2009","unstructured":"Kobayashi, H., Matsui, T.: Successful manipulation in stable marriage model with complete preference. IEICE Trans. Inf. Syst. E92\u2013D(2), 116\u2013119 (2009)","journal-title":"IEICE Trans. Inf. Syst."},{"key":"382_CR7","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/s00453-009-9359-3","volume":"58","author":"H Kobayashi","year":"2010","unstructured":"Kobayashi, H., Matsui, T.: Cheating strategies for the Gale\u2013Shapley algorithm with complete preference lists. Algorithmica 58, 151\u2013169 (2010)","journal-title":"Algorithmica"},{"issue":"4","key":"382_CR8","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1109\/TST.2014.6867518","volume":"19","author":"R Bredereck","year":"2014","unstructured":"Bredereck, R., Chen, J., Faliszewski, P., Guo, J., Niedermeier, R., Woeginger, G.J.: Parameterized algorithmics for computational social choice: nine research challenges. Tsinghua Sci. Technol. 19(4), 358\u2013373 (2014)","journal-title":"Tsinghua Sci. Technol."},{"issue":"1","key":"382_CR9","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"},{"issue":"1","key":"382_CR10","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. Discret. Optim. 8(1), 25\u201340 (2011)","journal-title":"Discret. Optim."},{"key":"382_CR11","doi-asserted-by":"crossref","unstructured":"Cseh, A., Manlove, D.F.: Stable marriage and roommates problems with restricted edges: complexity and approximability. In: Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT), volume 9347 of LNCS, pp. 15\u201326 (2015)","DOI":"10.1007\/978-3-662-48433-3_2"},{"issue":"4","key":"382_CR12","doi-asserted-by":"crossref","first-page":"706","DOI":"10.1137\/0209055","volume":"9","author":"T Beyer","year":"1980","unstructured":"Beyer, T., Hedetniemi, S.M.: Constant time generation of rooted trees. SIAM J. Comput. 9(4), 706\u2013712 (1980)","journal-title":"SIAM J. Comput."},{"key":"382_CR13","unstructured":"Otter, R.: The number of trees. Ann. Math. 49(3), 583\u2013599 (1948)"},{"key":"382_CR14","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Lokshtanov, D., Panolan, F., Saurabh, S.: Representative sets of product families. In: Proceedings of 22nd Annual European Symposium on Algorithms (ESA), volume 8737 of LNCS, pp. 443\u2013454. Springer (2014)","DOI":"10.1007\/978-3-662-44777-2_37"},{"issue":"3","key":"382_CR15","doi-asserted-by":"crossref","first-page":"698","DOI":"10.1016\/j.jcss.2011.10.001","volume":"78","author":"FV Fomin","year":"2012","unstructured":"Fomin, F.V., Lokshtanov, D., Raman, V., Saurabh, S., Raghavendra Rao, B.V.: Faster algorithms for finding and counting subgraphs. J. Comput. Syst. Sci. 78(3), 698\u2013706 (2012)","journal-title":"J. Comput. Syst. Sci."},{"key":"382_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-16533-7","volume-title":"Exact Exponential Algorithms","author":"FV Fomin","year":"2010","unstructured":"Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms. Springer, Berlin (2010)"},{"key":"382_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Berlin (2015)"},{"issue":"2","key":"382_CR18","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1137\/100789403","volume":"26","author":"O Amini","year":"2012","unstructured":"Amini, O., Fomin, F.V., Saurabh, S.: Counting subgraphs via homomorphisms. J. Discret. Math. 26(2), 695\u2013717 (2012)","journal-title":"J. Discret. Math."},{"key":"382_CR19","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Paturi, R.: The complexity of k-SAT. In: Proceedings of 14th IEEE Conference on Computational Complexity, pp. 237\u2013240 (1999)","DOI":"10.1109\/CCC.1999.766282"},{"issue":"4","key":"382_CR20","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1080\/00029890.1985.11971592","volume":"92","author":"D Gale","year":"1985","unstructured":"Gale, D., Oliveira Sotomayor, M.A.: Ms. Machiavelli and the Gale\u2013Shapley algorithm. Am. Math. Mon. 92(4), 261\u2013268 (1985)","journal-title":"Am. Math. Mon."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-017-0382-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0382-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0382-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,5,22]],"date-time":"2018-05-22T10:54:28Z","timestamp":1526986468000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-017-0382-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,27]]},"references-count":20,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["382"],"URL":"https:\/\/doi.org\/10.1007\/s00453-017-0382-5","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10,27]]}}}