default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShweta Jain 0003
Person information
- affiliation: University of California, Santa Cruz, CA, USA
Other persons with the same name
- Shweta Jain 0001
![[0000-0002-4962-0054]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-4962-0054")
— City University of New York, John Jay College of Criminal Justice, NY, USA (and 4 more) - Shweta Jain 0002 — Indian Institute of Technology, Ropar (IIT Ropar), India (and 1 more)
- Shweta Jain 0004 — Pandit Dwarka Prasad Mishra Indian Institute of Information Technology, Jabalpur, India
- Shweta Jain 0005 — Intel Corporation
- Shweta Jain 0007 — University of Utah, Salt Lake City, UT, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c6]Balaram Behera, Edin Husic, Shweta Jain, Tim Roughgarden, C. Seshadhri:
FPT Algorithms for Finding Near-Cliques in c-Closed Graphs. ITCS 2022: 17:1-17:24- 2020
- [b1]Shweta Jain:
Counting Cliques in Real-World Graphs. University of California, Santa Cruz, USA, 2020 - [c5]Shweta Jain, C. Seshadhri:
The Power of Pivoting for Exact Clique Counting. WSDM 2020: 268-276 - [c4]Shweta Jain, C. Seshadhri:
Provably and Efficiently Approximating Near-cliques using the Turán Shadow: PEANUTS. WWW 2020: 1966-1976 - [c3]Huda Nassar, Caitlin Kennedy, Shweta Jain, Austin R. Benson, David F. Gleich:
Using Cliques with Higher-order Spectral Embeddings Improves Graph Visualizations. WWW 2020: 2927-2933 - [i4]Shweta Jain, C. Seshadhri:
The Power of Pivoting for Exact Clique Counting. CoRR abs/2001.06784 (2020) - [i3]Shweta Jain, C. Seshadhri:
Provably and Efficiently Approximating Near-cliques using the Turán Shadow: PEANUTS. CoRR abs/2006.13483 (2020)
2010 – 2019
- 2018
- [c2]Talya Eden, Shweta Jain, Ali Pinar, Dana Ron, C. Seshadhri:
Provable and Practical Approximations for the Degree Distribution using Sublinear Graph Samples. WWW 2018: 449-458 - 2017
- [c1]Shweta Jain, C. Seshadhri:
A Fast and Provable Method for Estimating Clique Counts Using Turán's Theorem. WWW 2017: 441-449 - [i2]Talya Eden, Shweta Jain, Ali Pinar, Dana Ron, C. Seshadhri:
Provable and practical approximations for the degree distribution using sublinear graph samples. CoRR abs/1710.08607 (2017) - 2016
- [i1]Shweta Jain, C. Seshadhri:
A Fast and Provable Method for Estimating Clique Counts Using Turán's Theorem. CoRR abs/1611.05561 (2016)
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-15 20:36 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:
