Slobodan Mitrovic
15 papers · 2017–2025 · 3 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓+6 more ↓ Show less ↑
πΊοΈ Taxonomy Completionist (18) π Academic Marathon Β· Sprint π Conference Polyglot Β· Bronze π Interdisciplinary Bridge Β· Silver π£ Hot Topic Early Bird
π§¬
Topic Evolution
π
Keyword Champion
(2)
ποΈ
Keyword Collector
(65)
π
Century Club Β· Bronze
π₯
Unstoppable Β· Bronze
π
Renaissance Researcher
(5)
Venues
Top co-authors
Research topics
Keywords
streaming algorithm
(4)
submodular maximization
(4)
correlation clustering
(4)
approximation algorithm
(4)
cardinality constraint
(4)
data summarization
(2)
privacy guarantee
(2)
differential privacy
(2)
densest subgraph
(2)
massively parallel computation
(2)
dynamic algorithm
(2)
approximation guarantee
(2)
empirical evaluation
(1)
graph sparsification
(1)
community detection
(1)
non-convex optimization
(1)
unsupervised learning
(1)
directed graph
(1)
representative selection
(1)
structured sparsity
(1)
Papers
Breaking the $n^1.5$ Additive Error Barrier for Private and Efficient Graph Sparsification via Private Expander Decomposition
ICML 2025
Sparse-pivot: Dynamic correlation clustering for node insertions
ICML 2025
Faster Streaming and Scalable Algorithms for Finding Directed Dense Subgraphs in Large Graphs
ICML 2024
Pruned Pivot: Correlation Clustering Algorithm for Dynamic, Parallel, and Local Computation Models
ICML 2024
Nearly Tight Bounds For Differentially Private Multiway Cut
NeurIPS 2023
Near-Optimal Correlation Clustering with Privacy
NeurIPS 2022
Online Page Migration with ML Advice
AISTATS 2022
Correlation Clustering in Constant Many Parallel Rounds
ICML 2021
Fairness in Streaming Submodular Maximization: Algorithms and Hardness
NeurIPS 2020
Fully Dynamic Algorithm for Constrained Submodular Optimization
NeurIPS 2020
Improved Parallel Algorithms for Density-Based Network Clustering
ICML 2019
A Fast Algorithm for Separated Sparsity via Perturbed Lagrangians
AISTATS 2018
Beyond 1/2-Approximation for Submodular Maximization on Massive Data Streams
ICML 2018
Robust Submodular Maximization: A Non-Uniform Partitioning Approach
ICML 2017
Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach
NeurIPS 2017