|
Search the dblp DataBase
Eli Berger:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Rachel Tzoref, Mark Matusevich, Eli Berger, Ilan Beer
An Optimized Symbolic Bounded Model Checking Engine. [Citation Graph (0, 0)][DBLP] CHARME, 2003, pp:141-149 [Conf]
- Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler, Muli Safra
On Non-Approximability for Quadratic Programs. [Citation Graph (0, 0)][DBLP] FOCS, 2005, pp:206-215 [Conf]
- Ron Aharoni, Eli Berger, Ran Ziv
A Tree Version of Konig's Theorem. [Citation Graph (0, 0)][DBLP] Combinatorica, 2002, v:22, n:3, pp:335-343 [Journal]
- Eli Berger
KKM-A Topological Approach For Trees. [Citation Graph (0, 0)][DBLP] Combinatorica, 2004, v:25, n:1, pp:1-18 [Journal]
- Ron Aharoni, Eli Berger
The number of edges in critical strongly connected graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2001, v:234, n:1-3, pp:119-123 [Journal]
- Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler, Muli Safra
On Non-Approximability for Quadratic Programs [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:058, pp:- [Journal]
- Eli Berger
Dynamic Monopolies of Constant Size. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2001, v:83, n:2, pp:191-200 [Journal]
Independent systems of representatives in weighted graphs. [Citation Graph (, )][DBLP]
A note on the edge cover number and independence number in hypergraphs. [Citation Graph (, )][DBLP]
Proof of Berge's strong path partition conjecture for k=2. [Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.005secs
|