default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShubhangi Agarwal 0001
Person information
- affiliation: Lyon 1 University, LIRIS, France
- affiliation (PhD): Indian Institute of Technology, Kanpur, India
Other persons with the same name
- Shubhangi Agarwal 0002
![[0000-0001-7564-3826]](/post-https-dblp.org/img/orcid-mark.12x12.png "0000-0001-7564-3826")
— Arizona State University, AZ, USA - Shubhangi Agarwal 0003 — Jaypee Institute of Information Technology, Noida, Uttar Pradesh, India
- Shubhangi Agarwal 0004 — Amity University, Amity College of Commerce and Finance, Noida, India
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c6]V. S. D. S. Mahesh Akavarapu, Hrishikesh Terdalkar, Pramit Bhattacharyya, Shubhangi Agarwal, Vishakha Deulgaonkar, Chaitali Dangarikar, Pralay Manna, Arnab Bhattacharya:
A Case Study of Cross-Lingual Zero-Shot Generalization for Classical Languages in LLMs. ACL (Findings) 2025: 2745-2761- [c5]Mouna Ammar, Shubhangi Agarwal, Angela Bonifati, Erhard Rahm:
Transforming Time Series into Graphs and Vice Versa with HyGraph. EDBT/ICDT Workshops 2025 - [c4]Mouna Ammar, Christopher Rost, Riccardo Tommasini, Shubhangi Agarwal, Angela Bonifati, Petra Selmer, Evgeny Kharlamov, Erhard Rahm:
Towards Hybrid Graphs: Unifying Property Graphs and Time Series. EDBT 2025: 970-977 - [i3]V. S. D. S. Mahesh Akavarapu, Hrishikesh Terdalkar, Pramit Bhattacharyya, Shubhangi Agarwal, Vishakha Deulgaonkar, Pralay Manna, Chaitali Dangarikar, Arnab Bhattacharya:
A Case Study of Cross-Lingual Zero-Shot Generalization for Classical Languages in LLMs. CoRR abs/2505.13173 (2025) - 2024
- [c3]Shubhangi Agarwal, Sourav Dutta, Arnab Bhattacharya:
VeNoM: Approximate Subgraph Matching with Enhanced Neighbourhood Structural Information. COMAD/CODS 2024: 18-26 - 2021
- [c2]Shubhangi Agarwal, Sourav Dutta, Arnab Bhattacharya:
VerSaChI: Finding Statistically Significant Subgraph Matches using Chebyshev's Inequality. CIKM 2021: 2812-2816 - [c1]Sunil Nishad, Shubhangi Agarwal, Arnab Bhattacharya, Sayan Ranu:
GraphReach: Position-Aware Graph Neural Network using Reachability Estimations. IJCAI 2021: 1527-1533 - [i2]Shubhangi Agarwal, Sourav Dutta, Arnab Bhattacharya:
VerSaChI: Finding Statistically Significant Subgraph Matches using Chebyshev's Inequality. CoRR abs/2108.07996 (2021) - 2020
- [j1]Shubhangi Agarwal, Sourav Dutta, Arnab Bhattacharya:
ChiSeL: Graph Similarity Search using Chi-Squared Statistics in Large Probabilistic Graphs. Proc. VLDB Endow. 13(10): 1654-1668 (2020) - [i1]Sunil Nishad, Shubhangi Agarwal, Arnab Bhattacharya, Sayan Ranu:
GraphReach: Locality-Aware Graph Neural Networks using Reachability Estimations. CoRR abs/2008.09657 (2020)
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 2025-12-09 00:30 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:
