2022

l  ±èÅÂÈÆ, ±è¼º±Ç, K-means Ŭ·¯½ºÅ͸µÀ» »ç¿ëÇÑ SVD ±â¹ÝÀÇ ±³Â÷ µµ¸ÞÀÎ Ãßõ, Á¤º¸°úÇÐȸ ³í¹®Áö, 49±Ç 5È£, pp. 360-368, 2022³â 5¿ù  // ¿¬±¸Àç´Ü ±âº»¿¬±¸(°³ÀÎ) 2019

2021

l  ȲűÔ, ±è¼º±Ç, ¸ÞŸµ¥ÀÌŸÀÇ ÆíÇ⠺м®À» ÅëÇÑ ¿µÈ­ Ãßõ, Á¤º¸°úÇÐȸ ÄÄÇ»ÆÃÀÇ ½ÇÁ¦ ³í¹®Áö, 27±Ç 10È£, pp. 479-485, 2021³â 10¿ù  // ¿¬±¸Àç´Ü ±âº»¿¬±¸(°³ÀÎ) 2019

l   Tae-Gyu Hwang and S.K. Kim, Movie Recommendation through Multiple Bias Analysis,  Applied Sciences. 2021; 11(6):2817. https://doi.org/10.3390/app11062817, 22 March 2021 // ¿¬±¸Àç´Ü ±âº»¿¬±¸(°³ÀÎ) 2019

 

2020

l  ȲűÔ, ±è¼º±Ç, À帣 »ó°ü°ü°è¸¦ »ç¿ëÇÑ ¿µÈ­Ãßõ ¾Ë°í¸®Áò, Á¤º¸°úÇÐȸ ÄÄÇ»ÆÃÀÇ ½ÇÁ¦ ³í¹®Áö, 26±Ç 9È£, pp. 429-434, September  2020 // ¿¬±¸Àç´Ü ±âº»¿¬±¸(°³ÀÎ) 2019

l  ȲűÔ, ±è¼º±Ç, ¸ÞŸµ¥ÀÌÅÍÀÇ ÆíÇâºÐ¼®À» ÅëÇÑ ¿µÈ­Ãßõ, Á¤º¸°úÇÐȸ 2020³â Çѱ¹¼ÒÇÁÆ®¿þ¾îÁ¾ÇÕÇмú´ëȸ ³í¹®Áý, pp. 105-107, December  2020 // ¿¬±¸Àç´Ü ±âº»¿¬±¸(°³ÀÎ) 2019

l  ±èÅÂÈÆ, ±è¼º±Ç, µ¥ÀÌÅÍ Á߿䵵¿¡ µû¸¥ customized wide & deep ±â¹ÝÀÇ ½Ä´ç Ãßõ, Á¤º¸°úÇÐȸ 2020³â Çѱ¹¼ÒÇÁÆ®¿þ¾îÁ¾ÇÕÇмú´ëȸ ³í¹®Áý, pp. 675-677, December  2020 // ¿¬±¸Àç´Ü ±âº»¿¬±¸(°³ÀÎ) 2019

2019

l  ȲűÔ, ±è¼º±Ç, À帣 »ó°ü°ü°è¸¦ »ç¿ëÇÑ ¿µÈ­Ãßõ ¾Ë°í¸®Áò, Çѱ¹Á¤º¸°úÇÐȸ 2019 Çѱ¹¼ÒÇÁÆ®¿þ¾îÁ¾ÇÕÇмú´ëȸ ³í¹®Áý, pp. 96-98 (3 pages), December 2019. // ¿¬±¸Àç´Ü ±âº»¿¬±¸(°³ÀÎ) 2019

l  Sung Kwon Kim, Enumerating Subsequences of a Sequence and Paths of a Tree in the Order of Weight, Journal of Computing Science and Engineering, Vol. 13, No. 1, March 2019, pp. 11-16 // ¿¬±¸Àç´Ü ±âº»¿¬±¸(°³ÀÎ) 2015// 

l  Tae-Gyu Hwang and Sung Kwon Kim, Multi-Label Bias-Based Predictor, 2019 International Conference on Platform Technology and Service (PlatCon), pp. 1-5, January 2019. // ¿¬±¸Àç´Ü ±âº»¿¬±¸(°³ÀÎ) 2015// 

2018

l  Yoon Kyoung Choi, and Sung Kwon Kim, A Recommendation System for Repetitively Purchasing Items in E-commerce Based on Collaborative Filtering and Association Rules, Journal of Internet Technology, vol. 19, no. 6, pp. 1691-1698, Nov. 2018.  // ¿¬±¸Àç´Ü ±âº»¿¬±¸(°³ÀÎ) 2015// 

l  ÃÖÁØÈñ, ¹ÚÂù¼ö, ȲűÔ, ±è¼º±Ç, »ç¿ëÀÚº° ÆÄ¶ó¹ÌÅͰ¡ Àû¿ëµÈ ÇÏÀ̺긮µå Ãßõ ½Ã½ºÅÛ, Çѱ¹Á¤º¸°úÇÐȸ 2018 Çѱ¹ÄÄÇ»ÅÍÁ¾ÇÕÇмú´ëȸ ³í¹®Áý, pp.941-943 (3 pages), June 2018. // ¿¬±¸Àç´Ü ±âº»¿¬±¸(°³ÀÎ) 2015//

2017

l  À±Å¿í, ¹ÚÂù¼ö, ȲűÔ, ±è¼º±Ç, ¼ø¼­ Á¤º¸ ±â¹Ý ¾Ç¼ºÄÚµå ºÐ·ù °¡´É¼º, Á¤º¸°úÇÐȸ ³í¹®Áö, Volume 44, Number 11, pp. 11251129, Nov 2017. // ¿¬±¸Àç´Ü ±âº»¿¬±¸(°³ÀÎ) 2015//

l  ȲűÔ, ±è¼º±Ç, ÆòÁ¡ ºóµµ °¡ÁßÄ¡ ±â¹Ý ±âÁؼ± ¿¹Ãø±âÀÇ Ãßõ ¼º´É Çâ»óÀ» À§ÇÑ ÆíÇâ ±â¹Ý Ãßõ±â, Á¤º¸°úÇÐȸ ³í¹®Áö, Volume 44, Number 5, pp. 486495, May 2017. // ¿¬±¸Àç´Ü ±âº»¿¬±¸(°³ÀÎ) 2015//

l  Kyoung-Jun Sung, Soo-Cheol Kim, Sung Kwon Kim, Spam Detection in Social Bookmarking Systems Using Tag Scores and Selective Evaluation, Journal of Internet Technology, vol. 18, No. 1, pp. 165-174, Jan. 2017. // ¿¬±¸Àç´Ü ±âº»¿¬±¸(°³ÀÎ) 2015//

l  ȲűÔ, ±è¼º±Ç, ÆíÇâ ±â¹Ý Ãßõ±âÀÇ ÇнÀ¼º´É °³¼±À» À§ÇÑ ¹æ¹ý. 2017³â Çѱ¹ÄÄÇ»ÅÍÁ¾ÇÕÇмú´ëȸ ³í¹®Áý, pp. 796-798, June 2017. // KCC 2017 ¿ì¼ö³í¹®, ¿¬±¸Àç´Ü ±âº»¿¬±¸(°³ÀÎ) 2015//

l  ÃÖÁØÈñ, ¹ÚÂù¼ö, À±Å¿í, ȲűÔ, ±è¼º±Ç, Ãʱ⠻ç¿ëÀÚ ¹®Á¦¸¦ À§ÇÑ ´ÙÁß µ¥ÀÌÅÍ ±â¹ÝÀÇ Ãßõ½Ã½ºÅÛ. 2017³â Çѱ¹¼ÒÇÁÆ®¿þ¾îÁ¾ÇÕÇмú´ëȸ ³í¹®Áý, pp. 847-849, December 2017. // ¿¬±¸Àç´Ü ±âº»¿¬±¸(°³ÀÎ) 2015//

2016

l  Tae-Gyu Hwang, Chan-Soo Park, Jeong-Hwa Hong, S.K. Kim, An Algorithm for Movie Classification and Recommendation Using Genre Correlation, Multimedia Tools and Applications, Volume 75, Issue 20, pp 1284312858, October 2016 //¿¬±¸Àç´Ü ±âº»¿¬±¸(°³ÀÎ) 2015//

l  Soo-Cheol Kim, Kyoung-Jun Sung, Chan-Soo Park, Sung Kwon Kim, Improvement of Collaborative Filtering using Rating Normalization, Multimedia Tools and Applications, vol. 75, no. 9, pp. 4957-4968, May 2016 //¿¬±¸Á¶±³A 2011//

l  À±Å¿í, ¹ÚÂù¼ö, ȲűÔ, ±è¼º±Ç, LSTM ±â¹Ý ¾Ç¼º ÄÚµå ºÐ·ù, Çѱ¹Á¤º¸°úÇÐȸ µ¿°èÇмú¹ßǥȸ ³í¹®Áý, pp. 772-774, December 2016. //µ¿°èÇмú¹ßǥȸ ¿ì¼ö³í¹®, ¿¬±¸Àç´Ü ±âº»¿¬±¸(°³ÀÎ) 2015//

l  ȲűÔ, ¹ÚÂù¼ö, È«Á¤È­, À±Å¿í, ±è¼º±Ç, ÆòÁ¡ ºóµµ °¡ÁßÄ¡ ±â¹Ý Baseline PredictorÀÇ Ãßõ ¼º´É Çâ»óÀ» À§ÇÑ Bias-Based Predictor. 2016³â Çѱ¹ÄÄÇ»ÅÍÁ¾ÇÕÇмú´ëȸ(KCC) ³í¹®Áý, pp. 824-826, June 2016. //KCC 2016 ¿ì¼ö³í¹®, ¿¬±¸Àç´Ü ±âº»¿¬±¸(°³ÀÎ) 2015//

2015

l  È«Á¤È­,¹ÚÂù¼ö,ȲűÔ,±è¼º±Ç, ±×¸®µð ¾Ë°í¸®ÁòÀ» ÀÌ¿ëÇÑ ´ÙÁßÀ¯»çµµ ±â¹Ý Ãßõ½Ã½ºÅÛ, Á¤º¸°úÇÐȸ µ¿°èÇмú¹ßǥȸ, 2015.12.

l  ȲűÔ,¹ÚÂù¼ö,È«Á¤È­,±è¼º±Ç, ¼±È£Ç׸ñ°ú ¿¬·ÉÁýÇÕÀ» »ç¿ëÇÑ Å¬·¯½ºÅ͸µ ±â¹ÝÀÇ ¿µÈ­ Ãßõ ¾Ë°í¸®Áò, Á¤º¸°úÇÐȸ KCC 2015 2015.06.

