default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSung Kwon Kim
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j30]Sung Kwon Kim:
Enumerating Subsequences of a Sequence and Paths of a Tree in the Order of Weight. J. Comput. Sci. Eng. 13(1): 11-16 (2019)- 2016
- [j29]Soo-Cheol Kim, Kyoung-Jun Sung, Chan-Soo Park, Sung Kwon Kim:
Improvement of collaborative filtering using rating normalization. Multim. Tools Appl. 75(9): 4957-4968 (2016) - [j28]Tae-Gyu Hwang
, Chan-Soo Park, Jeong-Hwa Hong, Sung Kwon Kim:
An algorithm for movie classification and recommendation using genre correlation. Multim. Tools Appl. 75(20): 12843-12858 (2016) - 2015
- [j27]Sung Kwon Kim:
Algorithm for the Length-Constrained Maximum-Density Path Problem in a Tree with Uniform Edge Lengths. IEICE Trans. Inf. Syst. 98-D(1): 103-107 (2015) - 2014
- [c22]Yoon Kyoung Choi, Sung Kwon Kim:
An auxiliary recommendation system for repetitively purchasing items in E-commerce. BigComp 2014: 96-98 - 2013
- [j26]Sung Kwon Kim:
Linear-Time Algorithm for the Length-Constrained Heaviest Path Problem in a Tree with Uniform Edge Lengths. IEICE Trans. Inf. Syst. 96-D(3): 498-501 (2013) - [j25]Soo-Cheol Kim, Jung-Sik Cho, Sung Kwon Kim:
Performance improvement of hybrid tag anti-collision protocol for radio frequency identification systems. Int. J. Commun. Syst. 26(6): 705-719 (2013) - [j24]Soo-Cheol Kim, Sang-Soo Yeo, Sung Kwon Kim:
A hybrid user authentication protocol for mobile IPTV service. Multim. Tools Appl. 65(2): 283-296 (2013) - 2011
- [j23]Jung-Sik Cho, Sang-Soo Yeo, Sung Kwon Kim:
Securing against brute-force attack: A hash-based RFID mutual authentication protocol using a secret value. Comput. Commun. 34(3): 391-397 (2011) - [j22]Sung Kwon Kim:
Optimal Algorithms for Finding the Longest Path with Length and Sum Constraints in a Tree. IEICE Trans. Inf. Syst. 94-D(6): 1325-1328 (2011) - [c21]Jung-Sik Cho, Soo-Cheol Kim, Sung Kwon Kim:
Hash-Based RFID Tag Mutual Authentication Scheme with Retrieval Efficiency. ISPA 2011: 324-328 - [c20]Soo-Cheol Kim, Sung Kwon Kim:
An Enhanced Anti-collision Algorithm for EPC Gen2 RFID System. MUE 2011: 293-296 - 2010
- [j21]Sung Kwon Kim:
Optimal Online and Offline Algorithms for Finding Longest and Shortest Subsequences with Length and Sum Constraints. IEICE Trans. Inf. Syst. 93-D(2): 250-256 (2010) - [j20]Sung Kwon Kim:
Optimal Algorithms for Finding Density-Constrained Longest and Heaviest Paths in a Tree. IEICE Trans. Inf. Syst. 93-D(11): 2989-2994 (2010)
2000 – 2009
- 2009
- [j19]Sung Kwon Kim, Jung-Sik Cho, Soo-Cheol Kim:
Path Maximum Query and Path Maximum Sum Query in a Tree. IEICE Trans. Inf. Syst. 92-D(2): 166-171 (2009) - [j18]Sang-Soo Yeo, Soo-Cheol Kim, Sung Kwon Kim, Gilcheol Park, Seoksoo Kim, KiSung Yang, Sung-Eon Cho:
Protecting Your Privacy with a Mobile Agent Device in RFID Environment. Wirel. Pers. Commun. 51(1): 165-178 (2009) - 2008
- [c19]Jung-Sik Cho, Sang-Soo Yeo, Su-Chul Hwang, Sang-Yong Rhee, Sung Kwon Kim:
Enhanced Yoking Proof Protocols for RFID Tags and Tag Groups. AINA Workshops 2008: 1591-1596 - 2007
- [c18]Sang-Soo Yeo, Sung Kwon Kim:
MarSelHR: A Haplotype Reconstruction System Using Linkage Disequilibrium. FBIT 2007: 75-80 - [c17]Jung-Sik Cho, Sang-Soo Yeo, Sung Kwon Kim:
An Analysis of RFID Tag Authentication Protocols Using Secret Value. FGCN (1) 2007: 482-487 - [c16]Jae-Dong Shin, Sang-Soo Yeo, Tai-Hoon Kim, Sung Kwon Kim:
Hybrid Tag Anti-collision Algorithms in RFID Systems. International Conference on Computational Science (4) 2007: 693-700 - [c15]Sang-Soo Yeo, Kouichi Sakurai, Sung-Eon Cho, KiSung Yang, Sung Kwon Kim:
Forward Secure Privacy Protection Scheme for RFID System Using Advanced Encryption Standard. ISPA Workshops 2007: 245-254 - [c14]Sang-Soo Yeo, Soo-Cheol Kim, Sung Kwon Kim:
eMARP: Enhanced Mobile Agent for RFID Privacy Protection and Forgery Detection. KES-AMSTA 2007: 318-327 - 2006
- [c13]Soo-Cheol Kim, Sang-Soo Yeo, Sung Kwon Kim:
MARP: Mobile Agent for RFID Privacy Protection. CARDIS 2006: 300-312 - 2005
- [j17]Sung Kwon Kim:
Finding a longest nonnegative path in a constant degree tree. Inf. Process. Lett. 93(6): 275-279 (2005) - [c12]Sang-Soo Yeo, Sung Kwon Kim:
Scalable and Flexible Privacy Protection Scheme for RFID Systems. ESAS 2005: 153-163 - [c11]Soon Seok Kim, Sang-Soo Yeo, Hong-Jin Park, Sung Kwon Kim:
A New Scheme for the Location Information Protection in Mobile Communication Environments. MMM-ACNS 2005: 436-441 - 2004
- [j16]Sung Kwon Kim:
Order-preserving, upward drawing of binary trees using fewer bends. Discret. Appl. Math. 143(1-3): 318-323 (2004) - [c10]Soon Seok Kim, Sung Kwon Kim, Hong-Jin Park:
New Approach for Secure and Efficient Metering in the Web Advertising. ICCSA (1) 2004: 215-221 - 2003
- [j15]Sung Kwon Kim:
Linear-time algorithm for finding a maximum-density segment of a sequence. Inf. Process. Lett. 86(6): 339-342 (2003) - 2001
- [j14]Sung Kwon Kim, Chan-Su Shin, Tae-Cheon Yang:
Labeling a Rectilinear Map with Sliding Labels. Int. J. Comput. Geom. Appl. 11(2): 167-179 (2001) - [j13]Sung Kwon Kim, Chan-Su Shin:
Computing the Optimal Bridge between Two Polygons. Theory Comput. Syst. 34(4): 337-352 (2001) - 2000
- [j12]Chan-Su Shin, Sung Kwon Kim, Kyung-Yong Chwa:
Area-efficient algorithms for straight-line tree drawings. Comput. Geom. 15(4): 175-202 (2000) - [j11]Sung Kwon Kim, Chan-Su Shin, Tae-Cheon Yang:
Placing two disks in a convex polygon. Inf. Process. Lett. 73(1-2): 33-39 (2000) - [c9]Sung Kwon Kim, Chan-Su Shin:
Efficient Algorithms for Two-Center Problems for a Convex Polygon. COCOON 2000: 299-309
1990 – 1999
- 1998
- [j10]Chan-Su Shin, Sung Kwon Kim, Sung-Ho Kim, Kyung-Yong Chwa:
Algorithms for Drawing Binary Trees in the Plane. Inf. Process. Lett. 66(3): 133-139 (1998) - [j9]Sung Kwon Kim:
Constant-Time RMESH Algorithms for the Range Minima and Co-Minima Problems. Parallel Comput. 24(5-6): 965-977 (1998) - [c8]Chan-Su Shin, Jung-Hyun Kim, Sung Kwon Kim, Kyung-Yong Chwa:
Two-Center Problems for a Convex Polygon (Extended Abstract). ESA 1998: 199-210 - [c7]Joonsoo Choi, Chan-Su Shin, Sung Kwon Kim:
Computing Weighted Rectilinear Median and Center Set in the Presence of Obstacles. ISAAC 1998: 29-38 - 1997
- [j8]Sung Kwon Kim:
Logarithmic Width, Linear Area Upward Drawing of AVL Trees. Inf. Process. Lett. 63(6): 303-307 (1997) - [j7]Sung Kwon Kim:
Rectangulating Rectilinear Polygons in Parallel. Parallel Comput. 23(3): 349-367 (1997) - [c6]Sukhan Lee, Hadi Moradi, Georgios Kardaras, Sung Kwon Kim:
Geometric collision detection and potential field based time delay planning for dual arm systems. ICRA 1997: 882-887 - [c5]Sung Kwon Kim:
An efficient parallel algorithm for the planar mincut linear arrangement problem for trees. ISPAN 1997: 240-246 - 1996
- [c4]Chan-Su Shin, Sung Kwon Kim, Kyung-Yong Chwa:
Area-Efficient Algorithms for Upward Straight-Line Tree Drawings (Extended Abstract). COCOON 1996: 106-116 - 1995
- [c3]Sung Kwon Kim:
Simple algorithms for orthogonal upward drawings of binary and ternary trees. CCCG 1995: 115-120 - [c2]Sung Kwon Kim:
Rectangulating Rectilinear Polygons in Parallel. COCOON 1995: 61-70 - 1994
- [j6]Sung Kwon Kim:
The Range Co-Minima Problem. Inf. Process. Lett. 49(3): 117-121 (1994) - 1992
- [j5]Sharat Chandran, Sung Kwon Kim, David M. Mount:
Parallel Computational Geometry of Rectangles. Algorithmica 7(1): 25-49 (1992) - 1991
- [j4]Sung Kwon Kim:
Optimal Parallel Algorithms for Region Labeling and Medial Axis Transform of Binary Images. SIAM J. Discret. Math. 4(3): 385-396 (1991) - 1990
- [j3]Sung Kwon Kim:
A Parallel Algorithm for Finding a Maximum Clique of a Set of Circular Arcs of a Circle. Inf. Process. Lett. 34(5): 235-241 (1990) - [j2]Sung Kwon Kim:
Parallel Algorithms for the Segment Dragging Problem. Inf. Process. Lett. 36(6): 323-327 (1990) - [j1]Sung Kwon Kim:
Parallel algorithms for planar dominance counting. Parallel Comput. 15(1-3): 241-246 (1990) - [c1]Sung Kwon Kim:
A Parallel Algorithm for Path-Min Queries in Trees. ICCI 1990: 425-432
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
