The number of edges in critical strongly connected graphs. - Ron Aharoni; Eli Berger (Discret. Math., 2001)

Dynamic Monopolies of Constant Size. - Eli Berger (J. Comb. Theory B, 2001)

A Tree Version of Konig's Theorem. - Ron Aharoni; Eli Berger; Ran Ziv (Comb., 2002)

An Optimized Symbolic Bounded Model Checking Engine. - Rachel Tzoref; Mark Matusevich; Eli Berger; Ilan Beer (CHARME, 2003)

KKM-A Topological Approach For Trees. - Eli Berger (Comb., 2004)

On Non-Approximability for Quadratic Programs - Sanjeev Arora; Eli Berger; Elad Hazan; Guy Kindler; Muli Safra (Electron. Colloquium Comput. Complex., 2005)

Independent systems of representatives in weighted graphs. - Ron Aharoni; Eli Berger; Ran Ziv (Comb., 2007)

Strongly Maximal Matchings in Infinite Graphs. - Ron Aharoni; Eli Berger; Agelos Georgakopoulos; Philipp Sprüssel (Electron. J. Comb., 2008)

The Grothendieck constant of random and pseudo-random graphs. - Noga Alon; Eli Berger (Discret. Optim., 2008)

A note on the edge cover number and independence number in hypergraphs. - Eli Berger; Ran Ziv (Discret. Math., 2008)

Proof of Berge's strong path partition conjecture for k=2. - Eli Berger; Irith Ben-Arroyo Hartman (Eur. J. Comb., 2008)

Independence - domination duality. - Ron Aharoni; Eli Berger; Ron Holzman; Ori Kfir (J. Comb. Theory B, 2008)

Acyclic systems of representatives and acyclic colorings of digraphs. - Ron Aharoni; Eli Berger; Ori Kfir (J. Graph Theory, 2008)

Rainbow Matchings in r-Partite r-Graphs. - Ron Aharoni; Eli Berger (Electron. J. Comb., 2009)

Eulerian edge sets in locally finite graphs. - Eli Berger; Henning Bruhn (Comb., 2011)

Strongly maximal antichains in posets. - Ron Aharoni; Eli Berger (Discret. Math., 2011)

The Max-Flow Min-Cut theorem for countable networks. - Ron Aharoni; Eli Berger; Agelos Georgakopoulos; Amitai Perlstein; Philipp Sprüssel (J. Comb. Theory B, 2011)

The edge covering number of the intersection of two matroids. - Ron Aharoni; Eli Berger; Ran Ziv (Discret. Math., 2012)

A unified approach to known and unknown cases of Berge's conjecture. - Eli Berger; Irith Ben-Arroyo Hartman (J. Graph Theory, 2012)

Tournaments and colouring. - Eli Berger; Krzysztof Choromanski; Maria Chudnovsky; Jacob Fox; Martin Loebl; Alex Scott 001; Paul D. Seymour; Stéphan Thomassé (J. Comb. Theory B, 2013)

Kernels in Weighted Digraphs. - Ron Aharoni; Eli Berger; Irina Gorelik (Order, 2014)

Two Disjoint Independent Bases in Matroid-Graph Pairs. - Ron Aharoni; Eli Berger; Philipp Sprüssel (Graphs Comb., 2015)

Cliques in the union of graphs. - Ron Aharoni; Eli Berger; Maria Chudnovsky; Juba Ziani (J. Comb. Theory B, 2015)

Forcing large transitive subtournaments. - Eli Berger; Krzysztof Choromanski; Maria Chudnovsky (J. Comb. Theory B, 2015)

On rainbow matchings in bipartite graphs. - Ron Aharoni; Eli Berger; Dani Kotlar; Ran Ziv (Electron. Notes Discret. Math., 2016)

Eigenvalues of K1, k-Free Graphs and the Connectivity of Their Independence Complexes. - Ron Aharoni; Noga Alon; Eli Berger (J. Graph Theory, 2016)

Unfriendly partitions for graphs not containing a subdivision of an infinite clique. - Eli Berger (Comb., 2017)

Fair Representation in the Intersection of Two Matroids. - Ron Aharoni; Eli Berger; Dani Kotlar; Ran Ziv (Electron. J. Comb., 2017)

