Fingerprint
Dive into the research topics where Omrit Filtser is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
- 1 Similar Profiles
Collaborations and top research areas from the last five years
Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
-
Peeling Rotten Potatoes for a Faster Approximation of Convex Cover
Filtser, O., Maimon, T. & Yomtovyan, O., 2026, Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2026. Larsen, K. G. & Saha, B. (eds.). Association for Computing Machinery, p. 2633-2643 11 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2026-January).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
The Gate-Cover Problem
Arkin, E. M., Efrat, A., Filtser, O., Kobourov, S., Kratochvíl, J., Mitchell, J. S. B. & Rosenberg, A., 1 Jan 2026, Lecture notes in computer science. p. 483-498 16 p.Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review
-
Guarding Polyominoes Under k-Hop Visibility
Filtser, O., Krohn, E., Nilsson, B., Rieck, C. & Schmidt, C., Apr 2025, In: Algorithmica. 87, 4, p. 572-593 22 p.Research output: Contribution to journal › Article › peer-review
Open Access -
Guarding Polyominoes Under k-Hop Visibility
Filtser, O., Krohn, E., Nilsson, B., Rieck, C. & Schmidt, C., 11 Jan 2025, In: Algorithmica. 87, 4, p. 572-593 22 p., 4.Research output: Contribution to journal › Article › peer-review
Open Access -
Minimum-Complexity Graph Simplification Under the Fréchet-Like Distance
Filtser, O., Mirzanezhad, M. & Wenk, C., 2025, Combinatorial Algorithms - 36th International Workshop, IWOCA 2025, Proceedings. Fernau, H. & Zhu, B. (eds.). Springer Science and Business Media Deutschland GmbH, p. 44-57 14 p. (Lecture Notes in Computer Science; vol. 15885 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Chapter