1. O( ? logn) approximation algorithms for min uncut, min 2cnf deletion, and directed cut problems;A Agarwal;Proceedings of the ACM symposium on Theory of computing,2005
2. Aggregating dependency graphs into voting agendas in multi-issue elections;S Airiau;Proceedings of the International Joint Conference on Artificial Intelligence,2011
3. Multiple referenda and multiwinner elections using Hamming distances: Complexity and manipulability;G Amanatidis;Proceedings of the International Conference on Autonomous Agents and Multiagent Systems,2015
4. Approximating min 2-sat and min 3-sat;A Avidor;Theory of Computing Systems,2005
5. Conditional and sequential approval voting on combinatorial domains;N Barrot;Proceedings of the International Joint Conference on Artificial Intelligence,2016