국제논문

■  Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs

    - Jung-Heum Park,  Hyeong-Seok Lim,  Hee-Chul Kim

    - Journal of Computer and System Sciences,  2019,  Vol. 105,  pp.104–115

​

■  Disjoint path covers joining prescribed source and sink sets in interval graphs

    - Jung-Heum Park, Jae-Hoon Kim, Hyeong-Seok Lim

    - Theoretical Computer Science , 2019,  Vol. 776, pp. 125–137 

 

■  Disjoint path covers with path length constraints in restricted hypercube-like graphs

    - Jung-Heum Park,  Hee-Chul Kim,  Hyeong-Seok Lim

    - Journal of Computer and System Sciences,  2017,  Vol. 89,  pp.246-269  

  

■  Algorithms for finding disjoint path covers in unit interval graphs

    - Jung-Heum Park,  Joonsoo Choi,  Hyeong-Seok Lim

    - Discrete Applied Mathematics,  2016,  Vol. 205,  pp.132-149    

 

■  Ore-type degree conditions for disjoint covers in simple graphs

    - Hyeong-Seok Lim,  Hee-Chul Kim,  Jung-Heum Park

    - Discrete Mathematics,  2016,  Vol. 339,  pp.770-779

​

■  The bicube: an interconnection of two hypercubes

    - Hyeong-Seok Lim,  Jung-Heum Park ,  Hee-Chul Kim

    - International Journal of Computer Mathematics, 2015,  Vol. 92,  pp.29-40

​

■  An approach to conditional diagnosability analysis under the PMC model and its application to torus networks

   - Hee-Chul Kim,  Hyeong-Seok Lim, J ung-Heum Park     

   - Theoretical Computer Science,  2014, Vol. 548,  pp.98-116

​

■  An improved preprocessing algorithm for haplotype inference by pure parsimony

   -  Choi MH,  Kang SH,  Lim HS.

   - Journal of Bioinformatics and Computational Biology,  2014, Vol. 12,  pp.1-16  

​

■  Individual haplotype assembly of Apis mellifera (honeybee) using a practical branch and bound algorithm

   - Hyeong-Seok Lim,  In-Seon Jeong,  Seung-Ho Kang

   - Journal of ASIA-PACIFIC Entomology,  2012,  Vol. 15,  pp.375-381  

​

■  HapAssembler: A web server for haplotype assembly from SNP fragments using genetic algorithm

   - Seung-Ho Kang,  In-Seon Jeong,  Hwan-Gue Cho,  Hyeong-Seok Lim     

   - Biochemical  and Biophysical Research Communications,  2010, Vol. 397,  pp.340-344  

   

■  An efficient similarity search based on indexing in large DNA databases

   - In-Seon Jeong,  Kyoung-Wook Park,  Seung-Ho Kang,  Hyeong-Seok Lim

   - Computational  Biology and  Chemistry,  2010,  Vol. 34,  pp.131-136  

​

■  Many-to-many disjoint path covers in the presence of faulty elements

   - Jung-Heum Park,  Hee-Chul Kim,  Hyeong-Seok Lim

   - IEEE Transactions on Computers,  2009,  Vol. 58,  pp.528-540      

 

■  Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements.

  - Jung-Heum Park,  Hyeong-Seok Lim,  Hee-Chul Kim

  - Theoretical Computer Science,  2007, Vol. 377,  pp.170-180

​

■  Embedding starlike trees into hypercube-like interconnection networks

   - Jung-Heum Park, Hyeong-Seok Lim, Hee-Chul Kim

   - Lecture Notes in Computer Science,  2006, Vol. 4331,  pp.301-310    

​

■  Many-to-many disjoint path covers in hypercube-like interconnection networks with faulty elements

   - Jung-Heum Park, Hyeong-Seok Lim, Hee-Chul Kim

   - IEEE Transactions on Parallel and Distributed Systems,  2006,  Vol. 17,  pp.227-240

​

■  Fault hamiltonicity of meshes with two wraparound edges

   - Kyoung-Wook Park,  Hyeong-Seok Lim,  Jung-Heum Park,  Hee-Chul Kim

   - Lecture Notes in Computer Science,  2004,  Vol. 3106,   pp.412-421

​

■  A distributed low-cost dynamic multicast routing algorithm with delay constraints

   - Min-Woo Shin, Nak-Keun Joo, Hyeong-Seok Lim

   - Lecture Notes in Computer Science,  2002,  pp.377-386

​

■  Embedding full ternary trees into recursive circulants

   - Cheol Kim, Jung Choi, Hyeong-Seok Lim

   - Lecture Notes in Computer Science, 2002,  pp.874-882

​

■  Hyper-star graph: A new interconnection network improving the network cost of the hypercube

   - Hyeong-Ok Lee,  Jong-Seok Kim,  Eunseuk Oh,  Hyeong-Seok Lim

   - Lecture Notes in Computer Science,  2002,  pp.858-865

 

■  Clustering in Trees: Optimizing cluster sizes and number of subtrees

   - Susanne E. Hambrusch,  Chuan-Ming Liu,  Hyeong-Seok Lim

   - Journal of Graph Algorithms and Applications,  2000,  Vol. 4,  pp.1-26

 

■  Minimizing the Diameter in Tree Networks under Edge Reductions

   - Susanne E. Hambrusch,  Hyeong-Seok Lim     

   - Parallel Processing Letters, 1999, Vol. 9,  pp.361-371

​

■  Minimizing broadcast costs under edge reductions in tree networks

   - Susanne E. Hambrusch,  Hyeong-Seok Lim     

   - Discrete Applied Mathematics,  1999,  Vol. 91,  pp.93-117

 

■  Embedding Trees in Recuresive Circulants

  - Hyeong-Seok Lim, Jung-Heum Park, Kyung-Yong Chwa

  - Discrete Applied Mathmatics,  1996, Vol. 69,  pp.83-99