![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Jai Moondra
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
- [j4]A. Dileep, Jai Moondra, Amitabha Tripathi:
On Disjunctive Rado Numbers for Some Sets of Equations. Electron. J. Comb. 31(1) (2024) - 2023
- [j3]Jai Moondra
, Aditya Sahdev
, Amitabha Tripathi:
Exact and approximate results on the least size of a graph with a given degree set. Discret. Appl. Math. 333: 32-42 (2023) - [j2]Reuben Tate
, Jai Moondra
, Bryan Gard
, Greg Mohler
, Swati Gupta
:
Warm-Started QAOA with Custom Mixers Provably Converges and Computationally Beats Goemans-Williamson's Max-Cut at Low Circuit Depths. Quantum 7: 1121 (2023) - 2022
- [j1]A. Dileep, Jai Moondra, Amitabha Tripathi
:
New Proofs for the Disjunctive Rado Number of the Equations x1-x2=a and x1-x2=b. Graphs Comb. 38(2): 38 (2022)
Conference and Workshop Papers
- 2023
- [c2]Swati Gupta
, Jai Moondra
, Mohit Singh
:
Which Lp norm is the fairest? Approximations for fair facility location across all "p". EC 2023: 817 - 2021
- [c1]Jai Moondra, Hassan Mortagy, Swati Gupta:
Reusing Combinatorial Structure: Faster Iterative Projections over Submodular Base Polytopes. NeurIPS 2021: 25386-25399
Informal and Other Publications
- 2024
- [i6]Jai Moondra, Phillip C. Lotshaw, Greg Mohler, Swati Gupta:
Promise of Graph Sparsification and Decomposition for Noise Reduction in QAOA: Analysis for Trapped-Ion Compilations. CoRR abs/2406.14330 (2024) - 2023
- [i5]Swati Gupta, Jai Moondra, Mohit Singh:
Balancing Notions of Equity: Approximation Algorithms for Fair Portfolio of Solutions in Combinatorial Optimization. CoRR abs/2311.03230 (2023) - 2022
- [i4]Majid Farhadi, Jai Moondra, Prasad Tetali, Alejandro Toriello:
Multi Purpose Routing: New Perspectives and Approximation Algorithms. CoRR abs/2208.04410 (2022) - [i3]Swati Gupta, Jai Moondra, Mohit Singh:
Socially Fair and Hierarchical Facility Location Problems. CoRR abs/2211.14873 (2022) - 2021
- [i2]Jai Moondra, Hassan Mortagy, Swati Gupta:
Reusing Combinatorial Structure: Faster Iterative Projections over Submodular Base Polytopes. CoRR abs/2106.11943 (2021) - 2020
- [i1]Joel Rajakumar, Jai Moondra, Swati Gupta, Creston D. Herold:
Generating Target Graph Couplings for QAOA from Native Quantum Hardware Couplings. CoRR abs/2011.08165 (2020)
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-07-25 19:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint