| Being an influencer is hard: The complexity of influence maximization in temporal graphs with a fixed source A Deligkas, M Döring, E Eiben, TL Goldsmith, G Skretas Information and Computation 299, 105171, 2024 | 10 | 2024 |
| Parameterized Complexity of Hotelling-Downs with Party Nominees. A Deligkas, E Eiben, TL Goldsmith IJCAI, 244-250, 2022 | 8 | 2022 |
| The parameterized complexity of welfare guarantees in Schelling segregation A Deligkas, E Eiben, TL Goldsmith Theoretical Computer Science 1017, 114783, 2024 | 5 | 2024 |
| EF1 and EFX orientations A Deligkas, E Eiben, TL Goldsmith, V Korchemna arXiv preprint arXiv:2409.13616, 2024 | 2 | 2024 |
| How Many Lines to Paint the City: Exact Edge-Cover in Temporal Graphs A Deligkas, M Döring, E Eiben, TL Goldsmith, G Skretas, G Tennigkeit arXiv preprint arXiv:2408.17107, 2024 | 1 | 2024 |
| The Complexity of Extending Fair Allocations of Indivisible Goods A Deligkas, E Eiben, R Ganian, TL Goldsmith, SD Ioannidis arXiv preprint arXiv:2503.01368, 2025 | | 2025 |
Eduard EibenLecturer in Computer Science, Royal Holloway, Univeristy of LondonEmail được xác minh tại rhul.ac.uk