{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T09:25:36Z","timestamp":1770888336774,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T00:00:00Z","timestamp":1691452800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T00:00:00Z","timestamp":1691452800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001843","name":"Science and Engineering Research Board","doi-asserted-by":"publisher","award":["SRG\/2019\/001870"],"award-info":[{"award-number":["SRG\/2019\/001870"]}],"id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010663","name":"H2020 European Research Council","doi-asserted-by":"publisher","award":["819416"],"award-info":[{"award-number":["819416"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Department of Science and Technology, India","award":["DST\/SJF\/MSA- 01\/2017-18"],"award-info":[{"award-number":["DST\/SJF\/MSA- 01\/2017-18"]}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"crossref","award":["630\/19"],"award-info":[{"award-number":["630\/19"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s00453-023-01155-7","type":"journal-article","created":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T19:01:42Z","timestamp":1691521302000},"page":"3717-3740","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules"],"prefix":"10.1007","volume":"85","author":[{"given":"Sushmita","family":"Gupta","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8900-9797","authenticated-orcid":false,"given":"Pallavi","family":"Jain","sequence":"additional","affiliation":[]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[]},{"given":"Nimrod","family":"Talmon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,8]]},"reference":[{"key":"1155_CR1","doi-asserted-by":"crossref","unstructured":"Aziz, H., Faliszewski, P., Grofman, B., Slinko, A., Talmon, N.: Egalitarian committee scoring rules. In: Proceedings of IJCAI \u201918, pp. 56\u201362 (2018)","DOI":"10.24963\/ijcai.2018\/8"},{"key":"1155_CR2","unstructured":"Aziz, H., Gaspers, S., Gudmundsson, J., Mackenzie, S., Mattei, N., Walsh, T.: Computational aspects of multi-winner approval voting. arXiv:1407.3247 (2014)"},{"key":"1155_CR3","doi-asserted-by":"crossref","unstructured":"Betzler, N., Bredereck, R., Chen, J., Niedermeier, R.: Studies in computational aspects of voting. In: The Multivariate Algorithmic Revolution and Beyond, pp. 318\u2013363. Springer (2012)","DOI":"10.1007\/978-3-642-30891-8_16"},{"key":"1155_CR4","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1613\/jair.3896","volume":"47","author":"N Betzler","year":"2013","unstructured":"Betzler, N., Slinko, A., Uhlmann, J.: On the computation of fully proportional representation. JAIR 47, 475\u2013519 (2013)","journal-title":"JAIR"},{"key":"1155_CR5","doi-asserted-by":"crossref","unstructured":"Bredereck, R., Faliszewski, P., Kaczmarczyk, A., Knop, D., Niedermeier, R.: Parameterized algorithms for finding a collective set of items. In: Proceedings of AAAI \u201920, pp. 1838\u20131845 (2020)","DOI":"10.1609\/aaai.v34i02.5551"},{"key":"1155_CR6","doi-asserted-by":"crossref","unstructured":"Bredereck, R., Faliszewski, P., Kaczmarczyk, A., Niedermeier, R., Skowron, P., Talmon, N.: Robustness among multiwinner voting rules. In: Proceedings of SAGT \u201917, pp. 80\u201392. Springer (2017)","DOI":"10.1007\/978-3-319-66700-3_7"},{"key":"1155_CR7","doi-asserted-by":"publisher","first-page":"718","DOI":"10.2307\/1957270","volume":"77","author":"JR Chamberlin","year":"1983","unstructured":"Chamberlin, J.R., Courant, P.N.: Representative deliberations and representative decisions: proportional representation and the Borda rule. Am. Political Sci. Rev. 77, 718\u2013733 (1983)","journal-title":"Am. Political Sci. Rev."},{"key":"1155_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Berlin (2015)"},{"issue":"40\u201342","key":"1155_CR9","doi-asserted-by":"publisher","first-page":"3701","DOI":"10.1016\/j.tcs.2010.06.018","volume":"411","author":"M Cygan","year":"2010","unstructured":"Cygan, M., Pilipczuk, M.: Exact and approximate bandwidth. Theor. Comput. Sci. 411(40\u201342), 3701\u20133713 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"1155_CR10","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1137\/S0097539792228228","volume":"24","author":"RG Downey","year":"1995","unstructured":"Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness I: basic results. SIAM J. Comput. 24(4), 873\u2013921 (1995)","journal-title":"SIAM J. Comput."},{"key":"1155_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity, vol. 4. Springer, Berlin (2013)"},{"issue":"3","key":"1155_CR12","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/s00355-017-1026-z","volume":"48","author":"E Elkind","year":"2017","unstructured":"Elkind, E., Faliszewski, P., Skowron, P., Slinko, A.: Properties of multiwinner voting rules. Soc. Choice Welf. 48(3), 599\u2013632 (2017)","journal-title":"Soc. Choice Welf."},{"key":"1155_CR13","doi-asserted-by":"crossref","unstructured":"Faliszewski, P., Lackner, M., Peters, D., Talmon, N.: Effective heuristics for committee scoring rules. In: Proceedings of AAAI \u201918 (2018)","DOI":"10.1609\/aaai.v32i1.11459"},{"key":"1155_CR14","doi-asserted-by":"crossref","unstructured":"Faliszewski, P., Skowron, P., Slinko, A., Talmon, N.: Multiwinner rules on paths from k-Borda to Chamberlin-Courant. In: Proceedings of IJCAI, pp. 192\u2013198 (2017)","DOI":"10.24963\/ijcai.2017\/28"},{"key":"1155_CR15","volume-title":"Trends in Computational Social Choice","author":"P Faliszewski","year":"2017","unstructured":"Faliszewski, P., Skowron, P., Slinko, A., Talmon, N.: Multiwinner voting: a new challenge for social choice theory. In: Endriss, U. (ed.) Trends in Computational Social Choice. AI Access Foundation, El Segundo (2017)"},{"issue":"3","key":"1155_CR16","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/s00355-018-1126-4","volume":"51","author":"P Faliszewski","year":"2018","unstructured":"Faliszewski, P., Skowron, P., Slinko, A., Talmon, N.: Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives. Soc. Choice Welf. 51(3), 513\u2013550 (2018)","journal-title":"Soc. Choice Welf."},{"issue":"1","key":"1155_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/3296672","volume":"7","author":"P Faliszewski","year":"2019","unstructured":"Faliszewski, P., Skowron, P., Slinko, A., Talmon, N.: Committee scoring rules: axiomatic characterization and hierarchy. TEAC 7(1), 3 (2019)","journal-title":"TEAC"},{"key":"1155_CR18","unstructured":"Faliszewski, P., Skowron, P., Talmon, N.: Bribery as a measure of candidate success: Complexity results for approval-based multiwinner rules. In: Proceedings of AAMAS \u201917, pp. 6\u201314 (2017)"},{"key":"1155_CR19","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"issue":"26\u201328","key":"1155_CR20","doi-asserted-by":"publisher","first-page":"2467","DOI":"10.1016\/j.tcs.2010.02.016","volume":"411","author":"QS Hua","year":"2010","unstructured":"Hua, Q.S., Wang, Y., Yu, D., Lau, F.C.M.: Dynamic programming based algorithms for set multicover and multiset multicover problems. Theor. Comput. Sci. 411(26\u201328), 2467\u20132474 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"1155_CR21","unstructured":"Liu, H., Guo, J.: Parameterized complexity of winner determination in minimax committee elections. In: Proceedings of AAMAS \u201916, pp. 341\u2013349 (2016)"},{"issue":"10","key":"1155_CR22","doi-asserted-by":"publisher","first-page":"e13055","DOI":"10.1371\/journal.pone.0013055","volume":"5","author":"D Mellor","year":"2010","unstructured":"Mellor, D., Prieto, E., Mathieson, L., Moscato, P.: A kernelisation approach for multiple d-hitting set and its application in optimal multi-drug therapeutic combinations. PLoS ONE 5(10), e13055 (2010)","journal-title":"PLoS ONE"},{"key":"1155_CR23","unstructured":"Misra, N., Nabeel, A., Singh, H.: On the parameterized complexity of minimax approval voting. In: Proceedings of AAMAS \u201915, pp. 97\u2013105 (2015)"},{"key":"1155_CR24","doi-asserted-by":"crossref","unstructured":"Moenck, R.T.: Practical fast polynomial multiplication. In: Proceedings of SYMSAC, pp. 136\u2013148 (1976)","DOI":"10.1145\/800205.806332"},{"key":"1155_CR25","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":"1155_CR26","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.artint.2016.09.003","volume":"241","author":"P Skowron","year":"2016","unstructured":"Skowron, P., Faliszewski, P., Lang, J.: Finding a collective set of items: from proportional multirepresentation to group recommendation. Artif. Intell. 241, 191\u2013216 (2016)","journal-title":"Artif. Intell."},{"key":"1155_CR27","unstructured":"Szufa, S., Faliszewski, P., Skowron, P., Slinko, A., Talmon, N.: Drawing a map of elections in the space of statistical cultures. In: Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, pp. 1341\u20131349 (2020)"},{"key":"1155_CR28","unstructured":"Yang, Y., Wang, J.: Parameterized complexity of multi-winner determination: more effort towards fixed-parameter tractability. In: Proceedings of AAMAS \u201918, pp. 2142\u20132144 (2018)"},{"key":"1155_CR29","unstructured":"Zhou, A., Yang, Y., Guo, J.: Parameterized complexity of committee elections with dichotomous and trichotomous votes. In: Proceedings of AAMAS \u201919, pp. 503\u2013510 (2019)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-023-01155-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-023-01155-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-023-01155-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,10]],"date-time":"2023-11-10T13:04:32Z","timestamp":1699621472000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-023-01155-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,8]]},"references-count":29,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["1155"],"URL":"https:\/\/doi.org\/10.1007\/s00453-023-01155-7","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,8]]},"assertion":[{"value":"25 May 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 June 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 August 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}