default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSrikrishnan Divakaran
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Srishti U. Sharma
, Srikrishnan Divakaran, Tolga Kaya, Mehul S. Raval:
Athletic signature: predicting the next game lineup in collegiate basketball. Neural Comput. Appl. 36(34): 21761-21780 (2024)- [c5]Srishti U. Sharma, Srikrishnan Divakaran, Tolga Kaya, Mehul S. Raval:
A Computer Vision Framework on Biomechanical Analysis of Jump Landings. ICVGIP 2024: 9:1-9:9 - [c4]Samah Senbel, N. Sertac Artan, Christopher Taber, S. Alexander Long, Srishti U. Sharma, Mahmud Kandawala, Mehul S. Raval, Srikrishnan Divakaran, Tolga Kaya:
An Evaluation of the Determinants of Performance in NCAA Division I Women's Basketball: A Dual-Season Investigation. ISACE 2024: 228-234 - 2023
- [c3]Maitrik Shah, Mehul S. Raval, Srikrishnan Divakaran, Pragnesh Patel:
Study and Impact Analysis of Data Shift in Deep Learning Based Atmospheric Correction. IGARSS 2023: 6728-6731 - [c2]Srishti U. Sharma, Srikrishnan Divakaran, Tolga Kaya, Christopher Taber, Mehul S. Raval:
A Framework for Biomechanical Analysis of Jump Landings for Injury Risk Assessment. PRDC 2023: 327-331 - 2022
- [c1]Maitrik Shah, Mehul S. Raval, Srikrishnan Divakaran:
A Deep Learning Perspective to Atmospheric Correction of Satellite Images. IGARSS 2022: 346-349 - 2020
- [i7]Srikrishnan Divakaran:
An Optimal Algorithm for 1-D Cutting Stock Problem. CoRR abs/2001.01531 (2020)
2010 – 2019
- 2019
- [i6]Srikrishnan Divakaran:
Fast Approximation Schemes for Bin Packing. CoRR abs/1902.03422 (2019) - [i5]Srikrishnan Divakaran:
A Fast Scalable Heuristic for Bin Packing. CoRR abs/1904.12467 (2019) - 2015
- [i4]Srikrishnan Divakaran:
Fast Algorithms for Exact String Matching. CoRR abs/1509.09228 (2015) - [i3]Srikrishnan Divakaran:
A Fast Heuristic for Exact String Matching. CoRR abs/1512.03512 (2015) - 2014
- [i2]Srikrishnan Divakaran:
An Optimal Offline Algorithm for List Update. CoRR abs/1404.7638 (2014) - 2013
- [i1]Srikrishnan Divakaran, Arpit Mithal, Namit Jain:
A Fast Template Based Heuristic For Global Multiple Sequence Alignment. CoRR abs/1302.6030 (2013) - 2011
- [j3]Srikrishnan Divakaran, Michael E. Saks:
An Online Algorithm for a Problem in Scheduling with Set-ups and Release Times. Algorithmica 60(2): 301-315 (2011)
2000 – 2009
- 2009
- [j2]Srikrishnan Divakaran:
Approximation algorithms for constrained generalized tree alignment problem. Discret. Appl. Math. 157(7): 1407-1422 (2009) - 2008
- [j1]Srikrishnan Divakaran, Michael E. Saks:
Approximation algorithms for problems in scheduling with set-ups. Discret. Appl. Math. 156(5): 719-729 (2008)
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-01-15 21:49 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:
