PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Lee, Jae-Ha"

Author of the publication

copydeleteadd this publication to your clipboard
Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher.

, , and . ICALP, volume 2076 of Lecture Notes in Computer Science, page 456-468. Springer, (2001)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Florian Jaensch University of Stuttgart

Complex Physics with Graph Networks for Industrial Material Flow Simulation, , , , , and . 16th CIRP Conference on Intelligent Computation in Manufacturing Engineering, 118, page 50-55. Elsevier, (2023)

Moosung Lee University of Stuttgart

Dongwon Lee University of Stuttgart

Junghwa Lee University of Stuttgart

Ph. D. Benjamin Lee University of Stuttgart

 

Other publications of authors with the same name

Tight Analysis of a Self-Approaching Strategy for the Online Kernel-Search Problem., and . Inf. Process. Lett., 69 (1): 39-45 (1999)Searching a Polygonal Room with One Door by a 1-Searcher., , and . Int. J. Comput. Geometry Appl., 10 (2): 201-220 (2000)Carrying Umbrellas: An Online Relocation Problem on Graphs., , and . ISAAC, volume 1741 of Lecture Notes in Computer Science, page 195-204. Springer, (1999)General-demand disjoint path covers in a graph with faulty elements., and . Int. J. Comput. Math., 89 (5): 606-617 (2012)New Competitive Strategies for Searching in Unknown Star-Shaped Polygons., , , , and . Symposium on Computational Geometry, page 427-429. ACM, (1997)Visibility-Based Pursuit-Evasion in a Polygonal Room with a Door., , and . Symposium on Computational Geometry, page 281-290. ACM, (1999)Online Scheduling of Parallel Communications with Individual Deadlines., and . ISAAC, volume 1741 of Lecture Notes in Computer Science, page 383-392. Springer, (1999)Equivalence of Search Capability Among Mobile Guards with Various Visibilities., , and . ESA, volume 3221 of Lecture Notes in Computer Science, page 484-495. Springer, (2004)Improved gossipings by short messages in 2-dimensional meshes., , and . J. Parallel Distrib. Comput., 65 (7): 793-800 (2005)Simple algorithms for searching a polygon with flashlights., , and . Inf. Process. Lett., 81 (5): 265-270 (2002)