Georgios Amanatidis
TitleCited byYear
Provably-secure schemes for basic query support in outsourced databases
G Amanatidis, A Boldyreva, A O’Neill
IFIP Annual Conference on Data and Applications Security and Privacy, 14-30, 2007
772007
Approximation algorithms for computing maximin share allocations
G Amanatidis, E Markakis, A Nikzad, A Saberi
ACM Transactions on Algorithms (TALG) 13 (4), 52, 2017
502017
Graphic realizations of joint-degree matrices
Y Amanatidis, B Green, M Mihail
21*2008
Multiple referenda and multiwinner elections using hamming distances: Complexity and manipulability
G Amanatidis, N Barrot, J Lang, E Markakis, B Ries
Proceedings of the 2015 International Conference on Autonomous Agents and …, 2015
182015
Truthful allocation mechanisms without payments: Characterization and implications on fairness
G Amanatidis, G Birmpas, G Christodoulou, E Markakis
Proceedings of the 2017 ACM Conference on Economics and Computation, 545-562, 2017
132017
On Truthful Mechanisms for Maximin Share Allocations
G Amanatidis, G Birmpas, E Markakis
Twenty-Fifth International Joint Conference on Artificial Intelligence …, 2016
122016
New security models and provably-secure schemes for basic query support in outsourced databases
G Amanatidis, A Boldyreva, A O’Neill
21st Annual IFIP WG 11, 8-11, 2007
72007
Comparing approximate relaxations of envy-freeness
G Amanatidis, G Birmpas, E Markakis
arXiv preprint arXiv:1806.03114, 2018
52018
Coverage, matching, and beyond: new results on budgeted mechanism design
G Amanatidis, G Birmpas, E Markakis
International Conference on Web and Internet Economics, 414-428, 2016
52016
Inequity Aversion Pricing over Social Networks: Approximation Algorithms and Hardness Results
G Amanatidis, E Markakis, K Sornat
41st International Symposium on Mathematical Foundations of Computer Science …, 2016
52016
An improved envy-free cake cutting protocol for four agents
G Amanatidis, G Christodoulou, J Fearnley, E Markakis, CA Psomas, ...
International Symposium on Algorithmic Game Theory, 87-99, 2018
42018
Flexible models for complex networks
Y Amanatidis, B Green, M Mihail
Poster at Center for Algorithms Randomness and Computation, 2008
42008
Rapid Mixing of the Switch Markov Chain for Strongly Stable Degree Sequences and 2-Class Joint Degree Matrices
G Amanatidis, P Kleer
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
1*2019
Connected realizations of joint-degree matrices
G Amanatidis, B Green, M Mihail
Discrete Applied Mathematics 250, 65-74, 2018
12018
On budget-feasible mechanism design for symmetric submodular objectives
G Amanatidis, G Birmpas, E Markakis
International Conference on Web and Internet Economics, 1-15, 2017
12017
Algorithmic and Mechanism Design Aspects of Problems with Limited—or no—Payments
G Amanatidis
Οικονομικό Πανεπιστήμιο Αθηνών. Σχολή Επιστημών και Τεχνολογίας της …, 2017
2017
Kernel Models for Complex Networks
M Mihail, Y Amanatidis, S Young
2009
Alternatives to competitive analysis
GD Amanatidis
2005
Complexity Theory PCPs and Hardness of Approximation
G Amanatidis, A Vayner
2005
The system can't perform the operation now. Try again later.
Articles 1–19