Fair representation in dimatroids. - Ron Aharoni; Eli Berger; Dani Kotlar; Ran Ziv (Electron. Notes Discret. Math., 2017)

Topological methods for the existence of a rainbow matching. - Ron Aharoni; Eli Berger; Dani Kotlar; Ran Ziv (Electron. Notes Discret. Math., 2017)

Treewidth of Grid Subsets. - Eli Berger; Zdenek Dvorák 001; Sergey Norin (Comb., 2018)

A condition for assured 3-face-colorability of infinite plane graphs with a given spanning tree. - Eli Berger; Yanay Soker (Discret. Math., 2018)

Cliques in the Union of C4-Free Graphs. - Abeer Othman; Eli Berger (Graphs Comb., 2018)

Degree Conditions for Matchability in 3-Partite Hypergraphs. - Ron Aharoni; Eli Berger; Dani Kotlar; Ran Ziv (J. Graph Theory, 2018)

Large rainbow matchings in general graphs. - Ron Aharoni; Eli Berger; Maria Chudnovsky; David M. Howard 002; Paul D. Seymour (Eur. J. Comb., 2019)

On the Erdős-Hajnal conjecture for six-vertex tournaments. - Eli Berger; Krzysztof Choromanski; Maria Chudnovsky (Eur. J. Comb., 2019)

Cooperative Colorings of Trees and of Bipartite Graphs. - Ron Aharoni; Eli Berger; Maria Chudnovsky; Frédéric Havet; Zilin Jiang (Electron. J. Comb., 2020)

Finding an induced path that is not a shortest path. - Eli Berger; Paul D. Seymour; Sophie Spirkl (Discret. Math., 2021)

Rainbow Paths and Large Rainbow Matchings. - Ron Aharoni; Eli Berger; Maria Chudnovsky; Shira Zerbib (Electron. J. Comb., 2022)

Tournaments and the strong Erdős-Hajnal Property. - Eli Berger; Krzysztof Choromanski; Maria Chudnovsky; Shira Zerbib (Eur. J. Comb., 2022)

Fractionally Balanced Hypergraphs and Rainbow KKM Theorems. - Ron Aharoni; Eli Berger; Joseph Briggs; Erel Segal-Halevi; Shira Zerbib (Comb., 2022)

Efficient Graph Field Integrators Meet Point Clouds. - Krzysztof Marcin Choromanski; Arijit Sehanobish; Han Lin; Yunfan Zhao; Eli Berger; Tetiana Parshakova; Alvin Pan; David Watkins; Tianyi Zhang; Valerii Likhosherstov; Somnath Basu Roy Chowdhury; Kumar Avinava Dubey; et al. (ICML, 2023)

Looms. - Ron Aharoni; Eli Berger; Joseph Briggs; He Guo 002 (CoRR, 2023)

Universal Graph Random Features. - Isaac Reid; Krzysztof Choromanski; Eli Berger; Adrian Weller (CoRR, 2023)

2-covers of wide Young diagrams. - Ron Aharoni; Eli Berger; He Guo 002; Daniel Kotlar (CoRR, 2023)

Nonuniform Degrees and Rainbow Versions of the Caccetta-Häggkvist Conjecture. - Ron Aharoni; Eli Berger; Maria Chudnovsky; He Guo 002; Shira Zerbib (SIAM J. Discret. Math., 2023)

Repelling Random Walks. - Isaac Reid; Eli Berger; Krzysztof Marcin Choromanski; Adrian Weller (ICLR, 2024)

General Graph Random Features. - Isaac Reid; Krzysztof Marcin Choromanski; Eli Berger; Adrian Weller (ICLR, 2024)

Looms. - Ron Aharoni; Eli Berger; Joseph Briggs; He Guo 002; Shira Zerbib (Discret. Math., 2024)

Graphs with no even holes and no sector wheels are the union of two chordal graphs. - Tara Abrishami; Eli Berger; Maria Chudnovsky; Shira Zerbib (Eur. J. Comb., 2024)

Almost fair perfect matchings in complete bipartite graphs. - Abeer Othman; Eli Berger (Discret. Math., 2024)

Bounded-Diameter Tree-Decompositions. - Eli Berger; Paul D. Seymour (Comb., 2024)