Sung Kwon KIM


Algorithm for the Length-Constrained Maximum-Density Path Problem in a Tree with Uniform Edge Lengths
Sung Kwon KIM 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2015/01/01
Vol. E98-D  No. 1  pp. 103-107
Type of Manuscript:  PAPER
Category: Fundamentals of Information Systems
Keyword: 
length-constrained pathsmaximum-density pathsuniform edge lengths
 Summary | Full Text:PDF(323.8KB)

Linear-Time Algorithm for the Length-Constrained Heaviest Path Problem in a Tree with Uniform Edge Lengths
Sung Kwon KIM 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2013/03/01
Vol. E96-D  No. 3  pp. 498-501
Type of Manuscript:  Special Section LETTER (Special Section on Foundations of Computer Science — New Trends in Algorithms and Theory of Computation —)
Category: 
Keyword: 
length-constrained pathsheaviest pathsuniform edge lengths
 Summary | Full Text:PDF(76.6KB)

Optimal Algorithms for Finding the Longest Path with Length and Sum Constraints in a Tree
Sung Kwon KIM 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2011/06/01
Vol. E94-D  No. 6  pp. 1325-1328
Type of Manuscript:  LETTER
Category: Fundamentals of Information Systems
Keyword: 
length constraintlongest pathsum constrainttree
 Summary | Full Text:PDF(84.9KB)

Optimal Algorithms for Finding Density-Constrained Longest and Heaviest Paths in a Tree
Sung Kwon KIM 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2010/11/01
Vol. E93-D  No. 11  pp. 2989-2994
Type of Manuscript:  PAPER
Category: Fundamentals of Information Systems
Keyword: 
algorithmsdensity-constrained pathsheaviest pathslongest paths
 Summary | Full Text:PDF(202.7KB)

Optimal Online and Offline Algorithms for Finding Longest and Shortest Subsequences with Length and Sum Constraints
Sung Kwon KIM 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2010/02/01
Vol. E93-D  No. 2  pp. 250-256
Type of Manuscript:  Special Section PAPER (Special Section on Foundations of Computer Science)
Category: 
Keyword: 
length constraintlongest subsequenceoffline algorithmonline algorithmshortest subsequencesum constraint
 Summary | Full Text:PDF(553KB)

Path Maximum Query and Path Maximum Sum Query in a Tree
Sung Kwon KIM Jung-Sik CHO Soo-Cheol KIM 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2009/02/01
Vol. E92-D  No. 2  pp. 166-171
Type of Manuscript:  Special Section PAPER (Special Section on Foundations of Computer Science)
Category: 
Keyword: 
path maximum querypath maximum sum querytree
 Summary | Full Text:PDF(493.3KB)