Anastasios Sidiropoulos

According to our database, Anastasios Sidiropoulos authored at least 89 papers between 2003 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2024

Rational Economic Behaviours in the Bitcoin Lightning Network.

Andrea Carotti, Cosimo Sguanci, Anastasios Sidiropoulos

Proceedings of the IEEE International Conference on Blockchain and Cryptocurrency, 2024

2023

Maximizing Coverage While Ensuring Fairness: A Tale of Conflicting Objectives.

Abolfazl Asudeh, Tanya Y. Berger-Wolf, Bhaskar DasGupta, Anastasios Sidiropoulos

Algorithmica, May, 2023

Mass Exit Attacks on the Lightning Network.

Cosimo Sguanci, Anastasios Sidiropoulos

Proceedings of the IEEE International Conference on Blockchain and Cryptocurrency, 2023

Geometric Algorithms for k-NN Poisoning.

Diego Ihara, Karine Chubarian, Bohan Fan, Francesco Sgherzi, Thiruvenkadam S. Radhakrishnan, Anastasios Sidiropoulos, Angelo Straight

Proceedings of the 35th Canadian Conference on Computational Geometry, 2023

2021

Fractal Dimension and Lower Bounds for Geometric Problems.

Anastasios Sidiropoulos, Kritika Singhal, Vijay Sridhar

Discret. Comput. Geom., 2021

Embeddings of Planar Quasimetrics into Directed 𝓁₁ and Polylogarithmic Approximation for Directed Sparsest-Cut.

Ken-ichi Kawarabayashi, Anastasios Sidiropoulos

CoRR, 2021

NN-Baker: A Neural-network Infused Algorithmic Framework for Optimization Problems on Geometric Intersection Graphs.

Evan McCarty, Qi Zhao, Anastasios Sidiropoulos, Yusu Wang

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Grouping Words with Semantic Diversity.

Karine Chubarian, Abdul Rafae Khan, Anastasios Sidiropoulos, Jia Xu

Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, 2021

Embeddings of Planar Quasimetrics into Directed ℓ1 and Polylogarithmic Approximation for Directed Sparsest-Cut.

Ken-ichi Kawarabayashi, Anastasios Sidiropoulos

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020

Approximate greedy clustering and distance selection for graph metrics.

David Eppstein, Sariel Har-Peled, Anastasios Sidiropoulos

J. Comput. Geom., 2020

On theoretical and empirical algorithmic analysis of the efficiency gap measure in partisan gerrymandering.

Tanima Chatterjee, Bhaskar DasGupta, Laura Palmieri, Zainab Al-Qurashi, Anastasios Sidiropoulos

J. Comb. Optim., 2020

Maximizing coverage while ensuring fairness: a tale of conflicting objective.

Abolfazl Asudeh, Tanya Y. Berger-Wolf, Bhaskar DasGupta, Anastasios Sidiropoulos

CoRR, 2020

Learning Lines with Ordinal Constraints.

Diego Ihara Centurion, Bohan Fan, Francesco Sgherzi, Anastasios Sidiropoulos

CoRR, 2020

Topology-aware Parallel Data Processing: Models, Algorithms and Systems at Scale.

Spyros Blanas, Paraschos Koutris, Anastasios Sidiropoulos

Proceedings of the 10th Conference on Innovative Data Systems Research, 2020

Learning Lines with Ordinal Constraints.

Bohan Fan, Diego Ihara, Neshat Mohammadi, Francesco Sgherzi, Anastasios Sidiropoulos, Mina Valizadeh

Proceedings of the Approximation, 2020

Computing Bi-Lipschitz Outlier Embeddings into the Line.

Karine Chubarian, Anastasios Sidiropoulos

Proceedings of the Approximation, 2020

2019

Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces.

Anastasios Sidiropoulos, Mihai Badoiu, Kedar Dhamdhere, Anupam Gupta, Piotr Indyk, Yuri Rabinovich, Harald Räcke, R. Ravi

SIAM J. Discret. Math., 2019

Learning Mahalanobis Metric Spaces via Geometric Approximation Algorithms.

Diego Ihara, Neshat Mohammadi, Anastasios Sidiropoulos

CoRR, 2019

Spectral concentration and greedy <i>k</i>-clustering.

Tamal K. Dey, Pan Peng, Alfred Rossi, Anastasios Sidiropoulos

Comput. Geom., 2019

Polylogarithmic approximation for Euler genus on bounded degree graphs.

Ken-ichi Kawarabayashi, Anastasios Sidiropoulos

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.

Ario Salmasi, Anastasios Sidiropoulos, Vijay Sridhar

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.

Brian Axelrod, Ilias Diakonikolas, Alistair Stewart, Anastasios Sidiropoulos, Gregory Valiant

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.

Igor Fortel, Mitchell Butler, Laura E. Korthauer, Liang Zhan, Olusola Ajilore, Ira Driscoll, Anastasios Sidiropoulos, Yanfu Zhang, Lei Guo, Heng Huang, Dan Schonfeld, Alex D. Leow

Proceedings of the Medical Image Computing and Computer Assisted Intervention - MICCAI 2019, 2019

