Argyrios Deligkas
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
46
Venues
12
Active years
2013–2026
Best venue rank
A*
Where they publish
Papers
46 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | AAAI | Network Restoration Games with Quotas (Student Abstract). | Philip Bogaars, Argyrios Deligkas, Eduard Eiben, Michail Fasoulakis |
| 2026 | AAAI | Dividing Indivisible Items for the Benefit of All: It Is Hard to Be Fair Without Social Awareness. | Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith, Dusan Knop, Simon Schierreich |
| 2026 | AAAI | Public Goods Games in Directed Networks with Constraints on Sharing. | Argyrios Deligkas, Gregory Z. Gutin, Mark Jones, Philip R. Neary, Anders Yeo |
| 2026 | ESA | Maximizing Reachability via Shifting of Temporal Paths. | Argyrios Deligkas, Michelle Dring, Eduard Eiben, George Skretas, Georg Tennigkeit |
| 2026 | ICALP | Coordinated Motion Planning Is FPT on Discretized Simple Polygons. | Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj |
| 2026 | STOC | Fisher Markets with Approximately Optimal Bundles and the Need for a PCP Theorem for PPAD. | Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos |
| 2025 | AAAI | How Many Lines to Paint the City: Exact Edge-Cover in Temporal Graphs. | Argyrios Deligkas, Michelle Dring, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas, Georg Tennigkeit |
| 2025 | AAAI | The Complexity of Extending Fair Allocations of Indivisible Goods. | Argyrios Deligkas, Eduard Eiben, Robert Ganian, Tiger-Lily Goldsmith, Stavros D. Ioannidis |
| 2025 | AAAI | Balanced and Fair Partitioning of Friends. | Argyrios Deligkas, Eduard Eiben, Stavros D. Ioannidis, Dusan Knop, Simon Schierreich |
| 2025 | IJCAI | EF1 and EFX Orientations. | Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith, Viktoriia Korchemna |
| 2025 | WADS | Routing Few Robots in a Crowded Network. | Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, Dominik Leko, M. S. Ramanujan |
| 2024 | AAAI | The Complexity of Fair Division of Indivisible Items with Externalities. | Argyrios Deligkas, Eduard Eiben, Viktoriia Korchemna, Simon Schierreich |
| 2024 | ICALP | Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy. | Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan |
| 2024 | IJCAI | Individual Rationality in Topological Distance Games Is Surprisingly Hard. | Argyrios Deligkas, Eduard Eiben, Dusan Knop, Simon Schierreich |
| 2024 | IJCAI | Truthful Interval Covering. | Argyrios Deligkas, Aris Filos-Ratsikas, Alexandros A. Voudouris |
| 2024 | SAGT | Agent-Constrained Truthful Facility Location Games. | Argyrios Deligkas, Mohammad Lotfi, Alexandros A. Voudouris |
| 2023 | AAAI | Tight Inapproximability for Graphical Games. | Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos |
| 2023 | IJCAI | 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 |
| 2023 | IJCAI | Minimizing Reachability Times on Temporal Graphs via Shifting Labels. | Argyrios Deligkas, Eduard Eiben, George Skretas |
| 2023 | SODA | A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games. | Argyrios Deligkas, Michail Fasoulakis, Evangelos Markakis |
| 2023 | SOFSEM | The k-Centre Problem for Classes of Cyclic Words. | Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov |
| 2022 | AAAI | Pizza Sharing Is PPA-Hard. | Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos |
| 2022 | AAAI | Heterogeneous Facility Location with Limited Resources. | Argyrios Deligkas, Aris Filos-Ratsikas, Alexandros A. Voudouris |
| 2022 | ESA | A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games. | Argyrios Deligkas, Michail Fasoulakis, Evangelos Markakis |
| 2022 | FOCS | Pure-Circuit: Strong Inapproximability for PPAD. | Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos |
| 2022 | IJCAI | Parameterized Complexity of Hotelling-Downs with Party Nominees. | Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith |
| 2022 | IJCAI | The Complexity of Envy-Free Graph Cutting. | Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak |
| 2022 | MFCS | The Complexity of Periodic Energy Minimisation. | Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov |
| 2022 | STOC | Constant inapproximability for PPA. | Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos |
| 2022 | SAGT | Learning Approximately Optimal Contracts. | Alon Cohen, Argyrios Deligkas, Moran Koren |
| 2021 | CPM | Ranking Bracelets in Polynomial Time. | Duncan Adamson, Vladimir V. Gusev, Igor Potapov, Argyrios Deligkas |
| 2021 | IJCAI | The Parameterized Complexity of Connected Fair Division. | Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak |
| 2020 | AAAI | Optimizing Reachability Sets in Temporal Graphs by Delaying. | Argyrios Deligkas, Igor Potapov |
| 2020 | ICALP | Tree Polymatrix Games Are PPAD-Hard. | Argyrios Deligkas, John Fearnley, Rahul Savani |
| 2020 | MFCS | Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle. | Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev |
| 2020 | SOFSEM | On the Hardness of Energy Minimisation for Crystal Structure Prediction. | Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov |
| 2019 | ICALP | Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem. | Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis |
| 2019 | SAGT | Connected Subgraph Defense Games. | Eleni C. Akrida, Argyrios Deligkas, Themistoklis Melissourgos, Paul G. Spirakis |
| 2018 | IJCAI | Traffic Light Scheduling, Value of Time, and Incentives. | Argyrios Deligkas, Erez Karpas, Ron Lavi, Rann Smorodinsky |
| 2018 | MFCS | Directed Graph Minors and Serial-Parallel Width. | Argyrios Deligkas, Reshef Meir |
| 2017 | AAAI | The Computational Complexity of Weighted Greedy Matching. | Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis |
| 2017 | MFCS | Binary Search in Graphs Revisited. | Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis |
| 2017 | SAGT | Computing Constrained Approximate Equilibria in Polymatrix Games. | Argyrios Deligkas, John Fearnley, Rahul Savani |
| 2016 | SAGT | Lipschitz Continuity and Approximate Equilibria. | Argyrios Deligkas, John Fearnley, Paul G. Spirakis |
| 2014 | AAAI | Increasing VCG Revenue by Decreasing the Quality of Items. | Mingyu Guo, Argyrios Deligkas, Rahul Savani |
| 2013 | IJCAI | Revenue Maximization via Hiding Item Attributes. | Mingyu Guo, Argyrios Deligkas |