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 15 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
Two-Edge Connectivity via Pac-Man Gluing.
CoRR, 2024

The Exchange Problem.
CoRR, 2024

Random-Order Online Interval Scheduling and Geometric Generalizations.
CoRR, 2024

Efficient and Verified Continuous Double Auctions.
Proceedings of the LPAR 2024 Complementary Volume, Port Louis, Mauritius, May 26-31, 2024, 2024

Random-Order Online Independent Set of Intervals and Hyperrectangles.
Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

2023
Deterministic (1/2 + ε)-Approximation for Submodular Maximization over a Matroid.
SIAM J. Comput., August, 2023

Improved Approximation for Two-Edge-Connectivity.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Matching Augmentation via Simultaneous Contractions.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022
The Design and Regulation of Exchanges: A Formal Approach.
Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

2020
Online submodular maximization: beating 1/2 made simple.
Math. Program., 2020

2019
Deterministic (½ + ε)-Approximation for Submodular Maximization over a Matroid.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018
Online Submodular Maximization: Beating 1/2 Made Simple.
CoRR, 2018

2017
On Expressing Majority as a Majority of Majorities.
Electron. Colloquium Comput. Complex., 2017

Set Membership with Non-Adaptive Bit Probes.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

2015
Set membership with a few bit probes.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015


  Loading...