l  ȲűÔ,¹ÚÂù¼ö,È«Á¤È­,±è¼º±Ç, An Algorithm for Movie Classification and Recommendation Using Genre Correlation, PlatCon-15 (2015 International Conference on Platform Technology and Service) 2015.01.

l  Sung Kwon Kim, Algorithm for the Length-Constrained Maximum-Density Path Problem in a Tree with Uniform Edge Lengths, IEICE Transactions on Information and Systems, vol. E98-D, no. 1, pp. 103--107, Jan 2015 // ¿¬±¸Àç´Ü ±âº»¿¬±¸(°³ÀÎ) 2012 ¹× Áß¾Ó´ë ¿¬±¸³â 2013// [pdf]

l  ¹ÚÂù¼ö, ȲűÔ, È«Á¤È­, ±è¼º±Ç, Preference Difference MetricÀ» ÀÌ¿ëÇÑ ¾ÆÀÌÅÛ ºÐ·ù¹æ½ÄÀÇ Ãßõ ¾Ë°í¸®Áò, Á¤º¸°úÇÐȸ ÄÄÇ»ÆÃÀÇ ½ÇÁ¦ ³í¹®Áö, Á¦21±Ç, Á¦2È£, pp. 121~125, Feb 2015. // ¿¬±¸Àç´Ü ±âº»¿¬±¸(°³ÀÎ) 2012; KCC 2014 (June 2014)  ¿ì¼ö³í¹®//

 

2014

l  È«Á¤È­, ¹ÚÂù¼ö, ȲűÔ, ±è¼º±Ç, K-means Ŭ·¯½ºÅ͸µ°ú Neighbors¡¯ Voting ±â¹Ý Àü󸮸¦ »ç¿ëÇÑ Ãßõ ½Ã½ºÅÛ, Á¤º¸°úÇÐȸ µ¿°èÇмú¹ßǥȸ, Æ÷½ºÅÍ ¹ßÇ¥, Dec 2014.

l  ȲűÔ, ¹ÚÂù¼ö, È«Á¤È­, ±è¼º±Ç, ÆòÁ¡ ºóµµ °¡ÁßÄ¡ ±â¹Ý Baseline predictor¸¦ »ç¿ëÇÑ Ãßõ ¾Ë°í¸®Áò, Á¤º¸°úÇÐȸ µ¿°èÇмú¹ßǥȸ, Æ÷½ºÅÍ ¹ßÇ¥, Dec 2014.

l  ¹ÚÂù¼ö, ȲűÔ, È«Á¤È­, ±è¼º±Ç, Preference Difference MetricÀ» ÀÌ¿ëÇÑ ¾ÆÀÌÅÛ ºÐ·ù¹æ½ÄÀÇ Ãßõ ¾Ë°í¸®Áò, Á¤º¸°úÇÐȸ KCC 2014, Æ÷½ºÅÍ ¹ßÇ¥, June 2014. (¿ì¼ö³í¹®)

l  ȲűÔ, È«Á¤È­, ¹ÚÂù¼ö, ±è¼º±Ç, ÆòÁ¡ ºóµµ¼ö°¡ ÀÛÀº ¿µÈ­µéÀÇ ÆòÁ¡ ¿¹Ãø ¼º´É Çâ»óÀ» À§ÇÑ Ãßõ ¾Ë°í¸®Áò, Á¤º¸°úÇÐȸ KCC 2014, Æ÷½ºÅÍ ¹ßÇ¥, June 2014.

l  Yoon Kyoung Choi and Sung Kwon Kim, An Auxiliary Recommendation System for Repetitively Purchasing Items in E-Commerce, International Conference on Big Data and Smart Computing (BigComp2014), pp. 9698, (Bangkok, Thailand, Jan 15-17, 2014) ÁÖÃÖ: Á¤º¸°úÇÐȸ;ÇÁ·Î½Ãµù: IEEE, IEEE Computer Society (SCOPUS) // ¿¬±¸Àç´Ü ±âº»¿¬±¸(°³ÀÎ) 2012//

2013

l  ÃÖÀ±°æ, ±è¼º±Ç, ÁÖ±âÀû ±¸¸ÅÀÚ À§ÁÖÀÇ ¿Â¶óÀÎ ¼îÇθôÀ» À§ÇÑ Ãßõ ¾Ë°í¸®Áò ±¸Çö, Á¤º¸°úÇÐȸ³í¹®Áö: ¼ÒÇÁÆ®¿þ¾î ¹× ÀÀ¿ë, Á¦40±Ç Á¦8È£, pp. 453~462, August, 2013.

l  Soo-Cheol Kim, Chan-Soo Park, Sang-Soo Yeo, Sung Kwon Kim, IPTV recommender system using social network for multiple users, Information, vol. Vol.16, No.7(B), pp. 5261-5274, July 2013. (SCOPUS)//¿¬±¸Á¶±³ A//

l  Soo-Cheol Kim, Jung-Sik Cho and Sung Kwon Kim, Performance Improvement of Hybrid Tag Anti-Collision Protocol for Radio Frequency Identification Systems, International Journal of Communication Systems, vol. 26, issue 6, pp. 705-719, June 2013. // ¿¬±¸Àç´Ü ±âº»¿¬±¸(°³ÀÎ) 2012//

l  Soo-Cheol Kim, Sang-Soo Yeo, Sung Kwon Kim, A Hybrid User Authentication Protocol for Mobile IPTV Service, Multimedia Tools & Applications, vol. 65, issue 2, pp. 283-296, May 2013 // ¿¬±¸Àç´Ü ±âº»¿¬±¸(°³ÀÎ) 2010//

l  Sung Kwon Kim, Linear-Time Algorithm for the Length-Constrained Heaviest Path Problem in a Tree with Uniform Edge Lengths, IEICE Transactions on Information and Systems,  vol. E96-D, no. 3, pp. 498--501, March 2013. //Áß¾Ó´ë ¿¬±¸³â ¹× ¿¬±¸Àç´Ü ±âº»¿¬±¸(°³ÀÎ) 2012// [pdf]

2012

l  Soo-Cheol Kim, Su-Won Lee, Kyoung-Jun Sung, Sung Kwon Kim, Splog Detection Using Structural Similarity between Posts and URL Biasedness in Posts, Journal of Internet Technology, vol. 13, no. 5, pp. 767-772, Sept., 2012. // ¿¬±¸Àç´Ü ±âº»¿¬±¸(°³ÀÎ) 2012//

l  Soo-Cheol Kim, Chan-Soo Park, and Sung Kwon Kim, A Hybrid Recommendation System Using Trust Scores in a Social Network, International Conference on Embedded and Multimedia Computing (EMC 2012), Lecture Notes in Electrical Engineering, vol. 181, pp. 107-112, DOI : 10.1007/978-94-007-5076-0_12, Series ISSN : 1876-1100, Springer Netherlands, Sept. 2012, ±¤ÁÖ. SCOPUS.

l  Chan-Soo Park, Soo-Cheol Kim, and Sung Kwon Kim, Recommendation System with User¡¯s Preference and Rating Bias, The 8th International Conference on Multimedia Information Technology and Applications (MITA 2012) vol. 8(f), ISSN: 1975-4736, pp. 0097~0099, Çѱ¹¸ÖƼ¹Ìµð¾îÇÐȸ, June 2012 ºÏ°æ.

l  ¹ÚÂù¼ö, ±è¼öö, ±è¼º±Ç, »ç¿ëÀÚ ¼±È£µµ¿Í ÆòÁ¡ ¼ºÇâÀ» ÀÌ¿ëÇÏ´Â Ãßõ½Ã½ºÅÛ, Çѱ¹Á¤º¸°úÇÐȸ Á¦ 39ȸ Ãß°èÇмú¹ßǥȸ ³í¹®Áö      , vol.39(2), ISSN:1598-5164, pp. 0156~0158, Çѱ¹Á¤º¸°úÇÐȸ, Nov. 2012, ´ëÀü.

l  ÃÖÀ±°æ, ±è¼º±Ç, ÁÖ±âÀû, ¹Ýº¹ÀûÀ¸·Î ±¸¸ÅÇÏ´Â Online ¼îÇθô¿¡¼­ÀÇ Ãßõ ¾Ë°í¸®Áò, Çѱ¹Á¤º¸°úÇÐȸ Á¦ 39ȸ Ãß°èÇмú¹ßǥȸ ³í¹®Áö, vol. 39(2), ISSN:1598-5164, pp. 0153~0155, Çѱ¹Á¤º¸°úÇÐȸ, Nov. 2012, ´ëÀü.

 2011

l  Jung-Sik Cho, Soo-Cheol Kim, Sang-Soo Yeo and Sung Kwon Kim, Consideration on the Security and Efficiency of RFID System, 3rd FTRA International Conference on Information Technology Convergence and Services (ITCS-11), IT Convergence and Services, Lecture Notes in Electrical Engineering, vol. 107, pp.511-517, October 2011. SCOPUS, Gwangju, Korea // ¿¬±¸Àç´Ü ±âº»¿¬±¸(°³ÀÎ) 2010//

l  Soo-Cheol Kim, Jung-Wan Ko, Jung-Sik Cho and Sung Kwon Kim, Collaborative Filtering Recommender System Based on Social Network, 3rd FTRA International Conference on Information Technology Convergence and Services (ITCS-11), IT Convergence and Services,  Lecture Notes in Electrical Engineering, vol 107, pp.503-510, October 2011. SCOPUS, Gwangju, Korea // ¿¬±¸Àç´Ü ±âº»¿¬±¸(°³ÀÎ) 2010//

l  Soo-Cheol Kim, Sung Kwon Kim: An Enhanced Anti-collision Algorithm for EPC Gen2 RFID System. 5th FTRA International Conference on Multimedia and Ubiquitous Engineering (MUE 2011): 293-296 June 2011, Loutraki, Greece. // ¿¬±¸Àç´Ü ±âº»¿¬±¸(°³ÀÎ) 2010//

l  Sung Kwon Kim, Optimal Algorithms for Finding the Longest Path with Length and Sum Constraints in a Tree, IEICE Transactions on Information and Systems, vol. E94-D, no. 6, pp. 1325--1328, June 2011. [pdf] // ¿¬±¸Àç´Ü ±âº»¿¬±¸(°³ÀÎ) 2009//

l  Jung-Sik Cho, Sang-Soo Yeo, and S.K. Kim, Securing against Brute-Force Attack: a Hash-Based RFID Mutual Authentication Protocol using a Secret Value, Computer Communications, vol. 34, no. 3, pp. 391397, Mar. 2011. //°úÇÐÀç´Ü ƯÁ¤±âÃÊ 2005//

l  Jung-Sik Cho, Soo-Cheol Kim, Sung Kwon Kim, Hash-based RFID Tag Mutual Authentication Scheme with Retrieval Efficiency, Ninth IEEE International Symposium on Parallel and Distributed Processing with Applications (ISPA 2011), IEEE Computer Society, pp. 324328, May 2011, Busan, Korea // ¿¬±¸Àç´Ü ±âº»¿¬±¸(°³ÀÎ) 2010//

