Valia Mitsou

According to our database, Valia Mitsou authored at least 26 papers between 2007 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Complexity of Jelly-No and Hanano games with various constraints.

Owen Crabtree, Valia Mitsou

CoRR, January, 2025

Parameterized Spanning Tree Congestion.

Michael Lampis, Valia Mitsou, Edouard Nemery, Yota Otachi, Manolis Vasilakis, Daniel Vaz

Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science, 2025

Broadcasting Under Structural Restrictions.

Yudai Egami, Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Michael Lampis, Valia Mitsou, Edouard Nemery, Yota Otachi, Manolis Vasilakis, Daniel Vaz

Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science, 2025

2022

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

2021

Fine-Grained Meta-Theorems for Vertex Integrity.

Michael Lampis, Valia Mitsou

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

2020

Complexity of planar signed graph homomorphisms to cycles.

François Dross, Florent Foucaud, Valia Mitsou, Pascal Ochem, Théo Pierron

Discret. Appl. Math., 2020

Grundy Distinguishes Treewidth from Pathwidth.

Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

Token Sliding on Split Graphs.

Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism Problems.

Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, Théo Pierron

Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019

2018

Parameterized (Approximate) Defective Coloring.

Rémy Belmonte, Michael Lampis, Valia Mitsou

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

QBF as an Alternative to Courcelle's Theorem.

Michael Lampis, Stefan Mengel, Valia Mitsou

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2018, 2018

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

Defective Coloring on Classes of Perfect Graphs.

Rémy Belmonte, Michael Lampis, Valia Mitsou

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

Treewidth with a Quantifier Alternation Revisited.

Michael Lampis, Valia Mitsou

Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017

2016

Double-Exponential and Triple-Exponential Bounds for Choosability Problems Parameterized by Treewidth.

Dániel Marx, Valia Mitsou

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

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

Proceedings of the 8th International Conference on Fun with Algorithms, 2016

2015

Parameterized Algorithms for Parity Games.

Jakub Gajarský, Michael Lampis, Kazuhisa Makino, Valia Mitsou, Sebastian Ordyniak

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Complexity and Approximability of Parameterized MAX-CSPs.

Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke

Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015

2014

Parameterized Edge Hamiltonicity.

Michael Lampis, Kazuhisa Makino, Valia Mitsou, Yushi Uno

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014

The Computational Complexity of the Game of Set and Its Theoretical Applications.

Michael Lampis, Valia Mitsou

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

2012

Scrabble Is PSPACE-Complete.

Michael Lampis, Valia Mitsou, Karolina Soltys

Proceedings of the Fun with Algorithms - 6th International Conference, 2012

2011

Vertex Cover Problem Parameterized Above and Below Tight Bounds.

Gregory Z. Gutin, Eun Jung Kim, Michael Lampis, Valia Mitsou

Theory Comput. Syst., 2011

2010

Parameterized Modal Satisfiability.

Antonis Achilleos, Michael Lampis, Valia Mitsou

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009

Ordered Coloring Grids and Related Graphs.

Amotz Bar-Noy, Panagiotis Cheilaris, Michael Lampis, Valia Mitsou, Stathis Zachos

Proceedings of the Structural Information and Communication Complexity, 2009

2008

On the Algorithmic Effectiveness of Digraph Decompositions and Complexity Measures.

Michael Lampis, Georgia Kaouri, Valia Mitsou

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007

The Ferry Cover Problem.

Michael Lampis, Valia Mitsou

Proceedings of the Fun with Algorithms, 4th International Conference, 2007