Suivre
Valia Mitsou
Valia Mitsou
Research Institute on the Foundations of Computer Science (IRIF) and Paris Diderot University
Adresse e-mail validée de liris.cnrs.fr - Page d'accueil
Titre
Citée par
Citée par
Année
Measurement of the t t ¯ production cross-section as a function of jet multiplicity and jet transverse momentum in 7 TeV proton-proton collisions with the ATLAS …
G Aad, B Abbott, J Abdallah, S Abdel Khalek, R Aben, B Abi, M Abolins, ...
Journal of High Energy Physics 2015 (1), 1-67, 2015
2142015
A dynamic distributed federated database
G Bent, P Dantressangle, D Vyvyan, A Mowshowitz, V Mitsou
Proc. 2nd Ann. Conf. International Technology Alliance, 2008
1112008
On the algorithmic effectiveness of digraph decompositions and complexity measures
M Lampis, G Kaouri, V Mitsou
Discrete Optimization 8 (1), 129-138, 2011
572011
Vertex cover problem parameterized above and below tight bounds
G Gutin, EJ Kim, M Lampis, V Mitsou
Theory of Computing Systems 48, 402-410, 2011
412011
Entropy, orbits, and spectra of graphs
A Mowshowitz, V Mitsou
Analysis of Complex Networks: From Biology to Linguistics, 1-22, 2009
382009
Token sliding on split graphs
R Belmonte, EJ Kim, M Lampis, V Mitsou, Y Otachi, F Sikora
Theory of Computing Systems 65, 662-686, 2021
332021
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
322017
Treewidth with a quantifier alternation revisited
M Lampis, V Mitsou
12th International Symposium on Parameterized and Exact Computation (IPEC 2017), 2018
312018
Double-Exponential and Triple-Exponential Bounds for Choosability Problems Parameterized by Treewidth.
D Marx, V Mitsou
Schloss Dagstuhl Leibniz-Zentrum für Informatik, 2016
252016
Grundy distinguishes treewidth from pathwidth
R Belmonte, EJ Kim, M Lampis, V Mitsou, Y Otachi
SIAM Journal on Discrete Mathematics 36 (3), 1761-1787, 2022
182022
Parameterized modal satisfiability
A Achilleos, M Lampis, V Mitsou
Algorithmica 64, 38-55, 2012
172012
The computational complexity of the game of set and its theoretical applications
M Lampis, V Mitsou
LATIN 2014: Theoretical Informatics: 11th Latin American Symposium …, 2014
162014
Parameterized (approximate) defective coloring
R Belmonte, M Lampis, V Mitsou
SIAM Journal on Discrete Mathematics 34 (2), 1084-1106, 2020
152020
QBF as an Alternative to Courcelle’s Theorem
M Lampis, S Mengel, V Mitsou
Theory and Applications of Satisfiability Testing–SAT 2018: 21st …, 2018
152018
The Ferry Cover Problem
M Lampis, V Mitsou
Theory of Computing Systems 44 (2), 215-229, 2009
122009
Parameterized algorithms for parity games
J Gajarský, M Lampis, K Makino, V Mitsou, S Ordyniak
Mathematical Foundations of Computer Science 2015: 40th International …, 2015
102015
Parameterized edge hamiltonicity
M Lampis, K Makino, V Mitsou, Y Uno
Discrete Applied Mathematics 248, 68-78, 2018
92018
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
9*2015
Ordered coloring of grids and related graphs
A Bar-Noy, P Cheilaris, M Lampis, V Mitsou, S Zachos
Theoretical Computer Science 444, 40-51, 2012
92012
Defective coloring on classes of perfect graphs
R Belmonte, M Lampis, V Mitsou
Discrete Mathematics & Theoretical Computer Science 24 (Discrete Algorithms), 2022
82022
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20