Published in: LIPIcs, Volume 293, 40th International Symposium on Computational Geometry (SoCG 2024)
Chaya Keller and Shakhar Smorodinsky. Zarankiewicz’s Problem via ε-t-Nets. In 40th International Symposium on Computational Geometry (SoCG 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 293, pp. 66:1-66:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{keller_et_al:LIPIcs.SoCG.2024.66, author = {Keller, Chaya and Smorodinsky, Shakhar}, title = {{Zarankiewicz’s Problem via \epsilon-t-Nets}}, booktitle = {40th International Symposium on Computational Geometry (SoCG 2024)}, pages = {66:1--66:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-316-4}, ISSN = {1868-8969}, year = {2024}, volume = {293}, editor = {Mulzer, Wolfgang and Phillips, Jeff M.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.66}, URN = {urn:nbn:de:0030-drops-200111}, doi = {10.4230/LIPIcs.SoCG.2024.66}, annote = {Keywords: Zarankiewicz’s Problem, \epsilon-t-nets, pseudo-discs, VC-dimension} }
Published in: LIPIcs, Volume 224, 38th International Symposium on Computational Geometry (SoCG 2022)
James Davies, Chaya Keller, Linda Kleist, Shakhar Smorodinsky, and Bartosz Walczak. A Solution to Ringel’s Circle Problem. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 33:1-33:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{davies_et_al:LIPIcs.SoCG.2022.33, author = {Davies, James and Keller, Chaya and Kleist, Linda and Smorodinsky, Shakhar and Walczak, Bartosz}, title = {{A Solution to Ringel’s Circle Problem}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {33:1--33:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.33}, URN = {urn:nbn:de:0030-drops-160413}, doi = {10.4230/LIPIcs.SoCG.2022.33}, annote = {Keywords: circle arrangement, chromatic number, Gallai’s theorem, polynomial method} }
Published in: LIPIcs, Volume 224, 38th International Symposium on Computational Geometry (SoCG 2022)
Chaya Keller and Micha A. Perles. An (ℵ₀,k+2)-Theorem for k-Transversals. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 50:1-50:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{keller_et_al:LIPIcs.SoCG.2022.50, author = {Keller, Chaya and Perles, Micha A.}, title = {{An (\aleph₀,k+2)-Theorem for k-Transversals}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {50:1--50:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.50}, URN = {urn:nbn:de:0030-drops-160581}, doi = {10.4230/LIPIcs.SoCG.2022.50}, annote = {Keywords: convexity, (p,q)-theorem, k-transversal, infinite (p,q)-theorem} }
Published in: LIPIcs, Volume 198, 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)
Orr Dunkelman, Zeev Geyzel, Chaya Keller, Nathan Keller, Eyal Ronen, Adi Shamir, and Ran J. Tessler. Error Resilient Space Partitioning (Invited Talk). In 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 198, pp. 4:1-4:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{dunkelman_et_al:LIPIcs.ICALP.2021.4, author = {Dunkelman, Orr and Geyzel, Zeev and Keller, Chaya and Keller, Nathan and Ronen, Eyal and Shamir, Adi and Tessler, Ran J.}, title = {{Error Resilient Space Partitioning}}, booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)}, pages = {4:1--4:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-195-5}, ISSN = {1868-8969}, year = {2021}, volume = {198}, editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.4}, URN = {urn:nbn:de:0030-drops-140731}, doi = {10.4230/LIPIcs.ICALP.2021.4}, annote = {Keywords: space partition, high-dimensional rounding, error resilience, sphere packing, Sperner’s lemma, Brunn-Minkowski theorem, \v{C}ech cohomology} }
Published in: LIPIcs, Volume 189, 37th International Symposium on Computational Geometry (SoCG 2021)
Chaya Keller and Micha A. Perles. No Krasnoselskii Number for General Sets. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 47:1-47:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{keller_et_al:LIPIcs.SoCG.2021.47, author = {Keller, Chaya and Perles, Micha A.}, title = {{No Krasnoselskii Number for General Sets}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {47:1--47:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.47}, URN = {urn:nbn:de:0030-drops-138462}, doi = {10.4230/LIPIcs.SoCG.2021.47}, annote = {Keywords: visibility, Helly-type theorems, Krasnoselskii’s theorem, transfinite induction, well-ordering theorem} }
Published in: LIPIcs, Volume 164, 36th International Symposium on Computational Geometry (SoCG 2020)
Noga Alon, Bruno Jartoux, Chaya Keller, Shakhar Smorodinsky, and Yelena Yuditsky. The ε-t-Net Problem. In 36th International Symposium on Computational Geometry (SoCG 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 164, pp. 5:1-5:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{alon_et_al:LIPIcs.SoCG.2020.5, author = {Alon, Noga and Jartoux, Bruno and Keller, Chaya and Smorodinsky, Shakhar and Yuditsky, Yelena}, title = {{The \epsilon-t-Net Problem}}, booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)}, pages = {5:1--5:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-143-6}, ISSN = {1868-8969}, year = {2020}, volume = {164}, editor = {Cabello, Sergio and Chen, Danny Z.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.5}, URN = {urn:nbn:de:0030-drops-121639}, doi = {10.4230/LIPIcs.SoCG.2020.5}, annote = {Keywords: epsilon-nets, geometric hypergraphs, VC-dimension, linear union complexity} }
Published in: LIPIcs, Volume 99, 34th International Symposium on Computational Geometry (SoCG 2018)
Chaya Keller and Shakhar Smorodinsky. From a (p,2)-Theorem to a Tight (p,q)-Theorem. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 51:1-51:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{keller_et_al:LIPIcs.SoCG.2018.51, author = {Keller, Chaya and Smorodinsky, Shakhar}, title = {{From a (p,2)-Theorem to a Tight (p,q)-Theorem}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {51:1--51:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.51}, URN = {urn:nbn:de:0030-drops-87640}, doi = {10.4230/LIPIcs.SoCG.2018.51}, annote = {Keywords: (p,q)-Theorem, convexity, transversals, (p,2)-theorem, axis-parallel rectangles} }