Chaya Keller - RankMe

46 papers A* 11Journal 35

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Error Resilient Space Partitioning. Discret. Comput. Geom. Orr Dunkelman, Zeev Geyzel, Chaya Keller, Nathan Keller, Eyal Ronen, Adi Shamir, Ran J. Tessler
2026	J	`jnl`	On the Largest Convexity Number of Co-Finite Sets in the Plane. CoRR Chaya Keller, Micha A. Perles
2025	J	`jnl`	A simple proof of a (p,2)-theorem for non-piercing regions. CoRR Chaya Keller, Shakhar Smorodinsky
2025	J	`jnl`	Complements of finite unions of convex sets. CoRR Chaya Keller, Micha A. Perles
2025	A*	`conf`	On Zarankiewicz's Problem for Intersection Hypergraphs of Geometric Objects. SoCG Timothy M. Chan, Chaya Keller, Shakhar Smorodinsky
2025	J	`jnl`	On saturated triangulation-free convex geometric graphs. CoRR David Garber, Chaya Keller, Olga Nissenbaum, Shimon Aviram
2024	J	`jnl`	Conflict-Free Colouring of Subsets. Discret. Comput. Geom. Bruno Jartoux, Chaya Keller, Shakhar Smorodinsky, Yelena Yuditsky
2024	J	`jnl`	On Zarankiewicz's Problem for Intersection Hypergraphs of Geometric Objects. CoRR Timothy M. Chan, Chaya Keller, Shakhar Smorodinsky
2024	A*	`conf`	Zarankiewicz's Problem via ε-t-Nets. SoCG Chaya Keller, Shakhar Smorodinsky
2023	J	`jnl`	An (א CoRR Chaya Keller, Micha A. Perles
2023	J	`jnl`	Zarankiewicz's problem via ε-t-nets. CoRR Chaya Keller, Shakhar Smorodinsky
2022	A*	`conf`	A Solution to Ringel's Circle Problem. SoCG James Davies, Chaya Keller, Linda Kleist, Shakhar Smorodinsky, Bartosz Walczak
2022	A*	`conf`	An (ℵ₀, k+2)-Theorem for k-Transversals. SoCG Chaya Keller, Micha A. Perles
2022	J	`jnl`	Conflict-Free Colouring of Subsets. CoRR Bruno Jartoux, Chaya Keller, Shakhar Smorodinsky, Yelena Yuditsky
2022	J	`jnl`	On Multicolor Ramsey Numbers and Subset Coloring of Hypergraphs. SIAM J. Discret. Math. Bruno Jartoux, Chaya Keller, Shakhar Smorodinsky, Yelena Yuditsky
2022	J	`jnl`	On the Number of Hyperedges in the Hypergraph of Lines and Pseudo-Discs. Electron. J. Comb. Chaya Keller, Balázs Keszegh, Dömötör Pálvölgyi
2022	J	`jnl`	The ε-t-Net Problem. Discret. Comput. Geom. Noga Alon, Bruno Jartoux, Chaya Keller, Shakhar Smorodinsky, Yelena Yuditsky
2021	J	`jnl`	A solution to Ringel's circle problem. CoRR James Davies, Chaya Keller, Linda Kleist, Shakhar Smorodinsky, Bartosz Walczak
2021	J	`jnl`	Blockers for Simple Hamiltonian Paths in Convex Geometric Graphs of Odd Order. Discret. Comput. Geom. Chaya Keller, Micha A. Perles
2021	J	`jnl`	Conflict-Free Coloring of String Graphs. Discret. Comput. Geom. Chaya Keller, Alexandre Rok, Shakhar Smorodinsky
2021	A*	`conf`	Error Resilient Space Partitioning (Invited Talk). ICALP Orr Dunkelman, Zeev Geyzel, Chaya Keller, Nathan Keller, Eyal Ronen, Adi Shamir, Ran J. Tessler
2021	A*	`conf`	No Krasnoselskii Number for General Sets. SoCG Chaya Keller, Micha A. Perles
2021	J	`jnl`	On the number of hyperedges in the hypergraph of lines and pseudo-discs. CoRR Chaya Keller
2020	A*	`conf`	A New Lower Bound on Hadwiger-Debrunner Numbers in the Plane. SODA Chaya Keller, Shakhar Smorodinsky
2020	J	`jnl`	Blockers for Triangulations of a Convex Polygon and a Geometric Maker-Breaker Game. Electron. J. Comb. Chaya Keller, Yael Stein
2020	J	`jnl`	Conflict-Free Coloring of Intersection Graphs of Geometric Objects. Discret. Comput. Geom. Chaya Keller, Shakhar Smorodinsky
2020	J	`jnl`	Consistent High Dimensional Rounding with Side Information. CoRR Orr Dunkelman, Zeev Geyzel, Chaya Keller, Nathan Keller, Eyal Ronen, Adi Shamir, Ran J. Tessler
2020	J	`jnl`	From a (p, 2)-Theorem to a Tight (p, q)-Theorem. Discret. Comput. Geom. Chaya Keller, Shakhar Smorodinsky
2020	J	`jnl`	No Krasnoselskii number for general sets in R CoRR Chaya Keller, Micha A. Perles
2020	J	`jnl`	On Sets of n Points in General Position That Determine Lines That Can Be Pierced by n Points. Discret. Comput. Geom. Chaya Keller, Rom Pinchasi
2020	A*	`conf`	The ε-t-Net Problem. SoCG Noga Alon, Bruno Jartoux, Chaya Keller, Shakhar Smorodinsky, Yelena Yuditsky
2020	J	`jnl`	The ε-t-Net Problem. CoRR Noga Alon, Bruno Jartoux, Chaya Keller, Shakhar Smorodinsky, Yelena Yuditsky
2019	J	`jnl`	On sets of n points in general position that determine lines that can be pierced by n points. CoRR Chaya Keller, Rom Pinchasi
2018	J	`jnl`	A new lower bound on Hadwiger-Debrunner numbers in the plane. CoRR Chaya Keller, Shakhar Smorodinsky
2018	J	`jnl`	Blockers for Simple Hamiltonian Paths in Convex Geometric Graphs of Even Order. Discret. Comput. Geom. Chaya Keller, Micha A. Perles
2018	A*	`conf`	Conflict-Free Coloring of Intersection Graphs of Geometric Objects. SODA Chaya Keller, Shakhar Smorodinsky
2018	A*	`conf`	From a (p, 2)-Theorem to a Tight (p, q)-Theorem. SoCG Chaya Keller, Shakhar Smorodinsky
2018	J	`jnl`	On piercing numbers of families satisfying the ( Comput. Geom. Chaya Keller, Shakhar Smorodinsky
2018	J	`jnl`	On the Union Complexity of Families of Axis-Parallel Rectangles with a Low Packing Number. Electron. J. Comb. Chaya Keller, Shakhar Smorodinsky
2018	J	`jnl`	Reconstruction of the Path Graph. CoRR Chaya Keller, Yael Stein
2018	J	`jnl`	Reconstruction of the path graph. Comput. Geom. Chaya Keller, Yael Stein
2017	A*	`conf`	On Max-Clique for intersection graphs of sets and the Hadwiger-Debrunner numbers. SODA Chaya Keller, Shakhar Smorodinsky, Gábor Tardos
2017	J	`jnl`	On the union complexity of families of axis-parallel rectangles with a low packing number. CoRR Chaya Keller, Shakhar Smorodinsky
2016	J	`jnl`	On Convex Geometric Graphs with no k + 1 Pairwise Disjoint Edges. Graphs Comb. Chaya Keller, Micha A. Perles
2016	J	`jnl`	Reconstruction of the Geometric Structure of a Set of Points in the Plane from Its Geometric Tree Graph. Discret. Comput. Geom. Chaya Keller, Micha A. Perles
2013	J	`jnl`	Characterization of Co-blockers for Simple Perfect Matchings in a Convex Geometric Graph. Discret. Comput. Geom. Chaya Keller, Micha A. Perles