George Manoussakis

According to our database, George Manoussakis authored at least 15 papers between 2016 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Efficient maximal cliques enumeration in weakly closed graphs.

George Manoussakis

CoRR, 2023

2021

Efficient enumeration of maximal induced bicliques.

Danny Hermelin, George Manoussakis

Discret. Appl. Math., 2021

2020

Parameterized Multi-Scenario Single-Machine Scheduling Problems.

Danny Hermelin, George Manoussakis, Michael L. Pinedo, Dvir Shabtay, Liron Yedidsion

Algorithmica, 2020

2019

A new decomposition technique for maximal clique enumeration for sparse graphs.

George Manoussakis

Theor. Comput. Sci., 2019

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

2018

Primitive Zonotopes.

Antoine Deza, George Manoussakis, Shmuel Onn

Discret. Comput. Geom., 2018

A Self-Stabilizing Algorithm for Maximal Matching in Link-Register Model.

Johanne Cohen, George Manoussakis, Laurence Pilard, Devan Sohier

Proceedings of the Structural Information and Communication Complexity, 2018

2017

Combinatorial Algorithms and Optimization. (Algorithmes combinatoires et optimisation).

George Manoussakis

PhD thesis, 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

Self-stabilizing Distributed Stable Marriage.

Marie Laveau, George Manoussakis, Joffroy Beauquier, Thibault Bernard, Janna Burman, Johanne Cohen, Laurence Pilard

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2017

An Output Sensitive Algorithm for Maximal Clique Enumeration in Sparse Graphs.

George Manoussakis

Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017

Listing All Fixed-Length Simple Cycles in Sparse Graphs in Optimal Time.

George Manoussakis

Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

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

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 Maximum Matching Algorithm with Approximation Ratio 2/3.

Johanne Cohen, Khaled Maamra, George Manoussakis, Laurence Pilard

Proceedings of the 20th International Conference on Principles of Distributed Systems, 2016