OpenAlex Citation Counts

OpenAlex Citations Logo

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:

The maximin support method: an extension of the D’Hondt method to approval-based multiwinner elections
Luis Sánchez Fernández, Norberto Fernández, Jesús Arias Fisteus, et al.
Mathematical Programming (2022) Vol. 203, Iss. 1-2, pp. 107-134
Open Access | Times Cited: 18

Showing 18 citing articles:

Proportional Justified Representation
Luis Sánchez Fernández, Edith Elkind, Martin Lackner, et al.
Proceedings of the AAAI Conference on Artificial Intelligence (2017) Vol. 31, Iss. 1
Open Access | Times Cited: 93

Approval-Based Committee Voting: Axioms, Algorithms, and Applications.
Martin Lackner, Piotr Skowron
arXiv (Cornell University) (2020)
Closed Access | Times Cited: 22

Approval-based apportionment
Markus Brill, Paul Gölz, Dominik Peters, et al.
Mathematical Programming (2022) Vol. 203, Iss. 1-2, pp. 77-105
Open Access | Times Cited: 11

Phragmén’s voting methods and justified representation
Markus Brill, Rupert Freeman, Svante Janson, et al.
Mathematical Programming (2023) Vol. 203, Iss. 1-2, pp. 47-76
Open Access | Times Cited: 6

The Maximin Support Method: An Extension of the D’Hondt Method to Approval-Based Multiwinner Elections
Luis Sánchez Fernández, Norberto Fernández, Jesús Arias Fisteus, et al.
Proceedings of the AAAI Conference on Artificial Intelligence (2021) Vol. 35, Iss. 6, pp. 5690-5697
Open Access | Times Cited: 14

A verifiably secure and proportional committee election rule
Alfonso Cevallos, Alistair Stewart
(2021), pp. 29-42
Open Access | Times Cited: 13

Multiwinner Approval Rules as Apportionment Methods
Markus Brill, Jean‐François Laslier, Piotr Skowron
Proceedings of the AAAI Conference on Artificial Intelligence (2017) Vol. 31, Iss. 1
Open Access | Times Cited: 16

Overview of Polkadot and its Design Considerations
Jeff Burdges, Alfonso Cevallos, Peter Czaban, et al.
arXiv (Cornell University) (2020)
Closed Access | Times Cited: 9

The Expanding Approvals Rule: Improving Proportional Representation and Monotonicity
Haris Aziz, Barton E. Lee
arXiv (Cornell University) (2017)
Closed Access | Times Cited: 4

Validator election in nominated proof-of-stake.
Alfonso Cevallos, Alistair Stewart
arXiv (Cornell University) (2020)
Closed Access | Times Cited: 4

Computational Complexity of Testing Proportional Justified Representation
Haris Aziz, Shenwei Huang
arXiv (Cornell University) (2016)
Open Access | Times Cited: 3

From Computational Social Choice to Digital Democracy
Markus Brill
(2021), pp. 4937-4939
Open Access | Times Cited: 4

A Polynomial-time Algorithm to Achieve Extended Justified Representation
Haris Aziz, Shenwei Huang
arXiv (Cornell University) (2017)
Open Access | Times Cited: 3

Committees providing EJR can be computed efficiently
Luis Sánchez Fernández, Edith Elkind, Martin Lackner
arXiv (Cornell University) (2017)
Closed Access | Times Cited: 2

Sub-committee Approval Voting and Generalised Justified Representation Axioms
Haris Aziz, Barton E. Lee
arXiv (Cornell University) (2017)
Open Access | Times Cited: 1

A Quantitative Analysis of Multi-Winner Rules
Martin Lackner, Piotr Skowron
arXiv (Cornell University) (2018)
Closed Access | Times Cited: 1

Participatory Budgeting with Multiple Resources
Nima Motamed, Arie Soeteman, Simon Rey, et al.
Lecture notes in computer science (2022), pp. 330-347
Closed Access | Times Cited: 1

Page 1

Scroll to top