Parameterized Complexity of Hotelling-Downs with Party Nominees. - Argyrios Deligkas; Eduard Eiben; Tiger-Lily Goldsmith (IJCAI, 2022)

Being an Influencer is Hard: The Complexity of Influence Maximization in Temporal Graphs with a Fixed Source. - Argyrios Deligkas; Eduard Eiben; Tiger-Lily Goldsmith; George Skretas (AAMAS, 2023)

EF1 and EFX Orientations. - Argyrios Deligkas; Eduard Eiben; Tiger-Lily Goldsmith; Viktoriia Korchemna (CoRR, 2024)

Being an influencer is hard: The complexity of influence maximization in temporal graphs with a fixed source. - Argyrios Deligkas; Michelle Döring; Eduard Eiben; Tiger-Lily Goldsmith; George Skretas (Inf. Comput., 2024)

The parameterized complexity of welfare guarantees in Schelling segregation. - Argyrios Deligkas; Eduard Eiben; Tiger-Lily Goldsmith (Theor. Comput. Sci., 2024)

How Many Lines to Paint the City: Exact Edge-Cover in Temporal Graphs. - Argyrios Deligkas; Michelle Döring; Eduard Eiben; Tiger-Lily Goldsmith; George Skretas; Georg Tennigkeit (AAAI, 2025)

The Complexity of Extending Fair Allocations of Indivisible Goods. - Argyrios Deligkas; Eduard Eiben; Robert Ganian; Tiger-Lily Goldsmith; Stavros D. Ioannidis (AAAI, 2025)