{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T16:10:59Z","timestamp":1746115859446,"version":"3.40.4"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319037790"},{"type":"electronic","value":"9783319037806"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","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-319-03780-6_23","type":"book-chapter","created":{"date-parts":[[2013,11,21]],"date-time":"2013-11-21T06:13:18Z","timestamp":1385014398000},"page":"260-271","source":"Crossref","is-referenced-by-count":0,"title":["Parameterized Complexity of Control and Bribery for d-Approval Elections"],"prefix":"10.1007","author":[{"given":"Jianxin","family":"Wang","sequence":"first","affiliation":[]},{"given":"Min","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Jiong","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Qilong","family":"Feng","sequence":"additional","affiliation":[]},{"given":"Jianer","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","unstructured":"Arrow, K., Sen, A., Suzumura, K.: Handbook of Social Choice and Welfare I. North-Holland (2002)"},{"key":"23_CR2","unstructured":"Arrow, K., Sen, A., Suzumura, K.: Handbook of Social Choice and Welfare II. North-Holland (2010)"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00303169","volume":"6","author":"J. Bartholdi III","year":"1989","unstructured":"Bartholdi III, J., Tovey, C.A., Trick, M.A.: Voting schemes for which it can be difficult to tell who won the election. Social Choice and Welfare\u00a06, 157\u2013165 (1989)","journal-title":"Social Choice and Welfare"},{"issue":"8\/9","key":"23_CR4","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0895-7177(92)90085-Y","volume":"16","author":"J. Bartholdi III","year":"1992","unstructured":"Bartholdi III, J., Tovey, C.A., Trick, M.A.: How hard is it to control an election? Mathematical and Computer Modelling\u00a016(8\/9), 27\u201340 (1992)","journal-title":"Mathematical and Computer Modelling"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/978-3-642-30891-8_16","volume-title":"The Multivariate Algorithmic Revolution and Beyond","author":"N. Betzler","year":"2012","unstructured":"Betzler, N., Bredereck, R., Chen, J., Niedermeier, R.: Studies in Computational Aspects of Voting - A Parameterized Complexity Perspective. In: Bodlaender, H.L., Downey, R., Fomin, F.V., Marx, D. (eds.) Fellows Festschrift 2012. LNCS, vol.\u00a07370, pp. 318\u2013363. Springer, Heidelberg (2012)"},{"key":"23_CR6","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":"3","key":"23_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1236457.1236461","volume":"54","author":"V. Conitzer","year":"2007","unstructured":"Conitzer, V., Sandholm, T., Lang, J.: When are elections with few candidates hard to manipulate? Journal of the ACM\u00a054(3), 1\u201333 (2007)","journal-title":"Journal of the ACM"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer (1999)","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"23_CR9","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1613\/jair.2676","volume":"35","author":"P. Faliszewski","year":"2009","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.A.: How Hard Is Bribery in Elections? J. Artif. Intell. Res (JAIR)\u00a035, 485\u2013532 (2009)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"23_CR10","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1613\/jair.2697","volume":"35","author":"P. Faliszewski","year":"2009","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.A., Rothe, J.: Llull and Copeland Voting Computationally Resist Bribery and Constructive Control. J. Artif. Intell. Res (JAIR)\u00a035, 275\u2013341 (2009)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"issue":"1","key":"23_CR11","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":"5-6","key":"23_CR12","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.artint.2007.01.005","volume":"171","author":"E. Hemaspaandra","year":"2007","unstructured":"Hemaspaandra, E., Hemaspaandra, L.A., Rothe, J.: Anyone but him: The complexity of precluding an alternative. Artificial Intelligence\u00a0171(5-6), 255\u2013285 (2007)","journal-title":"Artificial Intelligence"},{"issue":"1","key":"23_CR13","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.jalgor.2003.07.001","volume":"50","author":"W. Jia","year":"2004","unstructured":"Jia, W., Zhang, C., Chen, J.: An efficient parameterized algorithm for m-set packing. J. Algorithms\u00a050(1), 106\u2013117 (2004)","journal-title":"J. Algorithms"},{"key":"23_CR14","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H.W. Lenstra","year":"1983","unstructured":"Lenstra, H.W.: Integer programming with a fixed number of variables. Mathematics of Operations Research\u00a08, 538\u2013548 (1983)","journal-title":"Mathematics of Operations Research"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Lin, A.: The complexity of manipulating k-Approval elections. In: Proc. 3rd International Conference on Agents and Artificial Intelligence, vol.\u00a0(2), pp. 212\u2013218. SciTe Press (2011)","DOI":"10.5220\/0003168802120218"},{"key":"23_CR16","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1613\/jair.2566","volume":"33","author":"R. Meir","year":"2008","unstructured":"Meir, R., Procaccia, A., Rosenschein, J., Zohar, A.: Complexity of strategic behavior in multi-winner elections. Journal of Artificial Intelligence Research\u00a033, 149\u2013178 (2008)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press (2006)","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03780-6_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T22:38:05Z","timestamp":1746052685000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03780-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319037790","9783319037806"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03780-6_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}