7 citations · 16 across the 30 of their papers we have counts for
5 papers · 1 filter
On Light Spanners, Low-treewidth Embeddings and Efficient Traversing in Minor-free Graphs
Vincent Cohen-Addad, Arnold Filtser, Philip N. Klein +1
Understanding the structure of minor-free metrics, namely shortest path metrics obtained over a weighted graph excluding a fixed minor, has been an important research direction sin…
Static and Streaming Data Structures for Fréchet Distance Queries
Arnold Filtser, Omrit Filtser
Given a curve with points in in a streaming fashion, and parameters and , we construct a distance oracle that uses $O(\frac{1}{\varepsilon})^{…
Graph Spanners by Sketching in Dynamic Streams and the Simultaneous Communication Model
Arnold Filtser, Michael Kapralov, Navid Nouri
Graph sketching is a powerful technique introduced by the seminal work of Ahn, Guha and McGregor'12 on connectivity in dynamic graph streams that has enjoyed considerable attention…
Plurality in Spatial Voting Games with constant
Arnold Filtser, Omrit Filtser
Consider a set of voters, represented by a multiset in a metric space . The voters have to reach a decision -- a point in . A choice is called a -pluralit…
Scattering and Sparse Partitions, and their Applications
Arnold Filtser
A partition of a weighted graph is -sparse if every cluster has diameter at most , and every ball of radius intersects at most clusters. Sim…