Argyrios Deligkas

ORCID

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 99

Top Venues

Publications

Argyrios Deligkas, Eduard Eiben, Viktoriia Korchemna, Simon Schierreich
The Complexity of Fair Division of Indivisible Items with Externalities. AAAI (2024)
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan
Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy. ICALP (2024)
Argyrios Deligkas, Eduard Eiben, Dusan Knop, Simon Schierreich
Individual Rationality in Topological Distance Games is Surprisingly Hard. CoRR (2024)
Argyrios Deligkas, Michelle Döring, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas
Being an influencer is hard: The complexity of influence maximization in temporal graphs with a fixed source. Inf. Comput. 299 (2024)
Argyrios Deligkas, Mohammad Lotfi, Alexandros A. Voudouris
Agent-Constrained Truthful Facility Location Games. CoRR (2024)
Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith
The Parameterized Complexity of Welfare Guarantees in Schelling Segregation. AAMAS (2024)
Argyrios Deligkas, Aris Filos-Ratsikas, Alexandros A. Voudouris
Truthful interval covering. Auton. Agents Multi Agent Syst. 38 (2) (2024)
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan
Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy. CoRR (2024)
Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith
The Parameterized Complexity of Welfare Guarantees in Schelling Segregation. AAMAS (2023)
Argyrios Deligkas, Eduard Eiben, Viktoriia Korchemna, Simon Schierreich
The Complexity of Fair Division of Indivisible Items with Externalities. CoRR (2023)
Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas
Being an Influencer is Hard: The Complexity of Influence Maximization in Temporal Graphs with a Fixed Source. AAMAS (2023)
Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo
Some coordination problems are harder than others. CoRR (2023)
Argyrios Deligkas, Michail Fasoulakis, Evangelos Markakis
A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games. SIAM J. Comput. 52 (5) (2023)
Argyrios Deligkas, Michelle Döring, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas
Being an Influencer is Hard: The Complexity of Influence Maximization in Temporal Graphs with a Fixed Source. CoRR (2023)
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
The Complexity of Envy-Free Graph Cutting. CoRR (2023)
Argyrios Deligkas, Michail Fasoulakis, Evangelos Markakis
A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games. ACM Trans. Algorithms 19 (4) (2023)
Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos
Tight Inapproximability for Graphical Games. AAAI (2023)
Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo
Complexity Dichotomies for the Maximum Weighted Digraph Partition Problem. CoRR (2023)
Argyrios Deligkas, Aris Filos-Ratsikas, Alexandros A. Voudouris
Truthful Interval Covering. CoRR (2023)
Vladimir V. Gusev, Duncan Adamson, Argyrios Deligkas, Dmytro Antypov, Christopher M. Collins, Piotr Krysta, Igor Potapov, George R. Darling, Matthew S. Dyer, Paul G. Spirakis, Matthew J. Rosseinsky
Optimality guarantees for crystal structure prediction. Nat. 619 (7968) (2023)
Argyrios Deligkas, Michail Fasoulakis, Evangelos Markakis
A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games. SODA (2023)
Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo
Complexity of Efficient Outcomes in Binary-Action Polymatrix Games with Implications for Coordination Problems. CoRR (2023)
Argyrios Deligkas, Aris Filos-Ratsikas, Alexandros A. Voudouris
Heterogeneous facility location with limited resources. Games Econ. Behav. 139 (2023)
Argyrios Deligkas, Eduard Eiben, George Skretas
Minimizing Reachability Times on Temporal Graphs via Shifting Labels. IJCAI (2023)
Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo
Complexity of Efficient Outcomes in Binary-Action Polymatrix Games and Implications for Coordination Problems. IJCAI (2023)
Alon Cohen, Argyrios Deligkas, Moran Koren
Learning approximately optimal contracts. Theor. Comput. Sci. 980 (2023)
Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov
The k-Centre Problem for Classes of Cyclic Words. SOFSEM (2023)
Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos
Pure-Circuit: Strong Inapproximability for PPAD. FOCS (2022)
Argyrios Deligkas, Aris Filos-Ratsikas, Alexandros Hollender
Two's company, three's a crowd: Consensus-halving for a constant number of agents. Artif. Intell. 313 (2022)
Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos
Pure-Circuit: Strong Inapproximability for PPAD. CoRR (2022)
Argyrios Deligkas, Aris Filos-Ratsikas, Alexandros A. Voudouris
Heterogeneous Facility Location with Limited Resources. AAAI (2022)
Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov
The Complexity of Periodic Energy Minimisation. MFCS (2022)
Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith
The Parameterized Complexity of Welfare Guarantees in Schelling Segregation. CoRR (2022)
Argyrios Deligkas, Igor Potapov
Optimizing reachability sets in temporal graphs by delaying. Inf. Comput. 285 (Part) (2022)
Argyrios Deligkas, Michail Fasoulakis, Evangelos Markakis
A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games. ESA (2022)
Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos
Constant inapproximability for PPA. STOC (2022)
Argyrios Deligkas, Michail Fasoulakis, Evangelos Markakis
A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games. CoRR (2022)
Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis
Approximating the existential theory of the reals. J. Comput. Syst. Sci. 125 (2022)
Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos
Tight Inapproximability for Graphical Games. CoRR (2022)
Argyrios Deligkas, Michail Fasoulakis, Evangelos Markakis
A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games. CoRR (2022)
Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos
Constant Inapproximability for PPA. CoRR (2022)
Alon Cohen, Argyrios Deligkas, Moran Koren
Learning Approximately Optimal Contracts. SAGT (2022)
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
The Complexity of Envy-Free Graph Cutting. IJCAI (2022)
Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith
Parameterized Complexity of Hotelling-Downs with Party Nominees. IJCAI (2022)
Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos
Pizza Sharing Is PPA-Hard. AAAI (2022)
Eleni C. Akrida, Argyrios Deligkas, Themistoklis Melissourgos, Paul G. Spirakis
Connected Subgraph Defense Games. Algorithmica 83 (11) (2021)
Argyrios Deligkas, Themistoklis Melissourgos, Paul G. Spirakis
Walrasian Equilibria in Markets with Small Demands. AAMAS (2021)
Argyrios Deligkas, Eduard Eiben, George Skretas
Minimizing Reachability Times on Temporal Graphs via Shifting Labels. CoRR (2021)
Argyrios Deligkas, Aris Filos-Ratsikas, Alexandros Hollender
Two's Company, Three's a Crowd: Consensus-Halving for a Constant Number of Agents. EC (2021)
Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov
Ranking Bracelets in Polynomial Time. CoRR (2021)
Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov
The k-Centre Selection Problem for Multidimensional Necklaces. CoRR (2021)
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
The Parameterized Complexity of Connected Fair Division. IJCAI (2021)
Duncan Adamson, Vladimir V. Gusev, Igor Potapov, Argyrios Deligkas
Ranking Bracelets in Polynomial Time. CPM (2021)
Argyrios Deligkas, Aris Filos-Ratsikas, Alexandros A. Voudouris
Heterogeneous Facility Location with Limited Resources. CoRR (2021)
Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov
On the Hardness of Energy Minimisation for Crystal Structure Prediction. Fundam. Informaticae 184 (3) (2021)
Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis
Computing exact solutions of consensus halving and the Borsuk-Ulam theorem. J. Comput. Syst. Sci. 117 (2021)
Argyrios Deligkas, John Fearnley, Rahul Savani
Tree Polymatrix Games are PPAD-hard. CoRR (2020)
Eleni C. Akrida, Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev
Matching in Stochastically Evolving Graphs. CoRR (2020)
Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov
On the Hardness of Energy Minimisation for Crystal Structure Prediction. SOFSEM (2020)
Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos
Square-Cut Pizza Sharing is PPA-complete. CoRR (2020)
Argyrios Deligkas, John Fearnley, Paul G. Spirakis
Lipschitz Continuity and Approximate Equilibria. Algorithmica 82 (10) (2020)
Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev
Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle. CoRR (2020)
Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev
Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle. MFCS (2020)
Argyrios Deligkas, Themistoklis Melissourgos, Paul G. Spirakis
Walrasian Equilibria in Markets with Small Demands. CoRR (2020)
Dmytro Antypov, Argyrios Deligkas, Vladimir V. Gusev, Matthew J. Rosseinsky, Paul G. Spirakis, Michail Theofilatos
Crystal Structure Prediction via Oblivious Local Search. CoRR (2020)
Argyrios Deligkas, Igor Potapov
Optimizing Reachability Sets in Temporal Graphs by Delaying. AAAI (2020)
Argyrios Deligkas, Igor Potapov
Optimizing Reachability Sets in Temporal Graphs by Delaying. CoRR (2020)
Argyrios Deligkas, John Fearnley, Rahul Savani
Tree Polymatrix Games Are PPAD-Hard. ICALP (2020)
Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov
The K-Centre Problem for Necklaces. CoRR (2020)
Argyrios Deligkas, Aris Filos-Ratsikas, Alexandros Hollender
Two's Company, Three's a Crowd: Consensus-Halving for a Constant Number of Agents. CoRR (2020)
Dmytro Antypov, Argyrios Deligkas, Vladimir V. Gusev, Matthew J. Rosseinsky, Paul G. Spirakis, Michail Theofilatos
Crystal Structure Prediction via Oblivious Local Search. SEA (2020)
Eleftherios Anastasiadis, Argyrios Deligkas
Heterogeneous Facility Location Games. CoRR (2020)
Eleni C. Akrida, Argyrios Deligkas, Themistoklis Melissourgos, Paul G. Spirakis
Connected Subgraph Defense Games. CoRR (2019)
Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis
Binary Search in Graphs Revisited. Algorithmica 81 (5) (2019)
Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis
Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem. CoRR (2019)
Artur Czumaj, Argyrios Deligkas, Michail Fasoulakis, John Fearnley, Marcin Jurdzinski, Rahul Savani
Distributed Methods for Computing Approximate Equilibria. Algorithmica 81 (3) (2019)
Eleni C. Akrida, Argyrios Deligkas, Themistoklis Melissourgos, Paul G. Spirakis
Connected Subgraph Defense Games. SAGT (2019)
Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis
Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem. ICALP (2019)
Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov
On the Hardness of Energy Minimisation for Crystal Structure Prediction. CoRR (2019)
Argyrios Deligkas, John Fearnley, Rahul Savani
Inapproximability results for constrained approximate Nash equilibria. Inf. Comput. 262 (2018)
Eleftherios Anastasiadis, Argyrios Deligkas
Heterogeneous Facility Location Games. AAMAS (2018)
Alon Cohen, Moran Koren, Argyrios Deligkas
Incentivizing the Dynamic Workforce: Learning Contracts in the Gig-Economy. CoRR (2018)
Argyrios Deligkas, Reshef Meir
Directed Graph Minors and Serial-Parallel Width. MFCS (2018)
Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis
Approximating the Existential Theory of the Reals. WINE (2018)
Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis
Approximating the Existential Theory of the Reals. CoRR (2018)
Argyrios Deligkas, Erez Karpas, Ron Lavi, Rann Smorodinsky
Traffic Light Scheduling, Value of Time, and Incentives. IJCAI (2018)
Argyrios Deligkas, John Fearnley, Rahul Savani
Computing Constrained Approximate Equilibria in Polymatrix Games. SAGT (2017)
Argyrios Deligkas, John Fearnley, Rahul Savani
Computing Constrained Approximate Equilibria in Polymatrix Games. CoRR (2017)
Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis
The Computational Complexity of Weighted Greedy Matching. AAAI (2017)
Argyrios Deligkas, John Fearnley, Rahul Savani, Paul G. Spirakis
Computing Approximate Nash Equilibria in Polymatrix Games. Algorithmica 77 (2) (2017)
Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis
Binary Search in Graphs Revisited. MFCS (2017)
Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis
Binary Search in Graphs Revisited. CoRR (2017)
Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis
On the Complexity of Weighted Greedy Matchings. CoRR (2016)
Artur Czumaj, Argyrios Deligkas, Michail Fasoulakis, John Fearnley, Marcin Jurdzinski, Rahul Savani
Distributed Methods for Computing Approximate Equilibria. WINE (2016)
Argyrios Deligkas, John Fearnley, Tobenna Peter Igwe, Rahul Savani
An Empirical Study on Computing Equilibria in Polymatrix Games. CoRR (2016)
Argyrios Deligkas, John Fearnley, Rahul Savani
Inapproximability Results for Approximate Nash Equilibria. CoRR (2016)
Argyrios Deligkas, John Fearnley, Tobenna Peter Igwe, Rahul Savani
An Empirical Study on Computing Equilibria in Polymatrix Games. AAMAS (2016)
Argyrios Deligkas, John Fearnley, Rahul Savani
Inapproximability Results for Approximate Nash Equilibria. WINE (2016)
Argyrios Deligkas, John Fearnley, Paul G. Spirakis
Lipschitz Continuity and Approximate Equilibria. SAGT (2016)
Argyrios Deligkas, Paul G. Spirakis
On Equilibrium Computation in Biased Games with Quadratic Penalties. CoRR (2015)

Argyrios Deligkas.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Argyrios Deligkas