Browse by People

Deligkas, Argyrios, Fearnley, John, Melissourgos, Themistoklis ORCID: 0000-0002-9867-6257 and Spirakis, Paul G ORCID: 0000-0001-5396-3749 (2018) Approximating the Existential Theory of the Reals. In: 14th Conference on Web and Internet Economics (WINE 2018), 2018-12-15 - 2018-12-17, Oxford , UK.

Deligkas, Argyrios, Fearnley, John, Melissourgos, Themistoklis and Spirakis, Paul G ORCID: 0000-0001-5396-3749 (2022) Approximating the existential theory of the reals. Journal of Computer and System Sciences, 125. pp. 106-128.

Deligkas, Argyrios, Mertzios, George B and Spirakis, Paul G ORCID: 0000-0001-5396-3749 (2017) Binary Search in Graphs Revisited. In: Mathematical Foundations Of Computer Science (MFCS) 2017, 2017-8-21 - 2017-8-25, Aalborg , Denmark.

Adamson, Duncan, Deligkas, Argyrios, Gusev, Vladimir V and Potapov, Igor (2021) Combinatorial Algorithms for Multidimensional Necklaces. [Preprint]

Deligkas, Argyrios, Mertzios, George B and Spirakis, Paul G ORCID: 0000-0001-5396-3749 (2017) The Computational Complexity of Weighted Greedy Matching. In: Thirty First AAAI Conference on Artificial Intelligence AAAI 2017, 2017-2-4 - 2017-2-9, San Francisco US.

Deligkas, Argyrios, Fearnley, John, Savani, Rahul ORCID: 0000-0003-1262-7831 and Spirakis, Paul ORCID: 0000-0001-5396-3749 (2017) Computing Approximate Nash Equilibria in Polymatrix Games. ALGORITHMICA, 77 (2). pp. 487-514.

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

Deligkas, Argyrios, Fearnley, John, Melissourgos, Themistoklis ORCID: 0000-0002-9867-6257 and Spirakis, Paul G ORCID: 0000-0001-5396-3749 (2019) Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem. Leibniz International Proceedings in Informatics, LIPIcs, 132.

Deligkas, Argyrios, Fearnley, John, Melissourgos, Themistoklis ORCID: 0000-0002-9867-6257 and Spirakis, Paul G ORCID: 0000-0001-5396-3749 (2021) Computing exact solutions of consensus halving and the Borsuk-Ulam theorem. In: ICALP 2019.

Akrida, Eleni C, Deligkas, Argyrios, Melissourgos, Themistoklis and Spirakis, Paul G ORCID: 0000-0001-5396-3749 (2021) Connected Subgraph Defense Games. ALGORITHMICA, 83 (11). pp. 3403-3431.

Akrida, Eleni C ORCID: 0000-0002-1126-1623, Deligkas, Argyrios, Melissourgos, Themistoklis ORCID: 0000-0002-9867-6257 and Spirakis, Paul G ORCID: 0000-0001-5396-3749 (2019) Connected Subgraph Defense Games. In: Algorithmic Game Theory.

Deligkas, Argyrios, Fearnley, John, Hollender, Alexandros and Melissourgos, Themistoklis (2022) Constant Inapproximability for PPA. In: STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing.

Deligkas, Argyrios, Fearnley, John, Hollender, Alexandros and Melissourgos, Themistoklis (2022) Constant Inapproximability for PPA. [Preprint]

Antypov, Dmytro ORCID: 0000-0003-1893-7785, Deligkas, Argyrios, Gusev, Vladimir, Rosseinsky, Matthew J ORCID: 0000-0002-1910-2483, Spirakis, Paul G ORCID: 0000-0001-5396-3749 and Theofilatos, Michail ORCID: 0000-0002-3699-0179 (2020) Crystal Structure Prediction via Oblivious Local Search. 18th Symposium on Experimental Algorithms (SEA 2020), 160. 21:1-21:14.

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

Czumaj, Artur, Deligkas, Argyrios, Fasoulakis, Michail, Fearnley, JS, Jurdzinski, Marcin and Savani, Rahul ORCID: 0000-0003-1262-7831 (2019) Distributed Methods for Computing Approximate Equilibria. Algorithmica: an international journal in computer science, 81 (3). pp. 1205-1231.

Deligkas, Argyrios, Mertzios, George B, Spirakis, Paul G ORCID: 0000-0001-5396-3749 and Zamaraev, Viktor ORCID: 0000-0001-5755-4141 (2020) Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle. Leibniz International Proceedings in Informatics, LIPIcs, 170.

Deligkas, Argyrios, Fearnley, John and Savani, Rahul ORCID: 0000-0003-1262-7831 (2016) Inapproximability Results for Approximate Nash Equilibria. .

