( en | de | ru )

 

Disambiguation of "Manoussakis, George"

Author of the publication

copydeleteadd this publication to your clipboard
A Self-Stabilizing Algorithm for Maximal Matching in Link-Register Model.

, , , and . SIROCCO, volume 11085 of Lecture Notes in Computer Science, page 14-19. Springer, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Nikolaus Manoussakis

Regine Quack-Manoussakis

George Mertzios

Combinatorial optimization and recognition of graph classes with applications to related models. TU Aachen, (2009)

Witold George

Hans George

 

Other publications of authors with the same name

An Output Sensitive Algorithm for Maximal Clique Enumeration in Sparse Graphs.. IPEC, volume 89 of LIPIcs, page 27:1-27:8. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Listing All Fixed-Length Simple Cycles in Sparse Graphs in Optimal Time.. FCT, volume 10472 of Lecture Notes in Computer Science, page 355-366. Springer, (2017)Parameterized Multi-Scenario Single-Machine Scheduling Problems., , , , and . Algorithmica, 82 (9): 2644-2667 (2020)A self-stabilizing algorithm for maximal matching in link-register model in $O(nΔ^3)$ moves., , , and . CoRR, (2017)Primitive Zonotopes., , and . Discret. Comput. Geom., 60 (1): 27-39 (2018)Efficient maximal cliques enumeration in weakly closed graphs.. CoRR, (2023)Combinatorial Algorithms and Optimization. (Algorithmes combinatoires et optimisation).. Paris-Sud University, France, (2017)A Self-Stabilizing Algorithm for Maximal Matching in Link-Register Model., , , and . SIROCCO, volume 11085 of Lecture Notes in Computer Science, page 14-19. Springer, (2018)A new decomposition technique for maximal clique enumeration for sparse graphs.. Theor. Comput. Sci., (2019)The first polynomial self-stabilizing 1-maximal matching algorithm for general graphs., , , , and . Theor. Comput. Sci., (2019)