OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!
If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.
Requested Article:
Voting and Bribing in Single-Exponential Time
Dušan Knop, Martin Koutecký, Matthias Mnich
ACM Transactions on Economics and Computation (2020) Vol. 8, Iss. 3, pp. 1-28
Open Access | Times Cited: 19
Dušan Knop, Martin Koutecký, Matthias Mnich
ACM Transactions on Economics and Computation (2020) Vol. 8, Iss. 3, pp. 1-28
Open Access | Times Cited: 19
Showing 19 citing articles:
A colorful Steinitz Lemma with application to block-structured integer programs
Timm Oertel, Joseph Paat, Robert Weismantel
Mathematical Programming (2023) Vol. 204, Iss. 1-2, pp. 677-702
Closed Access | Times Cited: 5
Timm Oertel, Joseph Paat, Robert Weismantel
Mathematical Programming (2023) Vol. 204, Iss. 1-2, pp. 677-702
Closed Access | Times Cited: 5
Robustness among multiwinner voting rules
Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, et al.
Artificial Intelligence (2020) Vol. 290, pp. 103403-103403
Open Access | Times Cited: 13
Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, et al.
Artificial Intelligence (2020) Vol. 290, pp. 103403-103403
Open Access | Times Cited: 13
Winner Robustness via Swap- and Shift-Bribery: Parameterized Counting Complexity and Experiments
Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, et al.
(2021), pp. 52-58
Open Access | Times Cited: 12
Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, et al.
(2021), pp. 52-58
Open Access | Times Cited: 12
The complexity landscape of decompositional parameters for ILP: Programs with few global variables and constraints
Pavel Dvořák, Eduard Eiben, Robert Ganian, et al.
Artificial Intelligence (2021) Vol. 300, pp. 103561-103561
Open Access | Times Cited: 9
Pavel Dvořák, Eduard Eiben, Robert Ganian, et al.
Artificial Intelligence (2021) Vol. 300, pp. 103561-103561
Open Access | Times Cited: 9
Approximation and Hardness of Shift-Bribery
Piotr Faliszewski, Pasin Manurangsi, Krzysztof Sornat
Proceedings of the AAAI Conference on Artificial Intelligence (2019) Vol. 33, Iss. 01, pp. 1901-1908
Open Access | Times Cited: 6
Piotr Faliszewski, Pasin Manurangsi, Krzysztof Sornat
Proceedings of the AAAI Conference on Artificial Intelligence (2019) Vol. 33, Iss. 01, pp. 1901-1908
Open Access | Times Cited: 6
Approximation and hardness of Shift-Bribery
Piotr Faliszewski, Pasin Manurangsi, Krzysztof Sornat
Artificial Intelligence (2021) Vol. 298, pp. 103520-103520
Open Access | Times Cited: 6
Piotr Faliszewski, Pasin Manurangsi, Krzysztof Sornat
Artificial Intelligence (2021) Vol. 298, pp. 103520-103520
Open Access | Times Cited: 6
Parameterized Algorithms for MILPs with Small Treedepth
Cornelius Brand, Martin Koutecký, Sebastian Ordyniak
Proceedings of the AAAI Conference on Artificial Intelligence (2021) Vol. 35, Iss. 14, pp. 12249-12257
Open Access | Times Cited: 5
Cornelius Brand, Martin Koutecký, Sebastian Ordyniak
Proceedings of the AAAI Conference on Artificial Intelligence (2021) Vol. 35, Iss. 14, pp. 12249-12257
Open Access | Times Cited: 5
Block-structured integer programming: Can we parameterize without the largest coefficient?
Hua Chen, Lin Chen, Guochuan Zhang
Discrete Optimization (2022) Vol. 46, pp. 100743-100743
Open Access | Times Cited: 3
Hua Chen, Lin Chen, Guochuan Zhang
Discrete Optimization (2022) Vol. 46, pp. 100743-100743
Open Access | Times Cited: 3
Collapsing the Tower - On the Complexity of Multistage Stochastic IPs
Kim-Manuel Klein, Janina Reuter
Society for Industrial and Applied Mathematics eBooks (2022), pp. 348-358
Open Access | Times Cited: 3
Kim-Manuel Klein, Janina Reuter
Society for Industrial and Applied Mathematics eBooks (2022), pp. 348-358
Open Access | Times Cited: 3
Tight Lower Bounds for Block-Structured Integer Programs
Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, et al.
Lecture notes in computer science (2024), pp. 224-237
Closed Access
Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, et al.
Lecture notes in computer science (2024), pp. 224-237
Closed Access
On the Robustness of Winners: Counting Briberies in Elections
Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, et al.
arXiv (Cornell University) (2020)
Open Access | Times Cited: 3
Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, et al.
arXiv (Cornell University) (2020)
Open Access | Times Cited: 3
Electoral manipulation via influence: probabilistic model
Liangde Tao, Lin Chen, Lei Xu, et al.
Autonomous Agents and Multi-Agent Systems (2023) Vol. 37, Iss. 1
Closed Access | Times Cited: 1
Liangde Tao, Lin Chen, Lei Xu, et al.
Autonomous Agents and Multi-Agent Systems (2023) Vol. 37, Iss. 1
Closed Access | Times Cited: 1
Collapsing the Tower - On the Complexity of Multistage Stochastic IPs
Kim-Manuel Klein, Janina Reuter
ACM Transactions on Algorithms (2023) Vol. 20, Iss. 3, pp. 1-21
Open Access | Times Cited: 1
Kim-Manuel Klein, Janina Reuter
ACM Transactions on Algorithms (2023) Vol. 20, Iss. 3, pp. 1-21
Open Access | Times Cited: 1
A Mechanism for Participatory Budgeting with Funding Constraints and Project Interactions
Mohak Goyal, Sahasrajit Sarmasarkar, Ashish Goel
Lecture notes in computer science (2023), pp. 329-347
Closed Access | Times Cited: 1
Mohak Goyal, Sahasrajit Sarmasarkar, Ashish Goel
Lecture notes in computer science (2023), pp. 329-347
Closed Access | Times Cited: 1
A parameterized perspective on protecting elections
Palash Dey, Neeldhara Misra, Swaprava Nath, et al.
Theoretical Computer Science (2021) Vol. 874, pp. 15-31
Open Access | Times Cited: 3
Palash Dey, Neeldhara Misra, Swaprava Nath, et al.
Theoretical Computer Science (2021) Vol. 874, pp. 15-31
Open Access | Times Cited: 3
Complexity of Shift Bribery in Committee Elections
Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, et al.
ACM Transactions on Computation Theory (2021) Vol. 13, Iss. 3, pp. 1-25
Open Access | Times Cited: 2
Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, et al.
ACM Transactions on Computation Theory (2021) Vol. 13, Iss. 3, pp. 1-25
Open Access | Times Cited: 2
Computational complexity characterization of protecting elections from bribery
Lin Chen, Ahmed Sunny, Lei Xu, et al.
Theoretical Computer Science (2021) Vol. 891, pp. 189-209
Open Access | Times Cited: 1
Lin Chen, Ahmed Sunny, Lei Xu, et al.
Theoretical Computer Science (2021) Vol. 891, pp. 189-209
Open Access | Times Cited: 1
Computational Complexity Characterization of Protecting Elections from Bribery
Lin Chen, Ahmed Sunny, Lei Xu, et al.
Lecture notes in computer science (2020), pp. 85-97
Closed Access
Lin Chen, Ahmed Sunny, Lei Xu, et al.
Lecture notes in computer science (2020), pp. 85-97
Closed Access
Block-structured Integer Programming: Can we Parameterize without the Largest Coefficient?
Lin Chen, Hua Chen, Guochuan Zhang
arXiv (Cornell University) (2020)
Open Access
Lin Chen, Hua Chen, Guochuan Zhang
arXiv (Cornell University) (2020)
Open Access
