Journals

[J24] Pizza Sharing is PPA-hard ,  TOCT
With John Fearnley, and Themistoklis Melissourgos

[J23] Agent-Constrained Truthful Facility Location Games, JOCO
With Mohammad Lotfi, and Alexandros Voudouris

[J22] Constant Inapproximability for PPA ,  SICOMP
With John Fearnley, Alexandros Hollender, and Themistoklis Melissourgos

[J21] Pure-Circuit: Tight Inapproximability for PPAD ,  JACM
With John Fearnley, Alexandros Hollender, and Themistoklis Melissourgos

[J20] Truthful interval covering,  JAAMAS
With Aris Filos-Ratsikas and Alexandros Voudouris

[J19] The parameterized complexity of welfare guarantees in Schelling segregation, TCS
With Eduard Eiben and Tiger-Lily Goldsmith

[J18] Approximate and Randomized algorithms for Computing a Second Hamiltonian Cycle, Algorithmica
With George Mertzios, Paul Spirakis, Viktor Zamaraev 

[J17] Being an Influencer is Hard: The Complexity of Influence Maximization in Temporal Graphs with a Fixed Source, Information and Computation
With Michelle Döring, Eduard Eiben, Tiger-Lily Goldsmith, and George Skretas

[J16] Learning approximately optimal contracts, Theoretical Computer Science
With Alon Cohen and Moran Koren

[J15] Optimality guarantees for crystal structure prediction, Nature
With Vladimir Gusev, Duncan Adamson, Dmytro Antypov, Chris Collins, Piotr Krysta, Igor Potapov, Matthew Dyer, Paul Spirakis, Matt Rosseinsky

[J14] A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games, SICOMP
With Michail Fasoulakis and Evangelos Markakis

[J13] A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games, Transactions on Algorithms
With Michail Fasoulakis and Evangelos Markakis

[J12] Heterogeneous Facility Location with Limited Resources, Games and Economic Behavior
With Aris Filos-Ratsikas and Alexandros Voudouris

[J11] Two's company, three's crowd: Consensus-halving for a constant number of agents, ARTINT
With Aris Filos-Ratsikas and Alexandros Hollender

[J10] Optimizing Reachability Sets in Temporal Graphs by Delaying, Information and Computation
With Igor Potapov

[J9] On the Hardness of Energy Minimisation for Crystal Structure Prediction, Fundamenta Informaticae
With Duncan Adamson, Vladimir Gusev, and Igor Potapov

[J8] Approximating the Existential Theory of the Reals,   JCSS
With John Fearnley, Themistoklis Melissourgos, and Paul Spirakis

[J7] Connected Subgraph Defense Games,  Algorithmica
With Eleni Akrida, Themistoklis Melissourgos, and Paul Spirakis

[J6] Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem,  JCSS
With John Fearnley, Themistoklis Melissourgos, and Paul Spirakis

[J5] Lipschitz Continuity and Approximate Equilibria,  Algorithmica
With John Fearnley and Paul Spirakis

[J4] Binary Search on Graphs Revisited,  Algorithmica
With George Mertzios and Paul Spirakis

[J3] Distributed Methods for Computing Approximate Equilibria,  Algorithmica
With Artur Czumaj, Michail Fasoulakis, John Fearnley, Marcin Jurdzínski, and Rahul Savani

[J2] Inapproximability Results for Constrained Approximate Nash Equilibria,   Information and Computation
With John Fearnley and Rahul Savani

[J1] Computing approximate Nash Equilibria in Polymatrix Games,  Algorithmica
With John Fearnley, Rahul Savani, and Paul Spirakis