Zobrazeno 1 - 9
of 9
pro vyhledávání: '"George Manoussakis"'
Autor:
George Manoussakis, Danny Hermelin
Publikováno v:
Discrete Applied Mathematics. 303:253-261
Given a graph G of order n , we consider the problem of enumerating all its maximal induced bicliques. We first propose an algorithm running in time O ( n 3 n / 3 ) . As the maximum number of maximal induced bicliques of a graph with n vertices is Θ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::78b49a57daa48ae5e0b047e1bf9ae8e7
https://doi.org/10.1016/j.dam.2020.04.034
https://doi.org/10.1016/j.dam.2020.04.034
Publikováno v:
Algorithmica. 82:2644-2667
We study a class of multi-scenario single-machine scheduling problems. In this class of problems, we are given a set of scenarios with each one having a different realization of job characteristics. We consider these multi-scenario problems where the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e360449df122f26a79c1c2833ce8ee91
https://doi.org/10.1007/s00453-020-00702-w
https://doi.org/10.1007/s00453-020-00702-w
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2019, 782, pp.54-78. ⟨10.1016/j.tcs.2019.02.031⟩
Theoretical Computer Science, Elsevier, 2019, 782, pp.54-78. ⟨10.1016/j.tcs.2019.02.031⟩
We present the first polynomial self-stabilizing algorithm for finding a 1-maximal matching in a general graph. The previous best known algorithm has been presented by Manne et al. [20] and we show in this paper it has a sub-exponential time complexi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f731b15e3c22225164d0112af0574b4b
https://doi.org/10.1016/j.tcs.2019.02.031
https://doi.org/10.1016/j.tcs.2019.02.031
Autor:
George Manoussakis
Publikováno v:
Theoretical Computer Science. 770:25-33
Given a graph, we are interested in the question of finding all its maximal cliques. This question models the community detection problem and has been extensively studied. Here, we approach it under the light of an important graph parameter. The dege
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1a59112c4e7c87078b9bd7ab0ae101b0
https://doi.org/10.1016/j.tcs.2018.10.014
https://doi.org/10.1016/j.tcs.2018.10.014
Publikováno v:
SIROCCO 2018: International Colloquium on Structural Information and Communication Complexity
SIROCCO 2018: International Colloquium on Structural Information and Communication Complexity, Jun 2018, Ma'ale HaHamisha, Israel. pp.14-19
Structural Information and Communication Complexity ISBN: 9783030013240
SIROCCO
SIROCCO 2018: International Colloquium on Structural Information and Communication Complexity, Jun 2018, Ma'ale HaHamisha, Israel. pp.14-19
Structural Information and Communication Complexity ISBN: 9783030013240
SIROCCO
This paper presents a new distributed self-stabilizing algorithm solving the maximal matching problem under the fair distributed daemon. This is the first maximal matching algorithm in the link-register model under read/write atomicity. This work is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b1f777519294454d186d1af2dfc3c6c1
https://hal.archives-ouvertes.fr/hal-01974891
https://hal.archives-ouvertes.fr/hal-01974891
Autor:
Janna Burman, Johanne Cohen, Laurence Pilard, Marie Laveau, George Manoussakis, Thibault Bernard, Joffroy Beauquier
Publikováno v:
International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)
International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2017, Boston, United States. pp.46-61, ⟨10.1007/978-3-319-69084-1_4⟩
Lecture Notes in Computer Science ISBN: 9783319690834
SSS
International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2017, Boston, United States. pp.46-61, ⟨10.1007/978-3-319-69084-1_4⟩
Lecture Notes in Computer Science ISBN: 9783319690834
SSS
International audience; Stable matching (also called stable marriage in the literature) is a problem of matching in a bipartite graph, introduced in an economic context by Gale and Shapley. In this problem, each node has preferences for matching with
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a4c235ed4c1ac11e0bc3146068e62173
https://hal.archives-ouvertes.fr/hal-01576055/document
https://hal.archives-ouvertes.fr/hal-01576055/document
Autor:
George Manoussakis
Publikováno v:
Fundamentals of Computation Theory ISBN: 9783662557501
FCT
International Symposium on Fundamentals of Computation Theory
International Symposium on Fundamentals of Computation Theory, Sep 2017, Bordeaux, France
FCT
International Symposium on Fundamentals of Computation Theory
International Symposium on Fundamentals of Computation Theory, Sep 2017, Bordeaux, France
The degeneracy of an n-vertex graph G is the smallest number k such that every subgraph of G contains a vertex of degree at most k. We present an algorithm for enumerating all simple cycles of length p in an n-order k-degenerate graph running in time
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7ad6287cf628ac93453a84f3e7eb4ec4
https://doi.org/10.1007/978-3-662-55751-8_28
https://doi.org/10.1007/978-3-662-55751-8_28
Publikováno v:
Discrete and Computational Geometry
Discrete and Computational Geometry, Springer Verlag, 2018, 60, pp.27-39. ⟨10.1007/s00454-017-9873-z⟩
Discrete and Computational Geometry, Springer Verlag, 2018, 60, pp.27-39. ⟨10.1007/s00454-017-9873-z⟩
We introduce and study a family of polytopes which can be seen as a generalization of the permutahedron of type $B_d$. We highlight connections with the largest possible diameter of the convex hull of a set of points in dimension $d$ whose coordinate
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b947b1e8771af963225d38ec431eedd4
http://arxiv.org/abs/1512.08018
http://arxiv.org/abs/1512.08018