| 2008 |
|---|
| 34 | EE | Jung-Sik Cho,
Sang-Soo Yeo,
Suchul Hwang,
Sang-Yong Rhee,
Sung Kwon Kim:
Enhanced Yoking Proof Protocols for RFID Tags and Tag Groups.
AINA Workshops 2008: 1591-1596 |
| 2007 |
|---|
| 33 | EE | Sang-Soo Yeo,
Sung Kwon Kim:
MarSelHR: A Haplotype Reconstruction System Using Linkage Disequilibrium.
FBIT 2007: 75-80 |
| 32 | EE | Jung-Sik Cho,
Sang-Soo Yeo,
Sung Kwon Kim:
An Analysis of RFID Tag Authentication Protocols Using Secret Value.
FGCN (1) 2007: 482-487 |
| 31 | EE | 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 |
| 30 | EE | 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 |
| 29 | EE | 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 |
|---|
| 28 | EE | Soo-Cheol Kim,
Sang-Soo Yeo,
Sung Kwon Kim:
MARP: Mobile Agent for RFID Privacy Protection.
CARDIS 2006: 300-312 |
| 2005 |
|---|
| 27 | EE | Sang-Soo Yeo,
Sung Kwon Kim:
Scalable and Flexible Privacy Protection Scheme for RFID Systems.
ESAS 2005: 153-163 |
| 26 | EE | 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 |
| 25 | EE | Sung Kwon Kim:
Finding a longest nonnegative path in a constant degree tree.
Inf. Process. Lett. 93(6): 275-279 (2005) |
| 2004 |
|---|
| 24 | EE | 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 |
| 23 | EE | Sung Kwon Kim:
Order-preserving, upward drawing of binary trees using fewer bends.
Discrete Applied Mathematics 143(1-3): 318-323 (2004) |
| 2003 |
|---|
| 22 | EE | Sung Kwon Kim:
Linear-time algorithm for finding a maximum-density segment of a sequence.
Inf. Process. Lett. 86(6): 339-342 (2003) |
| 2001 |
|---|
| 21 | | Sung Kwon Kim,
Chan-Su Shin,
Tae-Cheon Yang:
Labeling a Rectilinear Map with Sliding Labels.
Int. J. Comput. Geometry Appl. 11(2): 167-179 (2001) |
| 20 | EE | Sung Kwon Kim,
Chan-Su Shin:
Computing the Optimal Bridge between Two Polygons.
Theory Comput. Syst. 34(4): 337-352 (2001) |
| 2000 |
|---|
| 19 | EE | Sung Kwon Kim,
Chan-Su Shin:
Efficient Algorithms for Two-Center Problems for a Convex Polygon.
COCOON 2000: 299-309 |
| 18 | | Chan-Su Shin,
Sung Kwon Kim,
Kyung-Yong Chwa:
Area-efficient algorithms for straight-line tree drawings.
Comput. Geom. 15(4): 175-202 (2000) |
| 17 | EE | 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) |
| 1998 |
|---|
| 16 | EE | 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 |
| 15 | EE | Joonsoo Choi,
Chan-Su Shin,
Sung Kwon Kim:
Computing Weighted Rectilinear Median and Center Set in the Presence of Obstacles.
ISAAC 1998: 29-38 |
| 14 | EE | 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) |
| 13 | | Sung Kwon Kim:
Constant-Time RMESH Algorithms for the Range Minima and Co-Minima Problems.
Parallel Computing 24(5-6): 965-977 (1998) |
| 1997 |
|---|
| 12 | EE | Sung Kwon Kim:
An efficient parallel algorithm for the planar mincut linear arrangement problem for trees.
ISPAN 1997: 240-246 |
| 11 | EE | Sung Kwon Kim:
Logarithmic Width, Linear Area Upward Drawing of AVL Trees.
Inf. Process. Lett. 63(6): 303-307 (1997) |
| 10 | | Sung Kwon Kim:
Rectangulating Rectilinear Polygons in Parallel.
Parallel Computing 23(3): 349-367 (1997) |
| 1996 |
|---|
| 9 | | 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 |
|---|
| 8 | | Sung Kwon Kim:
Rectangulating Rectilinear Polygons in Parallel.
COCOON 1995: 61-70 |
| 1994 |
|---|
| 7 | | Sung Kwon Kim:
The Range Co-Minima Problem.
Inf. Process. Lett. 49(3): 117-121 (1994) |
| 1992 |
|---|
| 6 | | Sharat Chandran,
Sung Kwon Kim,
David M. Mount:
Parallel Computational Geometry of Rectangles.
Algorithmica 7(1): 25-49 (1992) |
| 1991 |
|---|
| 5 | | Sung Kwon Kim:
Optimal Parallel Algorithms for Region Labeling and Medial Axis Transform of Binary Images.
SIAM J. Discrete Math. 4(3): 385-396 (1991) |
| 1990 |
|---|
| 4 | | Sung Kwon Kim:
A Parallel Algorithm for Path-Min Queries in Trees.
ICCI 1990: 425-432 |
| 3 | | 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) |
| 2 | | Sung Kwon Kim:
Parallel Algorithms for the Segment Dragging Problem.
Inf. Process. Lett. 36(6): 323-327 (1990) |
| 1 | | Sung Kwon Kim:
Parallel algorithms for planar dominance counting.
Parallel Computing 15(1-3): 241-246 (1990) |
