Conferences

2025

• [C50]  How Many Lines to Paint the City: Exact Edge-Cover in Temporal Graphs AAAI-25
  With  Michelle Döring, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas, and Georg Tennigkeit

• [C49]  The Complexity of Extending Fair Allocations of Indivisible Goods AAAI-25
  With  Eduard Eiben, Robert Ganian, Tiger-Lily Goldsmith, and Stavros Ioannidis

• [C48]  Balanced and Fair Partitioning of Friends AAAI-25
  With  Eduard Eiben, Stavros Ioannidis, Dusan Knop, and Simon Schierreich

2024

• [C47] Constant Inapproximability for Fisher Markets  EC-24
  With John Fearnley, Alexandros Hollender, and Themistoklis Melissourgos

• [C46]  Agent-Constrained Truthful Facility Location Games SAGT-24
  With Mohammad Lotfi and Alexandros Voudouris

• [C46]  Truthful Interval Covering IJCAI-24
  With  Aris Filos-Ratsikas and Alexandros Voudouris

• [C45]  Individual Rationality in Topological Distance Games is Surprisingly Hard IJCAI-24
  With  Eduard Eiben,  Dusan Knop, and Simon Schierreich

• [C44] Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy  ICALP-24
  With  Eduard Eiben, Robert Ganian, Iyad Kanj, and M. S. Ramanujan

• [C43] The Complexity of Fair Division of Indivisible Items with Externalities  AAAI-24
  With  Eduard Eiben, Viktoriia Korchemna, and Simon Schierreich

• [C42] The Parameterized Complexity of Welfare Guarantees in Schelling Segregation AAMAS-24
  With Eduard Eiben and Tiger-Lily Goldsmith

2023

• [C41] Tight Inapproximability for Graphical Games AAAI-23
  With John Fearnley, Alexandros Hollender, and Themistoklis Melissourgos

• [C40] Being an Influencer is Hard: The Complexity of Influence Maximization in Temporal Graphs with a Fixed Source AAMAS-23
  With Eduard Eiben, Tiger-Lily Goldsmith, and George Skretas

• [C39] The Parameterized Complexity of Welfare Guarantees in Schelling Segregation (Extended Abstract) AAMAS-23
  With Eduard Eiben and Tiger-Lily Goldsmith

• [C38] Minimizing reachability times on temporal graphs via shifting labels IJCAI-23
  With Eduard Eiben and George Skretas

• [C37] Complexity of Efficient Outcomes in Binary-Action Polymatrix Games and Implications for Coordination Problems IJCAI-23
  With Eduard Eiben, Gregory Gutin, Philip Neary, and Anders Yeo

• [C36] A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games SODA-23
  With Michail Fasoulakis and Evangelos Markakis

• [C35] The k-center Problem for Classes of Cyclic Words  SOFSEM-23
  With Duncan Adamson, Vladimir Gusev, and Igor Potapov

2022

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

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

• [C32] A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games  ESA-22
  With Michail Fasoulakis and Evangelos Markakis

• [C31] PURE-Circuit: Strong Inapproximability for PPAD FOCS-22
  With John Fearnley, Alexandros Hollender, and Themistoklis Melissourgos  

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

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

• [C28] The Complexity of Periodic Energy Minimisation MFCS-22
  With Duncan Adamson, Vladimir Gusev, and Igor Potapov

• [C27] Learning Approximately Optimal Contracts SAGT-22
  With Alon Cohen and Moran Koren

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

2021

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

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

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

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

2020

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

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

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

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

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

2019

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

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

2018

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

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

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

• [C11] Heterogeneous Facility Location Games AAMAS-18
  With Eleftherios Anastasiadis

2017

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

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

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

2016

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

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

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

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

2014

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

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

2013

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