We stand with Ukraine  

Mohit Garg

Orcid: 0000-0003-1230-4821

Affiliations:
  • Indian Institute of Science, Bengaluru, India
  • University of Bremen, Germany (former)
  • University of Hamburg, Germany (former)
  • Dalle Molle Institute for Artificial Intelligence, Lugano, Switzerland (former)
  • Open University of Israel, Ra'anana, Israel (former)
  • Research Institute for Mathematical Sciences, Kyoto University, Japan (former)
  • Tokyo Institute of Technology, Japan (former)
  • Tata Institute of Fundamental Research, Mumbai, India (former)


According to our database1, Mohit Garg authored at least 12 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The Exchange Problem.
[BibTeX]
[DOI]
Mohit Garg
,
Suneel Sarswat
CoRR, 2024

Random-Order Online Interval Scheduling and Geometric Generalizations.
[BibTeX]
[DOI]
Mohit Garg
,
Debajyoti Kar
,
Arindam Khan
CoRR, 2024

2023
Deterministic (1/2 + ε)-Approximation for Submodular Maximization over a Matroid.
[BibTeX]
[DOI]
Niv Buchbinder
,
Moran Feldman
,
Mohit Garg
SIAM J. Comput., August, 2023

Improved Approximation for Two-Edge-Connectivity.
[BibTeX]
[DOI]
Mohit Garg
,
Fabrizio Grandoni
,
Afrouz Jabal Ameli
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Matching Augmentation via Simultaneous Contractions.
[BibTeX]
[DOI]
Mohit Garg
,
Felix Hommelsheim
,
Nicole Megow
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022
The Design and Regulation of Exchanges: A Formal Approach.
[BibTeX]
[DOI]
Mohit Garg
,
Suneel Sarswat
Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

2020
On Expressing Majority as a Majority of Majorities.
[BibTeX]
[DOI]
Christian Engels
,
Mohit Garg
,
Kazuhisa Makino
,
Anup Rao
SIAM J. Discret. Math., 2020

Online submodular maximization: beating 1/2 made simple.
[BibTeX]
[DOI]
Niv Buchbinder
,
Moran Feldman
,
Yuval Filmus
,
Mohit Garg
Math. Program., 2020

2019
Deterministic (½ + ε)-Approximation for Submodular Maximization over a Matroid.
[BibTeX]
[DOI]
Niv Buchbinder
,
Moran Feldman
,
Mohit Garg
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018
Online Submodular Maximization: Beating 1/2 Made Simple.
[BibTeX]
[DOI]
Niv Buchbinder
,
Moran Feldman
,
Mohit Garg
CoRR, 2018

2017
Set Membership with Non-Adaptive Bit Probes.
[BibTeX]
[DOI]
Mohit Garg
,
Jaikumar Radhakrishnan
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

2015
Set membership with a few bit probes.
[BibTeX]
[DOI]
Mohit Garg
,
Jaikumar Radhakrishnan
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015


  Loading...