( en | de | ru )

 

Disambiguation of "Ofek, Eran"

Author of the publication

copydeleteadd this publication to your clipboard
Geodesics and almost geodesic cycles in random regular graphs.

, , , , and . J. Graph Theory, 66 (2): 115-136 (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Emre Eran

Asl han Eran

Hasan Gündüz Eran

Eran Gündüz

Tagi Erani

 

Other publications of authors with the same name

What You See is What You Read? Improving Text-Image Alignment Evaluation., , , , , , , and . CoRR, (2023)On the Expansion of the Giant Component in Percolated (n, d, lambda) Graphs.. Comb. Probab. Comput., 16 (3): 445-457 (2007)Geodesics and almost geodesic cycles in random regular graphs., , , , and . J. Graph Theory, 66 (2): 115-136 (2011)Easily refutable subformulas of large random 3CNF formulas., and . Theory of Computing, 3 (1): 25-43 (2007)Dynamic Composition for Conversational Domain Exploration., , , , , , , , , and 2 other author(s). WWW, page 872-883. ACM / IW3C2, (2020)Witnesses for non-satisfiability of dense random 3CNF formulas., , and . FOCS, page 497-508. IEEE Computer Society, (2006)Easily Refutable Subformulas of Large Random 3CNF Formulas., and . ICALP, volume 3142 of Lecture Notes in Computer Science, page 519-530. Springer, (2004)Finding a Maximum Independent Set in a Sparse Random Graph., and . APPROX-RANDOM, volume 3624 of Lecture Notes in Computer Science, page 282-293. Springer, (2005)Approximating Maximum Edge Coloring in Multigraphs., , and . APPROX, volume 2462 of Lecture Notes in Computer Science, page 108-121. Springer, (2002)Routing complexity of faulty networks., , , and . Random Struct. Algorithms, 32 (1): 71-87 (2008)