l  Soo-Cheol Kim, Sung Kwon Kim, Personalized IPTV Content Recommendation for Social Network Group, 2011 Digest of Technical Papers International Conference on Consumer Electronics (ICCE), IEEE Consumer Electronics Society, pp. 469470, Jan. 2011. SCOPUS. Las Vegas, USA // ¿¬±¸Àç´Ü ±âº»¿¬±¸(°³ÀÎ) 2010//

 

2010

l  Sung Kwon Kim, Optimal Algorithms for Finding Density-Constrained Longest and Heaviest Paths in a Tree, IEICE Transactions on Information and Systems, vol. E93-D, no. 11, pp. 2989--2994, Nov. 2010. [pdf]  //±³³»¿¬±¸ºñ 2009//

l  Sung Kwon Kim, Optimal Online and Offline Algorithms for Finding Longest and Shortest Subsequences with Length and Sum Constraints, IEICE Transactions on Information and Systems, vol. E93-D, no. 2, pp. 250256, Feb., 2010. [pdf] // ¿¬±¸Àç´Ü ±âº»¿¬±¸(°³ÀÎ) 2009//

l  Kyoung-Jun Sung, Soo-Cheol Kim, Sung Kwon Kim, Tag Quantification for Spam Detection in Social Bookmarking System, ICMIA (2nd International Conference on Data Mining and Intelligent Information Technology Applications), pp. 297-303, Dec. 2010 // ¿¬±¸Àç´Ü ±âº»¿¬±¸(°³ÀÎ) 2010//

l  Soo-Cheol Kim, Jung-Sik Cho and Sung Kwon Kim, Agent Tag Based User Authentication Protocol for Mobile IPTV Service, 2010 Digest of Technical Papers International Conference on Consumer Electronics (ICCE), IEEE Consumer Electronics Society, IEEE Consumer Electronics Society, Jan. 2010

l  ¹éÁöÇö, Á¶Á¤½Ä, ±è¼º±Ç, Æ÷½ºÆ®ÀÇ ±¸Á¶ À¯»ç¼º°ú ÀÏÀÏ ¹ßÇà¼ö¸¦ ÀÌ¿ëÇÑ ½ºÇÃ·Î±× Å½Áö, Á¤º¸°úÇÐȸ³í¹®Áö:¼ÒÇÁÆ®¿þ¾î  ¹× ÀÀ¿ë, 37±Ç 2È£, 128138 (2010³â2¿ù)

l  °íÁ¤¿Ï, ±è¼öö, ±è¼º±Ç, ÀÎÇ÷翣¼ÈÀ» Ȱ¿ëÇÑ Ä£±¸ Ãßõ½Ã½ºÅÛ, Çѱ¹Á¤º¸°úÇÐȸ 2010 Çѱ¹ÄÄÇ»ÅÍ Çмú¹ßÇ¥³í¹®Áý Á¦37±Ç Á¦2È£(C), pp. 269~272, November 2010

l  ¹ÚÅÂÇö, ±è¼öö, ±è¼º±Ç, À帣 Á¤º¸¸¦ ÀÌ¿ëÇÑ Çù¾÷ ÇÊÅ͸µ °³¼±, Çѱ¹Á¤º¸°úÇÐȸ 2010 Çѱ¹ÄÄÇ»ÅÍ Çмú¹ßÇ¥³í¹®Áý Á¦37±Ç Á¦2È£(C), pp. 264~268(5pages), November 2010

 

2009

l  Sang-Soo Yeo, Soo-Cheol Kim, Sung Kwon Kim, Gilcheol Park, Seok Soo Kim, Ki-Sung Yang, Sung-Eon Cho, Protecting Your Privacy with a Mobile Agent Device in RFID Environment, Wireless Personal Communications, Springer, vol. 51, no. 1, pp. 165178, Oct., 2009. //°úÇÐÀç´Ü ƯÁ¤±âÃÊ 2005//

l  Sung Kwon Kim, Jung-Sik Cho, Soo-Cheol Kim, Path Maximum Query and Path Maximum Sum Query in a Tree, IEICE TRANSACTIONS on Information and Systems, vol. E92-D, no. 2, pp. 166171, Feb 2009. [pdf] //±³³»¿¬±¸ºñ//

l  Á¤½Â¹Î, Á¶Á¤½Ä, ±è¼º±Ç, FQTR: RFID ½Ã½ºÅÛÀ» À§ÇÑ »õ·Î¿î ÇÏÀ̺긮µå ÅÂ±× Ãæµ¹ ¹æÁö ÇÁ·ÎÅäÄÝ, Á¤º¸°úÇÐȸ³í¹®Áö:¼ÒÇÁÆ®¿þ¾î  ¹× ÀÀ¿ë, 36±Ç 7È£, 560570 (2009³â7¿ù)//¿ì¼ö¿¬±¸ÀÚ//

l  Jung-Sik Cho, Sung Kwon Kim, Robust Local Privacy Problem: RFID Tag Authentication Protocol, 2009 Digest of Technical Papers International Conference on Consumer Electronics (ICCE), IEEE Consumer Electronics Society, IEEE Consumer Electronics Society, Jan. 2009 //°úÇÐÀç´Ü ƯÁ¤±âÃÊ 2005//

 

International Journals & Proceedings (2008 or earlier)

 

l  Sang-Soo Yeo, Gil-Cheol Park, Seok-Soo Kim, Tai-hoon Kim, Sung Kwon Kim, "Clustering, Leaf-ordering and Visualization for Intuitive Analysis of DNA Chip Data", International Journal of Multimedia and Ubiquitous Engineering, vol. 2, no. 3, pp. 15-22, October 2007.

l  Sang Soo Yeo, Kouichi Sakurai, SungEon Cho, KiSung Yang, and Sung Kwon Kim, Forward Secure Privacy Protection Scheme for RFID System Using Advanced Encryption Standard, ISPA Workshops 2007 (WISH-07), LNCS, vol. 4743, pp. 245--254, August, 2007. //°úÇÐÀç´Ü ƯÁ¤±âÃÊ 2005//

l  Jae-Dong Shin, Sang-Soo Yeo, Tai-Hoon Kim, and Sung Kwon Kim, Hybrid Tag Anti-Collision Algorithms in RFID Systems, International Conference on Computational Science 2007 (ICCS 2007), LNCS, vol. 4490, pp. 693700, May 2007. //°úÇÐÀç´Ü ƯÁ¤±âÃÊ 2005//

l  Sang-Soo Yeo, Soo-Cheol Kim, Sung Kwon Kim, eMARP: Enhanced Mobile Agent for RFID Privacy Protection and Forgery Detection, The 1st KES Symposium on Agent and Multi-Agent Systems (AMSTA 2007), LNCS, vol. 4496, pp. 318327, May 2007.  //°úÇÐÀç´Ü ƯÁ¤±âÃÊ 2005//

l  Soo-Cheol Kim, Sang-Soo Yeo, Sung Kwon Kim, MARP: Mobile Agent for RFID Privacy Protection, LNCS, vol. 3928, pp. 300-312, April 2006. //°úÇÐÀç´Ü ƯÁ¤±âÃÊ 2005//

l  Soon Seok Kim, Sang Soo Yeo, Hong Jin Park, and Sung Kwon Kim, A New Scheme for the Location Information Protection in Mobile Communication Environments, LNCS, vol. 3685, pp. 436-441, Sep., 2005. //°úÇÐÀç´Ü ƯÁ¤±âÃÊ 2005//

l  Sang-Soo Yeo and Sung Kwon Kim, Scalable and Flexible Privacy Protection Scheme for RFID Systems, LNCS, vol. 3813, pp. 153-163, July 2005. //°úÇÐÀç´Ü ƯÁ¤±âÃÊ 2005//

l  S.K. Kim, Finding a longest nonnegative path in a constant degree tree, vol. 93, no. 6, pp. 275--279, Information Processing Letters (March 2005). //±³³» Á¤º¸Åë½Å¿¬±¸¿ø//

l  S.K. Kim, Order-preserving, upward drawing of binary trees using fewer bends, vol. 143, Issues 1-3, pp. 318-323, Discrete Applied Mathematics (Sept., 2004)

l  F.Y.L. Chin, Alfredo De Santis, Anna Lisa Ferrara, N.L. Ho, and S.K. Kim, A Simple algorithm for the constrained sequence problems, vol. 90, no. 4, pp. 175--179, Information Processing Letters (May 2004)

l  S.S. Kim, S.K. Kim, and H.J. Park, New approach for secure and efficient metering in the web advertising, LNCS, Vol. 3043, pp. 215 221, April 2004.//°úÇÐÀç´ÜƯÁ¤±âÃÊ 2003//

l  S.K. Kim, Linear-time algorithm for finding a maximum-density segment of a sequence, vol. 86, no. 6, pp. 339342, Information Processing Letters  (June 2003) //±³³» Á¤º¸Åë½Å¿¬±¸¿ø//

l  S.K. Kim and C.S. Shin, Computing the optimal bridge between two polygons, vol. 34, no. 4, pp. 337-352, Theory of Computing Systems (July 2001)

l  S.K. Kim, C.S. Shin and T.C. Yang, Labeling a rectilinear map with sliding labels, International Journal of Computational Geometry & Applications, vol. 11, no. 2, pp. 167179 (April 2001)

l  C.S. Shin, S.K. Kim and K.Y. Chwa, Area-efficient algorithms for straight-line tree drawings, Computational Geometry: Theory and Applications, vol. 15, issue 4, pp. 175-202 (April 2000)

l  S.K. Kim, C.S. Shin and T.C. Yang, Placing two disks in a convex polygon,  Information Processing Letters, vol. 73, Issue 1-2, pp. 33-39 (January 2000)

l  S.K. Kim, Constant-time RMESH algorithms for the range minima and co-minima problems, Parallel Computing, vol. 24, no. 5/6, pp. 965-977  (June 1998)

l  C.S. Shin, S.K. Kim, S.H. Kim, and K.Y. Chwa, Algorithms for drawing binary trees in the plane, Information Processing Letters, vol. 66., no. 3, pp. 133-139 (May 1998)

l  S.K. Kim, Logarithmic width, linear area upward drawing of AVL trees, Information Processing Letters, vol. 63, no. 6, pp. 303-307 (Sept. 1997)

l  S.K. Kim, Rectangulating rectilinear polygons in parallel, Parallel Computing, vol. 23, no., 3, pp. 349-367 (May 1997)

l  S.K. Kim, H-v drawings of binary trees, in 'Software Visualisation', Eds. P. Eades and K. Zhang, Series on Software Engineering and Knowledge Engineering, vol. 7, pp. 101-116, World Scientific Publishing,  (1996) //refereed book chapter//

