 | 2011 |
| 13 |  | Daniel Eckert,
Christian Klamler:
Distance-Based Aggregation Theory.
Consensual Processes 2011: 3-22 |
| 12 |  | Steven J. Brams,
Michael A. Jones,
Christian Klamler:
Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting Algorithm.
SIAM Review 53(2): 291-307 (2011) |
| 2010 |
| 11 |  | Andreas Darmann,
Christian Klamler,
Ulrich Pferschy:
A note on maximizing the minimum voter satisfaction on spanning trees.
Mathematical Social Sciences 60(1): 82-85 (2010) |
| 2009 |
| 10 |  | Daniel Eckert,
Christian Klamler:
A Geometric Approach to Paradoxes of Majority Voting in Abstract Aggregation Theory.
ADT 2009: 14-25 |
| 9 |  | Christian Klamler,
Ulrich Pferschy,
Stefan Ruzika:
Committee Selection with a Weight Constraint Based on Lexicographic Rankings of Individuals.
ADT 2009: 50-61 |
| 8 |  | Andreas Darmann,
Christian Klamler,
Ulrich Pferschy:
Maximizing the minimum voter satisfaction on spanning trees.
Mathematical Social Sciences 58(2): 238-250 (2009) |
| 2008 |
| 7 |  | Steven J. Brams,
Michael A. Jones,
Christian Klamler:
Proportional pie-cutting.
Int. J. Game Theory 36(3-4): 353-367 (2008) |
| 6 |  | Christian Klamler:
A distance measure for choice functions.
Social Choice and Welfare 30(3): 419-425 (2008) |
| 2007 |
| 5 |  | Steven J. Brams,
Michael A. Jones,
Christian Klamler:
Better Ways to Cut a Cake - Revisited.
Fair Division 2007 |
| 4 |  | Steven J. Brams,
Michael A. Jones,
Christian Klamler:
Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting Procedure.
Fair Division 2007 |
| 3 |  | Christian Klamler,
Ulrich Pferschy:
The traveling group problem.
Social Choice and Welfare 29(3): 429-452 (2007) |
| 2004 |
| 2 |  | Christian Klamler:
The Dodgson ranking and the Borda count: a binary comparison.
Mathematical Social Sciences 48(1): 103-108 (2004) |
| 1 |  | Christian Klamler:
The Dodgson ranking and its relation to Kemeny's method and Slater's rule.
Social Choice and Welfare 23(1): 91-102 (2004) |