Levy Eytan (ELV)

Contact

 elevy@he2b.be

Courses taught

Publications

  • Eythan Levy, Guy Louchard, Jordi Petit, 2004. A Distributed Algorithm to Find Hamiltonian Cycles in G(n,p). Random Graphs Proceedings of the First Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN).Springer-Verlag, Lecture Notes in Computer Science, Berlin, Vol. 3405, p. 63-74
  • Jean Cardinal, Martine Labbé, Stefan Langerman, Eythan Levy and Hadrien Mélot, 2005. A Tight Analysis of the Maximal Matching Heuristic. Proceedings of The Eleventh International Computing and Combinatorics Conference (COCOON). Springer-Verlag, Lecture Notes in Computer Science, Berlin, Vol. 3595, p. 701-709
  • Jean Cardinal, Stefan Langerman, Eythan Levy, 2006. Improved Approximation Ratios for Edge Dominating Set in Dense Graphs. Proceedings of The Fourth Workshop on Approximation and Online Algorithms (WAOA). Springer-Verlag, Lecture Notes in Computer Science, Berlin, Vol. 4368, p. 108-120 Journal version in Theoretical Computer Science 410 (2009), p. 949-957
  • Jean Cardinal, Eythan Levy, 2008. Connected Vertex Covers in Dense Graphs. Proceedings of The 11th Intl. Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX). Springer-Verlag, Lecture Notes in Computer Science, Berlin, Vol. 5171, p. 35-48 Journal version in Theoretical Computer Science 411 (2010), p. 2581-2590
  • Eythan Levy, 2014. A Fresh Look at the Baal-Zaphon Stele. Journal of Egyptian Archaeology 100, p. 293-309
  • Eythan Levy, 2016. The Mekal stele. In Daphna Ben-Tor, ed. Pharaoh in Canaan, The untold story. The Israel Museum, Jerusalem (2016), p. 110-111
  • Eythan Levy, Frédéric Pluquet, 2016. Computer experiments on the Khirbet Qeiyafa ostracon. Digital scholarship in the Humanities 2016.