| Measurement of the production cross-section as a function of jet multiplicity and jet transverse momentum in 7 TeV proton-proton collisions with the ATLAS detector ATLAS collaboration arXiv preprint arXiv:1407.0891, 2014 | 220 | 2014 |
| A dynamic distributed federated database G Bent, P Dantressangle, D Vyvyan, A Mowshowitz, V Mitsou Proc. 2nd Ann. Conf. International Technology Alliance, 2008 | 117 | 2008 |
| On the algorithmic effectiveness of digraph decompositions and complexity measures M Lampis, G Kaouri, V Mitsou Discrete Optimization 8 (1), 129-138, 2011 | 57 | 2011 |
| 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 | 42 | 2011 |
| Treewidth with a quantifier alternation revisited M Lampis, V Mitsou 12th International Symposium on Parameterized and Exact Computation (IPEC 2017), 2018 | 38 | 2018 |
| Entropy, orbits, and spectra of graphs A Mowshowitz, V Mitsou Analysis of Complex Networks: From Biology to Linguistics, 1-22, 2009 | 38 | 2009 |
| 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 | 34 | 2021 |
| 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 | 34 | 2017 |
| Double-Exponential and Triple-Exponential Bounds for Choosability Problems Parameterized by Treewidth. D Marx, V Mitsou Schloss Dagstuhl Leibniz-Zentrum für Informatik, 2016 | 31 | 2016 |
| 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 | 23 | 2022 |
| QBF as an Alternative to Courcelle’s Theorem M Lampis, S Mengel, V Mitsou Theory and Applications of Satisfiability Testing–SAT 2018: 21st …, 2018 | 21 | 2018 |
| 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 | 20 | 2014 |
| Parameterized modal satisfiability A Achilleos, M Lampis, V Mitsou Algorithmica 64, 38-55, 2012 | 18 | 2012 |
| Parameterized (approximate) defective coloring R Belmonte, M Lampis, V Mitsou SIAM Journal on Discrete Mathematics 34 (2), 1084-1106, 2020 | 16 | 2020 |
| Scrabble is pspace-complete M Lampis, V Mitsou, K Sołtys Journal of Information Processing 23 (3), 284-292, 2015 | 13 | 2015 |
| Parameterized algorithms for parity games J Gajarský, M Lampis, K Makino, V Mitsou, S Ordyniak Mathematical Foundations of Computer Science 2015: 40th International …, 2015 | 12 | 2015 |
| Fine-grained meta-theorems for vertex integrity M Lampis, V Mitsou arXiv preprint arXiv:2109.10333, 2021 | 11 | 2021 |
| The Ferry Cover Problem M Lampis, V Mitsou Theory of Computing Systems 44 (2), 215-229, 2009 | 11 | 2009 |
| Defective coloring on classes of perfect graphs R Belmonte, M Lampis, V Mitsou Discrete Mathematics & Theoretical Computer Science 24 (Discrete Algorithms), 2022 | 10 | 2022 |
| Parameterized edge hamiltonicity M Lampis, K Makino, V Mitsou, Y Uno Discrete Applied Mathematics 248, 68-78, 2018 | 9 | 2018 |
Michael LampisLAMSADE, Université Paris DauphineVerified email at dauphine.fr
