Up a level |
Number of items: 2.
Deligkas, A, Fearnley, J, Hollender, A and Melissourgos, T
(2023)
Tight Inapproximability for Graphical Games.
In: AAAI 2023.
Filos-Ratsikas, A ORCID: 0000-0001-7868-8114, Hollender, A, Sotiraki, K and Zampetakis, M
(2021)
A topological characterization of modulo-p arguments and implications for necklace splitting.
In: SIAM Symposium on Discrete Algorithms, 2021-1-10 - 2021-1-11, Virtual Conference.