Articles by George Manoussakis

(Reported to unkwown date) The Bron-Kerbosch algorithm with vertex ordering is output sensitive.

-- George Manoussakis (University of Versailles)

summary: The Bron-Kerbosch algorithm is a well known maximal clique enumeration algorithm. So far it was unknown whether it was output sensitive or not. In this paper we partially answer this question by proving that the Bron-Kerbosch Algorithm with vertex ordering, first introduced and studied by Eppstein, Löffler and Strash ...

Attribution Accessit du prix de thèse 2018 Graphes Charles DELORME

-- George Manoussakis

Nous avons le plaisir de vous annoncer que l'étudiant George Manoussakis encadré par Johanne Cohen et Antoine Deza a reçu l'accessit du prix de thèse 2018 Graphes Charles DELORME.

http://gtgraphes.labri.fr/pmwiki/pmwiki.php/PrixTheseDelorme/PrixTheseDelorme

Voici le résumé de sa thèse : Nous introduisons d'abord ...

Euler Polytopes and Convex Matroid Optimization

-- George Manoussakis (LRI)

We introduce a novel family of polytopes strengthening bounds relevant to combinatorial optimization and convex matroid optimization. Del Pia and Michini recently improved the upper bound of kd due to Kleinschmidt and Onn for the largest possible diameter of the convex hull of a set of points in dimension d ...