Algorithms for the Problem of K Maximum Sums and a VLSI Algorithm for the K Maximum Subarrays Problem. - Sung Eun Bae; Tadao Takaoka (ISPAN, 2004)

Improved Algorithms for the K-Maximum Subarray Problem for Small K. - Sung Eun Bae; Tadao Takaoka (COCOON, 2005)

Algorithm for K Disjoint Maximum Subarrays. - Sung Eun Bae; Tadao Takaoka (International Conference on Computational Science (1), 2006)

Improved Algorithms for the K-Maximum Subarray Problem. - Sung Eun Bae; Tadao Takaoka (Comput. J., 2006)

A Sub-cubic Time Algorithm for the k -Maximum Subarray Problem. - Sung Eun Bae; Tadao Takaoka (ISAAC, 2007)

Algorithms for k-Disjoint Maximum Subarrays. - Sung Eun Bae; Tadao Takaoka (Int. J. Found. Comput. Sci., 2007)

A Faster Parallel Algorithm for Matrix Multiplication on a Mesh Array. - Sung Eun Bae; Tong-Wook Shinn; Tadao Takaoka (ICCS, 2014)

An efficient parallel algorithm for the maximum convex sum problem. - Sung Eun Bae; Tong-Wook Shinn; Tadao Takaoka (ACSW, 2016)

Minimum Weight Polygon Triangulation Problem in Sub-Cubic Time Bound. - Sung Eun Bae; Tong-Wook Shinn; Tadao Takaoka (COCOA, 2016)

Efficient Algorithms for the Maximum Sum Problems. - Sung Eun Bae; Tong-Wook Shinn; Tadao Takaoka (Algorithms, 2017)