![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Shira Zerbib
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j25]Daniel McGinnis
, Shira Zerbib:
A Sparse Colorful Polytopal KKM Theorem. Discret. Comput. Geom. 71(3): 945-959 (2024) - [j24]Shira Zerbib:
Bounds on piercing and line-piercing numbers in families of convex sets in the plane. Discret. Math. 347(3): 113787 (2024) - [j23]Enrique Gomez-Leos, Emily Heath
, Alex Parker, Coy Schwieder, Shira Zerbib:
New bounds on the generalized Ramsey number f(n,5,8). Discret. Math. 347(7): 114012 (2024) - [j22]Ron Aharoni, Eli Berger, Joseph Briggs, He Guo
, Shira Zerbib:
Looms. Discret. Math. 347(12): 114181 (2024) - 2023
- [j21]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) - 2022
- [j20]Ron Aharoni, Eli Berger, Joseph Briggs
, Erel Segal-Halevi, Shira Zerbib:
Fractionally Balanced Hypergraphs and Rainbow KKM Theorems. Comb. 42(6): 913-951 (2022) - [j19]Ron Aharoni, Eli Berger, Maria Chudnovsky
, Shira Zerbib:
Rainbow Paths and Large Rainbow Matchings. Electron. J. Comb. 29(1) (2022) - [j18]Abdul Basit
, Daniel McGinnis, Henry Simmons
, Matt Sinnwell, Shira Zerbib:
Improved Bounds on a Generalization of Tuza's Conjecture. Electron. J. Comb. 29(4) (2022) - [j17]Eli Berger, Krzysztof Choromanski, Maria Chudnovsky
, Shira Zerbib:
Tournaments and the strong Erdős-Hajnal Property. Eur. J. Comb. 100: 103440 (2022) - [j16]Bernard Lidický
, Tomás Masarík
, Kyle Murphy, Shira Zerbib
:
On Weak Flexibility in Planar Graphs. Graphs Comb. 38(6): 180 (2022) - [j15]Daniel McGinnis
, Shira Zerbib:
Line Transversals in Families of Connected Sets in the Plane. SIAM J. Discret. Math. 36(4): 2916-2919 (2022) - 2020
- [j14]Patrick Bennett
, Andrzej Dudek, Shira Zerbib:
Large triangle packings and Tuza's conjecture in sparse random graphs. Comb. Probab. Comput. 29(5): 757-779 (2020) - [j13]Kathryn L. Nyman, Francis Edward Su, Shira Zerbib:
Fair division with multiple pieces. Discret. Appl. Math. 283: 115-122 (2020) - [j12]Deborah Oliveros, Christopher O'Neill, Shira Zerbib:
The geometry and combinatorics of discrete line segment hypergraphs. Discret. Math. 343(6): 111825 (2020) - [j11]Ron Aharoni
, Shira Zerbib
:
A generalization of Tuza's conjecture. J. Graph Theory 94(3): 445-462 (2020) - [i3]Bernard Lidický, Tomás Masarík
, Kyle Murphy, Shira Zerbib:
On Weak Flexibility in Planar Graphs. CoRR abs/2009.07932 (2020)
2010 – 2019
- 2019
- [j10]Florian Frick, Shira Zerbib:
Colorful Coverings of Polytopes and Piercing Numbers of Colorful d-Intervals. Comb. 39(3): 627-637 (2019) - [j9]Shira Zerbib:
The (p, q) property in families of d-intervals and d-trees. Discret. Math. 342(4): 1089-1097 (2019) - [j8]Shira Zerbib:
An Improved Bound in Vizing's Conjecture. Graphs Comb. 35(6): 1401-1404 (2019) - [j7]Francis Edward Su, Shira Zerbib
:
Piercing numbers in approval voting. Math. Soc. Sci. 101: 65-71 (2019) - [j6]Shiliang Gao, Shira Zerbib
:
The (2, 2) and (4, 3) Properties in Families of Fat Sets in the Plane. SIAM J. Discret. Math. 33(3): 1326-1337 (2019) - 2018
- [j5]Maria Chudnovsky
, Sophie Spirkl
, Shira Zerbib:
Piercing Axis-Parallel Boxes. Electron. J. Comb. 25(1): 1 (2018) - [i2]Frédéric Meunier, Shira Zerbib:
Envy-free divisions of a partially burnt cake. CoRR abs/1804.00449 (2018) - 2017
- [j4]Ron Aharoni, Tomás Kaiser
, Shira Zerbib:
Fractional covers and matchings in families of weighted d-intervals. Comb. 37(4): 555-572 (2017) - [j3]Ron Aharoni, Ron Holzman
, Shira Zerbib:
Edge-Covers in d-Interval Hypergraphs. Discret. Comput. Geom. 58(3): 650-662 (2017) - 2013
- [j2]Gabriel Nivasch
, János Pach, Rom Pinchasi, Shira Zerbib:
The number of distinct distances from a vertex of a convex polygon. J. Comput. Geom. 4(1): 1-12 (2013) - 2012
- [i1]Gabriel Nivasch, János Pach, Rom Pinchasi, Shira Zerbib:
The number of distinct distances from a vertex of a convex polygon. CoRR abs/1207.1266 (2012) - 2011
- [j1]Shira Zerbib:
On the Zone Complexity of a Vertex. SIAM J. Discret. Math. 25(2): 719-730 (2011)
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
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-08-05 20:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint