The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Eythan Levy: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Eythan Levy, Guy Louchard, Jordi Petit
    A Distributed Algorithm to Find Hamiltonian Cycles in Random Graphs. [Citation Graph (0, 0)][DBLP]
    CAAN, 2004, pp:63-74 [Conf]
  2. Jean Cardinal, Martine Labbé, Stefan Langerman, Eythan Levy, Hadrien Mélot
    A Tight Analysis of the Maximal Matching Heuristic. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:701-709 [Conf]
  3. Jean Cardinal, Stefan Langerman, Eythan Levy
    Improved Approximation Bounds for Edge Dominating Set in Dense Graphs. [Citation Graph (0, 0)][DBLP]
    WAOA, 2006, pp:108-120 [Conf]

  4. Connected Vertex Covers in Dense Graphs. [Citation Graph (, )][DBLP]


Search in 0.001secs, Finished in 0.001secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002