Algorithms for Metric Learning via Contrastive Embeddings.

Diego Ihara, Neshat Mohammadi, Anastasios Sidiropoulos

Proceedings of the 35th International Symposium on Computational Geometry, 2019

Routing Symmetric Demands in Directed Minor-Free Graphs with Constant Congestion.

Timothy Carpenter, Ario Salmasi, Anastasios Sidiropoulos

Proceedings of the Approximation, 2019

2018

Computing the Gromov-Hausdorff Distance for Metric Trees.

Pankaj K. Agarwal, Kyle Fox, Abhinandan Nath, Anastasios Sidiropoulos, Yusu Wang

ACM Trans. Algorithms, 2018

Approximation Algorithms for Euler Genus and Related Problems.

Chandra Chekuri, Anastasios Sidiropoulos

SIAM J. Comput., 2018

Chasing Similarity: Distribution-aware Aggregation Scheduling.

Feilong Liu, Ario Salmasi, Spyros Blanas, Anastasios Sidiropoulos

Proc. VLDB Endow., 2018

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

Ilias Diakonikolas, Anastasios Sidiropoulos, Alistair Stewart

CoRR, 2018

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

Feilong Liu, Ario Salmasi, Spyros Blanas, Anastasios Sidiropoulos

CoRR, 2018

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

Tanima Chatterjee, Bhaskar DasGupta, Laura Palmieri, Zainab Al-Qurashi, Anastasios Sidiropoulos

CoRR, 2018

Sketching and Clustering Metric Measure Spaces.

Facundo Mémoli, Anastasios Sidiropoulos, Kritika Singhal

CoRR, 2018

Quasimetric Embeddings and Their Applications.

Facundo Mémoli, Anastasios Sidiropoulos, Vijay Sridhar

Algorithmica, 2018

Algorithms for Low-Distortion Embeddings into Arbitrary 1-Dimensional Spaces.

Timothy Carpenter, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Anastasios Sidiropoulos

Proceedings of the 34th International Symposium on Computational Geometry, 2018

Near-Optimal Sample Complexity Bounds for Maximum Likelihood Estimation of Multivariate Log-concave Densities.

Timothy Carpenter, Ilias Diakonikolas, Anastasios Sidiropoulos, Alistair Stewart

Proceedings of the Conference On Learning Theory, 2018

2017

A Pseudo-Approximation for the Genus of Hamiltonian Graphs.

Yury Makarychev, Amir Nayyeri, Anastasios Sidiropoulos

Theory Comput., 2017

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

Ario Salmasi, Anastasios Sidiropoulos, Vijay Sridhar

CoRR, 2017

Metric embeddings with outliers.

Anastasios Sidiropoulos, Dingkang Wang, Yusu Wang

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Temporal Hierarchical Clustering.

Tamal K. Dey, Alfred Rossi, Anastasios Sidiropoulos

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Polylogarithmic Approximation for Minimum Planarization (Almost).

Ken-ichi Kawarabayashi, Anastasios Sidiropoulos

Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

Temporal Clustering.

Tamal K. Dey, Alfred Rossi, Anastasios Sidiropoulos

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

Algorithmic Interpretations of Fractal Dimension.

Anastasios Sidiropoulos, Vijay Sridhar

Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016

How to Walk Your Dog in the Mountains with No Magic Leash.

Sariel Har-Peled, Amir Nayyeri, Mohammad R. Salavatipour, Anastasios Sidiropoulos

Discret. Comput. Geom., 2016

Layouts of Expander Graphs.

Vida Dujmovic, Anastasios Sidiropoulos, David R. Wood

Chic. J. Theor. Comput. Sci., 2016

Brief Announcement: Approximating the I/O Complexity of One-Shot Red-Blue Pebbling.

Timothy Carpenter, Fabrice Rastello, P. Sadayappan, Anastasios Sidiropoulos

Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Constant-Factor Approximations for Asymmetric TSP on Nearly-Embeddable Graphs.

Dániel Marx, Ario Salmasi, Anastasios Sidiropoulos

Proceedings of the Approximation, 2016

Constant-Distortion Embeddings of Hausdorff Metrics into Constant-Dimensional l_p Spaces.

Arturs Backurs, Anastasios Sidiropoulos

Proceedings of the Approximation, 2016

2015

Metric embedding with outliers.

Anastasios Sidiropoulos, Yusu Wang

CoRR, 2015

3-Monotone Expanders.

Vida Dujmovic, Anastasios Sidiropoulos, David R. Wood

CoRR, 2015

Beyond the Euler Characteristic: Approximating the Genus of General Graphs.

Ken-ichi Kawarabayashi, Anastasios Sidiropoulos

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Computing the Fréchet Distance Between Polygons with Holes.

Amir Nayyeri, Anastasios Sidiropoulos

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014

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

Tamal K. Dey, Alfred Rossi, Anastasios Sidiropoulos

CoRR, 2014

Minimum <i>d</i>-dimensional arrangement with fixed points.

Anupam Gupta, Anastasios Sidiropoulos

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.

Dániel Marx, Anastasios Sidiropoulos

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

A near-optimal approximation algorithm for Asymmetric TSP on embedded graphs.

Jeff Erickson, Anastasios Sidiropoulos

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2013

Fat Polygonal Partitions with Applications to Visualization and Embeddings.

Mark de Berg, Krzysztof Onak, Anastasios Sidiropoulos

J. Comput. Geom., 2013

Minimum d-dimensional arrangement with fixed points.

Anupam Gupta, Anastasios Sidiropoulos

CoRR, 2013

Pathwidth, trees, and random embeddings.

James R. Lee, Anastasios Sidiropoulos

Comb., 2013

Euclidean spanners in high dimensions.

Sariel Har-Peled, Piotr Indyk, Anastasios Sidiropoulos

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Non-positive Curvature and the Planar Embedding Conjecture.

Anastasios Sidiropoulos

Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2012

Convergence and approximation in potential games.

George Christodoulou, Vahab S. Mirrokni, Anastasios Sidiropoulos

Theor. Comput. Sci., 2012

Planarizing an Unknown Surface.

Yury Makarychev, Anastasios Sidiropoulos

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012

2011

How strong is Nisanʼs pseudo-random generator?

Matei David, Periklis A. Papakonstantinou, Anastasios Sidiropoulos

Inf. Process. Lett., 2011

Near-optimal distortion bounds for embedding doubling spaces into L₁.

James R. Lee, Anastasios Sidiropoulos

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

On Graph Crossing Number and Edge Planarization.

Julia Chuzhoy, Yury Makarychev, Anastasios Sidiropoulos

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Computationally Limited Randomness.

Matei David, Phuong Nguyen, Periklis A. Papakonstantinou, Anastasios Sidiropoulos

Proceedings of the Innovations in Computer Science, 2011

2010

Undecidability and intractability results concerning datalog programs and their persistency numbers.

Stavros S. Cosmadakis, Eugénie Foustoucos, Anastasios Sidiropoulos

ACM Trans. Comput. Log., 2010

On distributing symmetric streaming computations.

Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, Zoya Svitkina

ACM Trans. Algorithms, 2010

Randomly removing g handles at once.

Glencora Borradaile, James R. Lee, Anastasios Sidiropoulos

Comput. Geom., 2010

Genus and the Geometry of the Cut Graph.

James R. Lee, Anastasios Sidiropoulos

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Inapproximability for Planar Embedding Problems.

Jeff Edmonds, Anastasios Sidiropoulos, Anastasios Zouzias

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Optimal Stochastic Planarization.

Anastasios Sidiropoulos

Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

Online Embeddings.

Piotr Indyk, Avner Magen, Anastasios Sidiropoulos, Anastasios Zouzias

Proceedings of the Approximation, 2010

2009

Polynomial Time with Restricted Use of Randomness.

Matei David, Periklis A. Papakonstantinou, Anastasios Sidiropoulos

Electron. Colloquium Comput. Complex., 2009

Streaming Embeddings with Slack.

Christiane Lammersen, Anastasios Sidiropoulos, Christian Sohler

Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

On the geometry of graphs with a forbidden minor.

James R. Lee, Anastasios Sidiropoulos

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

2008

Computational metric embeddings.

Anastasios Sidiropoulos

PhD thesis, 2008

Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics.

Noga Alon, Mihai Badoiu, Erik D. Demaine, Martin Farach-Colton, Mohammad Taghi Hajiaghayi, Anastasios Sidiropoulos

ACM Trans. Algorithms, 2008

Theory research at Google.

Gagan Aggarwal, Nir Ailon, Florin Constantin, Eyal Even-Dar, Jon Feldman, Gereon Frahling, Monika Rauch Henzinger, S. Muthukrishnan, Noam Nisan, Martin Pál, Mark Sandler, Anastasios Sidiropoulos

SIGACT News, 2008

Inapproximability for Metric Embeddings into R^d.

Jirí Matousek, Anastasios Sidiropoulos

Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

Circular partitions with applications to visualization and embeddings.

Krzysztof Onak, Anastasios Sidiropoulos

Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction.

Mihai Badoiu, Erik D. Demaine, MohammadTaghi Hajiaghayi, Anastasios Sidiropoulos, Morteza Zadimoghaddam

Proceedings of the Approximation, 2008

2007

Approximation algorithms for embedding general metrics into trees.

Mihai Badoiu, Piotr Indyk, Anastasios Sidiropoulos

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Probabilistic embeddings of bounded genus graphs into planar graphs.

Piotr Indyk, Anastasios Sidiropoulos

Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

2006

On the Complexity of Processing Massive, Unordered, Distributed Data

Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, Zoya Svitkina

CoRR, 2006

Embedding ultrametrics into low-dimensional spaces.

Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasios Sidiropoulos

Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

2005

Low-distortion embeddings of general metrics into the line.

Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasios Sidiropoulos

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Approximation algorithms for low-distortion embeddings into low-dimensional spaces.

Mihai Badoiu, Kedar Dhamdhere, Anupam Gupta, Yuri Rabinovich, Harald Räcke, R. Ravi, Anastasios Sidiropoulos

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.

Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano, Anastasios Sidiropoulos

Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003