l  S.K. Kim, A note on finding compacts sets in graphs represented by an adjacency list, Information Processing Letters, vol. 57, pp. 335-338 (March 1996)

l  S.K. Kim, The range cominima problem, Information Processing Letters, vol. 49, pp. 117-121 (Feb. 1994)

l  S. Chandran, S.K. Kim, and D. Mount, Parallel computational geometry of rectangles, Algorithmica, vol. 7, pp. 25-49 (Jan. 1992)

l  S.K. Kim, Optimal parallel algorithms for region labeling and medial axis transform of binary images, SIAM Journal on Discrete Mathematics, vol. 4, pp. 385-396 (Aug. 1991)

l  S.K. Kim, Parallel algorithms for the segment dragging problem, Information Processing Letters, vol. 36, pp. 323-327 (Dec., 1990)

l  S.K. Kim, Parallel algorithms for planar dominance counting, Parallel Computing, vol. 15, pp. 241-246 (Sept., 1990)

l  S.K. Kim, A parallel algorithm for finding a maximum clique of a set of circular-arcs of a circle, Information Processing Letters, vol. 34, pp. 235-241 (May 1990)

 

Domestic Journals (mostly written in Korean)

 

l  ±è¼º±Ç, ±è¼öö, Á¶Á¤½Ä, ½ºÆ®¸µÀÇ ÃÖ´ë ¼­ÇȽº¸¦ °è»êÇÏ´Â È¿À²ÀûÀÎ ¿ÜºÎ ¸Þ¸ð¸® ¾Ë°í¸®Áò, Á¤º¸Ã³¸®ÇÐȸ ³í¹®Áö, 15-A±Ç, 4È£, 239--242ÆäÀÌÁö (2008³â8¿ù) //Áß¾Ó´ëÇб³ Çмú¿¬±¸ºñ 2007³â//

l  ±è¼öö, ¿©»ó¼ö, ±è¼º±Ç, RFID ÇÁ¶óÀ̹ö½Ã º¸È£¸¦ À§ÇÑ Çâ»óµÈ ¸ð¹ÙÀÏ ¿¡ÀÌÀüÆ® ±â¹ý, Çѱ¹Åë½ÅÇÐȸ³í¹®Áö, 33±Ç, 2È£, ÆäÀÌÁö 208--218 (2008³â 2¿ù) //°úÇÐÀç´Ü ƯÁ¤±âÃÊ 2005//

l  ¿©»ó¼ö, °ûÁø, ±è»óÁØ, ±è¼º±Ç, ÀϹèüÇü À籸¼º ½Ã½ºÅÛµéÀÇ ¼º´É ¹× Á¤È®µµ ºñ±³ ºÐ¼®, JOURNAL OF THE KOREAN DATA ANALYSIS SOCIETY, 9±Ç, 3È£, ÆäÀÌÁö 1089--1105 (2007³â 6¿ù) //°úÇÐÀç´Ü ƯÁ¤±âÃÊ 2003//

l  ½ÅÀ絿, ¿©»ó¼ö, ±è¼º±Ç, RFID ½Ã½ºÅÛ¿¡¼­ ÇÏÀ̺긮µå ÅÂ±× Ãæµ¹¹æÁö ¾Ë°í¸®Áò, Çѱ¹Åë½ÅÇÐȸ³í¹®Áö, 32±Ç, 4È£ ÆäÀÌÁö 358364 (2007³â 4¿ù) //°úÇÐÀç´Ü ƯÁ¤±âÃÊ 2005//

l  Á¶Á¤½Ä, ¿©»ó¼ö, ±è¼º±Ç, RFID tag¸¦ À§ÇÑ °­·ÂÇÑ Yoking Proof Protocols, Çѱ¹Åë½ÅÇÐȸ³í¹®Áö, 32±Ç, 3È£ ÆäÀÌÁö 308318 (2007³â 3¿ù) //°úÇÐÀç´Ü ƯÁ¤±âÃÊ 2005//

l  ±è¼º±Ç, Æ®¸®¿¡¼­ ±æÀÌ Á¦ÇÑÀÌ ÀÖ´Â °¡Àå ¹«°Å¿î °æ·Î¸¦ ã´Â ¾Ë°í¸®Áò, Á¤º¸Ã³¸®ÇÐȸ ³í¹®Áö A, 13-A±Ç, 6È£, ÆäÀÌÁö 541--544 (2006³â12¿ù) ) //2005³â Áß¾Ó´ë ±³³»¿¬±¸(¿¬±¸³â)//

l  ±è¼º±Ç, Æ®¸®¿¡¼­ °¡Àå ±ä ºñÀ½¼ö °æ·Î¸¦ ã´Â Á÷·Ä ¹× º´·Ä ¾Ë°í¸®Áò, Çѱ¹Á¤º¸°úÇÐȸ³í¹®Áö:½Ã½ºÅÛ ¹× ÀÌ·Ð, 33±Ç, 12È£, ÆäÀÌÁö 880--884 (2006³â 12¿ù) //2004³â Áß¾Ó´ë ±³³»¿¬±¸//

l  ¿©»ó¼ö, ±è¼ø¼®, ±è¼º±Ç, "¾ÈÀüÇÑ RFID ÇÁ¶óÀ̹ö½Ã º¸È£ ÇÁ·ÎÅäÄÝÀ» À§ÇÑ ¹é¿£µå ¼­¹öÀÇ ÅÂ±× ÆÇº° ½Ã°£ Àý°¨ ±â¹ý", Çѱ¹Á¤º¸º¸È£ÇÐȸ ³í¹®Áö, vol.16, no.4, pp.13-26, August 2006. //°úÇÐÀç´Ü ƯÁ¤±âÃÊ 2005//

l  ±è»óÁØ, ¿©»ó¼ö, ±è¼º±Ç, MarSel: ´ë¿ë·® SNP ÀϹèüÇü µ¥ÀÌÅÍ¿¡ ´ëÇÑ ¿¬°üºÒ±ÕÇü±â¹ÝÀÇ tagSNP ¼±Åà ½Ã½ºÅÛ, Á¤º¸Ã³¸®ÇÐȸ ³í¹®Áö A, 13-A±Ç, 1È£, ÆäÀÌÁö 79--86 (2006³â2¿ù) //°úÇÐÀç´Ü ƯÁ¤±âÃÊ 2003//

l  ±è¼º±Ç, Â÷¼ö 3ÀÎ Æ®¸®¿¡¼­ °¡Àå ±ä ºñÀ½¼ö °æ·Î¸¦ ã´Â ¾Ë°í¸®Áò, Çѱ¹Á¤º¸°úÇÐȸ³í¹®Áö:½Ã½ºÅÛ ¹× ÀÌ·Ð, 31±Ç, 7/8È£, ÆäÀÌÁö 397--401 (2004³â 8¿ù) //2003³â Áß¾Ó´ë ±³³»¿¬±¸//

l  ¿©»ó¼ö, ±è¼º±Ç, DNA ¸¶ÀÌÅ©·Î¾î·¹ÀÌ µ¥ÀÌÅÍÀÇ Å¬·¯½ºÅ͸µ ¾Ë°í¸®Áò ¹× µµ±¸ °³¹ß, Çѱ¹Á¤º¸°úÇÐȸ³í¹®Áö:½Ã½ºÅÛ ¹× ÀÌ·Ð, 30±Ç, 9/10È£, ÆäÀÌÁö 544555 (2003³â 10¿ù) //2001³â ÇÐÁø¼±µµ¿¬±¸//

l  ±è¼ø¼®, ±è¼º±Ç, À̵¿Åë½Å ȯ°æ¿¡¼­ Àӽà ÀÍ¸í ¾ÆÀ̵𸦠ÀÌ¿ëÇÑ À§Ä¡ ºÒÃßÀû ¼­ºñ½º¿Í ÁöºÒ ÇÁ·ÎÅäÄÝ¿¡ °üÇÑ ¿¬±¸, Çѱ¹Á¤º¸°úÇÐȸ³í¹®Áö:½Ã½ºÅÛ ¹× ÀÌ·Ð, 30±Ç 2È£, ÆäÀÌÁö 7892 (2003³â 2¿ù) //°úÇÐÀç´Ü ¸ñÀû±âÃÊ2000//

l  ±è¼º±Ç, Å©·Î½º ¸µÅ©µÈ ´Ü¹éÁú ¼­ºê½ÃÄö½º¸¦ ã´Â ¾Ë°í¸®Áò, Çѱ¹Á¤º¸°úÇÐȸ³í¹®Áö:½Ã½ºÅÛ ¹× ÀÌ·Ð, 29±Ç 9/10È£, ÆäÀÌÁö 514519 (2002³â 10¿ù) //2001³â ÇÐÁø¼±µµ¿¬±¸//

l  ±è¼º±Ç, ´Ü¹éÁú ½ÃÄö½º¿Í °¡ÁßÄ¡ ½ºÆ®¸µ¿¡ ´ëÇÑ Å½»ö ¾Ë°í¸®Áò, Çѱ¹Á¤º¸°úÇÐȸ³í¹®Áö:½Ã½ºÅÛ ¹× ÀÌ·Ð, 29±Ç 7/8È£, ÆäÀÌÁö 456462 (2002³â 8¿ù) //2001³â Áß¾Ó´ë ±³³» ¿¬±¸ºñ//

l  ±è¼ø¼®, ½ÅÁ¦¿ë, ±è¼º±Ç, ÀÎÅÍ³Ý ±¤°í¿¡¼­ ¾ÈÀüÇϰí È¿À²ÀûÀÎ ÃøÁ¤ ¹æ¹ý, Çѱ¹Á¤º¸°úÇÐȸ³í¹®Áö:½Ã½ºÅÛ ¹× ÀÌ·Ð, 29±Ç 3È£, ÆäÀÌÁö 153160 (2002³â 4¿ù) //Á¤º¸Åë½Å¿ì¼ö½Ã¹üÇб³//

l  ±è¼º±Ç, ±è¼ø¼®, ½ÅÂù¼ö, ¿©»ó¼ö, Á¡ ÁýÇÕÀ» µÎ°³ÀÇ ºÎä²Ã·Î Æ÷ÇÔÇÏ´Â ¾Ë°í¸®Áò °³¹ß, Çѱ¹Á¤º¸°úÇÐȸ³í¹®Áö:½Ã½ºÅÛ ¹× ÀÌ·Ð, 28±Ç 6È£, ÆäÀÌÁö 278288 (2001³â 6¿ù) //ÇмúÁøÈïÀç´Ü ¼±µµ¿¬±¸2000//

