Silvio Lattanzi
46 papers · 2013–2025 · 5 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+14 more ↓ Show less ↑
π Conference Polyglot (5) πΊοΈ Taxonomy Completionist (11) π Interdisciplinary Bridge π§ Keyword Pioneer π Academic Marathon (12)
πΊοΈ
Taxonomy Completionist
(11)
π
Academic Marathon
(12)
π§
Keyword Pioneer
π
Conference Loyalist
(20)
π¬
Deep Specialist
(24)
π§¬
Topic Evolution
π
Keyword Champion
(3)
π€
Dynamic Duo
(11)
π
Trend Setter
ποΈ
Keyword Collector
(138)
β‘
Prolific Year
(6)
π
Century Club
(46)
π₯
Unstoppable
(10)
π
Conference Pioneer
Conferences
NIPS (20)
ICML (17)
AISTATS (4)
COLT (3)
JMLR (2)
Top co-authors
Research topics
Keywords
approximation algorithm
(13)
k-means clustering
(6)
streaming algorithm
(5)
clustering algorithm
(5)
correlation clustering
(4)
data summarization
(4)
online algorithm
(4)
matroid constraint
(4)
cluster recovery
(4)
graph clustering
(3)
submodular maximization
(3)
k-median clustering
(3)
metric space
(3)
dynamic algorithm
(3)
graph algorithm
(3)
parallel algorithm
(3)
active learning
(3)
distributed algorithm
(3)
exact recovery
(2)
online clustering
(2)
Papers
Metric Embeddings Beyond Bi-Lipschitz Distortion via Sherali-Adams
COLT 2025
Deletion Robust Non-Monotone Submodular Maximization over Matroids
JMLR 2025
Algorithms and Hardness for Active Learning on Graphs
ICML 2025
Almost Optimal Fully Dynamic $k$-Center Clustering with Recourse
ICML 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
NIPS 2023
Multi-Swap k-Means++
NIPS 2023
Fully Dynamic Submodular Maximization over Matroids
ICML 2023
Speeding Up Bellman Ford via Minimum Violation Permutations
ICML 2023
Online and Consistent Correlation Clustering
ICML 2022
Approximate Cluster Recovery from Noisy Labels
COLT 2022
Efficient and Stable Fully Dynamic Facility Location
NIPS 2022
Active Learning of Classifiers with Label and Seed Queries
NIPS 2022
Near-Optimal Correlation Clustering with Privacy
NIPS 2022
Deletion Robust Submodular Maximization over Matroids
ICML 2022
Efficient and Local Parallel Random Walks
NIPS 2021
On Margin-Based Cluster Recovery with Oracle Queries
NIPS 2021
Exact Recovery of Clusters in Finite Metric Spaces Using Oracle Queries
COLT 2021
Correlation Clustering in Constant Many Parallel Rounds
ICML 2021
Online Facility Location with Multiple Advice
NIPS 2021
Robust Online Correlation Clustering
NIPS 2021
Parallel and Efficient Hierarchical k-Median Clustering
NIPS 2021
Sliding Window Algorithms for k-Clustering Problems
NIPS 2020
Exact Recovery of Mangled Clusters with Same-Cluster Queries
NIPS 2020
Fast and Accurate $k$-means++ via Rejection Sampling
NIPS 2020
Online MAP Inference of Determinantal Point Processes
NIPS 2020
Fully Dynamic Algorithm for Constrained Submodular Optimization
NIPS 2020
Consistent Online Optimization: Convex and Submodular
AISTATS 2019
Improved Parallel Algorithms for Density-Based Network Clustering
ICML 2019
Submodular Streaming in All Its Glory: Tight Approximation, Minimum Memory and Low Adaptive Complexity
ICML 2019
A Better k-means++ Algorithm via Local Search
ICML 2019
Matroids, Matchings, and Fairness
AISTATS 2019
One-shot Coresets: The Case of k-Clustering
AISTATS 2018
Parallel and Streaming Algorithms for K-Core Decomposition
ICML 2018
Mallows Models for Top-k Lists
NIPS 2018
Fair Clustering Through Fairlets
NIPS 2017
Affinity Clustering: Hierarchical Clustering at Scale
NIPS 2017
Consistent k-Clustering
ICML 2017
Algorithms for $\ell_p$ Low-Rank Approximation
ICML 2017
Community Detection on Evolving Graphs
NIPS 2016
Distributed Balanced Clustering via Mapping Coresets
NIPS 2014
A Local Algorithm for Finding Well-Connected Clusters
ICML 2013