Efficient determination of the unique decodability of a string. - Arnold Filtser; Jiaxi Jin; Aryeh Kontorovich; Ari Trachtenberg (ISIT, 2013)

Sparsification of Two-Variable Valued CSPs. - Arnold Filtser; Robert Krauthgamer (CoRR, 2015)

Steiner Point Removal with Distortion O(log k). - Arnold Filtser (CoRR, 2017)

Sparsification of Two-Variable Valued Constraint Satisfaction Problems. - Arnold Filtser; Robert Krauthgamer (SIAM J. Discret. Math., 2017)

Terminal embeddings. - Michael Elkin; Arnold Filtser; Ofer Neiman (Theor. Comput. Sci., 2017)

Steiner Point Removal with Distortion O(log k). - Arnold Filtser (SODA, 2018)

Steiner Point Removal with distortion O(log k), using the Noisy-Voronoi algorithm. - Arnold Filtser (CoRR, 2018)

Noisy Voronoi: a Simple Framework for Terminal-Clustering Problems. - Arnold Filtser; Robert Krauthgamer; Ohad Trabelsi (CoRR, 2018)

Prioritized Metric Structures and Embedding. - Michael Elkin; Arnold Filtser; Ofer Neiman (SIAM J. Comput., 2018)

On Strong Diameter Padded Decompositions. - Arnold Filtser (APPROX-RANDOM, 2019)

Relaxed Voronoi: A Simple Framework for Terminal-Clustering Problems. - Arnold Filtser; Robert Krauthgamer; Ohad Trabelsi (SOSA, 2019)

Distributed monitoring of election winners. - Arnold Filtser; Nimrod Talmon (Artif. Intell., 2019)

A face cover perspective to 𝓁1 embeddings of planar graphs. - Arnold Filtser (CoRR, 2019)

On notions of distortion and an almost minimum spanning tree with constant average distortion. - Yair Bartal; Arnold Filtser; Ofer Neiman (J. Comput. Syst. Sci., 2019)

Steiner Point Removal with Distortion O(log k) using the Relaxed-Voronoi Algorithm. - Arnold Filtser (SIAM J. Comput., 2019)

On Light Spanners, Low-treewidth Embeddings and Efficient Traversing in Minor-free Graphs. - Vincent Cohen-Addad; Arnold Filtser; Philip N. Klein; Hung Le 001 (FOCS, 2020)

Distributed Construction of Light Networks. - Michael Elkin; Arnold Filtser; Ofer Neiman (PODC, 2020)

Labelings vs. Embeddings: On Distributed Representations of Distances. - Arnold Filtser; Lee-Ad Gottlieb; Robert Krauthgamer (SODA, 2020)

The Greedy Spanner Is Existentially Optimal. - Arnold Filtser; Shay Solomon (SIAM J. Comput., 2020)

Ramsey Spanning Trees and Their Applications. - Ittai Abraham; Shiri Chechik; Michael Elkin; Arnold Filtser; Ofer Neiman (ACM Trans. Algorithms, 2020)

Condorcet Relaxation In Spatial Voting. - Arnold Filtser; Omrit Filtser (AAAI, 2021)

Hop-Constrained Metric Embeddings and their Applications. - Arnold Filtser (FOCS, 2021)

Graph Spanners by Sketching in Dynamic Streams and the Simultaneous Communication Model. - Arnold Filtser; Michael Kapralov; Navid Nouri (SODA, 2021)

Clan embeddings into trees, and low treewidth graphs. - Arnold Filtser; Hung Le 001 (STOC, 2021)

Reliable Spanners: Locality-Sensitive Orderings Strike Back. - Arnold Filtser; Hung Le 001 (CoRR, 2021)

Low Treewidth Embeddings of Planar and Minor-Free Metrics. - Arnold Filtser; Hung Le 001 (FOCS, 2022)

Locality-sensitive orderings and applications to reliable spanners. - Arnold Filtser; Hung Le 001 (STOC, 2022)

Light Spanners for High Dimensional Norms via Stochastic Decompositions. - Arnold Filtser; Ofer Neiman (Algorithmica, 2022)

Metric Embedding via Shortest Path Decompositions. - Ittai Abraham; Arnold Filtser; Anupam Gupta 001; Ofer Neiman (SIAM J. Comput., 2022)

