Mohit Garg

Mohit Garg

Reader
Theoretical Computer Science
+91 44 2254 3255
mohitgarg @ imsc . res . in
NB 405
Research Interests: 
  • Algorithms and Complexity
Education: 
  • BTech, Computer Science and Engineering, 2008
  • MS and PhD, 2016
Career History: 
  • Visiting Fellow, TIFR (2016)
  • Postdoctoral Fellow, Tokyo Institute of Technology (2016–2017)
  • Postdoctoral Fellow, RIMS, Kyoto University (2017)
  • Postdoctoral Fellow, Open University of Israel (2017–2019)
  • Researcher, IDSIA, USI-SUPSI (2019–2021)
  • Senior Researcher, University of Bremen (2021–2022)
  • Senior Researcher, University of Hamburg (2021–2022)
  • Research Associate, IISc (2023–2025)
  • Reader, IMSc (2026–)
Courses Taught: 
  • Theory of Computation
  • Data Structures and Algorithms
Selected publications: 

(Complete list at DBLP)

  • Mohit Garg, Aditya Subramanian: Online Connectivity Augmentation. SODA 2026: 85-104
  • Miguel Bosch-Calvo, Mohit Garg, Fabrizio Grandoni, Felix Hommelsheim, Afrouz Jabal Ameli, Alexander Lindermayr: A 5/4-Approximation for Two-Edge Connectivity. STOC 2025: 653-664
  • Mohit Garg, N. Raja, Suneel Sarswat, Abhishek Kr Singh: Double Auctions: Formalization and Automated Checkers. J. Autom. Reason. 69(3): 17 (2025)
  • Mohit Garg, Debajyoti Kar, Arindam Khan: Random-Order Online Independent Set of Intervals and Hyperrectangles. ESA 2024: 58:1-58:18
  • Mohit Garg, Felix Hommelsheim, Nicole Megow: Matching Augmentation via Simultaneous Contractions. ICALP 2023: 65:1-65:17
  • Niv Buchbinder, Moran Feldman, Mohit Garg: Deterministic (1/2 + ε)-Approximation for Submodular Maximization over a Matroid. SIAM J. Comput. 52(4): 945-967 (2023)
  • Mohit Garg, Suneel Sarswat: The Design and Regulation of Exchanges: A Formal Approach. FSTTCS 2022: 39:1-39:21
  • Niv Buchbinder, Moran Feldman, Yuval Filmus, Mohit Garg: Online submodular maximization: beating 1/2 made simple. Math. Program. 183(1): 149-169 (2020)
  • Christian Engels, Mohit Garg, Kazuhisa Makino, Anup Rao: On Expressing Majority as a Majority of Majorities. SIAM J. Discret. Math. 34(1): 730-741 (2020)
  • Mohit Garg, Jaikumar Radhakrishnan: Set membership with a few bit probes. SODA 2015: 776-784