|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
No Growbag Graphs found.
|
|
|
|
|
Results
Found 19 publication records. Showing 19 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Ron Aharoni, Eli Berger, Ran Ziv |
The edge covering number of the intersection of two matroids.  |
Discrete Mathematics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ron Aharoni, Eli Berger, Agelos Georgakopoulos, Amitai Perlstein, Philipp Sprüssel |
The Max-Flow Min-Cut theorem for countable networks. |
J. Comb. Theory, Ser. B |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ron Aharoni, Eli Berger |
Strongly maximal antichains in posets. |
Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Berger, Henning Bruhn |
Eulerian edge sets in locally finite graphs. |
Combinatorica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ron Aharoni, Eli Berger |
Rainbow Matchings in r-Partite r-Graphs. |
Electr. J. Comb. |
2009 |
DBLP BibTeX RDF |
|
| 1 | Ron Aharoni, Eli Berger, Ron Holzman, Ori Kfir |
Independence - domination duality. |
J. Comb. Theory, Ser. B |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Eli Berger |
The Grothendieck constant of random and pseudo-random graphs. |
Discrete Optimization |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Berger, Ran Ziv |
A note on the edge cover number and independence number in hypergraphs. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Berger, Irith Ben-Arroyo Hartman |
Proof of Berge's strong path partition conjecture for k=2. |
Eur. J. Comb. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ron Aharoni, Eli Berger, Agelos Georgakopoulos, Philipp Sprüssel |
Strongly Maximal Matchings in Infinite Graphs. |
Electr. J. Comb. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Ron Aharoni, Eli Berger, Ori Kfir |
Acyclic systems of representatives and acyclic colorings of digraphs. |
Journal of Graph Theory |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ron Aharoni, Eli Berger, Ran Ziv |
Independent systems of representatives in weighted graphs. |
Combinatorica |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler, Muli Safra |
On Non-Approximability for Quadratic Programs |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler, Muli Safra |
On Non-Approximability for Quadratic Programs. |
FOCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Berger |
KKM-A Topological Approach For Trees. |
Combinatorica |
2004 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05B40 |
| 1 | Rachel Tzoref, Mark Matusevich, Eli Berger, Ilan Beer |
An Optimized Symbolic Bounded Model Checking Engine. |
CHARME |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Ron Aharoni, Eli Berger, Ran Ziv |
A Tree Version of Konig's Theorem. |
Combinatorica |
2002 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000) Classes: 05C70 |
| 1 | Eli Berger |
Dynamic Monopolies of Constant Size. |
J. Comb. Theory, Ser. B |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Ron Aharoni, Eli Berger |
The number of edges in critical strongly connected graphs. |
Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #19 of 19 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")