l  ±è¼ø¼®, ¿©»ó¼ö, ±è¼º±Ç, Àü±¤ Æ®¸® ³×Æ®¿öÅ©¿¡¼­ ÆÄÀå ¹× °æ·Î ¼³Á¤ ¹®Á¦¸¦ ÇØ°áÇÏ´Â ¾Ë°í¸®Áò¿¡ °üÇÑ ¿¬±¸, Á¤º¸Ã³¸®³í¹®Áö, 7±Ç 12È£, ÆäÀÌÁö 3952-3963 (2000³â 12¿ù) //ITRC2000-2001//

l  ±è¼ø¼®, ÀÌÀç½Å, ±è¼º±Ç, ½Ç¿ëÀûÀÌ°í ¾ÈÀüÇÑ ÀüÀÚÅõÇ¥ ÇÁ·ÎÅäÄÝ¿¡ °üÇÑ ¿¬±¸, Çѱ¹Åë½ÅÁ¤º¸º¸È£ÇÐȸ³í¹®Áö, 10±Ç 4È£, ÆäÀÌÁö 21-32 (2000³â 12¿ù) //°úÇÐÀç´Ü ¸ñÀû±âÃÊ2000//

l  ±è¼º±Ç, ½ÅÂù¼ö, µÎ°³ÀÇ µ¿ÀÏÇÑ Å½Á¶µîÀ¸·Î º¼·Ï´Ù°¢ÇüÀ» ºñÃß´Â ¾Ë°í¸®Áò, Çѱ¹Á¤º¸°úÇÐȸ³í¹®Áö:½Ã½ºÅÛ ¹× ÀÌ·Ð, 27±Ç 4È£, ÆäÀÌÁö 416-419 (2000³â 4¿ù) //Áß¾Ó´ë ¿¬±¸±âÀÚÀç//

l  ±è¼º±Ç, ÀûÀº ±¼°îÁ¡À» °¡Áø ÀÌÁøÆ®¸®¸¦ ±×¸®´Â ¾Ë°í¸®Áò, Çѱ¹Á¤º¸°úÇÐȸ³í¹®Áö:½Ã½ºÅÛ ¹× ÀÌ·Ð, 27±Ç 2È£, ÆäÀÌÁö 209-215 (2000³â 2¿ù)//ÇмúÁøÈïÀç´Ü1997//

l  ±èÁ¤Çö, ½ÅÂù¼ö, ±è¼º±Ç, ÁÂ°æ·æ, º¼·Ï´Ù°¢Çü¿¡¼­ÀÇ 2-Á߽ɹ®Á¦, Çѱ¹Á¤º¸°úÇÐȸ³í¹®Áö(A), 25±Ç 9È£, ÆäÀÌÁö 989-996 (1998³â 9¿ù)//¾øÀ½//

l  ±è¼º±Ç, Àç±Í¿øÇü ´ÙÁßÄÄÇ»Å͸¦ À§ÇÑ È¿À²ÀûÀÎ Á¤·Ä ¹× º´ÇÕ ¾Ë°í¸®Áò, Çѱ¹Á¤º¸°úÇÐȸ³í¹®Áö,  23±Ç 8È£, ÆäÀÌÁö 805-812 (1996³â 8¿ù)//¾øÀ½//

l  ±è¼º±Ç, ÀÌÁøÆ®¸®ÀÇ ÃÖ¼ÒÄÆ ¼±Çü¹è¿­¿¡ °üÇÑ º´·Ä ¾Ë°í¸®Áò, Çѱ¹Á¤º¸°úÇÐȸ³í¹®Áö, 23±Ç 1È£, ÆäÀÌÁö 58-68 (1996³â 1¿ù)

l  ±è¼º±Ç, Æ®¸®¿¡¼­ °æ·ÎÇÕÀ» ±¸ÇÏ´Â º´·Ä ¾Ë°í¸®Áò, Çѱ¹Á¤º¸°úÇÐȸ³í¹®Áö, 21±Ç 2È£, ÆäÀÌÁö 416-423 (1994³â 2¿ù)

l  ±è¼º±Ç, ¿îÇϹ®Á¦, Çѱ¹Á¤º¸°úÇÐȸ³í¹®Áö, 20±Ç 12È£, ÆäÀÌÁö 1891-1901 (1993³â 12¿ù)

l  ±è¼º±Ç, ÀÌÁøÆ®¸®ÀÇ ÃÖÀû³ëµå·©Å·À» À§ÇÑ º´·Ä ¾Ë°í¸®Áò, Á¤º¸°úÇÐȸ³í¹®Áö, 19±Ç 4È£, ÆäÀÌÁö 394-399 (1992³â 7¿ù)

l  ±è¼º±Ç, A study on sequential labelings of graphs, Çѱ¹Á¤º¸°úÇÐȸ³í¹®Áö, 11±Ç 4È£, ÆäÀÌÁö 271-274 (1984³â 11¿ù)

l  ÁÂ°æ·æ, ±è¼º±Ç,µµÁ¤ÀÎ, ´Ü¼ø ´Ù°¢ÇüµéÀÇ ±³ÁýÇÕÀ» ±¸ÇÏ´Â ¾Ë°í¸®Áò, Çѱ¹Á¤º¸°úÇÐȸ³í¹®Áö, 10±Ç 4È£, ÆäÀÌÁö 225-234 (1983³â 11¿ù)

l  ±è¼º±Ç, µÎ º¼·Ï n °¢ÇüÀÇ ÇÕÁýÇÕ°ú ±³ÁýÇÕÀ» ±¸ÇÏ´Â ÃÖÀû ¾Ë°í¸®Áò, Çѱ¹Á¤º¸°úÇÐȸ³í¹®Áö, 10±Ç 3È£, ÆäÀÌÁö 147-152 (1983³â 8¿ù)

 

International Conference Proceedings / Poster Presentations

 

l  Jung-Sik Cho, Sang-Soo Yeo, Suchul Hwang, Sang-Yong Rhee, and Sung Kwon Kim, Enhanced Yoking Proof Protocols for RFID Tags and Tag Groups, Proceedings of the 22nd International Conference on Advanced Information Networking and Applications, IEEE Computer Society, pages 15911596, March 2008. //°úÇÐÀç´Ü ƯÁ¤±âÃÊ 2005//

l  Jung-Sik Cho, Jae-Dong Shin, and Sung-Kwon Kim, RFID Tag Anti-Collision Protocol: Query Tree with Reversed IDs, 10th International Conference on Advanced Communication Technology (ICACT 2008), IEEE Communications Society , 225-230, February 2008. //°úÇÐÀç´Ü ƯÁ¤±âÃÊ 2005//

l  Jung-Sik Cho, Sang-Soo Yeo, and Sung-Kwon Kim, An Analysis of RFID Tag Authentication Protocols Using Secret Value, 2007 International Conference on Future Generation Communication and Networking (FGCN 2007),  vol.1. pp.481-486, December 2007. //°úÇÐÀç´Ü ƯÁ¤±âÃÊ 2005//

l  Sang-Soo Yeo, and Sung Kwon Kim, MarSelHR: A HAplotype Reconstruction System using Linkage Disequilibrium, Frontiers in the Convergence of Bioscience and Information Technology, pp. 7580,  October, 2007. //°úÇÐÀç´Ü ƯÁ¤±âÃÊ 2003//

l  Sang Jun Kim, Sang-Soo Yeo, and Sung Kwon Kim, Implementation of a Haplotype Reconstruction Algorithm and a tag SNP Selection Algorithm for Large-scale SNP information Processing, 2005 Proceedings of  Chem-Bio Information Society, page. 50, Aug. 2005. //°úÇÐÀç´Ü ƯÁ¤±âÃÊ 2003//

l  Sang Jun Kim, Sang-Soo Yeo, and S.K. Kim, LD-based Haplotype Reconstruction System, 2nd Moscow Conference on Computational Molecular Biology, MCCMB 2005, pp. 168-169, July 2005. //°úÇÐÀç´Ü ƯÁ¤±âÃÊ 2003//

l  Sang Jun Kim, S.S. Yeo, and S.K. Kim, MarSel: improved tagSNP selection system with Phylogeny-based haplotype reconstruction, 3rd Asia-Pacific Bioinformatics Conference, p.81, January 2005. //°úÇÐÀç´Ü ƯÁ¤±âÃÊ 2003//

l  Sang Jun Kim, S.K. Kim, K.R. Na, and S.S. Yeo, MarSel: LD-based marker selection system for large-scale haplotype data, 12th International Conference on Intelligent Systems for Molecular Biology (ISMB 2004), Poster presentation, July, 2004. //°úÇÐÀç´Ü ƯÁ¤±âÃÊ 2003//

 

 

 

 

 

 

l  S.S. Yeo, S.K. Kim, J.W. Rhee, and K.R. Na, EPP: eukaryotic promoter prediction system using an efficient training approach, 11th International Conference on Intelligent Systems for Molecular Biology (ISMB 2003), Poster presentation, June, 2003. //IMT »ç¾÷ 2002//

l  S.S. Yeo, J.W. Rhee, and S.K. Kim, Development of clustering and leaf ordering tool for gene expression profiles, Genome Informatics 2002, Genome Informatics Series No. 13, pp. 260-261, Tokyo, Japan, Dec. 2002 //ÇÐÁø ¼±µµ¿¬±¸ 2002//

l  J.W. Rhee, S.S. Yeo, K.R. Na, and S.K. Kim, New training method for computational identification of promoter, Genome Informatics 2002, Genome Informatics Series No. 13, pp. 293-294, Tokyo, Japan, Dec. 2002 //IMT »ç¾÷ 2002//

l  S.S. Kim, J.Y. Shin, and S.K. Kim, Efficient metering scheme in the WWW, Proc. 2001 International Conferences on Infor-tech and Infor-net, pp. 117-121 (Beijing, China, Oct. 2001) //°úÇÐÀç´Ü ¸ñÀû±âÃÊ2000//

l  S.K. Kim and C.S. Shin, Efficient algorithms for two-center problems for a convex polygon, Proc.  COCOON 2000, Lecture Notes in Computer Science, vol. 1858, pp. 299-309  (Sydney, Australia, July 2000)

l  S.K. Kim, C.S. Shin, and T.C. Yang, Placing two disks in a convex polygon, Proc. Korea-Japan Joint Workshop on Algorithms and Computation, pp. 131-138, (Seoul, Korea, July 19-20, 1999)

l  J.S. Choi, C.S. Shin, and S.K. Kim, Computing weighted rectilinear median and center set in the presence of obstacles, Proc. International Symposium on Algorithms and Computation, Lecture Notes in Computer Science, vol. 1533, pp. 29-38 (Taejon, Korea, Dec. 1998)

l  C.S. Shin, J.H. Kim, S.K. Kim, and K.Y. Chwa, Two-center problems for a convex polygon,  Proc. 6th European Symposium on Algorithms, Lecture Notes in Computer Science, vol. 1461, pp. 199--210 (Venice, Italy, Aug. 1998)

l  S.K. Kim, An efficient parallel algorithm for the planar mincut linear arrangement problem for trees, Proc. 1997 International Symposium on Parallel Architecture, Algorithms and Networks (ISPAN'97) pp. 240-246 (Taipei, Taiwan, Dec. 1997)

l  C.S. Shin, S.K. Kim, and K.Y. Chwa, Area-efficient algorithms for upward straight-line tree drawings, Proc. 2nd International Computing & Combinatorics Conferences (COCOON'96) Lecture Notes in Computer Science, vol. 1090, pp. 106-116 (Hong Kong, June 1996)

l  S.K. Kim, Rectangulating rectilinear polygons in parallel, Proc. 1st International Computing & Combinatorics Conferences (COCOON'95) Lecture Notes in Computer Science, vol. 959, pp. 61-70 (Xian, China, Aug. 1995)

l  S.K. Kim, Simple algorithms for orthogonal upward drawings of  binary and ternary trees, Proc. 7th Canadian Conference on Computational Geometry, pp. 115-120 (Quebec, Canada, Aug. 1995)

l  S.K. Kim, A parallel algorithm for the min-cut linear arrangement of binary trees, Proc. 46th SIGAL Workshop, pp. 57-64 (Osaka, Japan, July, 1995)

l  S.K. Kim, S.R. Kim, and K.W. Ryu, Constructing a centroid tree of a tree in parallel, Proc. InfoScience'93, pp. 739-744, (Seoul, Korea, Oct. 1993)

l  S.K. Kim, A parallel algorithm for path-min queries in trees, International Conference on Computing and Information, Lecture Notes in Computer Science, vol. 468, pp. 425-432, (Niagara Falls, Canada, May 1990)

l  S.K. Kim, Optimal parallel algorithms on sorted intervals, Proc. 27th Allerton Conferences, vol. 27, pp. 766-775, (Urbana, Illinois, U.S.A., Sept. 1989

 

Domestic Conference Proceedings (mostly written in Korean)

 

l  ÃÖ½ÂÁø, ±è¼º±Ç, ±¹³» À¥ ºÐ¼®À» ÅëÇÑ À¥ ½ºÆÔÀÇ Æ¯¼º, Çѱ¹Á¤º¸°úÇÐȸ Çмú¹ßÇ¥³í¹®Áý Çѱ¹Á¤º¸°úÇÐȸ 2007 °¡À» Çмú¹ßÇ¥ ³í¹®Áý Á¦34±Ç Á¦2È£(D), pp.333-338, October 2007.

l  ÃÖ½ÂÁø, ½ÅÀ絿, ±è¼º±Ç, RFID ½Ã½ºÅÛ¿¡¼­ °³¼±µÈ Ãæµ¹ ÃßÀû ¹æ½ÄÀ» ÀÌ¿ëÇÑ Å±×ÀÎ½Ä ¾Ë°í¸®Áò, Çѱ¹Á¤º¸°úÇÐȸ Çмú¹ßÇ¥³í¹®Áý Çѱ¹Á¤º¸°úÇÐȸ 2007 Çѱ¹ÄÄÇ»ÅÍÁ¾ÇÕÇмú´ëȸ ³í¹®Áý Á¦34±Ç Á¦1È£(D), pp.473-476, June 2007.

l  ¹éÁöÇö, ±è¼º±Ç, URL ¸®´ÙÀÌ·º¼Ç ½ºÆÔ ŽÁö ±â¹ý, Çѱ¹Á¤º¸°úÇÐȸ Çмú¹ßÇ¥³í¹®Áý Çѱ¹Á¤º¸°úÇÐȸ 2007 °¡À» Çмú¹ßÇ¥ ³í¹®Áý Á¦34±Ç Á¦2È£(D), pp.540-544, October 2007.

l  Á¶Á¤È¯, ¿©»ó¼ö, ±è¼º±Ç, µ¿ÀûÀÎ Á֯ļö ÇÒ´ç°ú ÀüÆÄ¼¼±â Á¶ÀýÀ» ÀÌ¿ëÇÑ RFID ¸®´õ Ãæµ¹ ¹æÁö ±â¹ý, Çѱ¹Á¤º¸°úÇÐȸ Çмú´ëȸ, 2006³â10¿ù //°úÇÐÀç´Ü ƯÁ¤±âÃÊ 2005³â//.

l  Á¶Á¤½Ä, ¿©»ó¼ö, ±è¼º±Ç, "Çâ»óµÈ Yoking Proofs ÇÁ·ÎÅäÄÝ", Çѱ¹Á¤º¸º¸È£ÇÐȸ Çмú´ëȸ ³í¹®Áý, vol.16, no.1, pp.703-706, June 2006. (¿ì¼ö³í¹®»ó)//°úÇÐÀç´Ü ƯÁ¤±âÃÊ 2005³â//

l  ½ÅÀ絿, ¿©»ó¼ö, ±è¼º±Ç, "EPCglobal Class1 Generation2¸¦ À§ÇÑ ÇÁ¶óÀ̹ö½Ã º¸È£ ¿¡ÀÌÀüÆ®", Çѱ¹Á¤º¸º¸È£ÇÐȸ Çмú´ëȸ ³í¹®Áý, vol.16, no.1, pp.619-622, June 2006. //°úÇÐÀç´Ü ƯÁ¤±âÃÊ 2005³â//

l  Á¶Á¤È¯, ¿©»ó¼ö, ±è¼º±Ç, "°­·ÂÇÑ ÇÁ¶óÀ̹ö½Ã º¸È£¸¦ ÇÊ¿ä·Î ÇÏ´Â °í°¡ ¹°Ç°À» À§ÇÑ °³¼±µÈ RFID ÇÁ¶óÀ̹ö½Ã º¸È£ ÇÁ·ÎÅäÄÝ", Çѱ¹Á¤º¸º¸È£ÇÐȸ Çмú´ëȸ ³í¹®Áý, vol.16, no.1, pp.615-618, June 2006. //°úÇÐÀç´Ü ƯÁ¤±âÃÊ 2005³â//

l  ±è¼öö, ¿©»ó¼ö, ±è¼º±Ç, "HB ÇÁ·ÎÅäÄݰú º¯ÇüµÈ HB ÇÁ·ÎÅäÄÝ ºñ±³ºÐ¼®", Çѱ¹Á¤º¸º¸È£ÇÐȸ Çмú´ëȸ ³í¹®Áý, vol.16, no.1, pp.213-216, June 2006. //°úÇÐÀç´Ü ƯÁ¤±âÃÊ 2005³â//

l  ½ÅÀ絿, ¿©»ó¼ö, ±è¼º±Ç, "RFID ÅÂ±× Ãæµ¹ ¹æÁö ÇÁ·ÎÅäÄÝÀÇ ¼º´É ºñ±³¸¦ À§ÇÑ ½Ã¹Ä·¹ÀÌ¼Ç ½Ã½ºÅÛ", Çѱ¹ÄÄÇ»ÅÍÁ¾ÇÕÇмú´ëȸ 2006 (KCC 2006), Çѱ¹ÄÄÇ»ÅÍÁ¾ÇÕÇмú´ëȸ ³í¹®Áý, vol.33, no.1, pp.91-93, June 2006. //°úÇÐÀç´Ü ƯÁ¤±âÃÊ 2005³â//

l  Á¶Á¤È¯, ¿©»ó¼ö, ±è¼º±Ç, "°í°¡ ¹°Ç°¿¡ ÀûÇÕÇÑ °­·ÂÇÑ RFID ÇÁ¶óÀ̹ö½Ã º¸È£ ±â¹ý", Çѱ¹ÄÄÇ»ÅÍÁ¾ÇÕÇмú´ëȸ 2006 (KCC2006), Çѱ¹ÄÄÇ»ÅÍÁ¾ÇÕÇмú´ëȸ ³í¹®Áý, vol.33, no.1, pp.283-285, June 2006. //°úÇÐÀç´Ü ƯÁ¤±âÃÊ 2005³â//

l  Á¶Á¤È¯, Á¶Á¤½Ä, ¿©»ó¼ö, ±è¼º±Ç, »õ·Î¿î Ű »ý¼º ¹æ¹ýÀ» ÅëÇÑ RFID½Ã½ºÅÛÀÇ Àü¹æÀ§ º¸¾È¼º º¸È£ ÇÁ·ÎÅäÄÝ, Çѱ¹ÄÄÇ»ÅÍÁ¾ÇÕÇмú´ëȸ ³í¹®Áý 2005, Vol. 32, No. 2(A) ÆäÀÌÁö 19-21  (2005³â 11¿ù) //¿ì¼ö¹ßÇ¥³í¹®// °úÇÐÀç´Ü ƯÁ¤±âÃÊ 2005//

l  ±è¼öö, ¿©»ó¼ö, ±è¼º±Ç, RFID »ç¿ëÀÚ¸¦ À§ÇÑ °³ÀÎ ÇÁ¶óÀ̹ö½Ã º¸È£ ¿¡ÀÌÀüÆ®, Çѱ¹ÄÄÇ»ÅÍÁ¾ÇÕÇмú´ëȸ ³í¹®Áý 2005, Vol. 32, No. 2(A) ÆäÀÌÁö 58-60  (2005³â 11¿ù) //°úÇÐÀç´Ü ƯÁ¤±âÃÊ 2005//

l  Á¶Á¤È¯, ¿©»ó¼ö, ±è¼º±Ç, AES¸¦ ±â¹ÝÀ¸·Î ÇÏ´Â °³¼±µÈ RFID ÇÁ¶óÀ̹ö½Ã º¸È£ ÇÁ·ÎÅäÄÝ, Çѱ¹ÄÄÇ»ÅÍÁ¾ÇÕÇмú´ëȸ ³í¹®Áý 2005, Vol. 32, No. 1(A) ÆäÀÌÁö 100-102  (2005³â 7¿ù) //°úÇÐÀç´Ü ƯÁ¤±âÃÊ 2005//

l  ±è¼öö, ¿©»ó¼ö, ±è¼º±Ç, Àú°¡ RFID ű׸¦ À§ÇÑ Selective Blocking ±â¹Ý ÇÁ¶óÀ̹ö½Ã Çâ»ó ±â¹ý, Çѱ¹ÄÄÇ»ÅÍÁ¾ÇÕÇмú´ëȸ ³í¹®Áý 2005, Vol. 32, No. 1(A) ÆäÀÌÁö 103-105  (2005³â 7¿ù) //°úÇÐÀç´Ü ƯÁ¤±âÃÊ 2005//

l  Á¶Á¤½Ä, ¿©»ó¼ö, ±è¼º±Ç, ¹«¼± ¼¾¼­ ³×Æ®¿öÅ©¿¡¼­ÀÇ Çâ»óµÈ Ű ºÐ¹è ±â¹ý, Çѱ¹ÄÄÇ»ÅÍÁ¾ÇÕÇмú´ëȸ ³í¹®Áý 2005, Vol. 32, No. 1(A) ÆäÀÌÁö 151-153  (2005³â 7¿ù) //°úÇÐÀç´Ü ƯÁ¤±âÃÊ 2005//

l  À̽±¸, ¿©»ó¼ö, Á¶Á¤½Ä, ±è¼º±Ç, RFID ½Ã½ºÅÛ¿¡¼­ ¾ÈÀüÇϰí È¿À²ÀûÀÎ ÇÁ¶óÀ̹ö½Ã º¸È£ ±â¹ý, Çѱ¹ÄÄÇ»ÅÍÁ¾ÇÕÇмú´ëȸ ³í¹®Áý 2005, Vol. 32, No. 1(A) ÆäÀÌÁö 196-198  (2005³â 7¿ù) //°úÇÐÀç´Ü ƯÁ¤±âÃÊ 2005//

l  ±è»óÁØ, ¿©»ó¼ö, ±è¼º±Ç, ´ë¿ë·® À¯ÀüÀÚÇü µ¥ÀÌÅÍ¿¡ ´ëÇÑ LD±â¹ÝÀÇ ÀϹèüÇü À籸¼º ½Ã½ºÅÛ, Çѱ¹ÄÄÇ»ÅÍÁ¾ÇÕÇмú´ëȸ ³í¹®Áý 2005, Vol. 32, No. 1(A) ÆäÀÌÁö 271-273  (2005³â 7¿ù) //°úÇÐÀç´Ü ƯÁ¤±âÃÊ 2003//

l  Á¶Á¤½Ä, ¿©»ó¼ö, ±è¼º±Ç, ¹«¼± ¼¾¼­ ³×Æ®¿öÅ©¿¡¼­ÀÇ ³­¼ö ºÐ¹è¸¦ ÀÌ¿ëÇÑ Å° °ü¸® ±â¹ý, 2005³âµµ Çѱ¹Á¤º¸º¸È£ÇÐȸ Çϰè Çмú´ëȸ³í¹®Áý, 15±Ç 1È£, pp. 48-51 (2005³â 6¿ù) //°úÇÐÀç´Ü ƯÁ¤±âÃÊ 2005//

l  À̽±¸, Á¶Á¤½Ä, ¿©»ó¼ö, ±è¼º±Ç, RFID ÇÁ¶óÀ̹ö½Ã º¸È£¸¦ À§ÇÑ Çâ»óµÈ ±â¹ý, 2005³âµµ Çѱ¹Á¤º¸º¸È£ÇÐȸ Çϰè Çмú´ëȸ³í¹®Áý, 15±Ç 1È£, pp. 561-564 (2005³â 6¿ù) //°úÇÐÀç´Ü ƯÁ¤±âÃÊ 2005//

l  ±è¼öö, ¿©»ó¼ö, ±è¼º±Ç, Àú°¡ RFID ű׿¡ Àû¿ë °¡´ÉÇÑ Privacy Zone ±â¹ý, 2005³âµµ Çѱ¹Á¤º¸º¸È£ÇÐȸ Çϰè Çмú´ëȸ³í¹®Áý, 15±Ç 1È£, pp. 565-568 (2005³â 6¿ù) //°úÇÐÀç´Ü ƯÁ¤±âÃÊ 2005//

l  Á¶Á¤È¯, ¿©»ó¼ö, ±è¼º±Ç, AES ¾Ë°í¸®ÁòÀ» »ç¿ëÇÏ´Â RFIDÀÇ ÇÁ¶óÀ̹ö½Ã¸¦ À§ÇÑ Çâ»óµÈ º¸È£ ±â¹ý, 2005³âµµ Çѱ¹Á¤º¸º¸È£ÇÐȸ Çϰè Çмú´ëȸ³í¹®Áý, 15±Ç 1È£, pp. 582-585 (2005³â 6¿ù) //°úÇÐÀç´Ü ƯÁ¤±âÃÊ 2005//

l  ±è»óÁØ, ¿©»ó¼ö, ±è¼º±Ç, ´ë¿ë·®ÀÇ Haplotype°ú Genotypeµ¥ÀÌÅÍ¿¡ ´ëÇÑ LD±â¹ÝÀÇ tagSNP¼±Åà ½Ã½ºÅÛ        Çѱ¹»ý¹°Á¤º¸ÇÐȸ Çмú¹ßǥȸ, Á¦3±Ç          1È£, pp. 279-285 (2004³â11¿ù).//°úÇÐÀç´Ü ƯÁ¤±âÃÊ 2003//

l  Á¶Á¤½Ä, ¿©»ó¼ö, ±è¼ø¼®, ±è¼º±Ç, ¹«¼± ¼¾¼­ ³×Æ®¿öÅ©¿¡¼­ Á¤º¸º¸È£¸¦ À§ÇÑ Å° °ü¸® ÇÁ·ÎÅäÄÝ, Çѱ¹Á¤º¸°úÇÐȸ 2004³â °¡À» Çмú¹ßÇ¥³í¹®Áý(A) Á¦ 31±Ç 2È£ pp. 430~432 (2004³â 10¿ù)

l  ±è»óÁØ, ¿©»ó¼ö, ±è¼º±Ç, MarSel: Large-scale Dataset¿¡ ´ëÇÑ LD ±â¹ÝÀÇ Marker ¼±Åà ½Ã½ºÅÛ, Çѱ¹Á¤º¸°úÇÐȸ 2004³â °¡À» Çмú¹ßÇ¥³í¹®Áý(A) Á¦ 31±Ç 2È£ pp. 253~255 (2004³â 10¿ù) //°úÇÐÀç´Ü ƯÁ¤±âÃÊ 2003//

l  ±è»óÁØ, ³ª°æ¶ô, ¿©»ó¼ö, ±è¼º±Ç,   Haplotype Reconstruction ¼ÒÇÁÆ®¿þ¾îÀÇ ¼º´É Æò°¡ ¹× ºñ±³, Çѱ¹Á¤º¸°úÇÐȸ 2004³â º½ Çмú¹ßÇ¥³í¹®Áý(B), Á¦ 31±Ç 1È£ pp. 313-315 (2004³â 4¿ù). //°úÇÐÀç´Ü ƯÁ¤±âÃÊ 2003//

l  ³ª°æ¶ô, ±è»óÁØ, ¿©»ó¼ö, ±è¼º±Ç,   Haplotype ºí·Ï ºÐÇÒÀ» À§ÇÑ LD±â¹Ý ¾Ë°í¸®Áò, Çѱ¹Á¤º¸°úÇÐȸ 2004³â º½ Çмú¹ßÇ¥³í¹®Áý(B) Á¦ 31±Ç 1È£ pp. 331-333 (2004³â 4¿ù). //°úÇÐÀç´Ü ƯÁ¤±âÃÊ 2003//

l  ±èÀçÇü, Á¶Á¤½Ä, ±è¼ø¼®, ±è¼º±Ç, ¾ÏÈ£ ¾îÅ¥¹Ä·¹ÀÌÅ͸¦ ÀÌ¿ëÇÑ ¿Â¶óÀÎ °ø°³Å° ÀÎÁõ¼­ À¯È¿¼º È®ÀÎ ¹æ¹ý, 2003³âµµ Çѱ¹Á¤º¸º¸È£ÇÐȸ µ¿°èÇмú´ëȸ ³í¹®Áý, pp. 227~230 (2003³â 12¿ù)

l  ¿©»ó¼ö, ÀÌÁ¤¿ø, ±è¼º±Ç, ÇÁ·Î¸ðÅÍ ¿¹ÃøÀ» À§ÇÑ ´ÙÁß °áÁ¤ ¸ðµ¨ Áö´É ½Ã½ºÅÛ, Proceedings of the 2nd Annual Conference of the Korean Society for Bioinformatics (KSBI 2003), pp. 179~182 (2003³â 11¿ù) //º¸°Çº¹ÁöºÎ IMT2000 °úÁ¦//

l  ³ª°æ¶ô, ±è»óÁØ, ±è¼º±Ç, Improved Algorithm for Haplotype Block Partitioning: Application to Human Chromosome 22, Proceedings of the 2nd Annual Conference of the Korean Society for Bioinformatics (KSBI 2003), pp. 229~235 (2003³â 11¿ù) //°úÇÐÀç´Ü ƯÁ¤±âÃÊ 2003//

l  ±èÀçÇü, ±è¼ø¼®, ±è¼º±Ç, ÀÎÁõµÈ µñ¼Å³Ê¸®¿¡¼­ÀÇ Çâ»óµÈ Àüó¸® ¾ÏÈ£ ¾îÅ¥¹Ä·¹ÀÌÅÍ, Çѱ¹Á¤º¸°úÇÐȸ 2003³â º½ Çмú¹ßÇ¥³í¹®Áý(A) Á¦ 30±Ç 1È£ pp. 344~346 (2003³â 4¿ù)

l  ¿©»ó¼ö, ÀÌÁ¤¿ø, ±è¼º±Ç, Analysis and display of gene expression profiles with leaf ordering schemes, Proceedings of the Annual Meeting of Korean Society for Bioinformatics, vol. 1, pp. 85~92 (2002³â 11¿ù) //ÇÐÁø ¼±µµ¿¬±¸//

l  ÀÌÁ¤¿ø, ¿©»ó¼ö, ³ª°æ¶ô, ±è¼º±Ç, Eukaryotic promoter recognition with binary tree clustering method, Proceedings of the Annual Meeting of Korean Society for Bioinformatics, vol. 1, pp. 157~162 (2002³â 11¿ù)(¿ì¼ö³í¹®) //º¸°Çº¹ÁöºÎ IMT 2000 »ç¾÷//

l  ±è±¸Ã¢, ¹Úâ¼³, ±è¼ø¼®, ¹ÚâÀ±, ±è¼º±Ç , À̵¿Åë½Åȯ°æ¿¡¼­ »ç¿ëÀÚ ÇÁ¶óÀ̹ö½Ã º¸È£¸¦ À§ÇÑ ÀÍ¸í ½Ã½ºÅÛ, Çѱ¹Á¤º¸°úÇÐȸ 2002 ³â °¡À» Çмú¹ßÇ¥³í¹®Áý(I) Á¦ 29±Ç 2È£ pp. 496~498  (2002³â 10¿ù) //°úÇÐÀç´Ü ¸ñÀû±âÃÊ//

l  ¿©»ó¼ö, ÀÌÁ¤¿ø, ±è¼º±Ç, À¯ÀüÀÚ ¹ßÇö µ¥ÀÌÅÍ¿¡ ´ëÇÑ Å¬·¯½ºÅ͸µ°ú ¸®ÇÁ¿À´õ¸µ ¿¬±¸, Çѱ¹Á¤º¸°úÇÐȸ 2002³â °¡À» Çмú¹ßÇ¥³í¹®Áý(I) Á¦ 29±Ç 2È£, pp. 736~738 (2002³â 10¿ù)  //ÇÐÁø ¼±µµ ¿¬±¸//

l  ¿©»ó¼ö, ÀÌÁ¤¿ø, ±è¼º±Ç, DNA ¸¶ÀÌÅ©·Î¾î·¹ÀÌ µ¥ÀÌÅÍÀÇ °èÃþÀû Ŭ·¯½ºÅ͸µ¿¡ ´ëÇÑ ¸®ÇÁ¿À´õ¸µ ¾Ë°í¸®Áò °³¹ß, Çѱ¹Á¤º¸°úÇÐȸ 2002³â Ãá°è Çмú¹ßǥȸ ³í¹®Áý, pp. 706-708 (2002³â 4¿ù) //ÇÐÁø ¼±µµ ¿¬±¸//

l  ¹Úâ¼³, ±è¼ø¼®, ±è¼ºÈÆ, ¹ÚâÀ±, ±è¼º±Ç, À̵¿Åë½Å ȯ°æ¿¡¼­ »ç¿ëÀÚÀÇ À§Ä¡Á¤º¸¸¦ º¸È£ÇÏ´Â »õ·Î¿î ¹æ¹ý, Çѱ¹Á¤º¸°úÇÐȸ 2002³â Ãá°è Çмú¹ßǥȸ ³í¹®Áý, pp. 901-903 (2002³â 4¿ù) //°úÇÐÀç´Ü ¸ñÀû±âÃÊ//

l  ½ÅÁ¦¿ë, ±è¼ø¼®, ±è¼º±Ç, ¸ð¹ÙÀÏ Åë½Å¿¡¼­ »óÈ£ ½Å·ÚÇÒ ¼ö ÀÖ´Â °ú±Ý ½Ã½ºÅÛ¿¡ °üÇÑ ¿¬±¸, Çѱ¹Á¤º¸º¸È£ÇÐȸ Á¾ÇÕÇмú¹ßǥȸ ³í¹®Áý, 11±Ç 1È£, pp. 173-176 (2001³â 11¿ù) //°úÇÐÀç´Ü ¸ñÀû±âÃÊ//

l  ±è¼ø¼®, ½ÅÁ¦¿ë, ±è¼º±Ç, À̵¿Åë½Å ȯ°æ¿¡¼­ ÇÁ¶óÀ̹ö½Ã¸¦ °í·ÁÇÑ ÁöºÒ ¹æ¹ý, Çѱ¹Á¤º¸º¸È£ÇÐȸ Á¾ÇÕÇмú¹ßǥȸ ³í¹®Áý, 11±Ç 1È£, pp. 185-188 (2001³â 11¿ù) //°úÇÐÀç´Ü ¸ñÀû±âÃÊ//

l  ½ÅÁ¦¿ë, ±è¼ø¼®, ±è¼º±Ç, ÀÎÅÍ³Ý ±¤°í¿¡¼­ ¹æ¹® Ƚ¼ö¸¦ ÃøÁ¤ÇÏ´Â ¾ÏÈ£ÇÐÀûÀÎ ¹æ¹ý¿¡ °üÇÑ ¿¬±¸, 2001³âµµ Çѱ¹Á¤º¸Ã³¸®ÇÐȸ Ãá°èÇмú¹ßÇ¥³í¹®Áý, vol. 8, no. 1, pp. 1045-1048 (2001³â 4¿ù) // Á¤º¸Åë½Å¿ì¼ö½Ã¹üÇб³ //

l  È«¿µ±â, ÀÌÀç½Å, ±è¼ø¼®, ±è¼º±Ç, ¾ÈÀüÇÑ ÀÚüÀÎÁõ ŰºÐ¹è ÇÁ·ÎÅäÄÝ, 1999³âµµ Åë½ÅÁ¤º¸º¸È£ÇÐȸ Á¾ÇÕÇмú¹ßǥȸ³í¹®Áý, vol. 9, no. 1, pp. 323-332 (1999³â 11¿ù) //Á¤º¸Åë½Å¿ì¼ö½Ã¹üÇб³//

l  ÀÌÀç½Å, È«¿µ±â, ±è¼ø¼®, ±è¼º±Ç, È¿À²ÀûÀÎ ÀüÀÚÅõÇ¥ ÇÁ·ÎÅäÄÝ¿¡ °üÇÑ ¿¬±¸, 1999³âµµ Åë½ÅÁ¤º¸º¸È£ÇÐȸ Á¾ÇÕÇмú¹ßǥȸ³í¹®Áý, vol. 9, no. 1, pp. 301-311 (1999³â 11¿ù) //Á¤º¸Åë½Å¿ì¼ö½Ã¹üÇб³//

l  ±èÁ¤Çö, ½ÅÂù¼ö, ±è¼º±Ç, ÁÂ°æ·æ, º¼·Ï ´Ù°¢ÇüÀÇ ³»ºÎ¸¦ ºñÃß´Â µÎ°³ÀÇ µîÀ» ¹èÄ¡ÇÏ´Â ¾Ë°í¸®Áò, Çѱ¹Á¤º¸°úÇÐȸ 97³â °¡À» Çмú¹ßǥȸ ³í¹®Áý, vol. 24, no. 2 (1997³â 10¿ù)

l  ½ÅÂù¼ö, ±è¼º±Ç, ±è½ÂÈ£, ÁÂ°æ·æ, ÀÌÁøÆ®¸®¸¦ Æò¸é¿¡ ±×¸®´Â ¾Ë°í¸®Áò, Çѱ¹Á¤º¸°úÇÐȸ 97³â º½À» Çмú¹ßǥȸ ³í¹®Áý, vol. 24, no. 1 (1994³â 4¿ù)

l  ¼­Çö°ï, ±è¼º±Ç, Æ®¸®¿¡¼­ °¡Àå ¸Õ ³ëµå¸¦ ã´Â º´·Ä ¾Ë°í¸®Áò, Çѱ¹Á¤º¸°úÇÐȸ 93³â °¡À» Çмú¹ßǥȸ ³í¹®Áý, vol. 20, no. 2 (1993³â 10¿ù)

l  ±è½Â·Ï, ±è¼º±Ç, ·ù°ü¿ì, ÀÏ¹ÝÆ®¸®¸¦ ÃÖÀû³ëµå·©Å·ÇÏ´Â º´·Ä ¾Ë°í¸®Áò, Çѱ¹Á¤º¸°úÇÐȸ 92³â °¡À» Çмú¹ßǥȸ³í¹®Áý, vol. 19, no. 2, pp. 899--902 (1992³â10¿ù)

l  ±è¼º±Ç, HEAPÀ» ¸¸µå´Â º´·Ä ¾Ë°í¸®Áò, Çѱ¹Á¤º¸°úÇÐȸ ÄÄÇ»ÅÍÀÌ·Ð ¿¬±¸È¸ 92³â Çмú ¼¼¹Ì³ª ¹ßÇ¥ ¿ä¾àÁý  (1992³â 8¿ù)

l  ±è¼º±Ç, DFS Æ®¸®¸¦ ÆÇº°ÇÏ´Â º´·Ä ¾Ë°í¸®Áò, Çѱ¹Á¤º¸°úÇÐȸ 92³â º½ Çмú¹ßÇ¥³í¹®Áý, vol. 19, no. 1, pp. 607--610 (1992³â 4¿ù)

 

Miscellaneous Publications  (mostly written in Korean.) 

 

l  ÀÌÁ¤¿ø, ³ª°æ¶ô, ±è¼º±Ç, ±âÁ¸ÀÇ ÇÁ·Î¸ðÅÍ ¿¹Ãø¹æ¹ý¿¡ ´ëÇÑ ºñ±³ ºÐ¼®, Çѱ¹Á¤º¸°úÇÐȸ ÄÄÇ»ÅÍÀ̷בּ¸È¸Áö, vol. 13, no. 2, pp. 215 (2002³â12¿ù)

l  ¿©»ó¼ö, ±è¼ø¼®, ±è¼º±Ç, ÀÌÁø Æ®¸®±¸Á¶ÀÇ °í¼Ó¸Á¿¡¼­ÀÇ ¿¬°á ¿ä±¸ ½ºÄÉÁ층 ¾Ë°í¸®Áò, Áß¾Ó´ëÇб³ Á¤º¸Åë½Å¿¬±¸¼Ò ³í¹®Áý, 3±Ç 2È£, 23-38 (2001³â 12¿ù)

l  ¿©»ó¼ö, ±è¼º±Ç, DNA ¸¶ÀÌÅ©·Î¾î·¹ÀÌ µ¥ÀÌÅÍ Å¬·¯½ºÅ͸µ ¾Ë°í¸®ÁòÀÇ ¿¬±¸ µ¿Çâ, Çѱ¹Á¤º¸°úÇÐȸ ÄÄÇ»ÅÍÀ̷בּ¸È¸Áö, vol. 12, no. 1, pp. 211 (2001³â10¿ù)

l  ¿©»ó¼ö, À±ÈƱâ, ±è¼º±Ç, µðÁöÅÐ ÄÁÅÙÃ÷ÀÇ ÁöÀû Àç»ê±Ç º¸È£¸¦ À§ÇÑ À͸í ÇΰÅÇÁ¸°ÆÃÀÇ ¿¬±¸µ¿Çâ, Çѱ¹Á¤º¸º¸È£ÇÐȸ Á¤º¸º¸È£ÇÐȸÁö, Á¦11±Ç3È£ ÆäÀÌÁö 9099 (2001³â6¿ù) //ITRC2000-2001//

l  ±è¼ø¼®, ½ÅÁ¦¿ë,  ±è¼º±Ç, ÀÎÅÍ³Ý ±¤°í¿¡¼­ ¹æ¹® Ƚ¼ö¸¦ ÃøÁ¤ÇÏ´Â ¾ÏÈ£ÇÐÀûÀÎ ¹æ¹ý¿¡ °üÇÑ °íÂû, Çѱ¹Á¤º¸°úÇÐȸ Á¤º¸º¸È£¿¬±¸È¸Áö, vol. 1, no. 1, pp. 3139 (2001³â4¿ù)

l  ±è¼º±Ç, Çü½Ä¾ð¾î¿Í ¿ÀÅ丶Ÿ,  Á¤º¸°úÇÐȸÁö, (ÄÄÇ»ÅÍ À̷РƯÁý ±â°í) vol. 10, no. 6, pp. 7-14 (1992³â 12¿ù)

l  ±è¼º±Ç, An optimal parallel algorithm for the planar fixed-radius near neighbor problem, °æ¼º´ëÇб³ ³í¹®Áý, vol. 12, no. 3, 409415 (1991³â9¿ù)