George Manoussakis

According to our database1, George Manoussakis authored at least 17 papers between 2016 and 2024.

Collaborative distances:

Timeline

2016
2017
2018
2019
2020
2021
2022
2023
2024
0
1
2
3
4
5
6
1
1
1
1
2
1
1
2
1
1
3
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
New results for the detection of bicliques.
CoRR, 2024

2023
Efficient maximal cliques enumeration in weakly closed graphs.
CoRR, 2023

From State to Link-Register Model: A transformer for Self-Stabilizing Distributed Algorithms.
Proceedings of the 25th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2023

2021
Efficient enumeration of maximal induced bicliques.
Discret. Appl. Math., 2021

2020
Parameterized Multi-Scenario Single-Machine Scheduling Problems.
Algorithmica, 2020

2019
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.
Theor. Comput. Sci., 2019

2018
Primitive Zonotopes.
Discret. Comput. Geom., 2018

A Self-Stabilizing Algorithm for Maximal Matching in Link-Register Model.
Proceedings of the Structural Information and Communication Complexity, 2018

2017
Combinatorial Algorithms and Optimization. (Algorithmes combinatoires et optimisation).
PhD thesis, 2017

A self-stabilizing algorithm for maximal matching in link-register model in $O(nΔ^3)$ moves.
CoRR, 2017

Self-stabilizing Distributed Stable Marriage.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2017

An Output Sensitive Algorithm for Maximal Clique Enumeration in Sparse Graphs.
Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017

Listing All Fixed-Length Simple Cycles in Sparse Graphs in Optimal Time.
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.
CoRR, 2016

The Mann et al. self-stabilizing 2/3-approximation matching algorithm is sub-exponential.
CoRR, 2016

Polynomial Self-Stabilizing Maximum Matching Algorithm with Approximation Ratio 2/3.
Proceedings of the 20th International Conference on Principles of Distributed Systems, 2016


  Loading...