default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSharat Ibrahimpur
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]Ishan Bansal, Joseph Cheriyan, Logan Grout, Sharat Ibrahimpur:
Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions. Algorithmica 86(8): 2575-2604 (2024)- [j2]Sylvia C. Boyd, Joseph Cheriyan
, Arash Haddadan, Sharat Ibrahimpur:
Approximation algorithms for flexible graph connectivity. Math. Program. 204(1): 493-516 (2024) - 2023
- [c10]Ishan Bansal, Joe Cheriyan, Logan Grout, Sharat Ibrahimpur:
Algorithms for 2-Connected Network Design and Flexible Steiner Trees with a Constant Number of Terminals. APPROX/RANDOM 2023: 14:1-14:14 - [c9]Ishan Bansal, Joseph Cheriyan, Logan Grout, Sharat Ibrahimpur:
Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions. ICALP 2023: 15:1-15:19 - [c8]Sharat Ibrahimpur, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang:
Efficient Caching with Reserves via Marking. ICALP 2023: 80:1-80:20 - [i11]Sharat Ibrahimpur, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang:
Efficient Caching with Reserves via Marking. CoRR abs/2305.02508 (2023) - 2022
- [j1]Sylvia C. Boyd, Joseph Cheriyan, Robert Cummings, Logan Grout, Sharat Ibrahimpur, Zoltán Szigeti, Lu Wang:
A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case. SIAM J. Discret. Math. 36(3): 1730-1747 (2022) - [c7]Sharat Ibrahimpur, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang:
Caching with Reserves. APPROX/RANDOM 2022: 52:1-52:16 - [c6]Sharat Ibrahimpur, Chaitanya Swamy:
A Simple Approximation Algorithm for Vector Scheduling and Applications to Stochastic Min-Norm Load Balancing. SOSA 2022: 247-256 - [i10]Sylvia C. Boyd, Joseph Cheriyan, Arash Haddadan, Sharat Ibrahimpur:
Approximation Algorithms for Flexible Graph Connectivity. CoRR abs/2202.13298 (2022) - [i9]Ishan Bansal, Joe Cheriyan, Logan Grout, Sharat Ibrahimpur:
Algorithms for 2-connected network design and flexible Steiner trees with a constant number of terminals. CoRR abs/2206.11807 (2022) - [i8]Sharat Ibrahimpur, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang:
Caching with Reserves. CoRR abs/2207.05975 (2022) - [i7]Ishan Bansal, Joseph Cheriyan, Logan Grout, Sharat Ibrahimpur:
Approximating (p, 2) flexible graph connectivity via the primal-dual method. CoRR abs/2209.11209 (2022) - [i6]Ishan Bansal, Joseph Cheriyan, Logan Grout, Sharat Ibrahimpur:
Extensions of the (p, q)-Flexible-Graph-Connectivity model. CoRR abs/2211.09747 (2022) - 2021
- [c5]Sylvia C. Boyd, Joseph Cheriyan, Arash Haddadan, Sharat Ibrahimpur:
Approximation Algorithms for Flexible Graph Connectivity. FSTTCS 2021: 9:1-9:14 - [c4]Sharat Ibrahimpur, Chaitanya Swamy:
Minimum-Norm Load Balancing Is (Almost) as Easy as Minimizing Makespan. ICALP 2021: 81:1-81:20 - [i5]Sylvia C. Boyd, Joseph Cheriyan, Arash Haddadan, Sharat Ibrahimpur:
A 2-Approximation Algorithm for Flexible Graph Connectivity. CoRR abs/2102.03304 (2021) - [i4]Sharat Ibrahimpur, Chaitanya Swamy:
A Simple Approximation Algorithm for Vector Scheduling and Applications to Stochastic Min-Norm Load Balancing. CoRR abs/2111.07244 (2021) - 2020
- [c3]Sylvia C. Boyd, Joseph Cheriyan, Robert Cummings, Logan Grout, Sharat Ibrahimpur, Zoltán Szigeti, Lu Wang:
A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case. APPROX-RANDOM 2020: 61:1-61:12 - [c2]Sharat Ibrahimpur, Chaitanya Swamy:
Approximation Algorithms for Stochastic Minimum-Norm Combinatorial Optimization. FOCS 2020: 966-977 - [i3]Sylvia C. Boyd, Joseph Cheriyan, Robert Cummings, Logan Grout, Sharat Ibrahimpur, Zoltán Szigeti, Lu Wang:
A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case. CoRR abs/2008.03327 (2020) - [i2]Sharat Ibrahimpur, Chaitanya Swamy:
Approximation Algorithms for Stochastic Minimum Norm Combinatorial Optimization. CoRR abs/2010.05127 (2020)
2010 – 2019
- 2017
- [c1]Sharat Ibrahimpur, Chaitanya Swamy:
Min-Max Theorems for Packing and Covering Odd (u, v)-trails. IPCO 2017: 279-291 - [i1]Sharat Ibrahimpur, Chaitanya Swamy:
Min-Max Theorems for Packing and Covering Odd (u, v)-trails. CoRR abs/1708.06857 (2017)
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-07-31 21:37 CEST 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:
