Publications by Anastasios Sidiropoulos (chronological list)

  1. Algorithms for metric learning via contrastive embeddings
    Diego Ihara Centurion, Neshat Mohammadi, Anastasios Sidiropoulos
    Submitted. [ArXiv]

  2. Alleviating partisan gerrymandering: can math and computers help to eliminate wasted votes?
    Tanima Chatterjee, Bhaskar DasGupta, Laura Palmieri, Zainab Al-Qurashi Anastasios Sidiropoulos.
    Submitted. [ArXiv]

  3. Routing Symmetric Demands in Directed Minor-Free Graphs with Constant Congestion.
    Timothy Carpenter, Ario Salmasi, Anastasios Sidiropoulos.
    Submitted. [ArXiv]

  4. Learning Wasserstein distance in spaces of low intrinsic dimension.
    Timothy Carpenter, Ilias Diakonikolas, Anastasios Sidiropoulos.
    Submitted.

  5. Sketching and Clustering Metric Measure Spaces.
    Facundo Memoli, Anastasios Sidiropoulos, Kritika Singhal.
    Submitted. [ArXiv]

  6. On constant multi-commodity flow-cut gaps for directed minor-free graphs.
    Ario Salmasi, Anastasios Sidiropoulos, Vijay Sridhar.
    Submitted. [ArXiv]

  7. Approximate greedy clustering and distance selection for graph metrics.
    David Eppstein, Sariel Har-Peled, Anastasios Sidiropoulos.
    Submitted. [ArXiv]

  8. Spectral concentration and greedy k-clustering.
    Tamal K. Dey, Pan Peng, Alfred Rossi, Anastasios Sidiropoulos.
    Computational Geometry: Theory and Applications, to appear. [ArXiv]

  9. Near-optimal sample complexity bounds for maximum likelihood estimation of multivariate log-concave densities.
    Timothy Carpenter, Ilias Diakonikolas, Anastasios Sidiropoulos, Alistair Stewart.
    Annual Conference on Learning Theory (COLT 2018). [ArXiv]

  10. Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces.
    Timothy Carpenter, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Anastasios Sidiropoulos.
    ACM Symposium on Computational Geometry (SoCG 2018). [ArXiv]

  11. Fractal dimension and lower bounds for geometric problems.
    Anastasios Sidiropoulos, Kritika Singhal, Vijay Sridhar.
    ACM Symposium on Computational Geometry (SoCG 2018). [ArXiv]

  12. Polylogarithmic approximation for minimum planarization (almost)
    Ken-ichi Kawarabayashi, Anastasios Sidiropoulos.
    IEEE Symposium on Foundations of Computer Science (FOCS 2017). [ArXiv]

  13. Algorithmic interpretations of fractal dimension.
    Anastasios Sidiropoulos, Vijay Sridhar.
    ACM Symposium on Computational Geometry (SoCG 2017). [ArXiv]

  14. Metric embeddings with outliers.
    Anastasios Sidiropoulos, Dingkang Wang, Yusu Wang.
    ACM-SIAM Symposium on Discrete Algorithms (SODA 2017). [ArXiv]

  15. Temporal Hierarchical Clustering.
    Tamal K. Dey, Alfred Rossi, Anastasios Sidiropoulos.
    International Symposium on Algorithms and Computation (ISAAC 2017).

  16. Temporal Clustering.
    Tamal K. Dey, Alfred Rossi, Anastasios Sidiropoulos.
    European Symposium on Algorithms (ESA 2017). [ArXiv]

  17. Constant-factor approximations for asymmetric TSP on nearly-embeddable graphs.
    Daniel Marx, Ario Salmasi, Anastasios Sidiropoulos.
    International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2016). [ArXiv]

  18. Constant-distortion embeddings of Hausdorff metrics into constant-dimensional Lp spaces.
    Arturs Backurs, Anastasios Sidiropoulos.
    International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2016).

  19. Approximating the I/O complexity of one-shot red-blue pebbling.
    Timothy Carpenter, Fabrice Rastello, P. Sadayappan, Anastasios Sidiropoulos.
    ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2016), brief announcement.

  20. Quasimetric embeddings and their applications.
    Facundo Memoli, Anastasios Sidiropoulos, Vijay Sridhar.
    Journal version: Algorithmica [Link to article].
    Conference version: International Colloquium on Automata, Languages, and Programming (ICALP 2016).

  21. Layouts of expander graphs.
    Vida Dujmovic, Anastasios Sidiropoulos, David R. Wood.
    Chicago Journal of Theoretical Computer Science, 2016. [Link to article, ArXiv]

  22. Beyond the Euler characteristic: Approximating the genus of general graphs.
    Ken-ichi Kawarabayashi, Anastasios Sidiropoulos.
    ACM Symposium on Theory of Computing (STOC 2015). [ArXiv]

  23. Computing the Frechet distance between polygons with holes.
    Amir Nayyeri, Anastasios Sidiropoulos.
    International Colloquium on Automata, Languages, and Programming (ICALP 2015).

  24. Computing the Gromov-Hausdorff distance for metric trees.
    Pankaj K. Agarwal, Kyle J. Fox, Abhinandan Nath, Anastasios Sidiropoulos, Yusu Wang.
    26th International Symposium on Algorithms and Computation (ISAAC 2015).

  25. The limited blessing of low dimensionality: when 1-1/d is the best possible exponent for d-dimensional geometric problems.
    Daniel Marx, Anastasios Sidiropoulos.
    ACM Symposium on Computational Geometry (SoCG 2014).

  26. A nearly-optimal approximation algorithm for asymmetric TSP on embedded graphs.
    Jeff Erickson, Anastasios Sidiropoulos.
    ACM Symposium on Computational Geometry (SoCG 2014). [ArXiv]

  27. Minimum d-dimensional arrangement with fixed points.
    Anupam Gupta, Anastasios Sidiropoulos.
    ACM-SIAM Symposium on Discrete Algorithms (SODA 2014). [ArXiv]

  28. Non-positive curvature and the planar embedding conjecture.
    Anastasios Sidiropoulos.
    IEEE Symposium on Foundations of Computer Science (FOCS 2013). [ArXiv]

  29. Approximation algorithms for Euler genus, and related problems.
    Chandra Chekuri, Anastasios Sidiropoulos.
    Journal version: SIAM Journal on Computing (SICOMP), 2018. [Link to article]
    Conference version: IEEE Symposium on Foundations of Computer Science (FOCS 2013). [ArXiv]

  30. A pseudo-approximation for the genus of Hamiltonian graphs.
    Yury Makarychev, Amir Nayyeri, Anastasios Sidiropoulos.
    Journal version: Theory of Computing, 2017. [Link to article]
    Conference version: Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2013).

  31. Euclidean spanners in high dimensions.
    Sariel Har-Peled, Piotr Indyk, Anastasios Sidiropoulos.
    ACM-SIAM Symposium on Discrete Algorithms (SODA 2013). [PDF]

  32. Planarizing an unknown surface.
    Yury Makarychev, Anastasios Sidiropoulos.
    Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2012). [Arxiv]

  33. How to walk your dog in the mountains with no magic leash.
    Sariel Har-Peled, Amir Nayyeri, Mohammad Salavatipour, Anastasios Sidiropoulos.
    Journal version: Discrete & Computational Geometry. [Link to article]
    Conference version: ACM Symposium on Computational Geometry (SoCG 2012). [PDF]

  34. Near-optimal distortion bounds for embedding doubling spaces into L1.
    James R. Lee, Anastasios Sidiropoulos.
    ACM Symposium on Theory of Computing (STOC 2011). [Extended abstract: PDF, Slides: PDF, Video of lecture]

  35. On graph crossing number and edge planarization.
    Julia Chuzhoy, Yury Makarychev, Anastasios Sidiropoulos.
    ACM-SIAM Symposium on Discrete Algorithms (SODA 2011). [Extended abstract: PDF, full version: PDF, slides: PDF]

  36. Computationally limited randomness.
    Matei David, Phuong Nguyen, Periklis Papakonstantinou, Anastasios Sidiropoulos.
    Symposium on Innovations in Computer Science (ICS 2011). [PDF]

  37. How strong is Nisan's pseudo-random generator?
    Matei David, Periklis Papakonstantinou, Anastasios Sidiropoulos.
    Information Processing Letters, 2011.

  38. Optimal stochastic planarization.
    Anastasios Sidiropoulos.
    IEEE Symposium on Foundations of Computer Science (FOCS 2010). [Arxiv, slides: PDF, Video of lecture]

  39. On-line embeddings.
    Piotr Indyk, Avner Magen, Anastasios Sidiropoulos, Anastasios Zouzias.
    Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2010). [PDF]

  40. Genus and the geometry of the cut graph.
    James R. Lee, Anastasios Sidiropoulos.
    ACM-SIAM Symposium on Discrete Algorithms (SODA 2010). [PDF, slides: PDF]

  41. Inapproximability for planar embedding problems.
    Jeff Edmonds, Anastasios Sidiropoulos, Anastasios Zouzias.
    ACM-SIAM Symposium on Discrete Algorithms (SODA 2010). [PDF]

  42. Undecidability and intractability results concerning datalog programs and their persistency numbers.
    Stavros Cosmadakis, Eugenie Foustoucos, Anastasios Sidiropoulos.
    ACM Transactions on Computational Logic, 2010. [PDF]

  43. Randomly removing g handles at once.
    Glencora Borradaile, James R. Lee, Anastasios Sidiropoulos.
    Journal version: Invited to Computational Geometry: Theory and Applications. [Link to article]
    Conference version: ACM Symposium on Computational Geometry (SoCG 2009). [PDF]

  44. On the geometry of graphs with a forbidden minor.
    James R. Lee, Anastasios Sidiropoulos.
    Conference version: ACM Symposium on Theory of Computing (STOC 2009). [Extended abstract: PDF, slides: PDF]

  45. Streaming Embeddings with Slack.
    Christiane Lammersen, Anastasios Sidiropoulos, Christian Sohler.
    Algorithms and Data Structures Symposium (WADS 2009).

  46. Inapproximability for metric embeddings into Rd.
    Jiri Matousek, Anastasios Sidiropoulos.
    Journal version: Transactions of the AMS, 2010.
    Conference version: IEEE Symposium on Foundations of Computer Science (FOCS 2008). [Extended abstract: PDF, full version: PDF, slides: PDF]

  47. Ordinal embedding: Approximation algorithms and dimensionality reduction.
    Mihai Badoiu, Erik Demaine, MohammadTaghi Hajiaghayi, Anastasios Sidiropoulos, Morteza Zadimoghaddam.
    Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2008). [PS, PDF]

  48. Fat polygonal partitions with applications to visualization and embeddings.
    Mark de Berg, Krzysztof Onak, Anastasios Sidiropoulos.
    Journal version: Journal of Computational Geometry.
    Conference version: Circular partitions with applications to visualization and embeddings.
    Krzysztof Onak, Anastasios Sidiropoulos.
    ACM Symposium on Computational Geometry (SoCG 2008). [PS, PDF, slides: PDF]

  49. On distributing symmetric streaming computations.
    Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Cliff Stein, Zoya Svitkina.
    Journal version: Invited to ACM Transactions on Algorithms, 2010.
    Conference version: ACM-SIAM Symposium on Discrete Algorithms (SODA 2008). [PS, PDF, slides: PDF]

  50. Probabilistic embeddings of bounded genus graphs into planar graphs.
    Piotr Indyk, Anastasios Sidiropoulos.
    ACM Symposium on Computational Geometry (SoCG 2007). [PS, PDF, slides: PDF]

  51. Approximation algorithms for embedding general metrics into trees.
    Mihai Badoiu, Piotr Indyk, Anastasios Sidiropoulos.
    ACM-SIAM Symposium on Discrete Algorithms (SODA 2007). [Extended abstract: PS, PDF, full version: PDF, slides: PDF]

  52. Embedding ultrametrics into low-dimensional spaces.
    Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasios Sidiropoulos.
    ACM Symposium on Computational Geometry (SoCG 2006). [PS, PDF, slides: PDF]

  53. Convergence and approximation in potential games.
    George Christodoulou, Vahab S. Mirrokni, Anastasios Sidiropoulos.
    Journal version: Theoretical Computer Science.
    Conference version: Symposium on Theoretical Aspects of Computer Science (STACS 2006). [PS, PDF]

  54. Low-distortion embeddings of general metrics into the line.
    Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasios Sidiropoulos.
    ACM Symposium on Theory of Computing (STOC 2005). [Extended abstract: PS, PDF, full version: PDF]

  55. Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics.
    Noga Alon, Mihai Badoiu, Erik Demaine, Martin Farach-Colton, MohammadTaghi Hajiaghayi, Anastasios Sidiropoulos.
    Journal version: ACM Transactions on Algorithms, 2008.
    ACM-SIAM Symposium on Discrete Algorithms (SODA 2005). [PS, PDF, slides: PDF]

  56. Approximation algorithms for low-distortion embeddings into low-dimensional spaces.
    Mihai Badoiu, Kedar Dhamdhere, Anupam Gupta, Yuri Rabinovich, Harald Raecke, R. Ravi, Anastasios Sidiropoulos.
    ACM-SIAM Symposium on Discrete Algorithms (SODA 2005). [PS, PDF]

  57. Fractional and integral coloring of locally-symmetric sets of paths on binary trees.
    Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano, Anastasios Sidiropoulos.
    Workshop on Approximation and On-line Algorithms (WAOA 2003). [PS, PDF]

Thesis