{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,26]],"date-time":"2026-10-26T18:45:35Z","timestamp":1793040335646,"version":"4.5.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642415746","type":"print"},{"value":"9783642415753","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41575-3_33","type":"book-chapter","created":{"date-parts":[[2013,10,28]],"date-time":"2013-10-28T01:37:47Z","timestamp":1382924267000},"page":"425-439","source":"Crossref","is-referenced-by-count":1,"title":["Possible Winner Problems on Partial Tournaments: A Parameterized Study"],"prefix":"10.1007","author":[{"given":"Yongjie","family":"Yang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiong","family":"Guo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"33_CR1","unstructured":"Aziz, H., Harrenstein, P., Brill, M., Lang, J., Fischer, F.A., Seedig, H.G.: Possible and necessary winners of partial tournaments. In: AAMAS, pp. 585\u2013592 (2012)"},{"issue":"4","key":"33_CR2","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF00649265","volume":"1","author":"J.S. Banks","year":"1985","unstructured":"Banks, J.S.: Sophisticated voting outcomes and agenda control. Social Choice and Welfare\u00a01(4), 295\u2013306 (1985)","journal-title":"Social Choice and Welfare"},{"key":"33_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-642-11269-0_2","volume-title":"Parameterized and Exact Computation","author":"H.L. Bodlaender","year":"2009","unstructured":"Bodlaender, H.L.: Kernelization: New upper and lower bound techniques. In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol.\u00a05917, pp. 17\u201337. Springer, Heidelberg (2009)"},{"issue":"4","key":"33_CR4","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1002\/malq.200810027","volume":"55","author":"F. Brandt","year":"2009","unstructured":"Brandt, F., Fischer, F.A., Harrenstein, P.: The computational complexity of choice sets. Math. Log. Q.\u00a055(4), 444\u2013459 (2009)","journal-title":"Math. Log. Q."},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Chen, J., Liu, Y., Lu, S., O\u2019Sullivan, B., Razgon, I.: A fixed-parameter algorithm for the directed feedback vertex set problem. In: STOC, pp. 177\u2013186 (2008)","DOI":"10.1145\/1374376.1374404"},{"issue":"1","key":"33_CR6","doi-asserted-by":"publisher","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.: Fixed-parameter tractability results for feedback set problems in tournaments. J. Discrete Algorithms\u00a08(1), 76\u201386 (2010)","journal-title":"J. Discrete Algorithms"},{"key":"33_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/978-3-642-02927-1_32","volume-title":"Automata, Languages and Programming","author":"M. Dom","year":"2009","unstructured":"Dom, M., Lokshtanov, D., Saurabh, S.: Incompressibility through colors and ids. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol.\u00a05555, pp. 378\u2013389. Springer, Heidelberg (2009)"},{"key":"33_CR8","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized computational feasibility. In: Feasible Mathematics II, pp. 219\u2013244 (1995)","DOI":"10.1007\/978-1-4612-2566-9_7"},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer (1999)","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R., Stege, U.: 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 (1999)","DOI":"10.1090\/dimacs\/049\/04"},{"issue":"1","key":"33_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.tcs.2008.09.065","volume":"410","author":"M.R. Fellows","year":"2009","unstructured":"Fellows, M.R., Hermelin, D., Rosamond, F.A., Vialette, S.: On the parameterized complexity of multiple-interval graph problems. Theor. Comput. Sci.\u00a0410(1), 53\u201361 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"33_CR12","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1137\/0133030","volume":"33","author":"P.C. Fishburn","year":"1977","unstructured":"Fishburn, P.C.: Condorcet social choice functions. SIAM Journal on Applied Mathematics\u00a033(3), 469\u2013489 (1977)","journal-title":"SIAM Journal on Applied Mathematics"},{"issue":"1","key":"33_CR13","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/1233481.1233493","volume":"38","author":"J. Guo","year":"2007","unstructured":"Guo, J., Niedermeier, R.: Invitation to data reduction and problem kernelization. ACM SIGACT News\u00a038(1), 31\u201345 (2007)","journal-title":"ACM SIGACT News"},{"issue":"3","key":"33_CR14","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1016\/j.mathsocsci.2008.12.002","volume":"57","author":"O. Hudry","year":"2009","unstructured":"Hudry, O.: A survey on the complexity of tournament solutions. Mathematical Social Sciences\u00a057(3), 292\u2013303 (2009)","journal-title":"Mathematical Social Sciences"},{"issue":"1","key":"33_CR15","doi-asserted-by":"publisher","first-page":"68","DOI":"10.2307\/2110925","volume":"24","author":"N.R. Miller","year":"1980","unstructured":"Miller, N.R.: A new solution set for tournaments and majority voting: Further graph-theoretical approaches to the theory of voting. American Journal of Political Science\u00a024(1), 68\u201396 (1980)","journal-title":"American Journal of Political Science"},{"key":"33_CR16","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 Inc., Oxford University Press Inc (2006)"},{"issue":"3","key":"33_CR17","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.: Parameterized algorithms for feedback set problems and their duals in tournaments. Theor. Comput. Sci.\u00a0351(3), 446\u2013458 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"33_CR18","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.ipl.2007.05.005","volume":"104","author":"V. Raman","year":"2007","unstructured":"Raman, V., Sikdar, S.: Parameterized complexity of the induced subgraph problem in directed graphs. Inf. Process. Lett.\u00a0104(3), 79\u201385 (2007)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"33_CR19","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/s003550200197","volume":"20","author":"G.J. Woeginger","year":"2003","unstructured":"Woeginger, G.J.: Banks winners in tournaments are difficult to recognize. Social Choice and Welfare\u00a020(3), 523\u2013528 (2003)","journal-title":"Social Choice and Welfare"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Decision Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41575-3_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,29]],"date-time":"2020-09-29T01:04:30Z","timestamp":1601341470000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41575-3_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642415746","9783642415753"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41575-3_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}