default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEli Berger
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j44]Eli Berger, Paul D. Seymour:
Bounded-Diameter Tree-Decompositions. Comb. 44(3): 659-674 (2024)- [j43]Abeer Othman, Eli Berger:
Almost fair perfect matchings in complete bipartite graphs. Discret. Math. 347(4): 113865 (2024) - [j42]Ron Aharoni, Eli Berger, Joseph Briggs, He Guo
, Shira Zerbib:
Looms. Discret. Math. 347(12): 114181 (2024) - [j41]Tara Abrishami, Eli Berger, Maria Chudnovsky, Shira Zerbib:
Graphs with no even holes and no sector wheels are the union of two chordal graphs. Eur. J. Comb. 122: 104035 (2024) - [c5]Isaac Reid, Eli Berger, Krzysztof Marcin Choromanski, Adrian Weller:
Repelling Random Walks. ICLR 2024 - [c4]Isaac Reid, Krzysztof Marcin Choromanski, Eli Berger, Adrian Weller:
General Graph Random Features. ICLR 2024 - 2023
- [j40]Ron Aharoni, Eli Berger, Maria Chudnovsky, He Guo, Shira Zerbib:
Nonuniform Degrees and Rainbow Versions of the Caccetta-Häggkvist Conjecture. SIAM J. Discret. Math. 37(3): 1704-1714 (2023) - [c3]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, Deepali Jain, Tamás Sarlós, Snigdha Chaturvedi, Adrian Weller:
Efficient Graph Field Integrators Meet Point Clouds. ICML 2023: 5978-6004 - [i6]Krzysztof Choromanski, Arijit Sehanobish, Han Lin, Yunfan Zhao, Eli Berger, Tetiana Parshakova, Alvin Pan, David Watkins, Tianyi Zhang, Valerii Likhosherstov, Somnath Basu Roy Chowdhury, Avinava Dubey, Deepali Jain, Tamás Sarlós, Snigdha Chaturvedi, Adrian Weller:
Efficient Graph Field Integrators Meet Point Clouds. CoRR abs/2302.00942 (2023) - [i5]Ron Aharoni, Eli Berger, Joseph Briggs, He Guo:
Looms. CoRR abs/2309.03735 (2023) - [i4]Isaac Reid, Eli Berger, Krzysztof Choromanski, Adrian Weller:
Repelling Random Walks. CoRR abs/2310.04854 (2023) - [i3]Isaac Reid, Krzysztof Choromanski, Eli Berger, Adrian Weller:
Universal Graph Random Features. CoRR abs/2310.04859 (2023) - [i2]Ron Aharoni, Eli Berger, He Guo, Daniel Kotlar:
2-covers of wide Young diagrams. CoRR abs/2311.17670 (2023) - 2022
- [j39]Ron Aharoni, Eli Berger, Joseph Briggs, Erel Segal-Halevi, Shira Zerbib:
Fractionally Balanced Hypergraphs and Rainbow KKM Theorems. Comb. 42(6): 913-951 (2022) - [j38]Ron Aharoni, Eli Berger, Maria Chudnovsky, Shira Zerbib:
Rainbow Paths and Large Rainbow Matchings. Electron. J. Comb. 29(1) (2022) - [j37]Eli Berger, Krzysztof Choromanski, Maria Chudnovsky, Shira Zerbib:
Tournaments and the strong Erdős-Hajnal Property. Eur. J. Comb. 100: 103440 (2022) - 2021
- [j36]Eli Berger, Paul D. Seymour, Sophie Spirkl:
Finding an induced path that is not a shortest path. Discret. Math. 344(7): 112398 (2021) - 2020
- [j35]Ron Aharoni, Eli Berger, Maria Chudnovsky, Frédéric Havet, Zilin Jiang:
Cooperative Colorings of Trees and of Bipartite Graphs. Electron. J. Comb. 27(1): 1 (2020)
2010 – 2019
- 2019
- [j34]Eli Berger, Krzysztof Choromanski, Maria Chudnovsky:
On the Erdős-Hajnal conjecture for six-vertex tournaments. Eur. J. Comb. 75: 113-122 (2019) - [j33]Ron Aharoni, Eli Berger, Maria Chudnovsky, David M. Howard, Paul D. Seymour:
Large rainbow matchings in general graphs. Eur. J. Comb. 79: 222-227 (2019) - 2018
- [j32]Eli Berger, Zdenek Dvorák, Sergey Norin:
Treewidth of Grid Subsets. Comb. 38(6): 1337-1352 (2018) - [j31]Eli Berger, Yanay Soker:
A condition for assured 3-face-colorability of infinite plane graphs with a given spanning tree. Discret. Math. 341(10): 2919-2924 (2018) - [j30]Abeer Othman, Eli Berger:
Cliques in the Union of C4-Free Graphs. Graphs Comb. 34(4): 607-612 (2018) - [j29]Ron Aharoni, Eli Berger, Dani Kotlar, Ran Ziv:
Degree Conditions for Matchability in 3-Partite Hypergraphs. J. Graph Theory 87(1): 61-71 (2018) - 2017
- [j28]Eli Berger:
Unfriendly partitions for graphs not containing a subdivision of an infinite clique. Comb. 37(2): 157-166 (2017) - [j27]Ron Aharoni, Eli Berger, Dani Kotlar, Ran Ziv:
Fair Representation in the Intersection of Two Matroids. Electron. J. Comb. 24(4): 4 (2017) - [j26]Ron Aharoni, Eli Berger, Dani Kotlar, Ran Ziv:
Fair representation in dimatroids. Electron. Notes Discret. Math. 61: 5-11 (2017) - [j25]Ron Aharoni, Eli Berger, Dani Kotlar, Ran Ziv:
Topological methods for the existence of a rainbow matching. Electron. Notes Discret. Math. 63: 479-484 (2017) - 2016
- [j24]Ron Aharoni, Eli Berger, Dani Kotlar, Ran Ziv:
On rainbow matchings in bipartite graphs. Electron. Notes Discret. Math. 54: 33-38 (2016) - [j23]Ron Aharoni, Noga Alon, Eli Berger:
Eigenvalues of K1, k-Free Graphs and the Connectivity of Their Independence Complexes. J. Graph Theory 83(4): 384-391 (2016) - 2015
- [j22]Ron Aharoni, Eli Berger, Philipp Sprüssel:
Two Disjoint Independent Bases in Matroid-Graph Pairs. Graphs Comb. 31(5): 1107-1116 (2015) - [j21]Eli Berger, Krzysztof Choromanski, Maria Chudnovsky:
Forcing large transitive subtournaments. J. Comb. Theory B 112: 1-17 (2015) - [j20]Ron Aharoni, Eli Berger, Maria Chudnovsky, Juba Ziani:
Cliques in the union of graphs. J. Comb. Theory B 114: 170-186 (2015) - 2014
- [j19]Ron Aharoni, Eli Berger, Irina Gorelik:
Kernels in Weighted Digraphs. Order 31(1): 35-43 (2014) - 2013
- [j18]Eli Berger, Krzysztof Choromanski, Maria Chudnovsky, Jacob Fox, Martin Loebl, Alex Scott, Paul D. Seymour, Stéphan Thomassé:
Tournaments and colouring. J. Comb. Theory B 103(1): 1-20 (2013) - 2012
- [j17]Ron Aharoni, Eli Berger, Ran Ziv:
The edge covering number of the intersection of two matroids. Discret. Math. 312(1): 81-85 (2012) - [j16]Eli Berger, Irith Ben-Arroyo Hartman:
A unified approach to known and unknown cases of Berge's conjecture. J. Graph Theory 71(3): 317-330 (2012) - 2011
- [j15]Eli Berger, Henning Bruhn:
Eulerian edge sets in locally finite graphs. Comb. 31(1): 21-38 (2011) - [j14]Ron Aharoni, Eli Berger:
Strongly maximal antichains in posets. Discret. Math. 311(15): 1518-1522 (2011) - [j13]Ron Aharoni, Eli Berger, Agelos Georgakopoulos, Amitai Perlstein, Philipp Sprüssel:
The Max-Flow Min-Cut theorem for countable networks. J. Comb. Theory B 101(1): 1-17 (2011)
2000 – 2009
- 2009
- [j12]Ron Aharoni, Eli Berger:
Rainbow Matchings in r-Partite r-Graphs. Electron. J. Comb. 16(1) (2009) - 2008
- [j11]Ron Aharoni, Eli Berger, Agelos Georgakopoulos, Philipp Sprüssel:
Strongly Maximal Matchings in Infinite Graphs. Electron. J. Comb. 15(1) (2008) - [j10]Noga Alon, Eli Berger:
The Grothendieck constant of random and pseudo-random graphs. Discret. Optim. 5(2): 323-327 (2008) - [j9]Eli Berger, Ran Ziv:
A note on the edge cover number and independence number in hypergraphs. Discret. Math. 308(12): 2649-2654 (2008) - [j8]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) - [j7]Ron Aharoni, Eli Berger, Ron Holzman, Ori Kfir:
Independence - domination duality. J. Comb. Theory B 98(6): 1259-1270 (2008) - [j6]Ron Aharoni, Eli Berger, Ori Kfir:
Acyclic systems of representatives and acyclic colorings of digraphs. J. Graph Theory 59(3): 177-189 (2008) - 2007
- [j5]Ron Aharoni, Eli Berger, Ran Ziv:
Independent systems of representatives in weighted graphs. Comb. 27(3): 253-267 (2007) - 2005
- [c2]Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler, Muli Safra:
On Non-Approximability for Quadratic Programs. FOCS 2005: 206-215 - [i1]Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler, Muli Safra:
On Non-Approximability for Quadratic Programs. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j4]Eli Berger:
KKM-A Topological Approach For Trees. Comb. 25(1): 1-18 (2004) - 2003
- [c1]Rachel Tzoref, Mark Matusevich, Eli Berger, Ilan Beer:
An Optimized Symbolic Bounded Model Checking Engine. CHARME 2003: 141-149 - 2002
- [j3]Ron Aharoni, Eli Berger, Ran Ziv:
A Tree Version of Konig's Theorem. Comb. 22(3): 335-343 (2002) - 2001
- [j2]Ron Aharoni, Eli Berger:
The number of edges in critical strongly connected graphs. Discret. Math. 234(1-3): 119-123 (2001) - [j1]Eli Berger:
Dynamic Monopolies of Constant Size. J. Comb. Theory B 83(2): 191-200 (2001)
Coauthor Index
aka: Krzysztof Marcin Choromanski
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-02 20:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
