| Better ways to cut a cake SJ Brams, MA Jones, C Klamler Notices of the AMS 53 (11), 1314-1321, 2006 | 134 | 2006 |
| The undercut procedure: an algorithm for the envy-free division of indivisible items SJ Brams, DM Kilgour, C Klamler Social Choice and Welfare 39 (2), 615-631, 2012 | 63 | 2012 |
| Two-person fair division of indivisible items: An efficient, envy-free algorithm SJ Brams, M Kilgour, C Klamler Notices of the AMS 61 (2), 130-141, 2014 | 54 | 2014 |
| Proportional pie-cutting SJ Brams, MA Jones, C Klamler International Journal of Game Theory 36, 353-367, 2008 | 54 | 2008 |
| The Dodgson ranking and its relation to Kemeny’s method and Slater’s rule C Klamler Social Choice and Welfare 23 (1), 91-102, 2004 | 49 | 2004 |
| On the closeness aspect of three voting rules: Borda–Copeland–Maximin C Klamler Group Decision and Negotiation 14, 233-240, 2005 | 46 | 2005 |
| N-Person Cake-Cutting: There May Be No Perfect Division SJ Brams, MA Jones, C Klamler The American Mathematical Monthly 120 (1), 35-47, 2013 | 43 | 2013 |
| A distance measure for choice functions C Klamler Social Choice and Welfare 30 (3), 419-425, 2008 | 39 | 2008 |
| The Dodgson ranking and the Borda count: a binary comparison C Klamler Mathematical Social Sciences 48 (1), 103-108, 2004 | 34 | 2004 |
| The Copeland rule and Condorcet’s principle C Klamler Economic Theory 25, 745-749, 2005 | 33 | 2005 |
| A comparison of the Dodgson method and the Copeland rule C Klamler Economics Bulletin 4 (8), 1-7, 2003 | 28 | 2003 |
| Maximin envy-free division of indivisible items SJ Brams, DM Kilgour, C Klamler Group Decision and Negotiation 26, 115-131, 2017 | 27 | 2017 |
| Distance-based aggregation theory D Eckert, C Klamler Consensual processes, 3-22, 2011 | 27 | 2011 |
| Fair division C Klamler Handbook of group decision and negotiation, 183-202, 2010 | 25 | 2010 |
| A distance-based comparison of basic voting rules D Eckert, C Klamler, J Mitlöhner, C Schlötterer Central European Journal of Operations Research 14, 377-386, 2006 | 25 | 2006 |
| Borda and Condorcet: Some distance results C Klamler Theory and Decision 59, 97-109, 2005 | 22 | 2005 |
| Transitive closure, proximity and intransitivities N Baigent, C Klamler Economic Theory 23, 175-181 (2004), 2003 | 22 | 2003 |
| Election outcomes under different ways to announce preferences: an analysis of the 2015 parliament election in the Austrian federal state of Styria A Darmann, J Grundner, C Klamler Public Choice 173, 201-216, 2017 | 20 | 2017 |
| The traveling group problem C Klamler, U Pferschy Social Choice and Welfare 29 (3), 429-452, 2007 | 20 | 2007 |
| Divide-and-conquer: A proportional, minimal-envy cake-cutting algorithm SJ Brams, MA Jones, C Klamler SIAM review 53 (2), 291-307, 2011 | 18 | 2011 |
