Polynomial Self-Stabilizing Maximum Matching Algorithm with Approximation Ratio 2/3. - Johanne Cohen; Khaled Maamra; George Manoussakis; Laurence Pilard (OPODIS, 2016)

The Mann et al. self-stabilizing 2/3-approximation matching algorithm is sub-exponential. - Johanne Cohen; Khaled Maamra; George Manoussakis; Laurence Pilard (CoRR, 2016)

Polynomial self-stabilizing algorithm and proof for a 2/3-approximation of a maximum matching. - Johanne Cohen; Khaled Maâmra; George Manoussakis; Laurence Pilard (CoRR, 2016)

Listing All Fixed-Length Simple Cycles in Sparse Graphs in Optimal Time. - George Manoussakis (FCT, 2017)

An Output Sensitive Algorithm for Maximal Clique Enumeration in Sparse Graphs. - George Manoussakis (IPEC, 2017)

Self-stabilizing Distributed Stable Marriage. - Marie Laveau; George Manoussakis; Joffroy Beauquier; Thibault Bernard; Janna Burman; Johanne Cohen; Laurence Pilard (SSS, 2017)

A self-stabilizing algorithm for maximal matching in link-register model in $O(nΔ^3)$ moves. - Johanne Cohen; George Manoussakis; Laurence Pilard; Devan Sohier (CoRR, 2017)

Combinatorial Algorithms and Optimization. (Algorithmes combinatoires et optimisation). - George Manoussakis (2017)

A Self-Stabilizing Algorithm for Maximal Matching in Link-Register Model. - Johanne Cohen; George Manoussakis; Laurence Pilard; Devan Sohier (SIROCCO, 2018)

Primitive Zonotopes. - Antoine Deza; George Manoussakis; Shmuel Onn (Discret. Comput. Geom., 2018)

The first polynomial self-stabilizing 1-maximal matching algorithm for general graphs. - Johanne Cohen; Jonas Lefèvre; Khaled Maâmra; George Manoussakis; Laurence Pilard (Theor. Comput. Sci., 2019)

A new decomposition technique for maximal clique enumeration for sparse graphs. - George Manoussakis (Theor. Comput. Sci., 2019)

Parameterized Multi-Scenario Single-Machine Scheduling Problems. - Danny Hermelin; George Manoussakis; Michael L. Pinedo; Dvir Shabtay; Liron Yedidsion (Algorithmica, 2020)

Efficient enumeration of maximal induced bicliques. - Danny Hermelin; George Manoussakis (Discret. Appl. Math., 2021)

From State to Link-Register Model: A transformer for Self-Stabilizing Distributed Algorithms. - Johanne Cohen; George Manoussakis; Laurence Pilard (SYNASC, 2023)

Efficient maximal cliques enumeration in weakly closed graphs. - George Manoussakis (CoRR, 2023)

New results for the detection of bicliques. - George Manoussakis (CoRR, 2024)