 | Up a level |
Melissinos, Nikolaos, Pagourtzis, Aris and Triommatis, Theofilos
(2020)
Approximation Schemes for Subset Sum Ratio Problems.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 12340 .
pp. 96-107.
Gairing, M, Kollias, K and Kotsialou, G
(2017)
Cost-sharing in generalised selfish routing.
.
Lamprou, I 
ORCID: 0000-0001-5337-7336, Martin, RA ORCID: 0000-0002-7043-503X and Schewe, S ORCID: 0000-0002-9093-9518
(2017)
Perpetually Dominating Large Grids.
In: 10th International Conference on Algorithms and Complexity, 2017-5-24 - 2017-5-26, Athens, Greece.
Akrida, Eleni C ORCID: 0000-0002-1126-1623, Czyzowicz, Jurek, Gasieniec, Leszek ORCID: 0000-0003-1809-9814, Kuszner, Lukasz and Spirakis, Paul G ORCID: 0000-0001-5396-3749
(2017)
Temporal Flows in Temporal Networks.
In: 10th International Conference on Algorithms and Complexity, CIAC 2017, 2017-5-24 - 2017-5-26, Athens, Greece.