 | 2008 |
|---|
| 14 |       | Omer Angel,
Itai Benjamini,
Eran Ofek,
Udi Wieder:
Routing complexity of faulty networks.
Random Struct. Algorithms 32(1): 71-87 (2008) |
| 13 | | Uriel Feige,
Eran Ofek:
Finding a Maximum Independent Set in a Sparse Random Graph.
SIAM J. Discrete Math. 22(2): 693-718 (2008) |
| 2007 |
|---|
| 12 | | Eran Ofek:
On the Expansion of the Giant Component in Percolated (n, d, lambda) Graphs.
Combinatorics, Probability & Computing 16(3): 445-457 (2007) |
| 11 | | Uriel Feige,
Eran Ofek:
Easily refutable subformulas of large random 3CNF formulas.
Theory of Computing 3(1): 25-43 (2007) |
| 2006 |
|---|
| 10 | | Uriel Feige,
Jeong Han Kim,
Eran Ofek:
Witnesses for non-satisfiability of dense random 3CNF formulas.
FOCS 2006: 497-508 |
| 9 | | Uriel Feige,
Eran Ofek:
Random 3CNF formulas elude the Lovasz theta function
CoRR abs/cs/0603084: (2006) |
| 8 | | Eran Ofek,
Uriel Feige:
Random 3CNF formulas elude the Lovasz theta function.
Electronic Colloquium on Computational Complexity (ECCC) 13(043): (2006) |
| 2005 |
|---|
| 7 | | Uriel Feige,
Eran Ofek:
Finding a Maximum Independent Set in a Sparse Random Graph.
APPROX-RANDOM 2005: 282-293 |
| 6 | | Omer Angel,
Itai Benjamini,
Eran Ofek,
Udi Wieder:
Routing complexity of faulty networks.
PODC 2005: 209-217 |
| 5 | | Uriel Feige,
Eran Ofek:
Finding a Maximum Independent Set in a Sparse Random Graph
Electronic Colloquium on Computational Complexity (ECCC)(050): (2005) |
| 4 | | Eran Ofek:
On the expansion of the giant component in percolated (n,d,lambda) graphs
Electronic Colloquium on Computational Complexity (ECCC)(112): (2005) |
| 3 | | Uriel Feige,
Eran Ofek:
Spectral techniques applied to sparse random graphs.
Random Struct. Algorithms 27(2): 251-275 (2005) |
| 2004 |
|---|
| 2 | | Uriel Feige,
Eran Ofek:
Easily Refutable Subformulas of Large Random 3CNF Formulas.
ICALP 2004: 519-530 |
| 2002 |
|---|
| 1 | | Uriel Feige,
Eran Ofek,
Udi Wieder:
Approximating Maximum Edge Coloring in Multigraphs.
APPROX 2002: 108-121 |
