Argyrios Deligkas

2022

• Square-Cut Pizza Sharing is PPA-complete AAAI-22
  With John Fearnley and Themistoklis Melissourgos

• Heterogeneous Facility Location with Limited Resources AAAI-22
  With Aris Filos-Ratsikas and Alexandros Voudouris

• The Complexity of Envy-Free Graph Cutting IJCAI-22
  With Eduard Eiben, Robert Ganian, Thekla Hamm, and Sebastian Ordyniak

• Parameterized Complexity of Hotelling-Downs with Party Nominees IJCAI-22
  With Eduard Eiben, and Tiger-Lily Goldsmith

• Constant Inapproximability for PPA
  With John Fearnley, Alexandros Hollender, and Themistoklis Melissourgos STOC-22

2021

• Two's Company, Three's a Crowd: Consensus-Halving for a Constant Number of Agents EC-21
  With Alexandros Hollender and Aris Filos-Ratsikas

• The Parameterized Complexity of Connected Fair Division IJCAI-21
  With Eduard Eiben, Robert Ganian, Thekla Hamm, and Sebastian Ordyniak

• Walrasian Equilibria in Markets with Small Demands AAMAS-21
  With Themistoklis Melissourgos and Paul Spirakis Video

• Ranking Bracelets in Polynomial Time CPM-21
  With Duncan Adamson, Vladimir Gusev, and Igor Potapov

2020

• Tree Polymatrix Games are PPAD-hard ICALP-20
  With John Fearnley, and Rahul Savani

• Optimizing Reachability Sets in Temporal Graphs by Delaying AAAI-20
  With Igor Potapov

• Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle MFCS-20
  With George Mertzios, Paul Spirakis, and Viktor Zamaraev

• Crystal Structure Prediction via Oblivious Local Search SEA-20
  With Dmytro Antypov, Vladimir Gusev, Matthew Rosseinsky, Paul Spirakis, and Michael Theofilatos

• On the Hardness of Energy Minimisation for Crystal Structure Prediction SOFSEM-20
  With Duncan Adamson, Vladimir Gusev, and Igor Potapov

2019

• Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem ICALP-19
  With John Fearnley, Themistoklis Melissourgos, and Paul Spirakis

• Connected Subgraph Defense Games SAGT-19
  With Eleni Akrida, Themistoklis Melissourgos, and Paul Spirakis

2018

• Approximating the Existential Theory of the Reals WINE-18
  With John Fearnley, Themistoklis Melissourgos, and Paul Spirakis

• Directed Graph Minors and Serial-Parallel Width MFCS-18
  With Reshef Meir

• Traffic Light Scheduling, Value of Time, and Incentives IJCAI-18
  With Erez Karpaz, Ron Lavi, and Rann Smorodinsky

• Heterogeneous Facility Location Games AAMAS-18
  With Eleftherios Anastasiadis

2017

• Computing Constrained Approximate Equilibria in Polymatrix Games SAGT-17
  With John Fearnley and Rahul Savani

• Binary Search in Graphs Revisited MFCS-17
  With George Mertzios and Paul Spirakis

• On the Complexity of Weighted Greedy Matchings AAAI-17
  With George Mertzios and Paul Spirakis

2016

• Inapproximability Results for Approximate Nash Equilibria WINE-16
  With John Fearnley and Rahul Savani

• Distributed Methods for Computing Approximate Equilibria WINE-16
  With Artur Czumaj, Michail Fasoulakis, John Fearnley, Marcin Jurdziński, and Rahul Savani

• Lipschitz Continuity and Approximate Equilibria SAGT-16
  With John Fearnley and Paul Spirakis

• An Empirical Study on Computing Equilibria in Polymatrix Games AAMAS-16
  With John Fearnley, Tobenna Peter Igwe, and Rahul Savani

2014

• Computing approximate Nash Equilibria in Polymatrix Games WINE-14
  With John Fearnley, Rahul Savani and Paul Spirakis

• Increasing VCG Revenue by Decreasing the Quality of Items AAAI-14
  With Mingyu Guo and Rahul Savani

2013

• Revenue Maximization via Hiding Item Attributes IJCAI-13
  With Mingyu Guo