Browse by Journal

Kanellopoulos, Panagiotis and Voudouris, Alexandros and Zhang, Rongsen (2025) Truthful two-facility location with candidate locations. Theoretical Computer Science, 1024. p. 114913. DOI https://doi.org/10.1016/j.tcs.2024.114913

Kanellopoulos, Panagiotis and Kyropoulou, Maria and Zhou, Hao (2024) On priority-proportional payments in financial networks. Theoretical Computer Science, 1014. p. 114767. DOI https://doi.org/10.1016/j.tcs.2024.114767

Kanellopoulos, Panagiotis and Kyropoulou, Maria and Voudouris, Alexandros (2023) Not all Strangers are the Same: The Impact of Tolerance in Schelling Games. Theoretical Computer Science, 971. p. 114065. DOI https://doi.org/10.1016/j.tcs.2023.114065

Goldberg, Leslie Ann and Lapinskas, John and Richerby, David (2021) Faster Exponential-time Algorithms for Approximately Counting Independent Sets. Theoretical Computer Science, 892. pp. 48-84. DOI https://doi.org/10.1016/j.tcs.2021.09.009

Kanellopoulos, Panagiotis and Kyropoulou, Maria and Voudouris, Alexandros A (2021) Modified Schelling games. Theoretical Computer Science, 880. pp. 1-19. DOI https://doi.org/10.1016/j.tcs.2021.05.032

Amanatidis, Georgios and Fulla, Peter and Markakis, Evangelos and Sornat, Krzysztof (2021) Inequity aversion pricing over social networks: Approximation algorithms and hardness results. Theoretical Computer Science, 871. pp. 62-78. DOI https://doi.org/10.1016/j.tcs.2021.04.012

Amanatidis, Georgios and Birmpas, Georgios and Filos-Ratsikas, Aris and Hollender, Alexandros and Voudouris, Alexandros A (2021) Maximum Nash welfare and other stories about EFX. Theoretical Computer Science, 863. pp. 69-85. DOI https://doi.org/10.1016/j.tcs.2021.02.020

Kaklamanis, Christos and Kanellopoulos, Panagiotis and Papaioannou, Konstantinos and Patouchas, Dimitris (2021) On the price of stability of some simple graph-based hedonic games. Theoretical Computer Science, 855. pp. 1-15. DOI https://doi.org/10.1016/j.tcs.2020.11.012

Blume, Till and Richerby, David and Scherp, Ansgar (2021) FLUID: A common model for semantic structural graph summaries based on equivalence relations. Theoretical Computer Science, 854. pp. 136-158. DOI https://doi.org/10.1016/j.tcs.2020.12.019

Kyropoulou, Maria and Suksompong, Warut and Voudouris, Alexandros A (2020) Almost Envy-Freeness in Group Resource Allocation. Theoretical Computer Science, 841. pp. 110-123. DOI https://doi.org/10.1016/j.tcs.2020.07.008

Voudouris, Alexandros A (2020) Simple combinatorial auctions with budget constraints. Theoretical Computer Science, 842. pp. 6-17. DOI https://doi.org/10.1016/j.tcs.2020.07.019

Ferraioli, Diodato and Ventre, Carmine (2019) Social pressure in opinion dynamics. Theoretical Computer Science, 795. pp. 345-361. DOI https://doi.org/10.1016/j.tcs.2019.07.017

Yiannis, Giannakopoulos and Koutsoupias, Elias and Kyropoulou, Maria (2019) The Anarchy of Scheduling Without Money. Theoretical Computer Science, 778. pp. 19-32. DOI https://doi.org/10.1016/j.tcs.2019.01.022

Gatti, N and Rocco, M and Serafino, P and Ventre, C (2018) Towards Better Models of Externalities in Sponsored Search Auctions. Theoretical Computer Science, 745. pp. 150-162. DOI https://doi.org/10.1016/j.tcs.2018.06.011

Bulatov, Andrei and Goldberg, Leslie Ann and Jerrum, Mark and Richerby, David and Živný, Stanislav (2017) Functional clones and expressibility of partition functions. Theoretical Computer Science, 687. pp. 11-39. DOI https://doi.org/10.1016/j.tcs.2017.05.001

Higgins, Peter M and Alwan, Suhear (2017) Languages with membership determined by single letter factors. Theoretical Computer Science, 680. pp. 15-24. DOI https://doi.org/10.1016/j.tcs.2017.04.005

Ferraioli, D and Goldberg, PW and Ventre, C (2016) Decentralized dynamics for finite opinion games. Theoretical Computer Science, 648. pp. 96-115. DOI https://doi.org/10.1016/j.tcs.2016.08.011

Serafino, P and Ventre, C (2016) Heterogeneous facility location without money. Theoretical Computer Science, 636. pp. 27-46. DOI https://doi.org/10.1016/j.tcs.2016.04.033

Punnen, Abraham P and Sripratak, Piyashat and Karapetyan, Daniel (2015) Average value of solutions for the bipartite boolean quadratic programs and rounding algorithms. Theoretical Computer Science, 565 (C). pp. 77-89. DOI https://doi.org/10.1016/j.tcs.2014.11.008

Higgins, Peter M (2012) Burrows–Wheeler transformations and de Bruijn words. Theoretical Computer Science, 457. pp. 128-136. DOI https://doi.org/10.1016/j.tcs.2012.07.019