| 2026 | ESA | DAG Covers for Structured Graphs: The Steiner Point Effect. | Sujoy Bhore, Hsien-Chih Chang, Jonathan Conroy, Arnold Filtser, Eunjin Oh, Nicole Wein, Da Wei Zheng |
| 2026 | PODC | Near-Resolution of the Tradeoff Conjecture in Distributed Proof Labeling Schemes. | Arnold Filtser, Orr Fischer |
| 2026 | SODA | Stochastic Embedding of Digraphs into DAGs. | Arnold Filtser |
| 2025 | ICML | Faster Approximation Algorithms for k-Center via Data Reduction. | Arnold Filtser, Shaofeng H.-C. Jiang, Yi Li, Anurag Murty Naredla, Ioannis Psarros, Qiaoyuan Yang, Qin Zhang |
| 2025 | SODA | Highway Dimension: a Metric View. | Andreas Emil Feldmann, Arnold Filtser |
| 2025 | STOC | How to Protect Yourself from Threatening Skeletons: Optimal Padded Decompositions for Minor-Free Graphs. | Jonathan Conroy, Arnold Filtser |
| 2024 | FOCS | Near-Optimal (1+ε)-Approximate Fully-Dynamic All-Pairs Shortest Paths in Planar Graphs. | Arnold Filtser, Gramoz Goranci, Neel Patel, Maximilian Probst Gutenberg |
| 2024 | SODA | Online Duet between Metric Embeddings and Minimum-Weight Perfect Matchings. | Sujoy Bhore, Arnold Filtser, Csaba D. Tth |
| 2023 | FOCS | 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 |
| 2022 | ESA | Online Spanners in Metric Spaces. | Sujoy Bhore, Arnold Filtser, Hadi Khodabandeh, Csaba D. Tth |
| 2022 | FOCS | Low Treewidth Embeddings of Planar and Minor-Free Metrics. | Arnold Filtser, Hung Le |
| 2022 | STOC | Locality-sensitive orderings and applications to reliable spanners. | Arnold Filtser, Hung Le |
| 2021 | AAAI | Condorcet Relaxation In Spatial Voting. | Arnold Filtser, Omrit Filtser |
| 2021 | FOCS | Hop-Constrained Metric Embeddings and their Applications. | Arnold Filtser |
| 2021 | SODA | Static and Streaming Data Structures for Frchet Distance Queries. | Arnold Filtser, Omrit Filtser |
| 2021 | SODA | Graph Spanners by Sketching in Dynamic Streams and the Simultaneous Communication Model. | Arnold Filtser, Michael Kapralov, Navid Nouri |
| 2021 | STOC | Clan embeddings into trees, and low treewidth graphs. | Arnold Filtser, Hung Le |
| 2020 | FOCS | On Light Spanners, Low-treewidth Embeddings and Efficient Traversing in Minor-free Graphs. | Vincent Cohen-Addad, Arnold Filtser, Philip N. Klein, Hung Le |
| 2020 | ICALP | Scattering and Sparse Partitions, and Their Applications. | Arnold Filtser |
| 2020 | ICALP | Approximate Nearest Neighbor for Curves - Simple, Efficient, and Deterministic. | Arnold Filtser, Omrit Filtser, Matthew J. Katz |
| 2020 | PODC | Distributed Construction of Light Networks. | Michael Elkin, Arnold Filtser, Ofer Neiman |
| 2020 | SODA | A face cover perspective to | Arnold Filtser |
| 2020 | SODA | Labelings vs. Embeddings: On Distributed Representations of Distances. | Arnold Filtser, Lee-Ad Gottlieb, Robert Krauthgamer |
| 2019 | ESA | Constructing Light Spanners Deterministically in Near-Linear Time. | Stephen Alstrup, Sren Dahlgaard, Arnold Filtser, Morten Stckel, Christian Wulff-Nilsen |
| 2019 | SODA | Relaxed Voronoi: A Simple Framework for Terminal-Clustering Problems. | Arnold Filtser, Robert Krauthgamer, Ohad Trabelsi |
| 2018 | ESA | Light Spanners for High Dimensional Norms via Stochastic Decompositions. | Arnold Filtser, Ofer Neiman |
| 2018 | SODA | Ramsey Spanning Trees and their Applications. | Ittai Abraham, Shiri Chechik, Michael Elkin, Arnold Filtser, Ofer Neiman |
| 2018 | SODA | Steiner Point Removal with Distortion | Arnold Filtser |
| 2018 | STOC | Metric embedding via shortest path decompositions. | Ittai Abraham, Arnold Filtser, Anupam Gupta, Ofer Neiman |
| 2016 | PODC | The Greedy Spanner is Existentially Optimal. | Arnold Filtser, Shay Solomon |
| 2016 | SODA | On Notions of Distortion and an Almost Minimum Spanning Tree with Constant Average Distortion. | Yair Bartal, Arnold Filtser, Ofer Neiman |
| 2015 | STOC | Prioritized Metric Structures and Embedding. | Michael Elkin, Arnold Filtser, Ofer Neiman |
| 2013 | ISIT | Efficient determination of the unique decodability of a string. | Arnold Filtser, Jiaxi Jin, Aryeh Kontorovich, Ari Trachtenberg |