default search action
George Manoussakis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c6]Johanne Cohen, George Manoussakis, Laurence Pilard:
From State to Link-Register Model: A transformer for Self-Stabilizing Distributed Algorithms. SYNASC 2023: 114-121 - [i4]George Manoussakis:
Efficient maximal cliques enumeration in weakly closed graphs. CoRR abs/2303.02390 (2023) - 2021
- [j5]Danny Hermelin, George Manoussakis:
Efficient enumeration of maximal induced bicliques. Discret. Appl. Math. 303: 253-261 (2021) - 2020
- [j4]Danny Hermelin, George Manoussakis, Michael L. Pinedo, Dvir Shabtay, Liron Yedidsion:
Parameterized Multi-Scenario Single-Machine Scheduling Problems. Algorithmica 82(9): 2644-2667 (2020)
2010 – 2019
- 2019
- [j3]George Manoussakis:
A new decomposition technique for maximal clique enumeration for sparse graphs. Theor. Comput. Sci. 770: 25-33 (2019) - [j2]Johanne Cohen, Jonas Lefèvre, Khaled Maâmra, George Manoussakis, Laurence Pilard:
The first polynomial self-stabilizing 1-maximal matching algorithm for general graphs. Theor. Comput. Sci. 782: 54-78 (2019) - 2018
- [j1]Antoine Deza, George Manoussakis, Shmuel Onn
:
Primitive Zonotopes. Discret. Comput. Geom. 60(1): 27-39 (2018) - [c5]Johanne Cohen, George Manoussakis, Laurence Pilard, Devan Sohier:
A Self-Stabilizing Algorithm for Maximal Matching in Link-Register Model. SIROCCO 2018: 14-19 - 2017
- [b1]George Manoussakis:
Combinatorial Algorithms and Optimization. (Algorithmes combinatoires et optimisation). Paris-Sud University, France, 2017 - [c4]George Manoussakis:
Listing All Fixed-Length Simple Cycles in Sparse Graphs in Optimal Time. FCT 2017: 355-366 - [c3]George Manoussakis:
An Output Sensitive Algorithm for Maximal Clique Enumeration in Sparse Graphs. IPEC 2017: 27:1-27:8 - [c2]Marie Laveau
Self-stabilizing Distributed Stable Marriage. SSS 2017: 46-61 - [i3]Johanne Cohen, George Manoussakis, Laurence Pilard, Devan Sohier:
A self-stabilizing algorithm for maximal matching in link-register model in $O(nΔ^3)$ moves. CoRR abs/1709.04811 (2017) - 2016
- [c1]Johanne Cohen, Khaled Maamra, George Manoussakis, Laurence Pilard:
Polynomial Self-Stabilizing Maximum Matching Algorithm with Approximation Ratio 2/3. OPODIS 2016: 11:1-11:17 - [i2]Johanne Cohen, Khaled Maamra, George Manoussakis, Laurence Pilard:
The Mann et al. self-stabilizing 2/3-approximation matching algorithm is sub-exponential. CoRR abs/1604.08066 (2016) - [i1]Johanne Cohen, Khaled Maâmra, George Manoussakis, Laurence Pilard:
Polynomial self-stabilizing algorithm and proof for a 2/3-approximation of a maximum matching. CoRR abs/1611.06038 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-20 00:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: