Schulz, Andreas S.;Telha, Claudio
Integer factorization and Riemann's hypothesis: Why two-item joint replenishment is hard
Computational Complexity
2020

Friesecke, Gero;Schulz, Andreas S.;Vögler, Daniela
Genetic column generation: Fast computation of high-dimensional multi-marginal optimal transport problems
Machine Learning
2021

Filos-Ratsikas, Aris;Giannakopoulos, Yiannis;Lazos, Philip
The Pareto Frontier of Inefficiency in Mechanism Design
Math. Oper. Res.
2021

Giannakopoulos, Yiannis;Poças, Diogo;Zhu, Keyu
Optimal Pricing For MHR and $\lambda$-Regular Distributions
ACM Trans. Econ. Comput.
2020
9
1
2:1--2:28

Christodoulou, George;Gairing, Martin;Giannakopoulos, Yiannis;Spirakis, Paul G.
The Price of Stability of Weighted Congestion Games
SIAM Journal on Computing
2019
48
5
1544--1582

Giannakopoulos, Yiannis;Koutsoupias, Elias;Kyropoulou, Maria
The anarchy of scheduling without money
Theoretical Computer Science
2019
778
19–32

Poças, Diogo;Zucker, Jeffery
Analog Networks on Function Data Streams
Computability
2018
7
4
301-322

Poças, Diogo;Zucker, Jeff
Approximability in the GPAC
Logical Methods in Computer Science
2019
Accepted

Orlin, James B.;Schulz, Andreas S.;Udwani, Rajan
Robust monotone submodular function maximization
Mathematical Programming
2018
172(1-2)
505-537

Korchmáros, Gábor;Pace, Nicola;Sonnino, Angelo
One-factorisations of complete graphs arising from ovals in finite planes
Journal of Combinatorial Theory, Series A
2018
160
62--83