Deligkas, Argyrios, Fearnley, John and Savani, Rahul ORCID: 0000-0003-1262-7831 (2016) Inapproximability Results for Approximate Nash Equilibria. In: WINE 2016: The 12th Conference on Web and Internet Economics.

Deligkas, Argyrios, Fearnley, JS and Savani, Rahul ORCID: 0000-0003-1262-7831 (2018) Inapproximability results for constrained approximate Nash equilibria. Information and Computation, 262 (1). pp. 40-56.

Guo, Mingyu, Deligkas, Argyrios and Savani, Rahul ORCID: 0000-0003-1262-7831 (2014) Increasing VCG Revenue by Decreasing the Quality of Items. In: AAAI Conference on Artificial Intelligence Twenty-Eighth AAAI Conference on Artificial Intelligence, Québec City, Québec, Canada.

Adamson, Duncan, Deligkas, Argyrios, Gusev, Vladimir V and Potapov, Igor (2020) The K-Centre Problem for Necklaces. [Internet Publication]

Cohen, Alon, Koren, Moran and Deligkas, Argyrios (2018) Learning Approximately Optimal Contracts. CoRR, abs/18.

Deligkas, Argyrios, Fearnley, John and Spirakis, Paul ORCID: 0000-0001-5396-3749 (2020) Lipschitz Continuity and Approximate Equilibria. In: Symposium on Algorithmic Game Theory (SAGT), 2016-9-19 - 2016-9-21, Liverpool UK.

Adamson, Duncan, Deligkas, Argyrios, Gusev, Vladimir V and Potapov, Igor (2020) On the Hardness of Energy Minimisation for Crystal Structure Prediction. [Internet Publication]

Adamson, Duncan ORCID: 0000-0003-3343-2435, Deligkas, Argyrios, Gusev, Vladimir V and Potapov, Igor (2021) On the Hardness of Energy Minimisation for Crystal Structure Prediction. FUNDAMENTA INFORMATICAE, 184 (3). pp. 181-203.

Collapse authors list.
Adamson, Duncan ORCID: 0000-0003-3343-2435, Gusev, Vladimir V, Deligkas, Argyrios, Antypov, Dmytro ORCID: 0000-0003-1893-7785, Collins, Chritopher M ORCID: 0000-0002-0101-4426, Krysta, Piotr, Potapov, Igor, Darling, George R ORCID: 0000-0001-9329-9993, Dyer, Matthew S ORCID: 0000-0002-4923-3003, Spirakis, Paul ORCID: 0000-0001-5396-3749 et al (show 1 more authors) and Rosseinsky, Matthew J ORCID: 0000-0002-1910-2483 (2023) Optimality Guarantees for Crystal Structure Prediction. Nature, 619 (7968). 68-+.

Deligkas, Argyrios and Potapov, Igor (2020) Optimizing Reachability Sets in Temporal Graphs by Delaying. [Internet Publication]

Deligkas, Argyrios and Potapov, Igor (2022) Optimizing reachability sets in temporal graphs by delaying. INFORMATION AND COMPUTATION, 285. pp. 9810-9817.

Deligkas, Argyrios and Potapov, Igor (2022) Optimizing reachability sets in temporal graphs by delaying. Information and Computation, 285. p. 104890.

Deligkas, Argyrios, Fearnley, John and Melissourgos, Themistoklis (2022) Pizza Sharing Is PPA-Hard. THIRTY-SIXTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FOURTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE / THE TWELVETH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 36. pp. 4957-4965.

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

Deligkas, Argyrios, Fearnley, John, Alexandros, Hollender and Themistoklis, Melissourgos (2022) Pure-Circuit: Strong Inapproximability for PPAD. In: FOCS 2022, 2022-10-31 - 2022-11-3.

Adamson, Duncan, Deligkas, Argyrios, Gusev, Vladimir V and Potapov, Igor (2021) Ranking Bracelets in Polynomial Time. In: 32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021).

Deligkas, Argyrios, Fearnley, John and Savani, Rahul ORCID: 0000-0003-1262-7831 (2020) Tree Polymatrix Games Are PPAD-Hard. In: ICALP 2020.

Deligkas, Argyrios, Fearnley, John and Savani, Rahul ORCID: 0000-0003-1262-7831 (2020) Tree Polymatrix Games are PPAD-hard. In: 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), 2020-7-8 - 2020-7-12, Beijing.

Deligkas, Argyrios, Filos-Ratsikas, Aris ORCID: 0000-0001-7868-8114 and Hollender, Alexandros (2021) Two's Company, Three's a Crowd: Consensus-Halving for a Constant Number of Agents. In: EC '21: The 22nd ACM Conference on Economics and Computation, Budapest, Hungary.

Adamson, Duncan ORCID: 0000-0003-3343-2435, Deligkas, Argyrios, Gusev, Vladimir V and Potapov, Igor (2023) The k-Centre Problem for Classes of Cyclic Words. .