Anastasios Sidiropoulos

According to our database1, Anastasios Sidiropoulos authored at least 76 papers between 2003 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Topology-aware Parallel Data Processing: Models, Algorithms and Systems at Scale.
Proceedings of the CIDR 2020, 2020

2019
Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces.
SIAM J. Discrete Math., 2019

Learning Mahalanobis Metric Spaces via Geometric Approximation Algorithms.
CoRR, 2019

Spectral concentration and greedy k-clustering.
Comput. Geom., 2019

Polylogarithmic approximation for Euler genus on bounded degree graphs.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

On Constant Multi-Commodity Flow-Cut Gaps for Families of Directed Minor-Free Graphs.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

A Polynomial Time Algorithm for Log-Concave Maximum Likelihood via Locally Exponential Families.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Brain Dynamics Through the Lens of Statistical Mechanics by Unifying Structure and Function.
Proceedings of the Medical Image Computing and Computer Assisted Intervention - MICCAI 2019, 2019

Algorithms for Metric Learning via Contrastive Embeddings.
Proceedings of the 35th International Symposium on Computational Geometry, 2019

Routing Symmetric Demands in Directed Minor-Free Graphs with Constant Congestion.
Proceedings of the Approximation, 2019

2018
Computing the Gromov-Hausdorff Distance for Metric Trees.
ACM Trans. Algorithms, 2018

Approximation Algorithms for Euler Genus and Related Problems.
SIAM J. Comput., 2018

Chasing Similarity: Distribution-aware Aggregation Scheduling.
PVLDB, 2018

A Polynomial Time Algorithm for Maximum Likelihood Estimation of Multivariate Log-concave Densities.
CoRR, 2018

Chasing Similarity: Distribution-aware Aggregation Scheduling (Extended Version).
CoRR, 2018

Alleviating partisan gerrymandering: can math and computers help to eliminate wasted votes?
CoRR, 2018

Sketching and Clustering Metric Measure Spaces.
CoRR, 2018

Quasimetric Embeddings and Their Applications.
Algorithmica, 2018

Fractal Dimension and Lower Bounds for Geometric Problems.
Proceedings of the 34th International Symposium on Computational Geometry, 2018

Algorithms for Low-Distortion Embeddings into Arbitrary 1-Dimensional Spaces.
Proceedings of the 34th International Symposium on Computational Geometry, 2018

Near-Optimal Sample Complexity Bounds for Maximum Likelihood Estimation of Multivariate Log-concave Densities.
Proceedings of the Conference On Learning Theory, 2018

2017
A Pseudo-Approximation for the Genus of Hamiltonian Graphs.
Theory of Computing, 2017

On constant multi-commodity flow-cut gaps for directed minor-free graphs.
CoRR, 2017

Metric embeddings with outliers.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Temporal Hierarchical Clustering.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Polylogarithmic Approximation for Minimum Planarization (Almost).
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

Temporal Clustering.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017

Algorithmic Interpretations of Fractal Dimension.
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016
How to Walk Your Dog in the Mountains with No Magic Leash.
Discrete & Computational Geometry, 2016

Layouts of Expander Graphs.
Chicago J. Theor. Comput. Sci., 2016

Brief Announcement: Approximating the I/O Complexity of One-Shot Red-Blue Pebbling.
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Constant-Factor Approximations for Asymmetric TSP on Nearly-Embeddable Graphs.
Proceedings of the Approximation, 2016

Constant-Distortion Embeddings of Hausdorff Metrics into Constant-Dimensional l_p Spaces.
Proceedings of the Approximation, 2016

2015
Metric embedding with outliers.
CoRR, 2015

Approximate Greedy Clustering and Distance Selection for Graph Metrics.
CoRR, 2015

3-Monotone Expanders.
CoRR, 2015

Beyond the Euler Characteristic: Approximating the Genus of General Graphs.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Computing the Fréchet Distance Between Polygons with Holes.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014
Spectral concentration, robust k-center, and simple clustering.
CoRR, 2014

Minimum d-dimensional arrangement with fixed points.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

The limited blessing of low dimensionality: when 1-1/d is the best possible exponent for d-dimensional geometric problems.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

A near-optimal approximation algorithm for Asymmetric TSP on embedded graphs.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2013
Fat Polygonal Partitions with Applications to Visualization and Embeddings.
JoCG, 2013

Minimum d-dimensional arrangement with fixed points.
CoRR, 2013

Pathwidth, trees, and random embeddings.
Combinatorica, 2013

Euclidean spanners in high dimensions.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Non-positive Curvature and the Planar Embedding Conjecture.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2012
Convergence and approximation in potential games.
Theor. Comput. Sci., 2012

Planarizing an Unknown Surface.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012

2011
How strong is Nisanʼs pseudo-random generator?
Inf. Process. Lett., 2011

Near-optimal distortion bounds for embedding doubling spaces into L1.
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

On Graph Crossing Number and Edge Planarization.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Computationally Limited Randomness.
Proceedings of the Innovations in Computer Science, 2011

2010
Undecidability and intractability results concerning datalog programs and their persistency numbers.
ACM Trans. Comput. Log., 2010

On distributing symmetric streaming computations.
ACM Trans. Algorithms, 2010

Randomly removing g handles at once.
Comput. Geom., 2010

Genus and the Geometry of the Cut Graph.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Inapproximability for Planar Embedding Problems.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Optimal Stochastic Planarization.
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

Online Embeddings.
Proceedings of the Approximation, 2010

2009
Polynomial Time with Restricted Use of Randomness.
Electronic Colloquium on Computational Complexity (ECCC), 2009

Streaming Embeddings with Slack.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

On the geometry of graphs with a forbidden minor.
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

2008
Computational metric embeddings.
PhD thesis, 2008

Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics.
ACM Trans. Algorithms, 2008

Theory research at Google.
SIGACT News, 2008

Inapproximability for Metric Embeddings into R^d.
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

Circular partitions with applications to visualization and embeddings.
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction.
Proceedings of the Approximation, 2008

2007
Approximation algorithms for embedding general metrics into trees.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Probabilistic embeddings of bounded genus graphs into planar graphs.
Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, 2007

2006
On the Complexity of Processing Massive, Unordered, Distributed Data
CoRR, 2006

Embedding ultrametrics into low-dimensional spaces.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

2005
Low-distortion embeddings of general metrics into the line.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Approximation algorithms for low-distortion embeddings into low-dimensional spaces.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2003
Fractional and Integral Coloring of Locally-Symmetric Sets of Paths on Binary Trees.
Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003


  Loading...