Publications (36)
Constant-factor approximations for asymmetric TSP on nearly-embeddable graphs
Daniel Marx, Ario Salmasi, Anastasios Sidiropoulos
Fractal dimension and lower bounds for geometric problems
Anastasios Sidiropoulos, Kritika Singhal, Vijay Sridhar
Layouts of Expander Graphs
Vida DujmoviÄ, Anastasios Sidiropoulos, David R. Wood
Chasing Similarity: Distribution-aware Aggregation Scheduling (Extended Version)
Feilong Liu, Ario Salmasi, Spyros Blanas +1
The limited blessing of low dimensionality: when $1-1/d$ is the best possible exponent for $d$-dimensional geometric problems
Dániel Marx, Anastasios Sidiropoulos
Polylogarithmic approximation for minimum planarization (almost)
Ken-ichi Kawarabayashi, Anastasios Sidiropoulos
Optimal stochastic planarization
Anastasios Sidiropoulos
Randomly removing g handles at once
Glencora Borradaile, James R. Lee, Anastasios Sidiropoulos
Temporal Hierarchical Clustering
Tamal K. Dey, Alfred Rossi, Anastasios Sidiropoulos
How to Walk Your Dog in the Mountains with No Magic Leash
Sariel Har-Peled, Amir Nayyeri, Mohammad Salavatipour +1
Alleviating partisan gerrymandering: can math and computers help to eliminate wasted votes?
Tanima Chatterjee, Bhaskar DasGupta, Laura Palmieri +2
Approximation algorithms for Euler genus and related problems
Chandra Chekuri, Anastasios Sidiropoulos
On the Complexity of Processing Massive, Unordered, Distributed Data
Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos +2
A Polynomial Time Algorithm for Maximum Likelihood Estimation of Multivariate Log-concave Densities
Ilias Diakonikolas, Anastasios Sidiropoulos, Alistair Stewart
On constant multi-commodity flow-cut gaps for directed minor-free graphs
Ario Salmasi, Anastasios Sidiropoulos, Vijay Sridhar
On Graph Crossing Number and Edge Planarization
Julia Chuzhoy, Yury Makarychev, Anastasios Sidiropoulos
Quasimetric embeddings and their applications
Facundo Mémoli, Anastasios Sidiropoulos, Vijay Sridhar
Fat Polygonal Partitions with Applications to Visualization and Embeddings
Mark de Berg, Krzysztof Onak, Anastasios Sidiropoulos
Pathwidth, trees, and random embeddings
James R. Lee, Anastasios Sidiropoulos
Routing Symmetric Demands in Directed Minor-Free Graphs with Constant Congestion
Timothy Carpenter, Ario Salmasi, Anastasios Sidiropoulos
Temporal Clustering
Tamal K. Dey, Alfred Rossi, Anastasios Sidiropoulos
Minimum d-dimensional arrangement with fixed points
Anupam Gupta, Anastasios Sidiropoulos
Non-positive curvature, and the planar embedding conjecture
Anastasios Sidiropoulos
Algorithms for metric learning via contrastive embeddings
Diego Ihara Centurion, Neshat Mohammadi, Anastasios Sidiropoulos
A near-optimal approximation algorithm for Asymmetric TSP on embedded graphs
Jeff Erickson, Anastasios Sidiropoulos
Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces
Timothy Carpenter, Fedor V. Fomin, Daniel Lokshtanov +2
Inapproximability for metric embeddings into R^d
Jiri Matousek, Anastasios Sidiropoulos
Planarizing an Unknown Surface
Yury Makarychev, Anastasios Sidiropoulos
Algorithmic interpretations of fractal dimension
Anastasios Sidiropoulos, Vijay Sridhar
Computing the Gromov-Hausdorff Distance for Metric Trees
Pankaj K. Agarwal, Kyle Fox, Abhinandan Nath +2
Near-Optimal Sample Complexity Bounds for Maximum Likelihood Estimation of Multivariate Log-concave Densities
Timothy Carpenter, Ilias Diakonikolas, Anastasios Sidiropoulos +1
Sketching and Clustering Metric Measure Spaces
Facundo Mémoli, Anastasios Sidiropoulos, Kritika Singhal
Spectral concentration and greedy k-clustering
Tamal K. Dey, Pan Peng, Alfred Rossi +1
Beyond the Euler characteristic: Approximating the genus of general graphs
Ken-ichi Kawarabayashi, Anastasios Sidiropoulos
A Polynomial Time Algorithm for Log-Concave Maximum Likelihood via Locally Exponential Families
Brian Axelrod, Ilias Diakonikolas, Anastasios Sidiropoulos +2
Metric embedding with outliers
Anastasios Sidiropoulos, Yusu Wang