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:
Popular Branchings and Their Dual Certificates
Telikepalli Kavitha, Tamás Király, Jannik Matuschke, et al.
Lecture notes in computer science (2020), pp. 223-237
Closed Access | Times Cited: 9
Telikepalli Kavitha, Tamás Király, Jannik Matuschke, et al.
Lecture notes in computer science (2020), pp. 223-237
Closed Access | Times Cited: 9
Showing 9 citing articles:
Liquid Democracy with Ranked Delegations
Markus Brill, Théo Delemazure, Anne-Marie George, et al.
Proceedings of the AAAI Conference on Artificial Intelligence (2022) Vol. 36, Iss. 5, pp. 4884-4891
Open Access | Times Cited: 8
Markus Brill, Théo Delemazure, Anne-Marie George, et al.
Proceedings of the AAAI Conference on Artificial Intelligence (2022) Vol. 36, Iss. 5, pp. 4884-4891
Open Access | Times Cited: 8
On weakly and strongly popular rankings
Sonja Kraiczy, Ágnes Cseh, David F. Manlove
Discrete Applied Mathematics (2023) Vol. 340, pp. 134-152
Open Access | Times Cited: 4
Sonja Kraiczy, Ágnes Cseh, David F. Manlove
Discrete Applied Mathematics (2023) Vol. 340, pp. 134-152
Open Access | Times Cited: 4
Popular branchings and their dual certificates
Telikepalli Kavitha, Tamás Király, Jannik Matuschke, et al.
Mathematical Programming (2021) Vol. 192, Iss. 1-2, pp. 567-595
Open Access | Times Cited: 8
Telikepalli Kavitha, Tamás Király, Jannik Matuschke, et al.
Mathematical Programming (2021) Vol. 192, Iss. 1-2, pp. 567-595
Open Access | Times Cited: 8
An Approval-Based Model for Single-Step Liquid Democracy
Evangelos Markakis, Georgios Papasotiropoulos
Lecture notes in computer science (2021), pp. 360-375
Closed Access | Times Cited: 5
Evangelos Markakis, Georgios Papasotiropoulos
Lecture notes in computer science (2021), pp. 360-375
Closed Access | Times Cited: 5
From Computational Social Choice to Digital Democracy
Markus Brill
(2021), pp. 4937-4939
Open Access | Times Cited: 4
Markus Brill
(2021), pp. 4937-4939
Open Access | Times Cited: 4
Unveiling the Truth in Liquid Democracy with Misinformed Voters
Ruben Becker, Gianlorenzo D’Angelo, Esmaeil Delfaraz, et al.
Lecture notes in computer science (2021), pp. 132-146
Open Access | Times Cited: 4
Ruben Becker, Gianlorenzo D’Angelo, Esmaeil Delfaraz, et al.
Lecture notes in computer science (2021), pp. 132-146
Open Access | Times Cited: 4
Unravelling Expressive Delegations: Complexity and Normative Analysis
Giannis Tyrovolas, Andrei Constantinescu, Edith Elkind
Proceedings of the AAAI Conference on Artificial Intelligence (2024) Vol. 38, Iss. 9, pp. 9918-9925
Open Access
Giannis Tyrovolas, Andrei Constantinescu, Edith Elkind
Proceedings of the AAAI Conference on Artificial Intelligence (2024) Vol. 38, Iss. 9, pp. 9918-9925
Open Access
On absolutely and simply popular rankings.
Sonja Kraiczy, Ágnes Cseh, David F. Manlove
arXiv (Cornell University) (2021)
Closed Access | Times Cited: 1
Sonja Kraiczy, Ágnes Cseh, David F. Manlove
arXiv (Cornell University) (2021)
Closed Access | Times Cited: 1
Finding Popular Branchings in Vertex-Weighted Digraphs
Kei Natsui, Kenjiro Takazawa
Lecture notes in computer science (2022), pp. 303-314
Closed Access
Kei Natsui, Kenjiro Takazawa
Lecture notes in computer science (2022), pp. 303-314
Closed Access
