Chaya Keller



I am a Lecturer at the Computer Science Department of the Ariel University.


Before coming to Ariel University, I completed my Ph.D. at the Einstein Institute of Mathematics  in the Hebrew University of Jerusalem, under the supervision of Prof. Micha A. Perles, and was a Postdoctoral Fellow at the Mathematics Department of the Ben Gurion University, hosted by Prof. Shakhar Smorodinsky, and a Research Fellow at the Mathematics Department of the Technion, hosted by Prof. Rom Pinchasi.


My field of research is Combinatorial Geometry. Currently I am most interested in Helly-type theorems, coloring problems in hypergraphs, and geometric graph theory.


My CV can be found here. 


Email address: chaya.keller27 At gmail.com



Publications:


Journal Papers:

  1. C. Keller and M. A. Perles, Blockers for simple Hamiltonian paths in convex geometric graphs of odd order, Discrete and Computational Geometry, to appear.
  2. C. Keller and S. Smorodinsky, Conflict-free coloring of intersection graphs of geometric objects, Discrete and Computational Geometry, to appear. Extended abstract appeared at proceedings of SODA 2018.
  3. C. Keller and S. Smorodinsky, From a (p,2)-theorem to a tight (p,q)-theorem, Discrete and Computational Geometry, to appear. Extended abstract appeared at proceedings of SoCG 2018.
  4. C. Keller and S. Smorodinsky, On the union complexity of families of axis-parallel rectangles with a low packing number, Electronic Journal of Combinatorics 25(4) (2018), P4.32.
  5. C. Keller, S. Smorodinsky, and G. Tardos, Improved bounds on the Hadwiger-Debrunner numbers, Israel Journal of Mathematics 225(2) (2018), pp. 925-945. Extended abstract appeared at proceedings of SODA 2017.
  6. C. Keller and M. A. Perles, Blockers for simple Hamiltonian paths in convex geometric graphs of even order, Discrete and Computational Geometry 60(1) (2018), pp. 1-8.
  7. C. Keller and S. Smorodinsky, On piercing numbers of families satisfying the (p,q)_r property, Computational Geometry: Theory and Applications 72 (2018), pp. 11-18.
  8. C. Keller and Y. Stein, Reconstruction of the path graph, Computational Geometry: Theory and Applications 72 (2018), pp. 1-10.
  9. C. Keller and M. A. Perles, On convex geometric graphs with no k+1 pairwise disjoint edges, Graphs and Combinatorics 32(6) (2016), pp. 2497-2514.
  10. C. Keller and M. A. Perles, Reconstruction of the geometric structure of a set of points in the plane from its geometric tree graph, Discrete and Computational Geometry 55(3) (2016), pp. 610-637.
  11. C. Keller, M. A. Perles, E .Rivera-Campo and V. Urrutia-Galicia, Blockers for non-crossing spanning trees in complete geometric graphs, in: J. Pach (ed.), Thirty Essays on Geometric Graph Theory, Springer-Verlag, 2013, pp. 383-398.
  12. C. Keller and M. A. Perles, Characterization of co-blockers for simple perfect matchings in a convex geometric graph, Discrete and Computational Geometry 50(2) (2013), pp. 491-502.
  13. C. Keller and M. A. Perles, On the smallest sets blocking simple perfect matchings in a convex geometric graph, Israel Journal of Mathematics 187 (2012), pp. 465-484.


Conference Papers:

  1. C. Keller and S. Smorodinsky, New lower bounds on Hadwiger-Debrunner numbers in the plane, accepted to SODA 2020.
  2. C. Keller and S. Smorodinsky, From a (p,2)-theorem to a tight (p,q)-theorem, proceedings of SoCG 2018, pp. 51:1-51:14. Invited to the SoCG 2018 Special Issue of Discrete and Computational Geometry.
  3. C. Keller and S. Smorodinsky, Conflict-free coloring of intersection graphs of geometric objects, proceedings of SODA 2018, pp. 2397-2411.
  4. C. Keller, S. Smorodinsky, and G. Tardos, On Max-Clique for intersection graphs of sets and the Hadwiger-Debrunner numbers, proceedings of SODA 2017, pp. 2254-2263.


Preprints:

  1. C. Keller and R. Pinchasi, On sets of n points in general position that determine lines that can be pierced by n points, 2019.
  2. C. Keller, A. Rok, and S. Smorodinsky, k-Conflict-free coloring of string graphs, 2017.
  3. C. Keller and Y. Stein, Blockers for triangulations of a convex polygon and a geometric Maker-Breaker game, 2017.



Last updated: 13.11.2019