{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T03:08:15Z","timestamp":1767236895488},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,3,31]],"date-time":"2016-03-31T00:00:00Z","timestamp":1459382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s10878-016-0012-1","type":"journal-article","created":{"date-parts":[[2016,3,31]],"date-time":"2016-03-31T20:54:33Z","timestamp":1459457673000},"page":"882-896","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Possible winner problems on partial tournaments: a parameterized study"],"prefix":"10.1007","volume":"33","author":[{"given":"Yongjie","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiong","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,3,31]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1613\/jair.4856","volume":"54","author":"H Aziz","year":"2015","unstructured":"Aziz H, Brill M, Fischer FA, Harrenstein P, Lang J, Seedig HG (2015) Possible and necessary winners of partial tournaments. J Artif Intell Res (JAIR) 54:493\u2013534. doi: 10.1613\/jair.4856","journal-title":"J Artif Intell Res (JAIR)"},{"issue":"4","key":"12_CR2","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF00649265","volume":"1","author":"JS Banks","year":"1985","unstructured":"Banks JS (1985) Sophisticated voting outcomes and agenda control. Soc Choice Welf 1(4):295\u2013306","journal-title":"Soc Choice Welf"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Bodlaender HL (2009) Kernelization: New upper and lower bound techniques. In: IWPEC, pp 17\u201337","DOI":"10.1007\/978-3-642-11269-0_2"},{"issue":"4","key":"12_CR4","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1002\/malq.200810027","volume":"55","author":"F Brandt","year":"2009","unstructured":"Brandt F, Fischer FA, Harrenstein P (2009) The computational complexity of choice sets. Math Log Q 55(4):444\u2013459","journal-title":"Math Log Q"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Chen J, Liu Y, Lu S, O\u2019Sullivan B, Razgon I (2008) A fixed-parameter algorithm for the directed feedback vertex set problem. In: STOC, pp 177\u2013186","DOI":"10.1145\/1374376.1374404"},{"issue":"1","key":"12_CR6","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/j.jda.2009.08.001","volume":"8","author":"M Dom","year":"2010","unstructured":"Dom M, Guo J, H\u00fcffner F, Niedermeier R, Tru\u00df A (2010) Fixed-parameter tractability results for feedback set problems in tournaments. J Discret Algorithm 8(1):76\u201386","journal-title":"J Discret Algorithm"},{"key":"12_CR7","first-page":"378","volume":"1","author":"M Dom","year":"2009","unstructured":"Dom M, Lokshtanov D, Saurabh S (2009) Incompressibility through colors and IDs. ICALP 1:378\u2013389","journal-title":"ICALP"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Downey RG, Fellows MR (1995) Parameterized computational feasibility. In: Feasible mathematics II, pp 219\u2013244","DOI":"10.1007\/978-1-4612-2566-9_7"},{"key":"12_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized complexity","author":"RG Downey","year":"1999","unstructured":"Downey RG, Fellows MR (1999) Parameterized complexity. Springer, New York"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Downey RG, Fellows MR, Stege U (1999) Parameterized complexity: a framework for systematically confronting computational intractability. In: Contemporary trends in discrete mathematics: from DIMACS and DIMATIA to the future, pp 49\u201399. Springer, New York","DOI":"10.1007\/978-1-4612-0515-9"},{"issue":"1","key":"12_CR11","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.tcs.2008.09.065","volume":"410","author":"MR Fellows","year":"2009","unstructured":"Fellows MR, Hermelin D, Rosamond FA, Vialette S (2009) On the parameterized complexity of multiple-interval graph problems. Theor Comput Sci 410(1):53\u201361","journal-title":"Theor Comput Sci"},{"issue":"3","key":"12_CR12","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1137\/0133030","volume":"33","author":"PC Fishburn","year":"1977","unstructured":"Fishburn PC (1977) Condorcet social choice functions. SIAM J Appl Math 33(3):469\u2013489","journal-title":"SIAM J Appl Math"},{"issue":"1","key":"12_CR13","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/1233481.1233493","volume":"38","author":"J Guo","year":"2007","unstructured":"Guo J, Niedermeier R (2007) Invitation to data reduction and problem kernelization. SIGACT News 38(1):31\u201345","journal-title":"SIGACT News"},{"issue":"3","key":"12_CR14","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1016\/j.mathsocsci.2008.12.002","volume":"57","author":"O Hudry","year":"2009","unstructured":"Hudry O (2009) A survey on the complexity of tournament solutions. Math Soc Sci 57(3):292\u2013303","journal-title":"Math Soc Sci"},{"issue":"2","key":"12_CR15","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF02476378","volume":"15","author":"H Landau","year":"1953","unstructured":"Landau H (1953) On dominance relations and the structure of animal societies III. The condition for score structure. B Math Biophys 15(2):143\u2013148","journal-title":"B Math Biophys"},{"issue":"1","key":"12_CR16","doi-asserted-by":"crossref","first-page":"68","DOI":"10.2307\/2110925","volume":"24","author":"NR Miller","year":"1980","unstructured":"Miller NR (1980) A new solution set for tournaments and majority voting: further graph-theoretical approaches to the theory of voting. Am J Polit Sci 24(1):68\u201396","journal-title":"Am J Polit Sci"},{"key":"12_CR17","unstructured":"Mnich M, Shrestha YR, Yang Y (2015) When does Schwartz conjecture hold? In: IJCAI, pp 603\u2013609"},{"key":"12_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 (2006) Invitation to fixed-parameter algorithms. Oxford University Press Inc, Oxford"},{"issue":"3","key":"12_CR19","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1016\/j.tcs.2005.10.010","volume":"351","author":"V Raman","year":"2006","unstructured":"Raman V, Saurabh S (2006) Parameterized algorithms for feedback set problems and their duals in tournaments. Theor Comput Sci 351(3):446\u2013458. doi: 10.1016\/j.tcs.2005.10.010","journal-title":"Theor Comput Sci"},{"issue":"3","key":"12_CR20","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.ipl.2007.05.005","volume":"104","author":"V Raman","year":"2007","unstructured":"Raman V, Sikdar S (2007) Parameterized complexity of the induced subgraph problem in directed graphs. Inf Process Lett 104(3):79\u201385","journal-title":"Inf Process Lett"},{"issue":"3","key":"12_CR21","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/s003550200197","volume":"20","author":"GJ Woeginger","year":"2003","unstructured":"Woeginger GJ (2003) Banks winners in tournaments are difficult to recognize. Soc Choice Welf 20(3):523\u2013528","journal-title":"Soc Choice Welf"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0012-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-016-0012-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0012-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0012-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,6]],"date-time":"2019-09-06T04:34:24Z","timestamp":1567744464000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-016-0012-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,31]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["12"],"URL":"https:\/\/doi.org\/10.1007\/s10878-016-0012-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3,31]]}}}