Jae-Ha Lee

Jung-Heum Park

Int. J. Comput. Math., 2012

2011

Disjoint path covers in recursive circulants G(2<sup>m</sup>, 4) with faulty elements.

[BibT_eX]

[DOI]

Sook-Yeon Kim

Jung-Heum Park

Theor. Comput. Sci., 2011

2005

Improved gossipings by short messages in 2-dimensional meshes.

[BibT_eX]

[DOI]

Jae-Hoon Kim

J. Parallel Distributed Comput., 2005

2004

Equivalence of Search Capability Among Mobile Guards with Various Visibilities.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2004

2003

Online Deadline Scheduling: Team Adversary and Restart.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

Online deadline scheduling: multiple machines and randomization.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

2002

Simple algorithms for searching a polygon with flashlights.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

Searching a Room by Two Guards.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2002

2001

Carrying Umbrellas: an Online Relocation Game on a Graph.

[BibT_eX]

[DOI]

Chong-Dae Park

J. Graph Algorithms Appl., 2001

Optimization Algorithms for Sweeping a Polygonal Region with Mobile Guards.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000

Optimal Embedding of Multiple Directed Hamiltonian Rings into d-dimensional Meshes.

[BibT_eX]

[DOI]

Chan-Su Shin

J. Parallel Distributed Comput., 2000

Searching a Polygonal Room with One Door by a 1-Searcher.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2000

Characterization of Rooms Searchable by Two Guards.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 11th International Conference, 2000

Approximation of Curvature-Constrained Shortest Paths through a Sequence of Points.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2000

1999

Tight Analysis of a Self-Approaching Strategy for the Online Kernel-Search Problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1999

Carrying Umbrellas: An Online Relocation Problem on Graphs.

[BibT_eX]

[DOI]

Chong-Dae Park

Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

Online Scheduling of Parallel Communications with Individual Deadlines.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

Visibility-Based Pursuit-Evasion in a Polygonal Room with a Door.

[BibT_eX]

[DOI]

Sung Yong Shin

Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

1997

New Competitive Strategies for Searching in Unknown Star-Shaped Polygons.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996

Directed Hamiltonian Packing in <i>d</i>-Dimensional Meshes and Its Application (Extended Abstract).

[BibT_eX]

[DOI]

Chan-Su Shin