20122024

Research activity per year

Filter
Conference contribution

Search results

  • 2024

    Zarankiewicz’s Problem via ϵ-t-Nets

    Keller, C. & Smorodinsky, S., Jun 2024, 40th International Symposium on Computational Geometry, SoCG 2024. Mulzer, W. & Phillips, J. M. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 66. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 293).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    1 Scopus citations
  • 2022

    An (?0, k + 2)-Theorem for k-Transversals

    Keller, C. & Perles, M. A., 1 Jun 2022, 38th International Symposium on Computational Geometry, SoCG 2022. Goaoc, X. & Kerber, M. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 50. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 224).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    1 Scopus citations
  • A Solution to Ringel's Circle Problem

    Davies, J., Keller, C., Kleist, L., Smorodinsky, S. & Walczak, B., 1 Jun 2022, 38th International Symposium on Computational Geometry, SoCG 2022. Goaoc, X. & Kerber, M. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 33. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 224).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2021

    Error resilient space partitioning

    Dunkelman, O., Geyzel, Z., Keller, C., Keller, N., Ronen, E., Shamir, A. & Tessler, R. J., 1 Jul 2021, 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021. Bansal, N., Merelli, E. & Worrell, J. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 4. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 198).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • No Krasnoselskii number for general sets

    Keller, C. & Perles, M. A., 1 Jun 2021, 37th International Symposium on Computational Geometry, SoCG 2021. Buchin, K. & de Verdiere, E. C. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 47. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 189).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    1 Scopus citations
  • 2020

    A new lower bound on Hadwiger-Debrunner numbers in the plane

    Keller, C. & Smorodinsky, S., 2020, 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020. Chawla, S. (ed.). p. 1155-1169 15 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2020-January).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    1 Scopus citations
  • The ε-T-net problem

    Alon, N., Jartoux, B., Keller, C., Smorodinsky, S. & Yuditsky, Y., 1 Jun 2020, 36th International Symposium on Computational Geometry, SoCG 2020. Cabello, S. & Chen, D. Z. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, LIPIcs-SoCG-2020-5. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 164).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2018

    Conict-free coloring of intersection graphs of geometric objects

    Keller, C. & Smorodinsky, S., 2018, 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018. Czumaj, A. (ed.). p. 2397-2411 15 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
    7 Scopus citations
  • From a (p, 2)-Theorem to a Tight (p, q)-Theorem

    Keller, C. & Smorodinsky, S., 1 Jun 2018, 34th International Symposium on Computational Geometry, SoCG 2018. Toth, C. D. & Speckmann, B. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 511-5114 4604 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 99).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2017

    On max-clique for intersection graphs of sets and the hadwiger-debrunner numbers

    Keller, C., Smorodinsky, S. & Tardos, G., 2017, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017. Klein, P. N. (ed.). p. 2254-2263 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 0).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
    17 Scopus citations