The Dodgson ranking and the Borda count: a binary comparison. - Christian Klamler (Math. Soc. Sci., 2004)

The Dodgson ranking and its relation to Kemeny's method and Slater's rule. - Christian Klamler (Soc. Choice Welf., 2004)

A distance-based comparison of basic voting rules. - Daniel Eckert; Christian Klamler; Johann Mitlöhner; Christian Schlötterer (Central Eur. J. Oper. Res., 2006)

Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting Procedure. - Steven J. Brams; Michael A. Jones; Christian Klamler (Fair Division, 2007)

Better Ways to Cut a Cake - Revisited. - Steven J. Brams; Michael A. Jones; Christian Klamler (Fair Division, 2007)

The traveling group problem. - Christian Klamler; Ulrich Pferschy (Soc. Choice Welf., 2007)

Proportional pie-cutting. - Steven J. Brams; Michael A. Jones; Christian Klamler (Int. J. Game Theory, 2008)

A distance measure for choice functions. - Christian Klamler (Soc. Choice Welf., 2008)

A Geometric Approach to Paradoxes of Majority Voting in Abstract Aggregation Theory. - Daniel Eckert; Christian Klamler (ADT, 2009)

Committee Selection with a Weight Constraint Based on Lexicographic Rankings of Individuals. - Christian Klamler; Ulrich Pferschy; Stefan Ruzika (ADT, 2009)

Maximizing the minimum voter satisfaction on spanning trees. - Andreas Darmann; Christian Klamler; Ulrich Pferschy (Math. Soc. Sci., 2009)

Fair Division. - Christian Klamler (Handbook of Group Decision and Negotiation, 2010)

A note on maximizing the minimum voter satisfaction on spanning trees. - Andreas Darmann; Christian Klamler; Ulrich Pferschy (Math. Soc. Sci., 2010)

Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting Algorithm. - Steven J. Brams; Michael A. Jones; Christian Klamler (SIAM Rev., 2011)

Distance-Based Aggregation Theory. - Daniel Eckert; Christian Klamler (Consensual Processes, 2011)

Computation and Incentives in Social Choice (Dagstuhl Seminar 12101). - Edith Elkind; Christian Klamler; Jeffrey S. Rosenschein; M. Remzi Sanver (Dagstuhl Reports, 2012)

Committee selection under weight constraints. - Christian Klamler; Ulrich Pferschy; Stefan Ruzika (Math. Soc. Sci., 2012)

The undercut procedure: an algorithm for the envy-free division of indivisible items. - Steven J. Brams; D. Marc Kilgour; Christian Klamler (Soc. Choice Welf., 2012)

N-Person Cake-Cutting: There May Be No Perfect Division. - Steven J. Brams; Michael A. Jones; Christian Klamler (Am. Math. Mon., 2013)

Proportional Borda allocations. - Andreas Darmann; Christian Klamler (Soc. Choice Welf., 2016)

Using the Borda rule for ranking sets of objects. - Andreas Darmann; Christian Klamler (Soc. Choice Welf., 2019)

Two-Person Fair Division of Indivisible Items when Envy-Freeness is Impossible. - Steven J. Brams; D. Marc Kilgour; Christian Klamler (Oper. Res. Forum, 2022)