Characterization of Co-blockers for Simple Perfect Matchings in a Convex Geometric Graph. - Chaya Keller; Micha A. Perles (Discret. Comput. Geom., 2013)

Reconstruction of the Geometric Structure of a Set of Points in the Plane from Its Geometric Tree Graph. - Chaya Keller; Micha A. Perles (Discret. Comput. Geom., 2016)

On Convex Geometric Graphs with no k + 1 Pairwise Disjoint Edges. - Chaya Keller; Micha A. Perles (Graphs Comb., 2016)

On Max-Clique for intersection graphs of sets and the Hadwiger-Debrunner numbers. - Chaya Keller; Shakhar Smorodinsky; Gábor Tardos (SODA, 2017)

On the Union Complexity of Families of Axis-Parallel Rectangles with a Low Packing Number. - Chaya Keller; Shakhar Smorodinsky (Electron. J. Comb., 2018)

Reconstruction of the path graph. - Chaya Keller; Yael Stein (Comput. Geom., 2018)

On piercing numbers of families satisfying the (p, q)r property. - Chaya Keller; Shakhar Smorodinsky (Comput. Geom., 2018)

Blockers for Simple Hamiltonian Paths in Convex Geometric Graphs of Even Order. - Chaya Keller; Micha A. Perles (Discret. Comput. Geom., 2018)

A New Lower Bound on Hadwiger-Debrunner Numbers in the Plane. - Chaya Keller; Shakhar Smorodinsky (SODA, 2020)

Blockers for Triangulations of a Convex Polygon and a Geometric Maker-Breaker Game. - Chaya Keller; Yael Stein (Electron. J. Comb., 2020)

Consistent High Dimensional Rounding with Side Information. - Orr Dunkelman; Zeev Geyzel; Chaya Keller; Nathan Keller; Eyal Ronen; Adi Shamir; Ran J. Tessler (CoRR, 2020)

No Krasnoselskii number for general sets in R2. - Chaya Keller; Micha A. Perles (CoRR, 2020)

On Sets of n Points in General Position That Determine Lines That Can Be Pierced by n Points. - Chaya Keller; Rom Pinchasi (Discret. Comput. Geom., 2020)

From a (p, 2)-Theorem to a Tight (p, q)-Theorem. - Chaya Keller; Shakhar Smorodinsky (Discret. Comput. Geom., 2020)

Conflict-Free Coloring of Intersection Graphs of Geometric Objects. - Chaya Keller; Shakhar Smorodinsky (Discret. Comput. Geom., 2020)

No Krasnoselskii Number for General Sets. - Chaya Keller; Micha A. Perles (SoCG, 2021)

Error Resilient Space Partitioning (Invited Talk). - Orr Dunkelman; Zeev Geyzel; Chaya Keller; Nathan Keller; Eyal Ronen; Adi Shamir; Ran J. Tessler (ICALP, 2021)

On the number of hyperedges in the hypergraph of lines and pseudo-discs. - Chaya Keller (CoRR, 2021)

Blockers for Simple Hamiltonian Paths in Convex Geometric Graphs of Odd Order. - Chaya Keller; Micha A. Perles (Discret. Comput. Geom., 2021)

Conflict-Free Coloring of String Graphs. - Chaya Keller; Alexandre Rok; Shakhar Smorodinsky (Discret. Comput. Geom., 2021)

A Solution to Ringel's Circle Problem. - James Davies; Chaya Keller; Linda Kleist; Shakhar Smorodinsky; Bartosz Walczak (SoCG, 2022)

An (ℵ₀, k+2)-Theorem for k-Transversals. - Chaya Keller; Micha A. Perles (SoCG, 2022)

On the Number of Hyperedges in the Hypergraph of Lines and Pseudo-Discs. - Chaya Keller; Balázs Keszegh; Dömötör Pálvölgyi (Electron. J. Comb., 2022)

The ε-t-Net Problem. - Noga Alon; Bruno Jartoux; Chaya Keller; Shakhar Smorodinsky; Yelena Yuditsky (Discret. Comput. Geom., 2022)

On Multicolor Ramsey Numbers and Subset Coloring of Hypergraphs. - Bruno Jartoux; Chaya Keller; Shakhar Smorodinsky; Yelena Yuditsky (SIAM J. Discret. Math., 2022)

An (א0, k+2)-Theorem for k-Transversals. - Chaya Keller; Micha A. Perles (CoRR, 2023)

Zarankiewicz's Problem via ε-t-Nets. - Chaya Keller; Shakhar Smorodinsky (SoCG, 2024)

Conflict-Free Colouring of Subsets. - Bruno Jartoux; Chaya Keller; Shakhar Smorodinsky; Yelena Yuditsky (Discret. Comput. Geom., 2024)

On Zarankiewicz's Problem for Intersection Hypergraphs of Geometric Objects. - Timothy M. Chan; Chaya Keller; Shakhar Smorodinsky (SoCG, 2025)

A simple proof of a (p,2)-theorem for non-piercing regions. - Chaya Keller; Shakhar Smorodinsky (CoRR, 2025)