default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJae-Ha Lee
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j9]Jae-Ha Lee, Jung-Heum Park
:
General-demand disjoint path covers in a graph with faulty elements. Int. J. Comput. Math. 89(5): 606-617 (2012)- 2011
- [j8]Sook-Yeon Kim, Jae-Ha Lee, Jung-Heum Park:
Disjoint path covers in recursive circulants G(2m, 4) with faulty elements. Theor. Comput. Sci. 412(35): 4636-4649 (2011)
2000 – 2009
- 2005
- [j7]Jae-Hoon Kim, Jae-Ha Lee, Kyung-Yong Chwa:
Improved gossipings by short messages in 2-dimensional meshes. J. Parallel Distributed Comput. 65(7): 793-800 (2005) - 2004
- [c12]Jae-Ha Lee, Sang-Min Park, Kyung-Yong Chwa:
Equivalence of Search Capability Among Mobile Guards with Various Visibilities. ESA 2004: 484-495 - 2003
- [c11]Jae-Ha Lee:
Online deadline scheduling: multiple machines and randomization. SPAA 2003: 19-23 - [c10]Jae-Ha Lee:
Online Deadline Scheduling: Team Adversary and Restart. WAOA 2003: 206-213 - 2002
- [j6]Sang-Min Park, Jae-Ha Lee, Kyung-Yong Chwa:
Searching a Room by Two Guards. Int. J. Comput. Geom. Appl. 12(4): 339-352 (2002) - [j5]Jae-Ha Lee, Sang-Min Park, Kyung-Yong Chwa:
Simple algorithms for searching a polygon with flashlights. Inf. Process. Lett. 81(5): 265-270 (2002) - 2001
- [j4]Jae-Ha Lee, Chong-Dae Park, Kyung-Yong Chwa:
Carrying Umbrellas: an Online Relocation Game on a Graph. J. Graph Algorithms Appl. 5(5): 3-16 (2001) - [c9]Sang-Min Park, Jae-Ha Lee, Kyung-Yong Chwa:
Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher. ICALP 2001: 456-468 - [c8]Jae-Ha Lee, Sang-Min Park, Kyung-Yong Chwa:
Optimization Algorithms for Sweeping a Polygonal Region with Mobile Guards. ISAAC 2001: 480-492 - 2000
- [j3]Jae-Ha Lee, Sang-Min Park, Kyung-Yong Chwa:
Searching a Polygonal Room with One Door by a 1-Searcher. Int. J. Comput. Geom. Appl. 10(2): 201-220 (2000) - [j2]Jae-Ha Lee, Chan-Su Shin, Kyung-Yong Chwa:
Optimal Embedding of Multiple Directed Hamiltonian Rings into d-dimensional Meshes. J. Parallel Distributed Comput. 60(6): 775-783 (2000) - [c7]Jae-Ha Lee, Otfried Cheong, Woo-Cheol Kwon, Sung Yong Shin, Kyung-Yong Chwa:
Approximation of Curvature-Constrained Shortest Paths through a Sequence of Points. ESA 2000: 314-325 - [c6]Sang-Min Park, Kyung-Yong Chwa, Jae-Ha Lee:
Characterization of Rooms Searchable by Two Guards. ISAAC 2000: 515-526
1990 – 1999
- 1999
- [j1]Jae-Ha Lee, Kyung-Yong Chwa:
Tight Analysis of a Self-Approaching Strategy for the Online Kernel-Search Problem. Inf. Process. Lett. 69(1): 39-45 (1999) - [c5]Jae-Ha Lee, Sung Yong Shin, Kyung-Yong Chwa:
Visibility-Based Pursuit-Evasion in a Polygonal Room with a Door. SCG 1999: 281-290 - [c4]Jae-Ha Lee, Chong-Dae Park, Kyung-Yong Chwa:
Carrying Umbrellas: An Online Relocation Problem on Graphs. ISAAC 1999: 195-204 - [c3]Jae-Ha Lee, Kyung-Yong Chwa:
Online Scheduling of Parallel Communications with Individual Deadlines. ISAAC 1999: 383-392 - 1997
- [c2]Jae-Ha Lee, Chan-Su Shin, Jae-Hoon Kim, Sung Yong Shin, Kyung-Yong Chwa:
New Competitive Strategies for Searching in Unknown Star-Shaped Polygons. SCG 1997: 427-429 - 1996
- [c1]Jae-Ha Lee, Chan-Su Shin, Kyung-Yong Chwa:
Directed Hamiltonian Packing in d-Dimensional Meshes and Its Application (Extended Abstract). ISAAC 1996: 295-304
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
