11 citations · 15 across the 3 of their papers we have counts for
3 papers
On Graph Crossing Number and Edge Planarization
Julia Chuzhoy, Yury Makarychev, Anastasios Sidiropoulos
Given an n-vertex graph G, a drawing of G in the plane is a mapping of its vertices into points of the plane, and its edges into continuous curves, connecting the images of their e…
Inapproximability for metric embeddings into R^d
Jiri Matousek, Anastasios Sidiropoulos
We consider the problem of computing the smallest possible distortion for embedding of a given n-point metric space into R^d, where d is fixed (and small). For d=1, it was known th…
On the Complexity of Processing Massive, Unordered, Distributed Data
Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos +2
An existing approach for dealing with massive data sets is to stream over the input in few passes and perform computations with sublinear resources. This method does not work for t…