Slobodan Mitrović
Scholar

Slobodan Mitrović

Google Scholar ID: O62Q1t0AAAAJ
UC Davis
Distributed graph algorithms. Streaming graph algorithms. Combinatorial optimization. Fast graph algorithms.
Citations & Impact
All-time
Citations
1,105
 
H-index
19
 
i10-index
24
 
Publications
20
 
Co-authors
64
list available
Resume (English only)
Academic Achievements
  • Publications: Multiple papers published in SODA 2026, SOSA 2026, NeurIPS 2025, SPAA 2025, ICML 2025, etc.; Supported by the National Science Foundation (NSF) Faculty Early Career Development Program (CAREER) and Google Research Scholar Program.
Research Experience
  • Current: Assistant Professor in the Department of Computer Science at UC Davis; Guest Professor in the Department of Mathematics and Informatics at the University of Novi Sad; Former: Postdoctoral Fellow at the Theory of Computation group, CSAIL, MIT; Two-month research stay at ETH, hosted by Mohsen Ghaffari.
Education
  • PhD: École Polytechnique Fédérale de Lausanne (EPFL), advised by Aleksander Mądry; Postdoctoral Fellow: Massachusetts Institute of Technology (MIT), hosted by Ronitt Rubinfeld.
Background
  • Research interests: Algorithmic graph theory and combinatorial optimization. Focuses on designing efficient algorithms in the context of memory-constrained computation, such as parallel, distributed, streaming, and local computation.
Miscellany
  • Organizer: Aggie Competitive Programming Contest (ACPC); Program Committees: STOC 2026, ICALP 2025, SOSA 2025, SAND 2023, STOC 2023, ICALP 2022, SWAT 2022.