Valia Mitsou

Publication Activity (10 Years)

Years Active: 2007-2022
Publications (10 Years): 28

Top Topics

Constraint Satisfaction Problems

Parameterized Complexity

Tree Decompositions

Top Venues

SIAM J. Discret. Math.

Publications

Rémy Belmonte, Michael Lampis, Valia Mitsou
Defective Coloring on Classes of Perfect Graphs. Discret. Math. Theor. Comput. Sci. 24 (2022)
Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi
Grundy Distinguishes Treewidth from Pathwidth. SIAM J. Discret. Math. 36 (3) (2022)
Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, Théo Pierron
Graph Modification for Edge-Coloured and Signed Graph Homomorphism Problems: Parameterized and Classical Complexity. Algorithmica 84 (5) (2022)
Michael Lampis, Valia Mitsou
Fine-Grained Meta-Theorems for Vertex Integrity. ISAAC (2021)
Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora
Token Sliding on Split Graphs. Theory Comput. Syst. 65 (4) (2021)
Michael Lampis, Valia Mitsou
Fine-grained Meta-Theorems for Vertex Integrity. CoRR (2021)
Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi
Grundy Distinguishes Treewidth from Pathwidth. ESA (2020)
François Dross, Florent Foucaud, Valia Mitsou, Pascal Ochem, Théo Pierron
Complexity of planar signed graph homomorphisms to cycles. Discret. Appl. Math. 284 (2020)
Rémy Belmonte, Michael Lampis, Valia Mitsou
Parameterized (Approximate) Defective Coloring. SIAM J. Discret. Math. 34 (2) (2020)
Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi
Grundy Distinguishes Treewidth from Pathwidth. CoRR (2020)
Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, Théo Pierron
Parameterized complexity of edge-coloured and signed graph homomorphism problems. CoRR (2019)
Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora
Token Sliding on Split Graphs. STACS (2019)
François Dross, Florent Foucaud, Valia Mitsou, Pascal Ochem, Théo Pierron
Complexity of planar signed graph homomorphisms to cycles. CoRR (2019)
Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, Théo Pierron
Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism Problems. IPEC (2019)
Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora
Token Sliding on Split Graphs. CoRR (2018)
Michael Lampis, Kazuhisa Makino, Valia Mitsou, Yushi Uno
Parameterized Edge Hamiltonicity. Discret. Appl. Math. 248 (2018)
Michael Lampis, Stefan Mengel, Valia Mitsou
QBF as an Alternative to Courcelle's Theorem. CoRR (2018)
Michael Lampis, Stefan Mengel, Valia Mitsou
QBF as an Alternative to Courcelle's Theorem. SAT (2018)
Rémy Belmonte, Michael Lampis, Valia Mitsou
Parameterized (Approximate) Defective Coloring. STACS (2018)
Rémy Belmonte, Michael Lampis, Valia Mitsou
Parameterized (Approximate) Defective Coloring. CoRR (2018)
Michael Lampis, Valia Mitsou
Treewidth with a Quantifier Alternation Revisited. IPEC (2017)
Rémy Belmonte, Michael Lampis, Valia Mitsou
Defective Coloring on Classes of Perfect Graphs. WG (2017)
Rémy Belmonte, Michael Lampis, Valia Mitsou
Defective Coloring on Classes of Perfect Graphs. CoRR (2017)
Jean-François Baffier, Man-Kwun Chiu, Yago Diez, Matias Korman, Valia Mitsou, André van Renssen, Marcel Roeloffzen, Yushi Uno
Hanabi is NP-hard, even for cheaters who look at their cards. Theor. Comput. Sci. 675 (2017)
Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke
Complexity and Approximability of Parameterized MAX-CSPs. Algorithmica 79 (1) (2017)
Jean-François Baffier, Man-Kwun Chiu, Yago Diez, Matias Korman, Valia Mitsou, André van Renssen, Marcel Roeloffzen, Yushi Uno
Hanabi is NP-complete, Even for Cheaters who Look at Their Cards. FUN (2016)
Jean-François Baffier, Man-Kwun Chiu, Yago Diez, Matias Korman, Valia Mitsou, André van Renssen, Marcel Roeloffzen, Yushi Uno
Hanabi is NP-complete, Even for Cheaters who Look at Their Cards. CoRR (2016)
Dániel Marx, Valia Mitsou
Double-Exponential and Triple-Exponential Bounds for Choosability Problems Parameterized by Treewidth. ICALP (2016)
Michael Lampis, Valia Mitsou, Karolina Soltys
Scrabble is PSPACE-Complete. J. Inf. Process. 23 (3) (2015)
Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke
Complexity and Approximability of Parameterized MAX-CSPs. IPEC (2015)
Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke
Complexity and Approximability of Parameterized MAX-CSPs. CoRR (2015)
Jakub Gajarský, Michael Lampis, Kazuhisa Makino, Valia Mitsou, Sebastian Ordyniak
Parameterized Algorithms for Parity Games. MFCS (2) (2015)
Michael Lampis, Valia Mitsou
The Computational Complexity of the Game of Set and Its Theoretical Applications. LATIN (2014)
Michael Lampis, Kazuhisa Makino, Valia Mitsou, Yushi Uno
Parameterized Edge Hamiltonicity. WG (2014)
Michael Lampis, Kazuhisa Makino, Valia Mitsou, Yushi Uno
Parameterized Edge Hamiltonicity. CoRR (2014)
Michael Lampis, Valia Mitsou
The Computational Complexity of the Game of Set and its Theoretical Applications. CoRR (2013)
Antonis Achilleos, Michael Lampis, Valia Mitsou
Parameterized Modal Satisfiability. Algorithmica 64 (1) (2012)
Amotz Bar-Noy, Panagiotis Cheilaris, Michael Lampis, Valia Mitsou, Stathis Zachos
Ordered coloring of grids and related graphs. Theor. Comput. Sci. 444 (2012)
Michael Lampis, Valia Mitsou, Karolina Soltys
Scrabble Is PSPACE-Complete. FUN (2012)
Michael Lampis, Valia Mitsou, Karolina Soltys
Scrabble is PSPACE-Complete CoRR (2012)
Michael Lampis, Georgia Kaouri, Valia Mitsou
On the algorithmic effectiveness of digraph decompositions and complexity measures. Discret. Optim. 8 (1) (2011)
Gregory Z. Gutin, Eun Jung Kim, Michael Lampis, Valia Mitsou
Vertex Cover Problem Parameterized Above and Below Tight Bounds. Theory Comput. Syst. 48 (2) (2011)
Antonis Achilleos, Michael Lampis, Valia Mitsou
Parameterized Modal Satisfiability. ICALP (2) (2010)
Michael Lampis, Valia Mitsou
The Ferry Cover Problem. Theory Comput. Syst. 44 (2) (2009)
Antonis Achilleos, Michael Lampis, Valia Mitsou
Parameterized Modal Satisfiability CoRR (2009)
Gregory Z. Gutin, Eun Jung Kim, Michael Lampis, Valia Mitsou
Vertex Cover Problem Parameterized Above and Below Tight Bounds CoRR (2009)
Amotz Bar-Noy, Panagiotis Cheilaris, Michael Lampis, Valia Mitsou, Stathis Zachos
Ordered Coloring Grids and Related Graphs. SIROCCO (2009)
Michael Lampis, Georgia Kaouri, Valia Mitsou
On the Algorithmic Effectiveness of Digraph Decompositions and Complexity Measures. ISAAC (2008)
Michael Lampis, Valia Mitsou
The Ferry Cover Problem. FUN (2007)