Silvio Lattanzi

Active Learning on Adversarially Corrupted Graphs COLT 2026 Algorithmic Thinking Theory COLT 2026 Algorithms and Hardness for Active Learning on Graphs ICML 2025 Almost Optimal Fully Dynamic k-Center Clustering with Recourse ICML 2025 Deletion Robust Non-Monotone Submodular Maximization over Matroids JMLR 2025 Metric Embeddings Beyond Bi-Lipschitz Distortion via Sherali-Adams COLT 2025 A Scalable Algorithm for Individually Fair k-Means Clustering AISTATS 2024 Consistent Submodular Maximization ICML 2024 Dynamic Correlation Clustering in Sublinear Update Time ICML 2024 Margin-Based Active Learning of Classifiers JMLR 2024 Multi-View Stochastic Block Models ICML 2024 Fully Dynamic $k$-Clustering in $\tilde O(k)$ Update Time NeurIPS 2023 Fully Dynamic Submodular Maximization over Matroids ICML 2023 Multi-Swap k-Means++ NeurIPS 2023 Speeding Up Bellman Ford via Minimum Violation Permutations ICML 2023 Active Learning of Classifiers with Label and Seed Queries NeurIPS 2022 Approximate Cluster Recovery from Noisy Labels COLT 2022 Deletion Robust Submodular Maximization over Matroids ICML 2022 Efficient and Stable Fully Dynamic Facility Location NeurIPS 2022 Near-Optimal Correlation Clustering with Privacy NeurIPS 2022 Online and Consistent Correlation Clustering ICML 2022 Correlation Clustering in Constant Many Parallel Rounds ICML 2021 Efficient and Local Parallel Random Walks NeurIPS 2021 Exact Recovery of Clusters in Finite Metric Spaces Using Oracle Queries COLT 2021 Online Facility Location with Multiple Advice NeurIPS 2021 On Margin-Based Cluster Recovery with Oracle Queries NeurIPS 2021 Parallel and Efficient Hierarchical k-Median Clustering NeurIPS 2021 Robust Online Correlation Clustering NeurIPS 2021 Exact Recovery of Mangled Clusters with Same-Cluster Queries NeurIPS 2020 Fast and Accurate k-means++ via Rejection Sampling NeurIPS 2020 Fully Dynamic Algorithm for Constrained Submodular Optimization NeurIPS 2020 Online MAP Inference of Determinantal Point Processes NeurIPS 2020 Sliding Window Algorithms for k-Clustering Problems NeurIPS 2020 A Better k-means++ Algorithm via Local Search ICML 2019 Consistent Online Optimization: Convex and Submodular AISTATS 2019 Improved Parallel Algorithms for Density-Based Network Clustering ICML 2019 Matroids, Matchings, and Fairness AISTATS 2019 Submodular Streaming in All Its Glory: Tight Approximation, Minimum Memory and Low Adaptive Complexity ICML 2019 Mallows Models for Top-k Lists NeurIPS 2018 One-shot Coresets: The Case of k-Clustering AISTATS 2018 Parallel and Streaming Algorithms for K-Core Decomposition ICML 2018 Affinity Clustering: Hierarchical Clustering at Scale NeurIPS 2017 Algorithms for ℓ_p Low-Rank Approximation ICML 2017 Consistent k-Clustering ICML 2017 Fair Clustering Through Fairlets NeurIPS 2017 Community Detection on Evolving Graphs NeurIPS 2016 Distributed Balanced Clustering via Mapping Coresets NeurIPS 2014 A Local Algorithm for Finding Well-Connected Clusters ICML 2013