default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMohit Garg 0003
Person information
- affiliation: Indian Institute of Science, Bengaluru, India
- affiliation (former): University of Bremen, Germany
- affiliation (former): University of Hamburg, Germany
- affiliation (former): Dalle Molle Institute for Artificial Intelligence, Lugano, Switzerland
- affiliation (former): Open University of Israel, Ra'anana, Israel
- affiliation (former): Research Institute for Mathematical Sciences, Kyoto University, Japan
- affiliation (former): Tokyo Institute of Technology, Japan
- affiliation (former): Tata Institute of Fundamental Research, Mumbai, India
Other persons with the same name
- Mohit Garg — disambiguation page
- Mohit Garg 0001 — La Trobe University, Victoria, Australia
- Mohit Garg 0002 — IIT Bombay, India
- Mohit Garg 0004
![[0000-0002-1164-6726]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-1164-6726")
— Trinity College, Dublin, Ireland - Mohit Garg 0005 — Virginia Tech, VA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c9]Mohit Garg, Debajyoti Kar, Arindam Khan:
Random-Order Online Independent Set of Intervals and Hyperrectangles. ESA 2024: 58:1-58:18- [c8]Mohit Garg, Suneel Sarswat:
Efficient and Verified Continuous Double Auctions. LPAR Complementary Volume 2024: 1-13 - [i12]Mohit Garg, Debajyoti Kar, Arindam Khan:
Random-Order Online Interval Scheduling and Geometric Generalizations. CoRR abs/2402.14201 (2024) - [i11]Mohit Garg, Suneel Sarswat:
The Exchange Problem. CoRR abs/2403.03046 (2024) - [i10]Mohit Garg, Felix Hommelsheim, Alexander Lindermayr:
Two-Edge Connectivity via Pac-Man Gluing. CoRR abs/2408.05282 (2024) - [i9]Mohit Garg, N. Raja, Suneel Sarswat, Abhishek Kr Singh:
Double Auctions: Formalization and Automated Checkers. CoRR abs/2410.18751 (2024) - 2023
- [j3]Niv Buchbinder, Moran Feldman, Mohit Garg:
Deterministic (1/2 + ε)-Approximation for Submodular Maximization over a Matroid. SIAM J. Comput. 52(4): 945-967 (2023) - [c7]Mohit Garg, Felix Hommelsheim, Nicole Megow:
Matching Augmentation via Simultaneous Contractions. ICALP 2023: 65:1-65:17 - [c6]Mohit Garg, Fabrizio Grandoni, Afrouz Jabal Ameli:
Improved Approximation for Two-Edge-Connectivity. SODA 2023: 2368-2410 - 2022
- [c5]Mohit Garg, Suneel Sarswat:
The Design and Regulation of Exchanges: A Formal Approach. FSTTCS 2022: 39:1-39:21 - [i8]Mohit Garg, Fabrizio Grandoni, Afrouz Jabal Ameli:
Improved Approximation for Two-Edge-Connectivity. CoRR abs/2209.10265 (2022) - [i7]Mohit Garg, Suneel Sarswat:
The Design and Regulation of Exchanges: A Formal Approach. CoRR abs/2210.05447 (2022) - [i6]Mohit Garg, Felix Hommelsheim, Nicole Megow:
Matching Augmentation via Simultaneous Contractions. CoRR abs/2211.01912 (2022) - 2020
- [j2]Niv Buchbinder, Moran Feldman, Yuval Filmus, Mohit Garg:
Online submodular maximization: beating 1/2 made simple. Math. Program. 183(1): 149-169 (2020) - [j1]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)
2010 – 2019
- 2019
- [c4]Niv Buchbinder, Moran Feldman, Yuval Filmus, Mohit Garg:
Online Submodular Maximization: Beating 1/2 Made Simple. IPCO 2019: 101-114 - [c3]Niv Buchbinder, Moran Feldman, Mohit Garg:
Deterministic (½ + ε)-Approximation for Submodular Maximization over a Matroid. SODA 2019: 241-254 - 2018
- [i5]Niv Buchbinder, Moran Feldman, Mohit Garg:
Online Submodular Maximization: Beating 1/2 Made Simple. CoRR abs/1807.05529 (2018) - [i4]Niv Buchbinder, Moran Feldman, Mohit Garg:
Deterministic (1/2 + ε)-Approximation for Submodular Maximization over a Matroid. CoRR abs/1807.05532 (2018) - 2017
- [c2]Mohit Garg, Jaikumar Radhakrishnan:
Set Membership with Non-Adaptive Bit Probes. STACS 2017: 38:1-38:13 - [i3]Christian Engels, Mohit Garg, Kazuhisa Makino, Anup Rao:
On Expressing Majority as a Majority of Majorities. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [i2]Mohit Garg, Jaikumar Radhakrishnan:
Set membership with non-adaptive bit probes. CoRR abs/1612.09388 (2016) - 2015
- [c1]Mohit Garg, Jaikumar Radhakrishnan:
Set membership with a few bit probes. SODA 2015: 776-784 - [i1]Mohit Garg, Jaikumar Radhakrishnan:
Set Membership with a Few Bit Probes. CoRR abs/1504.02035 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-28 21:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
