| Primitive zonotopes A Deza, G Manoussakis, S Onn Discrete & Computational Geometry 60, 27-39, 2018 | 35 | 2018 |
| Efficient enumeration of maximal induced bicliques D Hermelin, G Manoussakis Discrete Applied Mathematics 303, 253-261, 2021 | 18 | 2021 |
| A new decomposition technique for maximal clique enumeration for sparse graphs G Manoussakis Theoretical Computer Science 770, 25-33, 2019 | 13 | 2019 |
| Parameterized multi-scenario single-machine scheduling problems D Hermelin, G Manoussakis, M Pinedo, D Shabtay, L Yedidsion Algorithmica 82, 2644-2667, 2020 | 9 | 2020 |
| Polynomial self-stabilizing maximum matching algorithm with approximation ratio 2/3 J Cohen, K Maâmra, G Manoussakis, L Pilard 20th International Conference on Principles of Distributed Systems (OPODIS 2016), 2017 | 7 | 2017 |
| The clique problem on inductive k-independent graphs G Manoussakis arXiv preprint arXiv:1410.3302, 2014 | 6 | 2014 |
| Listing all fixed-length simple cycles in sparse graphs in optimal time G Manoussakis International Symposium on Fundamentals of Computation Theory, 355-366, 2017 | 5 | 2017 |
| Self-stabilizing distributed stable marriage M Laveau, G Manoussakis, J Beauquier, T Bernard, J Burman, J Cohen, ... Stabilization, Safety, and Security of Distributed Systems: 19th …, 2017 | 5 | 2017 |
| An output sensitive algorithm for maximal clique enumeration in sparse graphs G Manoussakis 12th International Symposium on Parameterized and Exact Computation (IPEC 2017), 2018 | 4 | 2018 |
| A Self-Stabilizing Algorithm for Maximal Matching in Link-Register Model J Cohen, G Manoussakis, L Pilard, D Sohier International Colloquium on Structural Information and Communication …, 2018 | 2 | 2018 |
| The Manne et al. self-stabilizing 2/3-approximation matching algorithm is sub-exponential J Cohen, J Lefèvre, K Maâmra, G Manoussakis, L Pilard arXiv preprint arXiv:1604.08066, 2016 | 2 | 2016 |
| Primitive lattice polytopes A Deza, G Manoussakis, S Onn arXiv preprint arXiv:1512.08018, 2015 | 2 | 2015 |
| Efficient maximal cliques enumeration in weakly closed graphs G Manoussakis arXiv preprint arXiv:2303.02390, 2023 | 1 | 2023 |
| The Bron-Kerbosch algorithm with vertex ordering is output-sensitive G Manoussakis arXiv preprint arXiv:1911.01951, 2019 | 1 | 2019 |
| The first polynomial self-stabilizing 1-maximal matching algorithm for general graphs J Cohen, J Lefèvre, K Maamra, G Manoussakis, L Pilard Theoretical Computer Science 782, 54-78, 2019 | 1 | 2019 |
| Small Primitive Zonotopes A Deza, G Manoussakis, S Onn Discrete Geometry and Symmetry: Dedicated to Károly Bezdek and Egon Schulte …, 2018 | 1 | 2018 |
| Polynomial self-stabilizing algorithm and proof for a 2/3-approximation of a maximum matching J Cohen, K Maâmra, G Manoussakis, L Pilard arXiv preprint arXiv:1611.06038, 2016 | 1 | 2016 |
| New algorithms for cliques and related structures in k-degenerate graphs G Manoussakis arXiv preprint arXiv:1501.01819, 2016 | 1 | 2016 |
| Algorithms for cliques in inductive k-independent graphs G Manoussakis arXiv preprint arXiv:1410.3302, 2014 | 1 | 2014 |
| New results for the detection of bicliques G Manoussakis arXiv preprint arXiv:2412.11234, 2024 | | 2024 |
Johanne CohenCNRS, LISN, Université Paris-Saclay在 lri.fr 的电子邮件经过验证
