Homometric sets in trees. - Radoslav Fulek; Slobodan Mitrovic (Eur. J. Comb., 2014)

On the Resiliency of Randomized Routing Against Multiple Edge Failures. - Marco Chiesa; Andrei V. Gurtov; Aleksander Madry; Slobodan Mitrovic; Ilya Nikolaevskiy; Michael Schapira; Scott Shenker (ICALP, 2016)

The quest for resilient (static) forwarding tables. - Marco Chiesa; Ilya Nikolaevskiy; Slobodan Mitrovic; Aurojit Panda; Andrei V. Gurtov; Aleksander Madry; Michael Schapira; Scott Shenker (INFOCOM, 2016)

A distributed algorithm for partitioned robust submodular maximization. - Ilija Bogunovic; Slobodan Mitrovic; Jonathan Scarlett; Volkan Cevher (CAMSAP, 2017)

Robust Submodular Maximization: A Non-Uniform Partitioning Approach. - Ilija Bogunovic; Slobodan Mitrovic; Jonathan Scarlett; Volkan Cevher (ICML, 2017)

Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach. - Slobodan Mitrovic; Ilija Bogunovic; Ashkan Norouzi-Fard; Jakub Tarnawski; Volkan Cevher (NIPS, 2017)

On the Resiliency of Static Forwarding Tables. - Marco Chiesa; Ilya Nikolaevskiy; Slobodan Mitrovic; Andrei V. Gurtov; Aleksander Madry; Michael Schapira; Scott Shenker (IEEE/ACM Trans. Netw., 2017)

A Fast Algorithm for Separated Sparsity via Perturbed Lagrangians. - Aleksander Madry; Slobodan Mitrovic; Ludwig Schmidt (AISTATS, 2018)

Beyond 1/2-Approximation for Submodular Maximization on Massive Data Streams. - Ashkan Norouzi-Fard; Jakub Tarnawski; Slobodan Mitrovic; Amir Zandieh; Aidasadat Mousavifar; Ola Svensson (ICML, 2018)

Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover. - Mohsen Ghaffari 001; Themis Gouleakis; Christian Konrad 001; Slobodan Mitrovic; Ronitt Rubinfeld (PODC, 2018)

Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover. - Mohsen Ghaffari 001; Themis Gouleakis; Slobodan Mitrovic; Ronitt Rubinfeld (CoRR, 2018)

When Stuck, Flip a Coin - New Algorithms for Large-Scale Tasks. - Slobodan Mitrovic (2018)

Improved Parallel Algorithms for Density-Based Network Clustering. - Mohsen Ghaffari 001; Silvio Lattanzi; Slobodan Mitrovic (ICML, 2019)

Adversarially Robust Submodular Maximization under Knapsack Constraints. - Dmitrii Avdiukhin; Slobodan Mitrovic; Grigory Yaroslavtsev; Samson Zhou (KDD, 2019)

Weighted Matchings via Unweighted Augmentations. - Buddhima Gamlath; Sagar Kale; Slobodan Mitrovic; Ola Svensson (PODC, 2019)

Identifying Maximal Non-Redundant Integer Cone Generators. - Slobodan Mitrovic; Ruzica Piskac; Viktor Kuncak (CoRR, 2019)

Fairness in Streaming Submodular Maximization: Algorithms and Hardness. - Marwa El Halabi; Slobodan Mitrovic; Ashkan Norouzi-Fard; Jakab Tardos; Jakub Tarnawski (NeurIPS, 2020)

Fully Dynamic Algorithm for Constrained Submodular Optimization. - Silvio Lattanzi; Slobodan Mitrovic; Ashkan Norouzi-Fard; Jakub Tarnawski; Morteza Zadimoghaddam (NeurIPS, 2020)

Improved Local Computation Algorithm for Set Cover via Sparsification. - Christoph Grunau; Slobodan Mitrovic; Ronitt Rubinfeld; Ali Vakilian (SODA, 2020)

Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples. - Michael Kapralov; Slobodan Mitrovic; Ashkan Norouzi-Fard; Jakab Tardos (SODA, 2020)

Walking randomly, massively, and efficiently. - Jakub Lacki; Slobodan Mitrovic; Krzysztof Onak; Piotr Sankowski (STOC, 2020)

Parallel Algorithms for Small Subgraph Counting. - Amartya Shankha Biswas; Talya Eden; Quanquan C. Liu; Slobodan Mitrovic; Ronitt Rubinfeld (CoRR, 2020)

Round Compression for Parallel Matching Algorithms. - Artur Czumaj; Jakub Lacki; Aleksander Madry; Slobodan Mitrovic; Krzysztof Onak; Piotr Sankowski (SIAM J. Comput., 2020)

