Master's (Licence) in Computer Science, ULB, 2002 [thesis]
Master's (DEA) in Algorithms, Ecole Polytechnique (Paris), 2003 [thesis,
erratum]
PhD in Computer Science, ULB, 2009 [thesis]
Bachelor in Ancient Near Eastern Languages and Literature, ULB, 2009
Publications
- Eythan Levy, Guy Louchard, Jordi Petit. A distributed algorithm
to find hamiltonian cycles in G(n,p) random graphs. In Proc.
Workshop on Combinatorial and Algorithmic Aspects of Networking
(CAAN) 2004, Springer Lecture Notes in Computer Science 3405.
(Pdf)
- Jean Cardinal, Martine Labbé, Stefan Langerman, Eythan
Levy and Hadrien Mélot. A Tight Analysis of the Maximal Matching
Heuristic. In Proceedings of The Eleventh International
Computing and Combinatorics Conference (COCOON 2005) Springer
Lecture Notes in Computer Science 3595.
(Pdf)
- Jean Cardinal,Stefan Langerman, Eythan
Levy. Improved Approximation Ratios for Edge Dominating Set in Dense
Graphs. In Proceedings of The Fourth Workshop on Approximation
and Online Algorithms (WAOA 2006) Springer
Lecture Notes in Computer Science 4368
(Pdf).
Journal version in Theoretical Computer Science 410 (2009), pp. 949-957.
- Jean Cardinal, Eythan Levy. Connected vertex covers in dense
graphs. In Proceedings of The 11th Intl. Workshop on
Approximation Algorithms for Combinatorial Optimization Problems
(APPROX 2008) Springer Lecture Notes in Computer Science.
(Pdf)
Contact
Eythan Levy
Université Libre de Bruxelles
Département d'Informatique
Bld du Triomphe - CP 212
B-1050 Bruxelles
Belgium
Tel: 00-32-2-650.55.99
Fax.: 00-32-2-650.56.09
E-mail: elevy AT ulb.ac.be
Eythan
Levy