{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:37:14Z","timestamp":1743143834519,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642174926"},{"type":"electronic","value":"9783642174933"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-17493-3_12","type":"book-chapter","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T08:41:01Z","timestamp":1291365661000},"page":"107-122","source":"Crossref","is-referenced-by-count":2,"title":["Multivariate Complexity Analysis of Swap Bribery"],"prefix":"10.1007","author":[{"given":"Britta","family":"Dorn","sequence":"first","affiliation":[]},{"given":"Ildik\u00f3","family":"Schlotter","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-642-15155-2_12","volume-title":"Mathematical Foundations of Computer Science 2010","author":"N. Betzler","year":"2010","unstructured":"Betzler, N.: On problem kernels for possible winner determination under the k-approval protocol. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol.\u00a06281, pp. 114\u2013125. Springer, Heidelberg (2010)"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1016\/j.jcss.2010.04.002","volume":"76","author":"N. Betzler","year":"2010","unstructured":"Betzler, N., Dorn, B.: Towards a dichotomy for the Possible Winner problem in elections based on scoring rules. J. Comput. Syst. Sci.\u00a076, 812\u2013836 (2010)","journal-title":"J. Comput. Syst. Sci."},{"key":"12_CR3","unstructured":"Betzler, N., Hemmann, S., Niedermeier, R.: A multivariate complexity analysis of determining possible winners given incomplete votes. In: Proc. of IJCAI 2009, pp. 53\u201358 (2009)"},{"issue":"52","key":"12_CR4","doi-asserted-by":"publisher","first-page":"5425","DOI":"10.1016\/j.tcs.2009.05.029","volume":"410","author":"N. Betzler","year":"2009","unstructured":"Betzler, N., Uhlmann, J.: Parameterized complexity of candidate control in elections and related digraph problems. Theor. Comput. Sci.\u00a0410(52), 5425\u20135442 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/S1574-0110(02)80008-X","volume-title":"Handbook of Social Choice and Welfare","author":"S.J. Brams","year":"2002","unstructured":"Brams, S.J., Fishburn, P.C.: Voting procedures. In: Handbook of Social Choice and Welfare, vol.\u00a01, pp. 173\u2013236. Elsevier, Amsterdam (2002)"},{"issue":"3","key":"12_CR6","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s10058-007-0028-1","volume":"11","author":"R. Christian","year":"2007","unstructured":"Christian, R., Fellows, M., Rosamond, F., Slinko, A.: On complexity of lobbying in multiple referenda. Review of Economic Design\u00a011(3), 217\u2013224 (2007)","journal-title":"Review of Economic Design"},{"issue":"3","key":"12_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? J. ACM\u00a054(3), 1\u201333 (2007)","journal-title":"J. ACM"},{"key":"12_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-642-04645-2_27","volume-title":"Algorithmic Game Theory","author":"E. Elkind","year":"2009","unstructured":"Elkind, E., Faliszewski, P., Slinko, A.: Swap bribery. In: Mavronicolas, M., Papadopoulou, V.G. (eds.) Algorithmic Game Theory. LNCS, vol.\u00a05814, pp. 299\u2013310. Springer, Heidelberg (2009)"},{"key":"12_CR10","unstructured":"Faliszewski, P.: Nonuniform bribery. In: Proc. of AAMAS 2008, pp. 1569\u20131572 (2008)"},{"key":"12_CR11","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.A.: The complexity of bribery in elections. In: Proc. of AAAI 2006, pp. 641\u2013646 (2006)"},{"key":"12_CR12","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":"12_CR13","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."},{"key":"12_CR14","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"issue":"1","key":"12_CR15","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.jcss.2006.09.002","volume":"73","author":"E. Hemaspaandra","year":"2007","unstructured":"Hemaspaandra, E., Hemaspaandra, L.A.: Dichotomy for voting systems. J. Comput. Syst. Sci.\u00a073(1), 73\u201383 (2007)","journal-title":"J. Comput. Syst. Sci."},{"key":"12_CR16","unstructured":"Konczak, K., Lang, J.: Voting procedures with incomplete preferences. In: Proc. of IJCAI 2005 Multidisciplinary Workshop on Advances in Preference Handling (2005)"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H. Lenstra","year":"1983","unstructured":"Lenstra, H.: Integer programming with a fixed number of variables. Math. of OR\u00a08, 538\u2013548 (1983)","journal-title":"Math. of OR"},{"issue":"27-29","key":"12_CR18","doi-asserted-by":"publisher","first-page":"2746","DOI":"10.1016\/j.tcs.2009.04.004","volume":"410","author":"H. Liu","year":"2009","unstructured":"Liu, H., Feng, H., Zhu, D., Luan, J.: Parameterized computational complexity of control problems in voting systems. Theor. Comput. Sci.\u00a0410(27-29), 2746\u20132753 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR19","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":"12_CR20","unstructured":"Niedermeier, R.: Reflections on multivariate algorithmics and problem parameterization. In: Proc. of STACS 2010, pp. 17\u201332 (2010)"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17493-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T12:47:42Z","timestamp":1553258862000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17493-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642174926","9783642174933"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17493-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}