George Manoussakis

18 papers B 5C 1Misc 1Journal 10
YearRankTypeTitle / Venue / Authors
2025 B conf
Efficient Enumeration of k-Plexes and k-Defective Cliques.
IPEC
Mohamed Jiddou, George Manoussakis
2024 J jnl
New results for the detection of bicliques.
CoRR
George Manoussakis
2023 J jnl
Efficient maximal cliques enumeration in weakly closed graphs.
CoRR
George Manoussakis
2023 Misc conf
From State to Link-Register Model: A transformer for Self-Stabilizing Distributed Algorithms.
SYNASC
Johanne Cohen, George Manoussakis, Laurence Pilard
2021 J jnl
Efficient enumeration of maximal induced bicliques.
Discret. Appl. Math.
Danny Hermelin, George Manoussakis
2020 J jnl
Parameterized Multi-Scenario Single-Machine Scheduling Problems.
Algorithmica
Danny Hermelin, George Manoussakis, Michael L. Pinedo, Dvir Shabtay, Liron Yedidsion
2019 J jnl
A new decomposition technique for maximal clique enumeration for sparse graphs.
Theor. Comput. Sci.
George Manoussakis
2019 J jnl
The first polynomial self-stabilizing 1-maximal matching algorithm for general graphs.
Theor. Comput. Sci.
Johanne Cohen, Jonas Lefèvre, Khaled Maâmra, George Manoussakis, Laurence Pilard
2018 B conf
A Self-Stabilizing Algorithm for Maximal Matching in Link-Register Model.
SIROCCO
Johanne Cohen, George Manoussakis, Laurence Pilard, Devan Sohier
2018 J jnl
Primitive Zonotopes.
Discret. Comput. Geom.
Antoine Deza, George Manoussakis, Shmuel Onn
2017 J jnl
A self-stabilizing algorithm for maximal matching in link-register model in $O(nΔ^3)$ moves.
CoRR
Johanne Cohen, George Manoussakis, Laurence Pilard, Devan Sohier
2017 B conf
An Output Sensitive Algorithm for Maximal Clique Enumeration in Sparse Graphs.
IPEC
George Manoussakis
2017 — —
Combinatorial Algorithms and Optimization. (Algorithmes combinatoires et optimisation).
George Manoussakis
2017 B conf
Listing All Fixed-Length Simple Cycles in Sparse Graphs in Optimal Time.
FCT
George Manoussakis
2017 C conf
Self-stabilizing Distributed Stable Marriage.
SSS
Marie Laveau, George Manoussakis, Joffroy Beauquier, Thibault Bernard, Janna Burman, Johanne Cohen, Laurence Pilard
2016 B conf
Polynomial Self-Stabilizing Maximum Matching Algorithm with Approximation Ratio 2/3.
OPODIS
Johanne Cohen, Khaled Maamra, George Manoussakis, Laurence Pilard
2016 J jnl
Polynomial self-stabilizing algorithm and proof for a 2/3-approximation of a maximum matching.
CoRR
Johanne Cohen, Khaled Maâmra, George Manoussakis, Laurence Pilard
2016 J jnl
The Mann et al. self-stabilizing 2/3-approximation matching algorithm is sub-exponential.
CoRR
Johanne Cohen, Khaled Maamra, George Manoussakis, Laurence Pilard