No photo of עומרית פילצר

View Scopus Profile

Omrit Filtser

Dr.

 https://orcid.org/0000-0002-3978-1428
20132024

Research activity per year

Filter
Conference contribution

Search results

  • 2024

    Guarding Polyominoes Under k-Hop Visibility

    Filtser, O., Krohn, E., Nilsson, B. J., Rieck, C. & Schmidt, C., 2024, LATIN 2024: Theoretical Informatics - 16th Latin American Symposium, 2024, Proceedings. Soto, J. A. & Wiese, A. (eds.). Springer Science and Business Media Deutschland GmbH, p. 288-302 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 14578 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • Robustly Guarding Polygons

    Das, R., Filtser, O., Katz, M. J. & Mitchell, J. S. B., 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, 47. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 293).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • 2023

    On Flipping the Fréchet Distance

    Filtser, O., Goswami, M., Mitchell, J. S. B. & Polishchuk, V., 1 Jan 2023, 14th Innovations in Theoretical Computer Science Conference, ITCS 2023. Kalai, Y. T. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 51:1-51:22 22 p. 51. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 251).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • 2021

    A Constant-Factor Approximation Algorithm for Vertex Guarding a WV-Polygon

    Ashur, S., Filtser, O. & Katz, M. J., 2021, Approximation and Online Algorithms - 18th International Workshop, WAOA 2020, Revised Selected Papers. Kaklamanis, C. & Levin, A. (eds.). Springer Science and Business Media Deutschland GmbH, p. 81-96 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12806 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access

  • Condorcet Relaxation In Spatial Voting

    Filtser, A. & Filtser, O., 2021, 35th AAAI Conference on Artificial Intelligence, AAAI 2021. Association for the Advancement of Artificial Intelligence, Vol. 35 . p. 5407-5414 8 p. 6. (35th AAAI Conference on Artificial Intelligence, AAAI 2021; vol. 6B).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • On Minimum-Complexity Graph Simplification

    Filtser, O., Mirzanezhad, M. & Wenk, C., 2021, The 37th European Workshop on Computational Geometry (EuroCG) .

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • 2020

    Approximate nearest neighbor for curves - simple, efficient, and deterministic

    Filtser, A., Filtser, O. & Katz, M. J., 1 Jun 2020, 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020. Czumaj, A., Dawar, A. & Merelli, E. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 48. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 168).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • 2019

    Bipartite diameter and other measures under translation

    Aronov, B., Filtser, O., Katz, M. J. & Sheikhan, K., 1 Mar 2019, 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019. Niedermeier, R. & Paul, C. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 8. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 126).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • Efficient nearest-neighbor query and clustering of planar curves

    Aronov, B., Filtser, O., Horton, M., Katz, M. J. & Sheikhan, K., 2019, Algorithms and Data Structures - 16th International Symposium, WADS 2019, Proceedings. Friggstad, Z., Salavatipour, M. R. & Sack, J-R. (eds.). Springer Verlag, p. 28-42 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11646 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access

  • Terrain-Like and Non-Jumping Graphs

    Ashur, S., Filtser, O. & Saban, R., 2019, European Workshop on Computational Geometry, 2019.

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • Terrain-Like Graphs: PTASs for Guarding Weakly-Visible Polygons and Terrains

    Ashur, S., Filtser, O., Katz, M. J. & Saban, R., 2019, Approximation and Online Algorithms - 17th International Workshop, WAOA 2019, Revised Selected Papers. Bampis, E. & Megow, N. (eds.). Springer, p. 1-17 17 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11926 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • 2018

    Algorithms for the discrete Fréchet distance under translation

    Filtser, O. & Katz, M. J., 1 Jun 2018, 16th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2018. Eppstein, D. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 201-2014 1814 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 101).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • 2016

    On the general chain pair simplification problem

    Fan, C., Filtser, O., Katz, M. J. & Zhu, B., 1 Aug 2016, 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016. Muscholl, A., Faliszewski, P. & Niedermeier, R. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 37. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 58).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • 2015

    On the chain pair simplification problem

    Fan, C., Filtser, O., Katz, M. J., Wylie, T. & Zhu, B., 2015, Algorithms and Data Structures - 14th International Symposium, WADS 2015, Proceedings. Dehne, F., Sack, J-R. & Stege, U. (eds.). Springer Verlag, p. 351-362 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9214).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
  • 2014

    A (7/2)-approximation algorithm for guarding orthogonal art galleries with sliding cameras

    Durocher, S., Filtser, O., Fraser, R., Mehrabi, A. D. & Mehrabi, S., 2014, LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Proceedings. Springer Verlag, p. 294-305 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8392 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection Techniques.

    Ben Avraham, R., Filtser, O., Kaplan, H., Katz, M. J. & Sharir, M., 8 Jun 2014, Proceedings of the thirtieth annual symposium on Computational geometry (SOCG'14). New York, NY: Association for Computing Machinery (ACM), p. 377-386 10 p. (Proceedings of the Annual Symposium on Computational Geometry).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
  • 2013

    Simple Rectilinear Polygons are Perfect under Rectangular Vision

    Arkin, E., Biro, M., Filtser, O., Katz, M. J., Mitchell, J. S. B. & Schmidt, C., 2013, 23rd Fall Workshop on Computational Geometry 2013.

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review