• On the linearity of strongly monotone mechanisms for multi-parameter domains. Annamaria Kovacs and Angelina Vidali
• Approaching Utopia: Strong Truthfulness and Externality-Resistant Mechanisms. Amos Fiat, Anna Karlin, Elias Koutsoupias and Angelina Vidali (4th Innovations in Theoretical Computer Science Conference) ITCS'13
• A complete characterization of group-strategyproof mechanisms of cost-sharing. Emmanouil Pountourakis and Angelina Vidali. to appear in Algorithmica special issue for ESA
• PhD Thesis: Game-theoretic Analysis of Networks, University of Athens, 17 June '09, advisor: Elias Koutsoupias
• A lower bound for scheduling mechanisms. George Christodoulou, Elias Koutsoupias and Angelina Vidali, Algorithmica 55(4): 729-740, 2009
• Multi-parameter mechanism design under budget and matroid constraints. Monika Henzinger and Angelina Vidali, 19th Annual European Symposium on Algorithms, (ESA'11)
• Extending characterizations from subdomains to domains. Angelina Vidali, 7th Workshop in Internet and Network Economics (WINE '11)
• Master's Thesis: Continued Fractions and average case analysis of the Euclidean Algorithm. Advisor: Yiannis Moschovakis
• A lower bound for scheduling mechanisms. Elias Koutsoupias and Angelina Vidali, 18th ACM-SIAM Symposium on Discrete Algorithms (SODA'07)
• A $1+\phi$ lower bound for truthful scheduling mechanisms. Elias Koutsoupias and Angelina Vidali, 32nd International Symposium on Mathematical Foundations of Computer Science (MFCS '07).
• A characterization of 2-player mechanisms for scheduling. George Christodoulou, Elias Koutsoupias and Angelina Vidali, 16th Annual European Symposium on Algorithms (ESA'08).
• The Geometry of Truthfulness. Angelina Vidali, 5th Workshop in Internet and Network Economics (WINE '09).
• A complete characterization of group-strategyproof mechanisms of cost-sharing. Emmanouil Pountourakis and Angelina Vidali, (18th Annual European Symposium on Algorithms) ESA'10.