Interactive Personalized eBooks for Education. - Stavros Droutsas; Panagiotis Patsilinakos; Antonios Symvonis (IISA, 2018)

Interactive and Personalized Activity eBooks for Learning to Read: The iRead Case. - Nick Deligiannis; Dionysis Panagiotopoulos; Panagiotis Patsilinakos; Chrysanthi N. Raftopoulou; Antonios Symvonis (iTextbooks@AIED, 2019)

Node Max-Cut and Computing Equilibria in Linear Weighted Congestion Games. - Dimitris Fotakis 001; Anthimos Vardis Kandiros; Thanasis Lianeas; Nikos Mouzakis; Panagiotis Patsilinakos; Stratis Skoulakis (CoRR, 2019)

Node-Max-Cut and the Complexity of Equilibrium in Linear Weighted Congestion Games. - Dimitris Fotakis 001; Anthimos Vardis Kandiros; Thanasis Lianeas; Nikos Mouzakis; Panagiotis Patsilinakos; Stratis Skoulakis (ICALP, 2020)

Asymptotically Optimal Communication in Simple Mechanisms. - Ioannis Anagnostides; Dimitris Fotakis 001; Panagiotis Patsilinakos (SAGT, 2020)

Strategyproof Facility Location in Perturbation Stable Instances. - Dimitris Fotakis 001; Panagiotis Patsilinakos (WINE, 2021)

Dimensionality, Coordination, and Robustness in Voting. - Ioannis Anagnostides; Dimitris Fotakis 001; Panagiotis Patsilinakos (CoRR, 2021)

Dimensionality and Coordination in Voting: The Distortion of STV. - Ioannis Anagnostides; Dimitris Fotakis 001; Panagiotis Patsilinakos (AAAI, 2022)

Sampling and Optimal Preference Elicitation in Simple Mechanisms. - Ioannis Anagnostides; Dimitris Fotakis 001; Panagiotis Patsilinakos (CoRR, 2022)

Metric-Distortion Bounds under Limited Information. - Ioannis Anagnostides; Dimitris Fotakis 001; Panagiotis Patsilinakos (J. Artif. Intell. Res., 2022)

Efficient Time-Series Clustering through Sparse Gaussian Modeling. - Dimitris Fotakis 001; Panagiotis Patsilinakos; Eleni Psaroudaki; Michalis Xefteris (Algorithms, 2024)

On the Distortion of Committee Election with 1-Euclidean Preferences and Few Distance Queries. - Dimitris Fotakis 001; Laurent Gourvès; Panagiotis Patsilinakos (AAAI, 2025)

A Competitive Posted-Price Mechanism for Online Budget-Feasible Auctions. - Andreas Charalampopoulos; Dimitris Fotakis 001; Panagiotis Patsilinakos; Thanos Tolias (EC, 2025)

Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems. - Evripidis Bampis; Bruno Escoffier; Dimitris Fotakis 001; Panagiotis Patsilinakos; Michalis Xefteris (CoRR, 2025)