default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAditya Shastri
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[i3]Seemandhar Jain
, Aditya A. Shastri, Kapil Ahuja, Yann Busnel, Navneet Pratap Singh:
Cube Sampled K-Prototype Clustering for Featured Data. CoRR abs/2108.10262 (2021)- 2020
- [i2]Aditya A. Shastri, Kapil Ahuja, Milind B. Ratnaparkhe, Yann Busnel:
Probabilistically Sampled and Spectrally Clustered Plant Genotypes using Phenotypic Characteristics. CoRR abs/2009.09028 (2020)
2010 – 2019
- 2018
- [j12]Aditya Shastri, Deepti Tamrakar, Kapil Ahuja:
Density-wise two stage mammogram classification using texture exploiting descriptors. Expert Syst. Appl. 99: 71-82 (2018) - [c3]Vishal Nemade, Aditya Shastri, Kapil Ahuja, Aruna Tiwari:
Scaled and Projected Spectral Clustering with Vector Quantization for Handling Big Data. SSCI 2018: 2174-2179 - [i1]Aditya A. Shastri, Kapil Ahuja, Milind B. Ratnaparkhe, Aditya Shah, Aishwary Gagrani, Anant Lal:
Vector Quantized Spectral Clustering applied to Soybean Whole Genome Sequences. CoRR abs/1810.00398 (2018) - 2017
- [j11]Nimish Kumar, Reena Dadhich, Aditya Shastri:
MAQM: a generic object-oriented framework to build quality models for Web-based applications. Int. J. Syst. Assur. Eng. Manag. 8(2s): 716-729 (2017) - 2014
- [j10]Aditya Shastri, S. R. Singh, Shalley Gupta:
Integrated defective production model for impatient customers with price dependent demand under the effect of learning. Int. J. Math. Oper. Res. 6(5): 589-609 (2014) - 2013
- [j9]Daniel J. Kleitman, Aditya Shastri, Vera T. Sós:
Editorial. Discret. Appl. Math. 161(9): 1169 (2013)
2000 – 2009
- 2008
- [j8]Deepti Gaur, Aditya Shastri, Ranjit Biswas:
Introducing 'Meta-Network': A New Concept in Network Technology. J. Inform. and Commun. Convergence Engineering 6(4): 470-474 (2008) - 2001
- [j7]Aditya Shastri:
Time-relaxed Multi-Broadcasting in Communication Networks (EXTENDED ABSTRACT). Electron. Notes Discret. Math. 10: 255-260 (2001) - 2000
- [j6]Tao Jiang, Dhruv Mubayi, Aditya Shastri, Douglas B. West:
Correction to Edge-Bandwidth of Graphs. SIAM J. Discret. Math. 13(1): 1 (2000)
1990 – 1999
- 1999
- [j5]Tao Jiang, Dhruv Mubayi, Aditya Shastri, Douglas B. West:
Edge-Bandwidth of Graphs. SIAM J. Discret. Math. 12(3): 307-316 (1999) - 1998
- [j4]Aditya Shastri:
Time-relaxed broadcasting in communication networks. Discret. Appl. Math. 83(1-3): 263-278 (1998) - 1996
- [c2]Aditya Shastri:
Some sparse time-relaxed broadcast communication networks. ICPADS 1996: 135-140 - 1995
- [c1]Aditya Shastri:
Broadcasting in General Networks I: Trees. COCOON 1995: 482-489 - 1992
- [j3]G. W. Peck, Aditya Shastri:
Bandwidth of theta graphs with short paths. Discret. Math. 103(2): 177-187 (1992) - 1990
- [j2]Aditya Shastri:
Lower bounds for bi-colored quaternary ramsey numbers. Discret. Math. 84(2): 213-216 (1990)
1980 – 1989
- 1989
- [j1]Jerrold R. Griggs, Daniel J. Kleitman, Aditya Shastri:
Spanning trees with many leaves in cubic graphs. J. Graph Theory 13(6): 669-695 (1989)
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-04-25 05:57 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:
