Revenue Maximization via Hiding Item Attributes. - Mingyu Guo; Argyrios Deligkas (IJCAI, 2013)

Increasing VCG Revenue by Decreasing the Quality of Items. - Mingyu Guo; Argyrios Deligkas; Rahul Savani (AAAI, 2014)

On Equilibrium Computation in Biased Games with Quadratic Penalties. - Argyrios Deligkas; Paul G. Spirakis (CoRR, 2015)

An Empirical Study on Computing Equilibria in Polymatrix Games. - Argyrios Deligkas; John Fearnley; Tobenna Peter Igwe; Rahul Savani (AAMAS, 2016)

Inapproximability Results for Approximate Nash Equilibria. - Argyrios Deligkas; John Fearnley; Rahul Savani (WINE, 2016)

On the Complexity of Weighted Greedy Matchings. - Argyrios Deligkas; George B. Mertzios; Paul G. Spirakis (CoRR, 2016)

Efficient algorithms for computing approximate equilibria in bimatrix, polymatrix and Lipschitz games. - Argyrios Deligkas (2016)

The Computational Complexity of Weighted Greedy Matching. - Argyrios Deligkas; George B. Mertzios; Paul G. Spirakis (AAAI, 2017)

Computing Constrained Approximate Equilibria in Polymatrix Games. - Argyrios Deligkas; John Fearnley; Rahul Savani (SAGT, 2017)

Computing Approximate Nash Equilibria in Polymatrix Games. - Argyrios Deligkas; John Fearnley; Rahul Savani; Paul G. Spirakis (Algorithmica, 2017)

Heterogeneous Facility Location Games. - Eleftherios Anastasiadis; Argyrios Deligkas (AAMAS, 2018)

Traffic Light Scheduling, Value of Time, and Incentives. - Argyrios Deligkas; Erez Karpas; Ron Lavi; Rann Smorodinsky (IJCAI, 2018)

Directed Graph Minors and Serial-Parallel Width. - Argyrios Deligkas; Reshef Meir (MFCS, 2018)

Incentivizing the Dynamic Workforce: Learning Contracts in the Gig-Economy. - Alon Cohen; Moran Koren; Argyrios Deligkas (CoRR, 2018)

Inapproximability results for constrained approximate Nash equilibria. - Argyrios Deligkas; John Fearnley; Rahul Savani (Inf. Comput., 2018)

Distributed Methods for Computing Approximate Equilibria. - Artur Czumaj; Argyrios Deligkas; Michail Fasoulakis; John Fearnley; Marcin Jurdzinski; Rahul Savani (Algorithmica, 2019)

Binary Search in Graphs Revisited. - Argyrios Deligkas; George B. Mertzios; Paul G. Spirakis (Algorithmica, 2019)

Tree Polymatrix Games Are PPAD-Hard. - Argyrios Deligkas; John Fearnley; Rahul Savani (ICALP, 2020)

Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle. - Argyrios Deligkas; George B. Mertzios; Paul G. Spirakis; Viktor Zamaraev (MFCS, 2020)

Crystal Structure Prediction via Oblivious Local Search. - Dmytro Antypov; Argyrios Deligkas; Vladimir V. Gusev; Matthew J. Rosseinsky; Paul G. Spirakis; Michail Theofilatos (SEA, 2020)

Lipschitz Continuity and Approximate Equilibria. - Argyrios Deligkas; John Fearnley; Paul G. Spirakis (Algorithmica, 2020)

Matching in Stochastically Evolving Graphs. - Eleni C. Akrida; Argyrios Deligkas; George B. Mertzios; Paul G. Spirakis; Viktor Zamaraev (CoRR, 2020)

The K-Centre Problem for Necklaces. - Duncan Adamson; Argyrios Deligkas; Vladimir V. Gusev; Igor Potapov (CoRR, 2020)

Square-Cut Pizza Sharing is PPA-complete. - Argyrios Deligkas; John Fearnley; Themistoklis Melissourgos (CoRR, 2020)

Walrasian Equilibria in Markets with Small Demands. - Argyrios Deligkas; Themistoklis Melissourgos; Paul G. Spirakis (AAMAS, 2021)

Ranking Bracelets in Polynomial Time. - Duncan Adamson; Vladimir V. Gusev; Igor Potapov; Argyrios Deligkas (CPM, 2021)

The Parameterized Complexity of Connected Fair Division. - Argyrios Deligkas; Eduard Eiben; Robert Ganian; Thekla Hamm; Sebastian Ordyniak (IJCAI, 2021)

Connected Subgraph Defense Games. - Eleni C. Akrida; Argyrios Deligkas; Themistoklis Melissourgos; Paul G. Spirakis (Algorithmica, 2021)

The k-Centre Selection Problem for Multidimensional Necklaces. - Duncan Adamson; Argyrios Deligkas; Vladimir V. Gusev; Igor Potapov (CoRR, 2021)

On the Hardness of Energy Minimisation for Crystal Structure Prediction. - Duncan Adamson; Argyrios Deligkas; Vladimir V. Gusev; Igor Potapov (Fundam. Informaticae, 2021)

Computing exact solutions of consensus halving and the Borsuk-Ulam theorem. - Argyrios Deligkas; John Fearnley; Themistoklis Melissourgos; Paul G. Spirakis (J. Comput. Syst. Sci., 2021)

Pizza Sharing Is PPA-Hard. - Argyrios Deligkas; John Fearnley; Themistoklis Melissourgos (AAAI, 2022)

Pure-Circuit: Strong Inapproximability for PPAD. - Argyrios Deligkas; John Fearnley; Alexandros Hollender; Themistoklis Melissourgos (FOCS, 2022)

Parameterized Complexity of Hotelling-Downs with Party Nominees. - Argyrios Deligkas; Eduard Eiben; Tiger-Lily Goldsmith (IJCAI, 2022)

The Complexity of Envy-Free Graph Cutting. - Argyrios Deligkas; Eduard Eiben; Robert Ganian; Thekla Hamm; Sebastian Ordyniak (IJCAI, 2022)

The Complexity of Periodic Energy Minimisation. - Duncan Adamson; Argyrios Deligkas; Vladimir V. Gusev; Igor Potapov (MFCS, 2022)

Two's company, three's a crowd: Consensus-halving for a constant number of agents. - Argyrios Deligkas; Aris Filos-Ratsikas; Alexandros Hollender (Artif. Intell., 2022)

Optimizing reachability sets in temporal graphs by delaying. - Argyrios Deligkas; Igor Potapov (Inf. Comput., 2022)

Approximating the existential theory of the reals. - Argyrios Deligkas; John Fearnley; Themistoklis Melissourgos; Paul G. Spirakis (J. Comput. Syst. Sci., 2022)

Tight Inapproximability for Graphical Games. - Argyrios Deligkas; John Fearnley; Alexandros Hollender; Themistoklis Melissourgos (AAAI, 2023)

Being an Influencer is Hard: The Complexity of Influence Maximization in Temporal Graphs with a Fixed Source. - Argyrios Deligkas; Eduard Eiben; Tiger-Lily Goldsmith; George Skretas (AAMAS, 2023)

Complexity of Efficient Outcomes in Binary-Action Polymatrix Games and Implications for Coordination Problems. - Argyrios Deligkas; Eduard Eiben; Gregory Z. Gutin; Philip R. Neary; Anders Yeo (IJCAI, 2023)

Minimizing Reachability Times on Temporal Graphs via Shifting Labels. - Argyrios Deligkas; Eduard Eiben; George Skretas (IJCAI, 2023)

The k-Centre Problem for Classes of Cyclic Words. - Duncan Adamson; Argyrios Deligkas; Vladimir V. Gusev; Igor Potapov (SOFSEM, 2023)

Complexity of Efficient Outcomes in Binary-Action Polymatrix Games with Implications for Coordination Problems. - Argyrios Deligkas; Eduard Eiben; Gregory Z. Gutin; Philip R. Neary; Anders Yeo (CoRR, 2023)

Complexity Dichotomies for the Maximum Weighted Digraph Partition Problem. - Argyrios Deligkas; Eduard Eiben; Gregory Z. Gutin; Philip R. Neary; Anders Yeo (CoRR, 2023)

Some coordination problems are harder than others. - Argyrios Deligkas; Eduard Eiben; Gregory Z. Gutin; Philip R. Neary; Anders Yeo (CoRR, 2023)

Optimality guarantees for crystal structure prediction. - Vladimir V. Gusev; Duncan Adamson; Argyrios Deligkas; Dmytro Antypov; Christopher M. Collins 003; Piotr Krysta; Igor Potapov; George R. Darling; Matthew S. Dyer; Paul G. Spirakis; Matthew J. Rosseinsky (Nat., 2023)

