 | 2008 |
|---|
| 12 |       | Eli Berger,
Ran Ziv:
A note on the edge cover number and independence number in hypergraphs.
Discrete Mathematics 308(12): 2649-2654 (2008) |
| 11 | | Noga Alon,
Eli Berger:
The Grothendieck constant of random and pseudo-random graphs.
Discrete Optimization 5(2): 323-327 (2008) |
| 10 | | Eli Berger,
Irith Ben-Arroyo Hartman:
Proof of Berge's strong path partition conjecture for k=2.
Eur. J. Comb. 29(1): 179-192 (2008) |
| 9 | | Ron Aharoni,
Eli Berger,
Ron Holzman,
Ori Kfir:
Independence - domination duality.
J. Comb. Theory, Ser. B 98(6): 1259-1270 (2008) |
| 8 | | Ron Aharoni,
Eli Berger,
Ori Kfir:
Acyclic systems of representatives and acyclic colorings of digraphs.
Journal of Graph Theory 59(3): 177-189 (2008) |
| 2005 |
|---|
| 7 | | Sanjeev Arora,
Eli Berger,
Elad Hazan,
Guy Kindler,
Muli Safra:
On Non-Approximability for Quadratic Programs.
FOCS 2005: 206-215 |
| 6 | | Sanjeev Arora,
Eli Berger,
Elad Hazan,
Guy Kindler,
Muli Safra:
On Non-Approximability for Quadratic Programs
Electronic Colloquium on Computational Complexity (ECCC)(058): (2005) |
| 2004 |
|---|
| 5 | | Eli Berger:
KKM-A Topological Approach For Trees.
Combinatorica 25(1): 1-18 (2004) |
| 2003 |
|---|
| 4 | | Rachel Tzoref,
Mark Matusevich,
Eli Berger,
Ilan Beer:
An Optimized Symbolic Bounded Model Checking Engine.
CHARME 2003: 141-149 |
| 2002 |
|---|
| 3 | | Ron Aharoni,
Eli Berger,
Ran Ziv:
A Tree Version of Konig's Theorem.
Combinatorica 22(3): 335-343 (2002) |
| 2001 |
|---|
| 2 | | Ron Aharoni,
Eli Berger:
The number of edges in critical strongly connected graphs.
Discrete Mathematics 234(1-3): 119-123 (2001) |
| 1 | | Eli Berger:
Dynamic Monopolies of Constant Size.
J. Comb. Theory, Ser. B 83(2): 191-200 (2001) |
