Directed Hamiltonian Packing in d-Dimensional Meshes and Its Application (Extended Abstract). - Jae-Ha Lee; Chan-Su Shin; Kyung-Yong Chwa (ISAAC, 1996)

New Competitive Strategies for Searching in Unknown Star-Shaped Polygons. - Jae-Ha Lee; Chan-Su Shin; Jae-Hoon Kim 001; Sung Yong Shin; Kyung-Yong Chwa (SCG, 1997)

Visibility-Based Pursuit-Evasion in a Polygonal Room with a Door. - Jae-Ha Lee; Sung Yong Shin; Kyung-Yong Chwa (SCG, 1999)

Online Scheduling of Parallel Communications with Individual Deadlines. - Jae-Ha Lee; Kyung-Yong Chwa (ISAAC, 1999)

Carrying Umbrellas: An Online Relocation Problem on Graphs. - Jae-Ha Lee; Chong-Dae Park; Kyung-Yong Chwa (ISAAC, 1999)

Tight Analysis of a Self-Approaching Strategy for the Online Kernel-Search Problem. - Jae-Ha Lee; Kyung-Yong Chwa (Inf. Process. Lett., 1999)

Approximation of Curvature-Constrained Shortest Paths through a Sequence of Points. - Jae-Ha Lee; Otfried Cheong; Woo-Cheol Kwon; Sung Yong Shin; Kyung-Yong Chwa (ESA, 2000)

Characterization of Rooms Searchable by Two Guards. - Sang-Min Park; Kyung-Yong Chwa; Jae-Ha Lee (ISAAC, 2000)

Searching a Polygonal Room with One Door by a 1-Searcher. - Jae-Ha Lee; Sang-Min Park; Kyung-Yong Chwa (Int. J. Comput. Geom. Appl., 2000)

Optimal Embedding of Multiple Directed Hamiltonian Rings into d-dimensional Meshes. - Jae-Ha Lee; Chan-Su Shin; Kyung-Yong Chwa (J. Parallel Distributed Comput., 2000)

Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher. - Sang-Min Park; Jae-Ha Lee; Kyung-Yong Chwa (ICALP, 2001)

Optimization Algorithms for Sweeping a Polygonal Region with Mobile Guards. - Jae-Ha Lee; Sang-Min Park; Kyung-Yong Chwa (ISAAC, 2001)

Carrying Umbrellas: an Online Relocation Game on a Graph. - Jae-Ha Lee; Chong-Dae Park; Kyung-Yong Chwa (J. Graph Algorithms Appl., 2001)

Searching a Room by Two Guards. - Sang-Min Park; Jae-Ha Lee; Kyung-Yong Chwa (Int. J. Comput. Geom. Appl., 2002)

Simple algorithms for searching a polygon with flashlights. - Jae-Ha Lee; Sang-Min Park; Kyung-Yong Chwa (Inf. Process. Lett., 2002)

Online deadline scheduling: multiple machines and randomization. - Jae-Ha Lee (SPAA, 2003)

Online Deadline Scheduling: Team Adversary and Restart. - Jae-Ha Lee (WAOA, 2003)

Equivalence of Search Capability Among Mobile Guards with Various Visibilities. - Jae-Ha Lee; Sang-Min Park; Kyung-Yong Chwa (ESA, 2004)

Improved gossipings by short messages in 2-dimensional meshes. - Jae-Hoon Kim 001; Jae-Ha Lee; Kyung-Yong Chwa (J. Parallel Distributed Comput., 2005)

Disjoint path covers in recursive circulants G(2m, 4) with faulty elements. - Sook-Yeon Kim; Jae-Ha Lee; Jung-Heum Park (Theor. Comput. Sci., 2011)

General-demand disjoint path covers in a graph with faulty elements. - Jae-Ha Lee; Jung-Heum Park (Int. J. Comput. Math., 2012)