Morteza Monemizadeh

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Resilient k-Clustering.

[BibT_eX]

[DOI]

Sara Ahmadian

MohammadHossein Bateni

Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2024

A Dynamic Algorithm for Weighted Submodular Cover Problem.

[BibT_eX]

[DOI]

Proceedings of the Forty-first International Conference on Machine Learning, 2024

2023

Clique-Based Separators for Geometric Intersection Graphs.

[BibT_eX]

[DOI]

Algorithmica, June, 2023

Faster Query Times for Fully Dynamic k-Center Clustering with Outliers.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Dynamic Non-monotone Submodular Maximization.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Clustering in Polygonal Domains.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

k-Center Clustering with Outliers in the MPC and Streaming Model.

[BibT_eX]

[DOI]

Mark de Berg

Proceedings of the IEEE International Parallel and Distributed Processing Symposium, 2023

Dynamic Constrained Submodular Optimization with Polylogarithmic Update Time.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2023

Facility Location in the Sublinear Geometric Model.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2023

2022

Efficient Distributed Algorithms for Minimum Spanning Tree in Dense Graphs.

[BibT_eX]

[DOI]

MohammadHossein Bateni

Kees Voorintholt

Proceedings of the IEEE International Conference on Data Mining Workshops, 2022

TSP in a Simple Polygon.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

Maximum-Weight Matching in Sliding Windows and Beyond.

[BibT_eX]

[DOI]

Mark de Berg

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

k-Center Clustering with Outliers in the Sliding-Window Model.

[BibT_eX]

[DOI]

Mark de Berg

Yu Zhong

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020

Dynamic Submodular Maximization.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019

Planar graphs: Random walks and bipartiteness testing.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2019

Dynamic Maximal Independent Set.

[BibT_eX]

[DOI]

CoRR, 2019

Structural Results on Matching Estimation with Applications to Streaming.

[BibT_eX]

[DOI]

Algorithmica, 2019

2018

Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond.

[BibT_eX]

[DOI]

Vahid Liaghat

Krzysztof Onak

ACM Trans. Algorithms, 2018

2017

Prophet Secretary.

[BibT_eX]

[DOI]

Vahid Liaghat

SIAM J. Discret. Math., 2017

Streaming Algorithms for Measuring H-Impact.

[BibT_eX]

[DOI]

Priya Govindan

S. Muthukrishnan

Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2017

Testable Bounded Degree Graph Properties Are Random Order Streamable.

[BibT_eX]

[DOI]

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

The Sparse Awakens: Streaming Algorithms for Matching Size Estimation in Sparse Graphs.

[BibT_eX]

[DOI]

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

2016

Estimating Weighted Matchings in o(n) Space.

[BibT_eX]

[DOI]

Elena Grigorescu

Samson Zhou

CoRR, 2016

Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams.

[BibT_eX]

[DOI]

Rajesh Chitnis

Andrew McGregor

Sofya Vorotnikova

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Clustering Problems on Sliding Windows.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Finding Large Matchings in Semi-Streaming.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Data Mining Workshops, 2016

2015

Kernelization via Sampling with Applications to Dynamic Graph Streams.

[BibT_eX]

[DOI]

Andrew McGregor

Sofya Vorotnikova

CoRR, 2015

A Unified Approach for Clustering Problems on Sliding Windows.

[BibT_eX]

[DOI]

CoRR, 2015

Brief Announcement: New Streaming Algorithms for Parameterized Maximal Matching & Beyond.

[BibT_eX]

[DOI]

Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Parameterized Streaming: Maximal Matching and Vertex Cover.

[BibT_eX]

[DOI]

Mohammad Taghi Hajiaghayi

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Clustering on Sliding Windows in Polylogarithmic Space.

[BibT_eX]

[DOI]

Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

2014

Parameterized Streaming Algorithms for Vertex Cover.

[BibT_eX]

[DOI]

Mohammad Taghi Hajiaghayi

CoRR, 2014

2013

(1+ Є)-approximation for facility location in data streams.

[BibT_eX]

[DOI]

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

2011

Non-uniform Sampling in Clustering and Streaming.

[BibT_eX]

[DOI]

PhD thesis, 2011

2010

1-Pass Relative-Error L<sub>p</sub>-Sampling with Applications.

[BibT_eX]

[DOI]

David P. Woodruff

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

Coresets and Sketches for High Dimensional Subspace Approximation Problems.

[BibT_eX]

[DOI]

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

2007

A PTAS for k-means clustering based on weak coresets.

[BibT_eX]

[DOI]

Dan Feldman