Mohammed Thaher, Tadao Takaoka. An efficient algorithm for computing the K-overlapping maximum convex sum problem. Procedia CS, 4:1288-1295, 2011. [doi]
@article{ThaherT11,
title = {An efficient algorithm for computing the K-overlapping maximum convex sum problem},
author = {Mohammed Thaher and Tadao Takaoka},
year = {2011},
doi = {10.1016/j.procs.2011.04.139},
url = {http://dx.doi.org/10.1016/j.procs.2011.04.139},
researchr = {https://researchr.org/publication/ThaherT11},
cites = {0},
citedby = {0},
journal = {Procedia CS},
volume = {4},
pages = {1288-1295},
}