default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChul E. Kim
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1995
[j21]Chul E. Kim, Ivan Stojmenovic:
Sequential and Parallel Approximate Convex Hull Algorithms. Comput. Artif. Intell. 14(6): 597-610 (1995)- 1991
- [j20]Chul E. Kim, Ivan Stojmenovic:
On the recognition of digital planes in three-dimensional space. Pattern Recognit. Lett. 12(11): 665-669 (1991)
1980 – 1989
- 1988
- [c7]Søren Forchhammer
, Chul E. Kim:
Digital squares. ICPR 1988: 672-674 - [c6]R. P. Krishnaswamy, Chul E. Kim:
Problems of Posting Sentries: Variations on the Art Gallery Theorem. SWAT 1988: 74-85 - 1987
- [j19]Chul E. Kim, Michael A. Langston:
Movement coordination for single-track robot systems. J. Field Robotics 4(1): 49-62 (1987) - [j18]Ravinder Krishnaswamy, Chul E. Kim:
Digital Parallelism, Perpendicularity, and Rectangles. IEEE Trans. Pattern Anal. Mach. Intell. 9(2): 316-321 (1987) - 1985
- [j17]Timothy A. Anderson, Chul E. Kim:
Representation of digital line segments and their preimages. Comput. Vis. Graph. Image Process. 30(3): 279-288 (1985) - [c5]Michael A. Langston, Chul E. Kim:
Movement coordination for single-track robot systems. ICRA 1985: 523-529 - 1984
- [j16]Chul E. Kim:
Digital Disks. IEEE Trans. Pattern Anal. Mach. Intell. 6(3): 372-374 (1984) - [j15]Chul E. Kim:
Three-Dimensional Digital Planes. IEEE Trans. Pattern Anal. Mach. Intell. 6(5): 639-645 (1984) - [c4]Chul E. Kim, Timothy A. Anderson:
Digital Disks and a Digital Compactness Measure. STOC 1984: 117-124 - 1983
- [j14]Chul E. Kim:
Three-Dimensional Digital Line Segments. IEEE Trans. Pattern Anal. Mach. Intell. 5(2): 231-234 (1983) - 1982
- [j13]Chul E. Kim:
On cellular straight line segments. Comput. Graph. Image Process. 18(4): 369-381 (1982) - [j12]Chul E. Kim, Azriel Rosenfeld:
Digital Straight Lines and Convexity of Digital Regions. IEEE Trans. Pattern Anal. Mach. Intell. 4(2): 149-153 (1982) - [j11]Chul E. Kim, Azriel Rosenfeld:
Convex Digital Solids. IEEE Trans. Pattern Anal. Mach. Intell. 4(6): 612-618 (1982) - [j10]Chul E. Kim:
Digital Convexity, Straightness, and Convex Polygons. IEEE Trans. Pattern Anal. Mach. Intell. 4(6): 618-626 (1982) - [j9]Chul E. Kim, Jack Sklansky:
Digital and cellular convexity. Pattern Recognit. 15(5): 359-367 (1982) - 1981
- [j8]Chul E. Kim:
On the Cellular Convexity of Complexes. IEEE Trans. Pattern Anal. Mach. Intell. 3(6): 617-625 (1981) - [c3]Chul E. Kim, Azriel Rosenfeld:
Digital Straightness and Convexity (Extended Abstract). STOC 1981: 80-89
1970 – 1979
- 1978
- [j7]Oscar H. Ibarra, Chul E. Kim:
Approximation Algorithms for Certain Scheduling Problems. Math. Oper. Res. 3(3): 197-204 (1978) - [j6]Greg N. Frederickson, Matthew S. Hecht, Chul E. Kim:
Approximation Algorithms for Some Routing Problems. SIAM J. Comput. 7(2): 178-193 (1978) - 1977
- [j5]Oscar H. Ibarra, Chul E. Kim:
Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors. J. ACM 24(2): 280-289 (1977) - 1976
- [j4]Oscar H. Ibarra, Chul E. Kim:
A Useful Device for Showing the Solvability of Some Decision Problems. J. Comput. Syst. Sci. 13(2): 153-160 (1976) - [j3]Oscar H. Ibarra, Sartaj Sahni, Chul E. Kim:
Finite Automata with Multiplication. Theor. Comput. Sci. 2(3): 271-294 (1976) - [c2]Greg N. Frederickson, Matthew S. Hecht, Chul E. Kim:
Approximation Algorithms for some Routing Problems. FOCS 1976: 216-227 - [c1]Oscar H. Ibarra, Chul E. Kim:
A Useful Device for Showing the Solvability of Some Decision Problems. STOC 1976: 135-140 - 1975
- [j2]Oscar H. Ibarra, Chul E. Kim:
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems. J. ACM 22(4): 463-468 (1975) - 1974
- [j1]Oscar H. Ibarra, Chul E. Kim:
On 3-Head Versus 2-Head Finite Automata. Acta Informatica 4: 193-200 (1974)
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-25 05:43 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:
