{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:10:41Z","timestamp":1725516641582},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540850960"},{"type":"electronic","value":"9783540850977"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85097-7_5","type":"book-chapter","created":{"date-parts":[[2008,8,19]],"date-time":"2008-08-19T07:18:26Z","timestamp":1219130306000},"page":"43-53","source":"Crossref","is-referenced-by-count":3,"title":["Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems"],"prefix":"10.1007","author":[{"given":"Nadja","family":"Betzler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johannes","family":"Uhlmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"8-9","key":"5_CR1","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0895-7177(92)90085-Y","volume":"16","author":"J.J. Bartholdi III","year":"1992","unstructured":"Bartholdi III, J.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"},{"issue":"3","key":"5_CR2","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.R., Rosamond, F.A., Slinko, A.M.: 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":"5_CR3","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":"5_CR4","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0304-3975(97)00101-1","volume":"209","author":"R.G. Downey","year":"1998","unstructured":"Downey, R.G., Fellows, M.R.: Threshold dominating sets and an improved version of W[2]. Theoretical Computer Science\u00a0209, 123\u2013140 (1998)","journal-title":"Theoretical Computer Science"},{"key":"5_CR5","doi-asserted-by":"crossref","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":"5_CR6","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.A., Rothe, J.: Llull and Copeland voting broadly resist bribery and control. In: Proc. of 22nd AAAI 2007, pp. 724\u2013730 (2007)"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.A., Rothe, J.: Copeland voting fully resists constructive control. In: Proc. of 4th AAIM 2008 (2008)","DOI":"10.1007\/978-3-540-68880-8_17"},{"key":"5_CR8","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, 255\u2013285 (2007)","journal-title":"Artificial Intelligence"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/BF01456961","volume":"77","author":"D. K\u00f6nig","year":"1916","unstructured":"K\u00f6nig, D.: \u00dcber Graphen und ihre Anwendungen auf Determinantentheorie und Mengenlehre. Mathematische Annalen\u00a077, 453\u2013465 (1916)","journal-title":"Mathematische Annalen"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85097-7_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:14:23Z","timestamp":1619522063000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85097-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540850960","9783540850977"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85097-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}