Correlation Clustering in Constant Many Parallel Rounds. - Vincent Cohen-Addad; Silvio Lattanzi; Slobodan Mitrovic; Ashkan Norouzi-Fard; Nikos Parotsidis; Jakub Tarnawski (ICML, 2021)

Massively Parallel Algorithms for Distance Approximation and Spanners. - Amartya Shankha Biswas; Michal Dory; Mohsen Ghaffari 001; Slobodan Mitrovic; Yasamin Nazari (SPAA, 2021)

Deterministic (1+ε)-Approximate Maximum Matching with poly(1/ε) Passes in the Semi-Streaming Model. - Manuela Fischer; Slobodan Mitrovic; Jara Uitto (CoRR, 2021)

Online Page Migration with ML Advice. - Piotr Indyk; Frederik Mallmann-Trenn; Slobodan Mitrovic; Ronitt Rubinfeld (AISTATS, 2022)

Massively Parallel Algorithms for Small Subgraph Counting. - Amartya Shankha Biswas; Talya Eden; Quanquan C. Liu; Ronitt Rubinfeld; Slobodan Mitrovic (APPROX/RANDOM, 2022)

Near-Optimal Correlation Clustering with Privacy. - Vincent Cohen-Addad; Chenglin Fan; Silvio Lattanzi; Slobodan Mitrovic; Ashkan Norouzi-Fard; Nikos Parotsidis; Jakub Tarnawski (NeurIPS, 2022)

Massively Parallel Algorithms for b-Matching. - Mohsen Ghaffari 001; Christoph Grunau; Slobodan Mitrovic (SPAA, 2022)

Deterministic (1+ε)-approximate maximum matching with poly(1/ε) passes in the semi-streaming model and beyond. - Manuela Fischer; Slobodan Mitrovic; Jara Uitto (STOC, 2022)

Nearly Tight Bounds For Differentially Private Multiway Cut. - Mina Dalirrooyfard; Slobodan Mitrovic; Yuriy Nevmyvaka (NeurIPS, 2023)

Nearly Tight Bounds For Differentially Private Min s-t and Multiway Cut. - Mina Dalirrooyfard; Slobodan Mitrovic; Yuriy Nevmyvaka (CoRR, 2023)

Locally Computing Edge Orientations. - Slobodan Mitrovic; Ronitt Rubinfeld; Mihir Singhal (ESA, 2024)

Dynamic PageRank: Algorithms and Lower Bounds. - Rajesh Jayaram; Jakub Lacki; Slobodan Mitrovic; Krzysztof Onak; Piotr Sankowski (ICALP, 2024)

Pruned Pivot: Correlation Clustering Algorithm for Dynamic, Parallel, and Local Computation Models. - Mina Dalirrooyfard; Konstantin Makarychev; Slobodan Mitrovic (ICML, 2024)

Faster Streaming and Scalable Algorithms for Finding Directed Dense Subgraphs in Large Graphs. - Slobodan Mitrovic; Theodore Pan (ICML, 2024)

Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling. - Laxman Dhulipala; Michael Dinitz; Jakub Lacki; Slobodan Mitrovic (DISC, 2024)

Differentially Private Gomory-Hu Trees. - Anders Aamand; Justin Y. Chen; Mina Dalirrooyfard; Slobodan Mitrovic; Yuriy Nevmyvaka; Sandeep Silwal; Yinzhan Xu (CoRR, 2024)

Approximate counting of permutation patterns. - Omri Ben-Eliezer; Slobodan Mitrovic; Pranjal Srivastava (CoRR, 2024)

New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling. - Spencer Compton; Slobodan Mitrovic; Ronitt Rubinfeld (Algorithmica, 2024)

Faster Semi-Streaming Matchings via Alternating Trees. - Slobodan Mitrovic; Anish Mukherjee 001; Piotr Sankowski; Wen-Horng Sheu (ICALP, 2025)

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs. - Jakub Lacki; Slobodan Mitrovic; Srikkanth Ramachandran; Wen-Horng Sheu (SPAA, 2025)

A framework for boosting matching approximation: parallel, distributed, and dynamic. - Slobodan Mitrovic; Wen-Horng Sheu (SPAA, 2025)

SPARSE-PIVOT: Dynamic correlation clustering for node insertions. - Mina Dalirrooyfard; Konstantin Makarychev; Slobodan Mitrovic (CoRR, 2025)

Breaking the n1.5 Additive Error Barrier for Private and Efficient Graph Sparsification via Private Expander Decomposition. - Anders Aamand; Justin Y. Chen; Mina Dalirrooyfard; Slobodan Mitrovic; Yuriy Nevmyvaka; Sandeep Silwal; Yinzhan Xu (CoRR, 2025)