Constructing light spanners deterministically in near-linear time. - Stephen Alstrup; Søren Dahlgaard; Arnold Filtser; Morten Stöckel; Christian Wulff-Nilsen (Theor. Comput. Sci., 2022)

Labeled Nearest Neighbor Search and Metric Spanners via Locality Sensitive Orderings. - Arnold Filtser (SoCG, 2023)

One Tree to Rule Them All: Poly-Logarithmic Universal Steiner Tree. - Costas Busch; Da Qi Chen; Arnold Filtser; Daniel Hathcock; D. Ellis Hershkowitz; Rajmohan Rajaraman (FOCS, 2023)

Communication Complexity of Inner Product in Symmetric Normed Spaces. - Alexandr Andoni; Jaroslaw Blasiok; Arnold Filtser (ITCS, 2023)

Expander Decomposition in Dynamic Streams. - Arnold Filtser; Michael Kapralov; Mikhail Makarov (ITCS, 2023)

Approximate Nearest Neighbor for Curves: Simple, Efficient, and Deterministic. - Arnold Filtser; Omrit Filtser; Matthew J. Katz (Algorithmica, 2023)

Corrigendum: Metric Embedding via Shortest Path Decompositions. - Ittai Abraham; Arnold Filtser; Anupam Gupta 001; Ofer Neiman (SIAM J. Comput., 2023)

Static and Streaming Data Structures for Fréchet Distance Queries. - Arnold Filtser; Omrit Filtser (ACM Trans. Algorithms, 2023)

Light, Reliable Spanners. - Arnold Filtser; Yuval Gitlitz; Ofer Neiman (SoCG, 2024)

Near-Optimal (1+ε)-Approximate Fully-Dynamic All-Pairs Shortest Paths in Planar Graphs. - Arnold Filtser; Gramoz Goranci; Neel Patel; Maximilian Probst Gutenberg (FOCS, 2024)

Online Duet between Metric Embeddings and Minimum-Weight Perfect Matchings. - Sujoy Bhore; Arnold Filtser; Csaba D. Tóth (SODA, 2024)

Optimal Padded Decomposition For Bounded Treewidth Graphs. - Arnold Filtser; Tobias Friedrich 001; Davis Issac; Nikhil Kumar 001; Hung Le 001; Nadym Mallek; Ziena Zeif (CoRR, 2024)

FPT approximations for Capacitated Sum of Radii and Diameters. - Arnold Filtser; Ameet Gadekar (CoRR, 2024)

Online Spanners in Metric Spaces. - Sujoy Bhore; Arnold Filtser; Hadi Khodabandeh; Csaba D. Tóth (SIAM J. Discret. Math., 2024)

Labelings vs. Embeddings: On Distributed and Prioritized Representations of Distances. - Arnold Filtser; Lee-Ad Gottlieb; Robert Krauthgamer (Discret. Comput. Geom., 2024)

Scattering and Sparse Partitions, and Their Applications. - Arnold Filtser (ACM Trans. Algorithms, 2024)

On Sparse Covers of Minor Free Graphs, Low Dimensional Metric Embeddings, and Other Applications. - Arnold Filtser (SoCG, 2025)

Highway Dimension: a Metric View. - Andreas Emil Feldmann; Arnold Filtser (SODA, 2025)

How to Protect Yourself from Threatening Skeletons: Optimal Padded Decompositions for Minor-Free Graphs. - Jonathan Conroy; Arnold Filtser (STOC, 2025)

A Face Cover Perspective to ℓ1 Embeddings of Planar Graphs. - Arnold Filtser (ACM Trans. Algorithms, 2025)

Faster Approximation Algorithms for k-Center via Data Reduction. - Arnold Filtser; Shaofeng H.-C. Jiang; Yi Li 002; Anurag Murty Naredla; Ioannis Psarros; Qiaoyuan Yang; Qin Zhang 001 (CoRR, 2025)

Plurality in Spatial Voting Games with Constant β. - Arnold Filtser; Omrit Filtser (Discret. Comput. Geom., 2025)

The Squishy Grid Problem. - Zixi Cai; Kuowen Chen; Shengquan Du; Arnold Filtser; Seth Pettie; Daniel Skora (CoRR, 2025)