Heterogeneous facility location with limited resources. - Argyrios Deligkas; Aris Filos-Ratsikas; Alexandros A. Voudouris (Games Econ. Behav., 2023)

A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games. - Argyrios Deligkas; Michail Fasoulakis; Evangelos Markakis (SIAM J. Comput., 2023)

A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games. - Argyrios Deligkas; Michail Fasoulakis; Evangelos Markakis (ACM Trans. Algorithms, 2023)

Learning approximately optimal contracts. - Alon Cohen; Argyrios Deligkas; Moran Koren (Theor. Comput. Sci., 2023)

The Complexity of Fair Division of Indivisible Items with Externalities. - Argyrios Deligkas; Eduard Eiben; Viktoriia Korchemna; Simon Schierreich (AAAI, 2024)

Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy. - Argyrios Deligkas; Eduard Eiben; Robert Ganian; Iyad Kanj; M. S. Ramanujan 001 (ICALP, 2024)

Individual Rationality in Topological Distance Games Is Surprisingly Hard. - Argyrios Deligkas; Eduard Eiben; Dusan Knop; Simon Schierreich (IJCAI, 2024)

Constant Inapproximability for Fisher Markets. - Argyrios Deligkas; John Fearnley; Alexandros Hollender; Themistoklis Melissourgos (EC, 2024)

EF1 and EFX Orientations. - Argyrios Deligkas; Eduard Eiben; Tiger-Lily Goldsmith; Viktoriia Korchemna (CoRR, 2024)

Being an influencer is hard: The complexity of influence maximization in temporal graphs with a fixed source. - Argyrios Deligkas; Michelle Döring; Eduard Eiben; Tiger-Lily Goldsmith; George Skretas (Inf. Comput., 2024)

The parameterized complexity of welfare guarantees in Schelling segregation. - Argyrios Deligkas; Eduard Eiben; Tiger-Lily Goldsmith (Theor. Comput. Sci., 2024)

Approximate and Randomized Algorithms for Computing a Second Hamiltonian Cycle. - Argyrios Deligkas; George B. Mertzios; Paul G. Spirakis; Viktor Zamaraev (Algorithmica, 2024)

Pure-Circuit: Tight Inapproximability for PPAD. - Argyrios Deligkas; John Fearnley; Alexandros Hollender; Themistoklis Melissourgos (J. ACM, 2024)

Truthful interval covering. - Argyrios Deligkas; Aris Filos-Ratsikas; Alexandros A. Voudouris (Auton. Agents Multi Agent Syst., 2024)

How Many Lines to Paint the City: Exact Edge-Cover in Temporal Graphs. - Argyrios Deligkas; Michelle Döring; Eduard Eiben; Tiger-Lily Goldsmith; George Skretas; Georg Tennigkeit (AAAI, 2025)

The Complexity of Extending Fair Allocations of Indivisible Goods. - Argyrios Deligkas; Eduard Eiben; Robert Ganian; Tiger-Lily Goldsmith; Stavros D. Ioannidis (AAAI, 2025)

Balanced and Fair Partitioning of Friends. - Argyrios Deligkas; Eduard Eiben; Stavros D. Ioannidis; Dusan Knop; Simon Schierreich (AAAI, 2025)

Parameterized Algorithms for Multiagent Pathfinding on Trees. - Argyrios Deligkas; Eduard Eiben; Robert Ganian; Iyad Kanj; M. S. Ramanujan 001 (AAMAS, 2025)

Routing Few Robots in a Crowded Network. - Argyrios Deligkas; Eduard Eiben; Robert Ganian; Iyad Kanj; Dominik Leko; M. S. Ramanujan 001 (WADS, 2025)

Special issue on Economics and Computation. - Argyrios Deligkas; Aris Filos-Ratsikas; Alexandros A. Voudouris (Inf. Process. Lett., 2025)

Constant Inapproximability for PPA. - Argyrios Deligkas; John Fearnley; Alexandros Hollender; Themistoklis Melissourgos (SIAM J. Comput., 2025)

Agent-constrained truthful facility location games. - Argyrios Deligkas; Mohammad Lotfi; Alexandros A. Voudouris (J. Comb. Optim., 2025)