| Conflict-free coloring of intersection graphs of geometric objects C Keller, S Smorodinsky Discrete & Computational Geometry 64 (3), 916-941, 2020 | 26 | 2020 |
| Improved bounds on the Hadwiger–Debrunner numbers C Keller, S Smorodinsky, G Tardos Israel Journal of Mathematics 225, 925-945, 2018 | 19 | 2018 |
| On Max-Clique for intersection graphs of sets and the Hadwiger-Debrunner numbers C Keller, S Smorodinsky, G Tardos Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 18 | 2017 |
| On the smallest sets blocking simple perfect matchings in a convex geometric graph C Keller, MA Perles Israel Journal of Mathematics 187, 465-484, 2012 | 15 | 2012 |
| Blockers for noncrossing spanning trees in complete geometric graphs C Keller, MA Perles, E Rivera-Campo, V Urrutia-Galicia Thirty Essays on Geometric Graph Theory, 383-397, 2013 | 10 | 2013 |
| On Convex Geometric Graphs with no Pairwise Disjoint Edges C Keller, MA Perles Graphs and Combinatorics 32, 2497-2514, 2016 | 7 | 2016 |
| Blockers for simple Hamiltonian paths in convex geometric graphs of even order C Keller, MA Perles Discrete & Computational Geometry 60 (1), 1-8, 2018 | 6 | 2018 |
| An (ℵ₀, k+ 2)-Theorem for k-Transversals C Keller, MA Perles 38th International Symposium on Computational Geometry (SoCG 2022), 2022 | 5 | 2022 |
| A new lower bound on Hadwiger-Debrunner numbers in the plane C Keller, S Smorodinsky Israel Journal of Mathematics 244 (2), 649-680, 2021 | 5 | 2021 |
| Conflict-free coloring of string graphs C Keller, A Rok, S Smorodinsky Discrete & Computational Geometry 65, 1337-1372, 2021 | 5 | 2021 |
| Reconstruction of the geometric structure of a set of points in the plane from its geometric tree graph C Keller, MA Perles Discrete & Computational Geometry 55, 610-637, 2016 | 5 | 2016 |
| From a (p, 2)-Theorem to a Tight (p, q)-Theorem C Keller, S Smorodinsky Discrete & Computational Geometry 63 (4), 821-847, 2020 | 4 | 2020 |
| Characterization of co-blockers for simple perfect matchings in a convex geometric graph C Keller, MA Perles Discrete & Computational Geometry 50, 491-502, 2013 | 4 | 2013 |
| A solution to Ringel's circle problem J Davies, C Keller, L Kleist, S Smorodinsky, B Walczak arXiv preprint arXiv:2112.05042, 2021 | 3 | 2021 |
| On sets of n points in general position that determine lines that can be pierced by n points C Keller, R Pinchasi Discrete & Computational Geometry 64 (3), 905-915, 2020 | 3 | 2020 |
| On the number of hyperedges in the hypergraph of lines and pseudo-discs C Keller, B Keszegh, D Pálvölgyi arXiv preprint arXiv:2102.11937, 2021 | 1 | 2021 |
| Error resilient space partitioning (invited talk) O Dunkelman, Z Geyzel, C Keller, N Keller, E Ronen, A Shamir, ... 48th International Colloquium on Automata, Languages, and Programming (ICALP …, 2021 | 1 | 2021 |
| On piercing numbers of families satisfying the (p, q) r property C Keller, S Smorodinsky Computational Geometry 72, 11-18, 2018 | 1 | 2018 |
| On the union complexity of families of axis-parallel rectangles with a low packing number C Keller, S Smorodinsky arXiv preprint arXiv:1702.00849, 2017 | 1 | 2017 |
| Reverse Engineering of the Path Graph C Keller, Y Stein | 1* | |
Shakhar SmorodinskyBen-Gurion University of the NegevVerified email at bgu.ac.il
