default search action
Chaya Keller
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j17]Bruno Jartoux
, Chaya Keller
Conflict-Free Colouring of Subsets. Discret. Comput. Geom. 72(2): 876-891 (2024) - [c10]Chaya Keller, Shakhar Smorodinsky:
Zarankiewicz's Problem via ε-t-Nets. SoCG 2024: 66:1-66:15 - 2023
- [i12]Chaya Keller, Micha A. Perles:
An (א0, k+2)-Theorem for k-Transversals. CoRR abs/2306.02181 (2023) - [i11]Chaya Keller, Shakhar Smorodinsky
Zarankiewicz's problem via ε-t-nets. CoRR abs/2311.13662 (2023) - 2022
- [j16]Chaya Keller
On the Number of Hyperedges in the Hypergraph of Lines and Pseudo-Discs. Electron. J. Comb. 29(3) (2022) - [j15]Noga Alon, Bruno Jartoux
The ε-t-Net Problem. Discret. Comput. Geom. 68(2): 618-644 (2022) - [j14]Bruno Jartoux
On Multicolor Ramsey Numbers and Subset Coloring of Hypergraphs. SIAM J. Discret. Math. 36(3): 1848-1860 (2022) - [c9]James Davies, Chaya Keller
A Solution to Ringel's Circle Problem. SoCG 2022: 33:1-33:14 - [c8]Chaya Keller
An (ℵ₀, k+2)-Theorem for k-Transversals. SoCG 2022: 50:1-50:14 - [i10]Bruno Jartoux, Chaya Keller, Shakhar Smorodinsky
Conflict-Free Colouring of Subsets. CoRR abs/2207.01041 (2022) - 2021
- [j13]Chaya Keller
Blockers for Simple Hamiltonian Paths in Convex Geometric Graphs of Odd Order. Discret. Comput. Geom. 65(2): 425-449 (2021) - [j12]Chaya Keller
Conflict-Free Coloring of String Graphs. Discret. Comput. Geom. 65(4): 1337-1372 (2021) - [c7]Chaya Keller
No Krasnoselskii Number for General Sets. SoCG 2021: 47:1-47:11 - [c6]Orr Dunkelman, Zeev Geyzel, Chaya Keller
Error Resilient Space Partitioning (Invited Talk). ICALP 2021: 4:1-4:22 - [i9]Chaya Keller:
On the number of hyperedges in the hypergraph of lines and pseudo-discs. CoRR abs/2102.11937 (2021) - [i8]James Davies, Chaya Keller, Linda Kleist, Shakhar Smorodinsky, Bartosz Walczak:
A solution to Ringel's circle problem. CoRR abs/2112.05042 (2021) - 2020
- [j11]Chaya Keller
Blockers for Triangulations of a Convex Polygon and a Geometric Maker-Breaker Game. Electron. J. Comb. 27(4): 4 (2020) - [j10]Chaya Keller
From a (p, 2)-Theorem to a Tight (p, q)-Theorem. Discret. Comput. Geom. 63(4): 821-847 (2020) - [j9]Chaya Keller
On Sets of n Points in General Position That Determine Lines That Can Be Pierced by n Points. Discret. Comput. Geom. 64(3): 905-915 (2020) - [j8]Chaya Keller
Conflict-Free Coloring of Intersection Graphs of Geometric Objects. Discret. Comput. Geom. 64(3): 916-941 (2020) - [c5]Noga Alon, Bruno Jartoux
The ε-t-Net Problem. SoCG 2020: 5:1-5:15 - [c4]Chaya Keller
A New Lower Bound on Hadwiger-Debrunner Numbers in the Plane. SODA 2020: 1155-1169 - [i7]Noga Alon, Bruno Jartoux, Chaya Keller, Shakhar Smorodinsky, Yelena Yuditsky:
The ε-t-Net Problem. CoRR abs/2003.07061 (2020) - [i6]Orr Dunkelman, Zeev Geyzel, Chaya Keller, Nathan Keller, Eyal Ronen, Adi Shamir, Ran J. Tessler:
Consistent High Dimensional Rounding with Side Information. CoRR abs/2008.03675 (2020) - [i5]Chaya Keller, Micha A. Perles:
No Krasnoselskii number for general sets in R2. CoRR abs/2012.06014 (2020)
2010 – 2019
- 2019
- [i4]Chaya Keller, Rom Pinchasi:
On sets of n points in general position that determine lines that can be pierced by n points. CoRR abs/1908.06390 (2019) - 2018
- [j7]Chaya Keller
On the Union Complexity of Families of Axis-Parallel Rectangles with a Low Packing Number. Electron. J. Comb. 25(4): 4 (2018) - [j6]Chaya Keller
Reconstruction of the path graph. Comput. Geom. 72: 1-10 (2018) - [j5]Chaya Keller
On piercing numbers of families satisfying the (p, q)r property. Comput. Geom. 72: 11-18 (2018) - [j4]Chaya Keller
Blockers for Simple Hamiltonian Paths in Convex Geometric Graphs of Even Order. Discret. Comput. Geom. 60(1): 1-8 (2018) - [c3]Chaya Keller
From a (p, 2)-Theorem to a Tight (p, q)-Theorem. SoCG 2018: 51:1-51:14 - [c2]Chaya Keller
Conflict-Free Coloring of Intersection Graphs of Geometric Objects. SODA 2018: 2397-2411 - [i3]Chaya Keller, Yael Stein:
Reconstruction of the Path Graph. CoRR abs/1801.00328 (2018) - [i2]Chaya Keller, Shakhar Smorodinsky:
A new lower bound on Hadwiger-Debrunner numbers in the plane. CoRR abs/1809.06451 (2018) - 2017
- [c1]Chaya Keller
On Max-Clique for intersection graphs of sets and the Hadwiger-Debrunner numbers. SODA 2017: 2254-2263 - [i1]Chaya Keller, Shakhar Smorodinsky:
On the union complexity of families of axis-parallel rectangles with a low packing number. CoRR abs/1702.00849 (2017) - 2016
- [j3]Chaya Keller
Reconstruction of the Geometric Structure of a Set of Points in the Plane from Its Geometric Tree Graph. Discret. Comput. Geom. 55(3): 610-637 (2016) - [j2]Chaya Keller
On Convex Geometric Graphs with no k + 1 Pairwise Disjoint Edges. Graphs Comb. 32(6): 2497-2514 (2016) - 2013
- [j1]Chaya Keller
Characterization of Co-blockers for Simple Perfect Matchings in a Convex Geometric Graph. Discret. Comput. Geom. 50(2): 491-502 (2013)
Coauthor Index
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-10-23 20:35 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: