Publisher
Springer Science and Business Media LLC
Subject
Management of Technology and Innovation,Strategy and Management,General Social Sciences,Arts and Humanities (miscellaneous),General Decision Sciences
Reference34 articles.
1. Barberà S, Coelho D (2008) How to choose a non-controversial list with k names. Soc Choice Welfare 31:79–96
2. Bartholdi J, Tovey CA, Trick MA (1989) Voting schemes for which it can be difficult to tell who won the election. Soc Choice Welfare 6(3):157–165
3. Betzler N, Guo J, Niedermeier R (2010) Parameterized computational complexity of Dodgson and Young elections. Inf Comput 208(2):165–177
4. Barvinok A (1994) Polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed. Math Oper Res 19:769–779
5. Barvinok A, Pommersheim J (1999) An algorithmic theory of lattice points in polyhedra. In: New perspectives in algebraic combinatorics, Berkeley, CA, 1996–1997, vol 38. Mathematical Sciences Research Institute Publications, pp 91–147
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献