Valia Mitsou
Valia Mitsou
Research Institute on the Foundations of Computer Science (IRIF) and Paris Diderot University
Verified email at - Homepage
Cited by
Cited by
A dynamic distributed federated database
G Bent, P Dantressangle, D Vyvyan, A Mowshowitz, V Mitsou
Proc. 2nd Ann. Conf. International Technology Alliance, 2008
On the algorithmic effectiveness of digraph decompositions and complexity measures
M Lampis, G Kaouri, V Mitsou
Discrete Optimization 8 (1), 129-138, 2011
Entropy, orbits, and spectra of graphs
A Mowshowitz, V Mitsou
Analysis of Complex Networks: From Biology to Linguistics, 1-22, 2009
Vertex cover problem parameterized above and below tight bounds
G Gutin, EJ Kim, M Lampis, V Mitsou
Theory of Computing Systems 48 (2), 402-410, 2011
Hanabi is np-hard, even for cheaters who look at their cards
JF Baffier, MK Chiu, Y Diez, M Korman, V Mitsou, A van Renssen, ...
Theoretical Computer Science 675, 43-55, 2017
Treewidth with a quantifier alternation revisited
M Lampis, V Mitsou
12th International Symposium on Parameterized and Exact Computation (IPEC 2017), 2018
Double-Exponential and Triple-Exponential Bounds for Choosability Problems Parameterized by Treewidth.
D Marx, V Mitsou
Schloss Dagstuhl Leibniz-Zentrum für Informatik, 2016
Token sliding on split graphs
R Belmonte, EJ Kim, M Lampis, V Mitsou, Y Otachi, F Sikora
Theory of Computing Systems 65 (4), 662-686, 2021
The computational complexity of the game of set and its theoretical applications
M Lampis, V Mitsou
Latin American Symposium on Theoretical Informatics, 24-34, 2014
Parameterized modal satisfiability
A Achilleos, M Lampis, V Mitsou
International Colloquium on Automata, Languages, and Programming, 369-380, 2010
Parameterized (approximate) defective coloring
R Belmonte, M Lampis, V Mitsou
SIAM Journal on Discrete Mathematics 34 (2), 1084-1106, 2020
The Ferry Cover Problem
M Lampis, V Mitsou
Theory of Computing Systems 44 (2), 215-229, 2009
QBF as an Alternative to Courcelle’s Theorem
M Lampis, S Mengel, V Mitsou
International Conference on Theory and Applications of Satisfiability …, 2018
Grundy distinguishes treewidth from pathwidth
R Belmonte, EJ Kim, M Lampis, V Mitsou, Y Otachi
arXiv preprint arXiv:2008.07425, 2020
Parameterized algorithms for parity games
J Gajarský, M Lampis, K Makino, V Mitsou, S Ordyniak
International Symposium on Mathematical Foundations of Computer Science, 336-347, 2015
Complexity and Approximability for Parameterized CSPs
H Dell, E Kim, M Lampis, V Mitsou, T Mömke
10th International Symposium on Parameterized and Exact Computation (IPEC …, 2015
Parameterized edge hamiltonicity
M Lampis, K Makino, V Mitsou, Y Uno
Discrete Applied Mathematics 248, 68-78, 2018
Complexity of planar signed graph homomorphisms to cycles
F Dross, F Foucaud, V Mitsou, P Ochem, T Pierron
Discrete Applied Mathematics 284, 166-178, 2020
Defective coloring on classes of perfect graphs
R Belmonte, M Lampis, V Mitsou
International Workshop on Graph-Theoretic Concepts in Computer Science, 113-126, 2017
Models of network growth by combination
A Mowshowitz, V Mitsou, G Bent
Proceedings of the Second Annual Conference of the International Technology …, 2008
The system can't perform the operation now. Try again later.
Articles 1–20