


default search action
Ishan Bansal
Person information
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
 [j2]Ishan Bansal, Oktay Günlük, Richard Shapley: [j2]Ishan Bansal, Oktay Günlük, Richard Shapley:
 Parallel token swapping for qubit routing. Discret. Appl. Math. 377: 480-497 (2025)
 [c10]Ishan Bansal, Joe Cheriyan, Sanjeev Khanna, Miles Simmons: [c10]Ishan Bansal, Joe Cheriyan, Sanjeev Khanna, Miles Simmons:
 Improved Approximation Algorithms for Capacitated Network Design and Flexible Graph Connectivity. ICALP 2025: 20:1-20:20
 [c9]Ishan Bansal [c9]Ishan Bansal : :
 A Global Analysis of the Primal-Dual Method for Edge Augmentation Problems. IPCO 2025: 58-71
 [c8]Ishan Bansal [c8]Ishan Bansal , Nagarjun Bhat, Agrim Gupta, Harine Govindarajan, Dinesh Bharadia: , Nagarjun Bhat, Agrim Gupta, Harine Govindarajan, Dinesh Bharadia:
 SenSync: Real-Time and Accurate Passive Sensing. RFID 2025: 1-6
 [c7]Ishan Bansal [c7]Ishan Bansal , Nagarjun Bhat , Nagarjun Bhat , Agrim Gupta , Agrim Gupta , Harine Govindarajan , Harine Govindarajan , Dinesh Bharadia , Dinesh Bharadia : :
 Demo Abstract - SIGAR: Sensor Integration Gateway using Augmented Reality. SenSys 2025: 696-697
 [i12]Miles Simmons, Ishan Bansal, Joe Cheriyan: [i12]Miles Simmons, Ishan Bansal, Joe Cheriyan:
 A Bad Example for Jain's Iterative Rounding Theorem for the Cover Small Cuts Problem. CoRR abs/2504.13105 (2025)
- 2024
 [j1]Ishan Bansal, Joseph Cheriyan, Logan Grout, Sharat Ibrahimpur: [j1]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)
 [c6]Ishan Bansal [c6]Ishan Bansal , Ryan Mao , Ryan Mao , Avhan Misra , Avhan Misra : :
 Network Design on Undirected Series-Parallel Graphs. ISCO 2024: 277-288
 [c5]Ishan Bansal [c5]Ishan Bansal , Nagarjun Bhat , Nagarjun Bhat , Agrim Gupta, Harine Govindarajan, Dinesh Bharadia , Agrim Gupta, Harine Govindarajan, Dinesh Bharadia : :
 ZenseTag: An RFID assisted Twin-Tag Single Antenna COTS Sensor Interface. MobiCom 2024: 1757-1759
 [c4]Nagarjun Bhat [c4]Nagarjun Bhat , Agrim Gupta , Agrim Gupta , Ishan Bansal , Ishan Bansal , Harine Govindarajan , Harine Govindarajan , Dinesh Bharadia , Dinesh Bharadia : :
 ZenseTag: An RFID assisted Twin-Tag Single Antenna COTS Sensor Interface. SenSys 2024: 336-350
 [i11]Ishan Bansal, Ryan Mao, Avhan Misra: [i11]Ishan Bansal, Ryan Mao, Avhan Misra:
 Network Design on Undirected Series-Parallel Graphs. CoRR abs/2401.10729 (2024)
 [i10]Ishan Bansal, Oktay Günlük: [i10]Ishan Bansal, Oktay Günlük:
 Warehouse Problem with Multiple Vendors and Generalized Complementarity Constraints. CoRR abs/2401.10738 (2024)
 [i9]Ishan Bansal, Oktay Günlük, Richard Shapley: [i9]Ishan Bansal, Oktay Günlük, Richard Shapley:
 Parallel Token Swapping for Qubit Routing. CoRR abs/2411.18581 (2024)
 [i8]Ishan Bansal, Joseph Cheriyan, Sanjeev Khanna, Miles Simmons: [i8]Ishan Bansal, Joseph Cheriyan, Sanjeev Khanna, Miles Simmons:
 Improved Approximation Algorithms for Flexible Graph Connectivity and Capacitated Network Design. CoRR abs/2411.18809 (2024)
- 2023
 [c3]Ishan Bansal, Joe Cheriyan, Logan Grout [c3]Ishan Bansal, Joe Cheriyan, Logan Grout , Sharat Ibrahimpur: , 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
 [c2]Ishan Bansal, Joseph Cheriyan, Logan Grout, Sharat Ibrahimpur: [c2]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
 [i7]Ishan Bansal, Oktay Günlük: [i7]Ishan Bansal, Oktay Günlük:
 Warehouse Problem with Bounds, Fixed Costs and Complementarity Constraints. CoRR abs/2302.12136 (2023)
 [i6]Ishan Bansal: [i6]Ishan Bansal:
 A constant factor approximation for the (p, 3)-flexible graph connectivity problem. CoRR abs/2308.15714 (2023)
- 2022
 [i5]Ishan Bansal, Joe Cheriyan, Logan Grout, Sharat Ibrahimpur: [i5]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)
 [i4]Ishan Bansal, Joseph Cheriyan, Logan Grout, Sharat Ibrahimpur [i4]Ishan Bansal, Joseph Cheriyan, Logan Grout, Sharat Ibrahimpur : :
 Approximating (p, 2) flexible graph connectivity via the primal-dual method. CoRR abs/2209.11209 (2022)
 [i3]Ishan Bansal, Joseph Cheriyan, Logan Grout, Sharat Ibrahimpur: [i3]Ishan Bansal, Joseph Cheriyan, Logan Grout, Sharat Ibrahimpur:
 Extensions of the (p, q)-Flexible-Graph-Connectivity model. CoRR abs/2211.09747 (2022)
- 2020
 [c1]Manan Bhandari, Ishan Bansal, V. Lalitha: [c1]Manan Bhandari, Ishan Bansal, V. Lalitha:
 On the Polarizing Behavior and Scaling Exponent of Polar Codes with Product Kernels. NCC 2020: 1-6
2010 – 2019
- 2019
 [i2]Akanksha Baranwal, Ishan Bansal, Roopal Nahar, K. Madhava Krishna: [i2]Akanksha Baranwal, Ishan Bansal, Roopal Nahar, K. Madhava Krishna:
 DeCoILFNet: Depth Concatenation and Inter-Layer Fusion based ConvNet Accelerator. CoRR abs/1901.02774 (2019)
 [i1]Manan Bhandari, Ishan Bansal, V. Lalitha: [i1]Manan Bhandari, Ishan Bansal, V. Lalitha:
 On the Scaling Exponent of Polar Codes with Product Kernels. CoRR abs/1904.08682 (2019)
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).
 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).
 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
, and  to record detail pages.
 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
 and  to record detail pages.
 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 2025-10-16 00:16 CEST by the dblp team
 all metadata released as open data under CC0 1.0 license
 all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint


 Google
Google Google Scholar
Google Scholar Semantic Scholar
Semantic Scholar Internet Archive Scholar
Internet Archive Scholar CiteSeerX
CiteSeerX ORCID
ORCID







