If you made any changes in Pure these will be visible here soon.
Filter
Conference contribution

Search results

  • 2022

    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

  • 2020

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

    Keller, C. & Smorodinsky, S., 1 Jan 2020, 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020. Chawla, S. (ed.). Association for Computing Machinery, 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

    Approximating maximum diameter-bounded subgraph in unit disk graphs

    Abu-Affash, A. K., Carmi, P., Maheshwari, A., Morin, P., Smid, M. & 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. 21-212 192 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 99).

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

  • Conict-free coloring of intersection graphs of geometric objects

    Keller, C. & Smorodinsky, S., 1 Jan 2018, 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018. Czumaj, A. (ed.). Association for Computing Machinery, 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
    6 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

    Balanced line separators of unit disk graphs

    Carmi, P., Chiu, M. K., Katz, M. J., Korman, M., Okamoto, Y., Van Renssen, A., Roeloffzen, M., Shiitada, T. & Smorodinsky, S., 1 Jan 2017, Algorithms and Data Structures - 15th International Symposium, WADS 2017, Proceedings. Ellen, F., Kolokolova, A. & Sack, J-R. (eds.). Springer Verlag, p. 241-252 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10389 LNCS).

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

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

    Keller, C., Smorodinsky, S. & Tardos, G., 1 Jan 2017, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017. Klein, P. N. (ed.). Association for Computing Machinery, 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

    16 Scopus citations
  • 2016

    On interference among moving sensors and related problems

    De Carufel, J. L., Katz, M. J., Korman, M., Van Renssen, A., Roeloffzen, M. & Smorodinsky, S., 1 Aug 2016, 24th Annual European Symposium on Algorithms, ESA 2016. Zaroliagis, C. & Sankowski, P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 34. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 57).

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

    1 Scopus citations
  • Weak 1/r-nets for moving points

    Rok, A. & Smorodinsky, S., 1 Jun 2016, 32nd International Symposium on Computational Geometry, SoCG 2016. Fekete, S. & Lubiw, A. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 59.1-59.13 (Leibniz International Proceedings in Informatics, LIPIcs; vol. 51).

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

    2 Scopus citations
  • 2012

    Strong conflict-free coloring for intervals

    Cheilaris, P., Gargano, L., Rescigno, A. A. & Smorodinsky, S., 1 Jan 2012, Algorithms and Computation - 23rd International Symposium, ISAAC 2012, Proceedings. Springer Verlag, p. 4-13 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7676 LNCS).

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

    1 Scopus citations
  • 2011

    Hitting sets online and vertex ranking

    Even, G. & Smorodinsky, S., 20 Sep 2011, Algorithms, ESA 2011 - 19th Annual European Symposium, Proceedings. p. 347-357 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6942 LNCS).

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

    1 Scopus citations
  • The potential to improve the choice: List conflict-free coloring for geometric hypergraphs

    Cheilaris, P., Smorodinsky, S. & Sulovský, M., 15 Jul 2011, Proceedings of the 27th Annual Symposium on Computational Geometry, SCG'11. p. 424-432 9 p. (Proceedings of the Annual Symposium on Computational Geometry).

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

    6 Scopus citations
  • 2010

    Colorful strips

    Aloupis, G., Cardinal, J., Collette, S., Imahori, S., Korman, M., Langerman, S., Schwartz, O., Smorodinsky, S. & Taslakian, P., 18 Jun 2010, LATIN 2010: Theoretical Informatics - 9th Latin American Symposium, Proceedings. p. 2-13 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6034 LNCS).

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

    1 Scopus citations
  • Conflict-free coloring made stronger

    Horev, E., Krakovski, R. & Smorodinsky, S., 21 Jul 2010, Algorithm Theory - SWAT 2010 - 12th Scandinavian Symposium and Workshops on Algorithm Theory, Proceedings. p. 105-117 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6139 LNCS).

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

    17 Scopus citations
  • Polychromatic coloring for half-planes

    Smorodinsky, S. & Yuditsky, Y., 21 Jul 2010, Algorithm Theory - SWAT 2010 - 12th Scandinavian Symposium and Workshops on Algorithm Theory, Proceedings. p. 118-126 9 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6139 LNCS).

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

    2 Scopus citations
  • 2008

    Coloring geometric range spaces

    Aloupis, G., Cardinal, J., Collette, S., Langerman, S. & Smorodinsky, S., 12 May 2008, LATIN 2008: Theoretical Informatics - 8th Latin American Symposium, Proceedings. p. 146-157 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4957 LNCS).

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

    6 Scopus citations
  • On center regions and balls containing many points

    Smorodinsky, S., Sulovský, M. & Wagner, U., 4 Aug 2008, Computing and Combinatorics - 14th Annual International Conference, COCOON 2008, Proceedings. p. 363-373 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5092 LNCS).

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

    6 Scopus citations
  • Weak ∈-nets and interval chains

    Alon, N., Kaplan, H., Nivasch, G., Sharir, M. & Smorodinsky, S., 1 Dec 2008, Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms. p. 1194-1203 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

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

    7 Scopus citations
  • 2007

    Online conflict-free colorings for hypergraphs

    Bar-Noy, A., Cheilaris, P., Olonetsky, S. & Smorodinsky, S., 1 Jan 2007, Automata, Languages and Programming - 34th International Colloquium, ICALP 2007, Proceedings. Springer Verlag, p. 219-230 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4596 LNCS).

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

    7 Scopus citations
  • 2006

    Conflict-free coloring for intervals: From offline to online

    Bar-Noy, A., Cheilaris, P. & Smorodinsky, S., 16 Oct 2006, SPAA 2006: 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures. p. 128-137 10 p. (Annual ACM Symposium on Parallelism in Algorithms and Architectures; vol. 2006).

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

    19 Scopus citations
  • Conflict-free colorings of shallow discs

    Alon, N. & Smorodinsky, S., 1 Jan 2006, Proceedings of the Twenty-Second Annual Symposium on Computational Geometry 2006, SCG'06. Association for Computing Machinery (ACM), p. 41-43 3 p. (Proceedings of the Annual Symposium on Computational Geometry; vol. 2006).

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

    26 Scopus citations
  • 2002

    On Neighbors in Geometric Permutations

    Sharir, M. & Smorodinsky, S., 2002, Algorithm Theory, SWAT 2002: 8th Scandinavian Workshop on Algorithm Theory, Proceedings. Penttonen, M. & Schmidt, E. M. (eds.). Springer Verlag, p. 131-139 9 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2368).

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