Slobodan Mitrović

From MaRDI portal
Person:2509752

Available identifiers

zbMath Open mitrovic.slobodanMaRDI QIDQ2509752

List of research outcomes





PublicationDate of PublicationType
New partitioning techniques and faster algorithms for approximate interval scheduling2024-11-14Paper
New partitioning techniques and faster algorithms for approximate interval scheduling2024-10-07Paper
Massively parallel algorithms for small subgraph counting2024-08-22Paper
Deterministic (1+ 𝜀 )-approximate maximum matching with poly(1/ 𝜀 ) passes in the semi-streaming model and beyond2023-12-08Paper
Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples2021-02-02Paper
Improved Local Computation Algorithm for Set Cover via Sparsification2021-02-02Paper
Weighted Matchings via Unweighted Augmentations2021-01-20Paper
Walking randomly, massively, and efficiently2021-01-19Paper
Round Compression for Parallel Matching Algorithms2020-10-29Paper
Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover2019-09-19Paper
Round compression for parallel matching algorithms2019-08-22Paper
On the Resiliency of Randomized Routing Against Multiple Edge Failures2017-12-19Paper
Homometric sets in trees2014-07-29Paper
https://portal.mardi4nfdi.de/entity/Q31170452012-02-16Paper

Research outcomes over time

This page was built for person: Slobodan Mitrović

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:2509752&oldid=6259628"
Powered by MediaWiki