default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKetan Date
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Ketan Date, Rakesh Nagi:
Optimal placement of multiple finite-size rectangular facilities in an existing layout. Int. J. Prod. Res. 62(1-2): 7-23 (2024)- [j6]Ketan Date, Rakesh Nagi:
Optimal and heuristic solutions for placing multiple finite-size rectangular facilities in an existing layout. Int. J. Prod. Res. 62(1-2): 24-44 (2024) - 2020
- [j5]Shardul Natu, Ketan Date, Rakesh Nagi
:
GPU-accelerated Lagrangian heuristic for multidimensional assignment problems with decomposable costs. Parallel Comput. 97: 102666 (2020)
2010 – 2019
- 2019
- [j4]Gregory Tauer, Ketan Date, Rakesh Nagi, Moises Sudit:
An incremental graph-partitioning algorithm for entity resolution. Inf. Fusion 46: 171-183 (2019) - [j3]Ketan Date, Rakesh Nagi:
Level 2 Reformulation Linearization Technique-Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters. INFORMS J. Comput. 31(4): 771-789 (2019) - 2018
- [c8]Ketan Date, Rakesh Nagi:
Tracking Multiple Maneuvering Targets Using Integer Programming and Spline Interpolation. FUSION 2018: 1293-1300 - [c7]Sitao Huang, Mohamed El-Hadedy, Cong Hao, Qin Li, Vikram S. Mailthody, Ketan Date, Jinjun Xiong, Deming Chen, Rakesh Nagi, Wen-Mei Hwu:
Triangle Counting and Truss Decomposition using FPGA. HPEC 2018: 1-7 - [c6]Vikram S. Mailthody, Ketan Date, Zaid Qureshi, Carl Pearson, Rakesh Nagi, Jinjun Xiong, Wen-Mei Hwu:
Collaborative (CPU + GPU) Algorithms for Triangle Counting and Truss Decomposition. HPEC 2018: 1-7 - 2017
- [c5]Ketan Date, Keven Feng, Rakesh Nagi, Jinjun Xiong, Nam Sung Kim, Wen-Mei W. Hwu:
Collaborative (CPU + GPU) algorithms for triangle counting and truss decomposition on the Minsky architecture: Static graph challenge: Subgraph isomorphism. HPEC 2017: 1-7 - [i1]Ketan Date, Rakesh Nagi:
RLT2-based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters. CoRR abs/1710.03732 (2017) - 2016
- [j2]Ketan Date, Rakesh Nagi:
GPU-accelerated Hungarian algorithms for the Linear Assignment Problem. Parallel Comput. 57: 52-72 (2016) - 2014
- [j1]Ketan Date, Suryaansh Makked, Rakesh Nagi:
Dominance rules for the optimal placement of a finite-size facility in an existing layout. Comput. Oper. Res. 51: 182-189 (2014) - [c4]Ketan Date, Geoff A. Gross, Rakesh Nagi:
Test and evaluation of data association algorithms in hard+soft data fusion. FUSION 2014: 1-8 - [c3]Geoff A. Gross, Ketan Date, Daniel R. Schlegel, Jason J. Corso, James Llinas, Rakesh Nagi, Stuart C. Shapiro:
Systemic test and evaluation of a hard+soft information fusion framework: Challenges and current approaches. FUSION 2014: 1-8 - 2013
- [c2]Ketan Date, Geoff A. Gross, Sushant S. Khopkar, Rakesh Nagi, Kedar Sambhoos:
Data association and graph analytical processing of hard and soft intelligence data. FUSION 2013: 404-411 - [c1]Rakesh Nagi, Ketan Date:
Optimal Placement of a Finite-Size Facility: A Computational Study of Sequential and Parallel Implementations. MIM 2013: 460-465
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:55 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:
