|
1. |
"Facility location and the geometric minimum-diameter spanning tree",
Computational Geometry: Theory and Applications,
Vol.27, No.1, pp.87-106, 2004 (Joachim Gudmundsson, Herman Haverkort,
Sang-Min Park, Chan-Su Shin and Alexander Wolff)
|
|
2. |
"Searching a room by two guards",
International Journal of Computational Geometry and Applications,
Vol.12, No.4, pp.339-352, 2002 (Sang-Min Park, Jae-Ha Lee and Kyung-Yong Chwa)
|
|
3. |
"Simple algorithms for searching a polygon with flashlights",
Information Processing Letters, 81(5):265-270, 2002 (Jae-Ha Lee, Sang-Min Park and Kyung-Yong Chwa)
|
|
4. |
"Searching a polygonal room with one door by a 1-searcher",
International Journal of Computational Geometry and Applications,
Vol.10, No.2, pp.201-220, 2000 (Jae-Ha Lee, Sang-Min Park and Kyung-Yong Chwa)
|
|
1. |
"Equivalence of Search Capability Among Mobile Guards with Various Visibilities",
In Proc. of the 12th Annual European Symposium on Algorithms(ESA'04), Bergen, Norway,
2004 - LNCS Vol. 3221, Pages:484-495 (Jae-Ha Lee, Sang-Min Park and Kyung-Yong Chwa)
|
|
2. |
"Facility Location and the Geometric Minimum-Diameter Spanning Tree" ,
In Proc. of the 5th Int. Workshop on Approximation Algorithms for Combinatorial
Optimization (APPROX'02), Roma, Italy, 2002 - LNCS
Vol. 2462, Pages:146-160
(Joachim Gudmundsson, Herman Haverkort, Sang-Min Park, Chan-Su Shin and Alexander Wolff)
|
|
3. |
"Approximating the Geometric Minimum-Diameter Spanning Tree" ,
In Proc. of the 18th European Workshop on Computational Geometry (EuroCG'02), Pages:41-45, Warszawa, Poland, 2002
(Joachim Gudmundsson, Herman Haverkort, Sang-Min Park, Chan-Su Shin and Alexander Wolff) - Invited to Computational Geometry: Theory and Applications |
|
4. |
"Optimization algorithms for sweeping a polygonal region with mobile guards",
In Proc. of the 12th International Symposium on Algorithms and Computation (ISAAC'01),
Christchurch, New Zealand, 2001 - LNCS Vol. 2223,
Pages:480-492
(Jae-Ha Lee, Sang-Min Park and Kyung-Yong Chwa)
|
|
5. |
"Visibility-based pursuit-evasion in a polygonal region by a searcher",
In Proc. of the 28th International Colloquium on Automata, Languages and Programming (ICALP'01),
Crete, Greece, 2001 - LNCS Vol. 2076, Pages:456-468
(Sang-Min Park, Jae-Ha Lee and Kyung-Yong Chwa) |
|
6. |
"A Characterization of the class of polygons searchable by a 1-searcher",
In Proc. of the 17th European Workshop on Computational Geometry (EuroCG'01), Pages:133-136,
Berlin, Germany, 2001 (Sang-Min Park, Jae-Ha Lee and Kyung-Yong Chwa) -
Invited to Computational Geometry: Theory and Applications |
|
7. |
"Characterization of rooms searchable by two guards", In Proc. of the 11th International Symposium
on Algorithms and Computation (ISAAC'00), Taipei, Taiwan, 2000 -
LNCS Vol. 1969,
Pages:515-526 (Sang-Min Park, Jae-Ha Lee and Kyung-Yong Chwa)
- Invited to International Journal of Computational Geometry and Applications |
|
1. |
"Approximation Algorithm for a Minimum-Diameter Spanning Tree", Journal of Korea Information Science Society, Vol.30, No.6, pp.319-323, 2003
(Chan-Su Shin and Sang-Min Park) |
|
2. |
"Embedding of complete binary trees and meshes of trees into recursive circulants
G(2^m,4)", Journal of Korea Information Science Society, Vol.24, No.4, pp.369-378, 1997
(Sang-Min Park, Sook-Yeon Kim, Jung-Heum Park and Kyung-Yong Chwa) |