A Distributed Algorithm to Find Hamiltonian Cycles in Random Graphs. - Eythan Levy; Guy Louchard; Jordi Petit (CAAN, 2004)

A Tight Analysis of the Maximal Matching Heuristic. - Jean Cardinal; Martine Labbé; Stefan Langerman; Eythan Levy; Hadrien Mélot (COCOON, 2005)

Improved approximation bounds for edge dominating set in dense graphs. - Jean Cardinal; Stefan Langerman; Eythan Levy (Theor. Comput. Sci., 2009)

Connected vertex covers in dense graphs. - Jean Cardinal; Eythan Levy (Theor. Comput. Sci., 2010)

Models and Algorithms for Chronology. - Gilles Geeraerts; Eythan Levy; Frédéric Pluquet (TIME, 2017)

Computer experiments on the Khirbet Qeiyafa ostracon. - Eythan Levy; Frédéric Pluquet (Digit. Scholarsh. Humanit., 2017)