Chaya Keller

Orcid: 0000-0001-6400-3946

According to our database1, Chaya Keller authored at least 28 papers between 2013 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Conflict-Free Colouring of Subsets.
Discret. Comput. Geom., September, 2024

Zarankiewicz's Problem via ε-t-Nets.
Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023
An (א<sub>0</sub>, k+2)-Theorem for k-Transversals.
CoRR, 2023

2022
On Multicolor Ramsey Numbers and Subset Coloring of Hypergraphs.
SIAM J. Discret. Math., September, 2022

The ε-t-Net Problem.
Discret. Comput. Geom., 2022

On the Number of Hyperedges in the Hypergraph of Lines and Pseudo-Discs.
Electron. J. Comb., 2022

An (ℵ₀, k+2)-Theorem for k-Transversals.
Proceedings of the 38th International Symposium on Computational Geometry, 2022

A Solution to Ringel's Circle Problem.
Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021
Conflict-Free Coloring of String Graphs.
Discret. Comput. Geom., 2021

Blockers for Simple Hamiltonian Paths in Convex Geometric Graphs of Odd Order.
Discret. Comput. Geom., 2021

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

Error Resilient Space Partitioning (Invited Talk).
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

No Krasnoselskii Number for General Sets.
Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020
Conflict-Free Coloring of Intersection Graphs of Geometric Objects.
Discret. Comput. Geom., 2020

From a (p, 2)-Theorem to a Tight (p, q)-Theorem.
Discret. Comput. Geom., 2020

On Sets of n Points in General Position That Determine Lines That Can Be Pierced by n Points.
Discret. Comput. Geom., 2020

No Krasnoselskii number for general sets in R<sup>2</sup>.
CoRR, 2020

Consistent High Dimensional Rounding with Side Information.
CoRR, 2020

Blockers for Triangulations of a Convex Polygon and a Geometric Maker-Breaker Game.
Electron. J. Comb., 2020

A New Lower Bound on Hadwiger-Debrunner Numbers in the Plane.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2018
Blockers for Simple Hamiltonian Paths in Convex Geometric Graphs of Even Order.
Discret. Comput. Geom., 2018

On piercing numbers of families satisfying the (<i>p</i>, <i>q</i>)<sub><i>r</i></sub> property.
Comput. Geom., 2018

Reconstruction of the path graph.
Comput. Geom., 2018

On the Union Complexity of Families of Axis-Parallel Rectangles with a Low Packing Number.
Electron. J. Comb., 2018

2017
On Max-Clique for intersection graphs of sets and the Hadwiger-Debrunner numbers.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016
On Convex Geometric Graphs with no k + 1 Pairwise Disjoint Edges.
Graphs Comb., 2016

Reconstruction of the Geometric Structure of a Set of Points in the Plane from Its Geometric Tree Graph.
Discret. Comput. Geom., 2016

2013
Characterization of Co-blockers for Simple Perfect Matchings in a Convex Geometric Graph.
Discret. Comput. Geom., 2013


  Loading...