The Ferry Cover Problem. - Michael Lampis; Valia Mitsou (Theory Comput. Syst., 2009)

On the algorithmic effectiveness of digraph decompositions and complexity measures. - Michael Lampis; Georgia Kaouri; Valia Mitsou (Discret. Optim., 2011)

Vertex Cover Problem Parameterized Above and Below Tight Bounds. - Gregory Z. Gutin; Eun Jung Kim 002; Michael Lampis; Valia Mitsou (Theory Comput. Syst., 2011)

Parameterized Modal Satisfiability. - Antonis Achilleos; Michael Lampis; Valia Mitsou (Algorithmica, 2012)

Ordered coloring of grids and related graphs. - Amotz Bar-Noy; Panagiotis Cheilaris; Michael Lampis; Valia Mitsou; Stathis Zachos (Theor. Comput. Sci., 2012)

The Computational Complexity of the Game of Set and Its Theoretical Applications. - Michael Lampis; Valia Mitsou (LATIN, 2014)

Parameterized Algorithms for Parity Games. - Jakub Gajarský; Michael Lampis; Kazuhisa Makino; Valia Mitsou; Sebastian Ordyniak (MFCS (2), 2015)

Scrabble is PSPACE-Complete. - Michael Lampis; Valia Mitsou; Karolina Soltys (J. Inf. Process., 2015)

Hanabi is NP-complete, Even for Cheaters who Look at Their Cards. - Jean-François Baffier; Man-Kwun Chiu; Yago Diez; Matias Korman; Valia Mitsou; André van Renssen; Marcel Roeloffzen; Yushi Uno (FUN, 2016)

Double-Exponential and Triple-Exponential Bounds for Choosability Problems Parameterized by Treewidth. - Dániel Marx; Valia Mitsou (ICALP, 2016)

Treewidth with a Quantifier Alternation Revisited. - Michael Lampis; Valia Mitsou (IPEC, 2017)

Complexity and Approximability of Parameterized MAX-CSPs. - Holger Dell; Eun Jung Kim 002; Michael Lampis; Valia Mitsou; Tobias Mömke (Algorithmica, 2017)

Hanabi is NP-hard, even for cheaters who look at their cards. - Jean-François Baffier; Man-Kwun Chiu; Yago Diez; Matias Korman; Valia Mitsou; André van Renssen; Marcel Roeloffzen; Yushi Uno (Theor. Comput. Sci., 2017)

QBF as an Alternative to Courcelle's Theorem. - Michael Lampis; Stefan Mengel; Valia Mitsou (SAT, 2018)

Parameterized Edge Hamiltonicity. - Michael Lampis; Kazuhisa Makino; Valia Mitsou; Yushi Uno (Discret. Appl. Math., 2018)

Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism Problems. - Florent Foucaud; Hervé Hocquard; Dimitri Lajou; Valia Mitsou; Théo Pierron (IPEC, 2019)

Complexity of planar signed graph homomorphisms to cycles. - François Dross; Florent Foucaud; Valia Mitsou; Pascal Ochem; Théo Pierron (Discret. Appl. Math., 2020)

Parameterized (Approximate) Defective Coloring. - Rémy Belmonte; Michael Lampis; Valia Mitsou (SIAM J. Discret. Math., 2020)

Token Sliding on Split Graphs. - Rémy Belmonte; Eun Jung Kim 002; Michael Lampis; Valia Mitsou; Yota Otachi; Florian Sikora (Theory Comput. Syst., 2021)

Graph Modification for Edge-Coloured and Signed Graph Homomorphism Problems: Parameterized and Classical Complexity. - Florent Foucaud; Hervé Hocquard; Dimitri Lajou; Valia Mitsou; Théo Pierron (Algorithmica, 2022)

Defective Coloring on Classes of Perfect Graphs. - Rémy Belmonte; Michael Lampis; Valia Mitsou (Discret. Math. Theor. Comput. Sci., 2022)

Grundy Distinguishes Treewidth from Pathwidth. - Rémy Belmonte; Eun Jung Kim 002; Michael Lampis; Valia Mitsou; Yota Otachi (SIAM J. Discret. Math., 2022)

Fine-grained Meta-Theorems for Vertex Integrity. - Michael Lampis; Valia Mitsou (Log. Methods Comput. Sci., 2024)

Broadcasting Under Structural Restrictions. - Yudai Egami; Tatsuya Gima; Tesshu Hanaka; Yasuaki Kobayashi; Michael Lampis; Valia Mitsou; Edouard Nemery; Yota Otachi; Manolis Vasilakis; Daniel Vaz 001 (MFCS, 2025)

Parameterized Spanning Tree Congestion. - Michael Lampis; Valia Mitsou; Edouard Nemery; Yota Otachi; Manolis Vasilakis; Daniel Vaz 001 (MFCS, 2025)

Complexity of Jelly-No and Hanano games with various constraints. - Owen Crabtree; Valia Mitsou (CoRR, 2025)