Nikos Karanikolas
Address: Department of Computer Engineering and Informatics, University of Patras, 26504 Rio, Greece
Voice: +30 2610 997511
E-mail: nkaranik@ceid.upatras.gr, nkaran@gmail.com
Skype: nkaran
MSN: nkaran@yahoo.com
Voice: +30 2610 997511
E-mail: nkaranik@ceid.upatras.gr, nkaran@gmail.com
Skype: nkaran
MSN: nkaran@yahoo.com
Research interests
Computational Social Choice, Design and Analysis of Algorithms, Computational Complexity, Approximation Algorithms, Algorithmic Aspects of Communication Networks
Computational Social Choice, Design and Analysis of Algorithms, Computational Complexity, Approximation Algorithms, Algorithmic Aspects of Communication Networks
Education
Department of Computer Engineering and Informatics, University of Patras, Greece
PhD candidate in Computer Science and Technology (January 2009 – today)
Thesis (tentative title): Computational Issues in Social Choice
Advisor: Professor Christos Kaklamanis
Msc in Computer Science and Technology (December 2008)
Thesis: Computational Issues in Social Choice: A study of Dodgson elections
Advisor: Professor Christos Kaklamanis
Diploma in Computer Engineering and Informatics (July 2006)
Department of Computer Engineering and Informatics, University of Patras, Greece
PhD candidate in Computer Science and Technology (January 2009 – today)
Thesis (tentative title): Computational Issues in Social Choice
Advisor: Professor Christos Kaklamanis
Msc in Computer Science and Technology (December 2008)
Thesis: Computational Issues in Social Choice: A study of Dodgson elections
Advisor: Professor Christos Kaklamanis
Diploma in Computer Engineering and Informatics (July 2006)
Journal Publications
1. I. Caragiannis, J. A. Covey, M. Feldman, C. M. Homan, C. Kaklamanis, N. Karanikolas, A. D. Procaccia, and J. S. Rosenschein. On the approximability of Dodgson and Young elections. Artificial Intelligence, to appear.
2. I. Caragiannis, C. Kaklamanis, N. Karanikolas, and A. D. Procaccia. Socially desirable approximations for Dodgson's voting rule. ACM Transactions on Algorithms, to appear.
Conference Publications
1. I. Caragiannis, J. A. Covey, M. Feldman, C. M. Homan, C. Kaklamanis, N. Karanikolas, A. D. Procaccia, and J. S. Rosenschein. On the approximability of Dodgson and Young elections. In Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 09), pp. 1058-1067, 2009. [link]
2. I. Caragiannis, C. Kaklamanis, N. Karanikolas, and A. D. Procaccia. Socially desirable approximations for Dodgson voting rule. In Proceedings of the 11th ACM Conference on Electronic Commerce (EC10), pp. 253-262, 2010. [link]
Other Publications
1. N. Karanikolas, M. Kyropoulou, and T. B. Sørensen. Editor's puzzle: Borrowing as cheaply as possible. SIGecom Exchanges, 10(2). [link]
1. I. Caragiannis, J. A. Covey, M. Feldman, C. M. Homan, C. Kaklamanis, N. Karanikolas, A. D. Procaccia, and J. S. Rosenschein. On the approximability of Dodgson and Young elections. Artificial Intelligence, to appear.
2. I. Caragiannis, C. Kaklamanis, N. Karanikolas, and A. D. Procaccia. Socially desirable approximations for Dodgson's voting rule. ACM Transactions on Algorithms, to appear.
Conference Publications
1. I. Caragiannis, J. A. Covey, M. Feldman, C. M. Homan, C. Kaklamanis, N. Karanikolas, A. D. Procaccia, and J. S. Rosenschein. On the approximability of Dodgson and Young elections. In Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 09), pp. 1058-1067, 2009. [link]
2. I. Caragiannis, C. Kaklamanis, N. Karanikolas, and A. D. Procaccia. Socially desirable approximations for Dodgson voting rule. In Proceedings of the 11th ACM Conference on Electronic Commerce (EC10), pp. 253-262, 2010. [link]
Other Publications
1. N. Karanikolas, M. Kyropoulou, and T. B. Sørensen. Editor's puzzle: Borrowing as cheaply as possible. SIGecom Exchanges, 10(2). [link]
Other interests/activities
Radio producer in the Radio station of the University of Patras, sports, travel, cinema.
Radio producer in the Radio station of the University of Patras, sports, travel, cinema.