default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKyungjin Cho
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c9]Kyungjin Cho, Jihun Shin, Eunjin Oh:
Approximate Distance Oracle for Fault-Tolerant Geometric Spanners. AAAI 2024: 20087-20095- [c8]Kyungjin Cho, Eunjin Oh, Haitao Wang, Jie Xue:
Optimal Algorithm for the Planar Two-Center Problem. SoCG 2024: 40:1-40:15 - [c7]Shinwoo An, Kyungjin Cho, Leo Jang, Byeonghyeon Jung, Yudam Lee, Eunjin Oh, Donghun Shin, Hyeonjun Shin, Chanho Song:
Dynamic Parameterized Problems on Unit Disk Graphs. ISAAC 2024: 6:1-6:15 - [c6]Kyungjin Cho, Eunjin Oh:
Mimicking Networks for Constrained Multicuts in Hypergraphs. ISAAC 2024: 21:1-21:14 - [i10]Shinwoo An, Yeonsu Chang, Kyungjin Cho, O-joung Kwon, Myounghwan Lee, Eunjin Oh, Hyeonjun Shin:
Pre-assignment problem for unique minimum vertex cover on bounded clique-width graphs. CoRR abs/2408.09591 (2024) - [i9]Kyungjin Cho, Eunjin Oh:
Mimicking Networks for Constrained Multicuts in Hypergraphs. CoRR abs/2409.12548 (2024) - [i8]Shinwoo An, Kyungjin Cho, Leo Jang, Byeonghyeon Jung, Yudam Lee, Eunjin Oh, Donghun Shin, Hyeonjun Shin, Chanho Song:
Dynamic parameterized problems on unit disk graphs. CoRR abs/2409.13403 (2024) - 2023
- [j6]Kyungjin Cho, Eunjin Oh:
Linear-time approximation scheme for k-means clustering of axis-parallel affine subspaces. Comput. Geom. 112: 101981 (2023) - [j5]Kyungjin Cho, Ki Duk Kim
, Yujin Nam, Jiheon Jeong, Jeeyoung Kim, Changyong Choi, Soyoung Lee, Jun Soo Lee, Seoyeon Woo, Gil-Sun Hong, Joon Beom Seo, Namkug Kim:
CheSS: Chest X-Ray Pre-trained Model via Self-supervised Contrastive Learning. J. Digit. Imaging 36(3): 902-910 (2023) - [j4]Kyungjin Cho, Jeeyoung Kim, Ki Duk Kim, Seungju Park, Junsik Kim, Jihye Yun, Yura Ahn, Sang Young Oh, Sang Min Lee, Joon Beom Seo, Namkug Kim:
MuSiC-ViT: A multi-task Siamese convolutional vision transformer for differentiating change from no-change in follow-up chest radiographs. Medical Image Anal. 89: 102894 (2023) - [c5]Jiheon Jeong, Ki Duk Kim, Yujin Nam, Kyungjin Cho, Jiseon Kang, Gil-Sun Hong, Namkug Kim:
Generating High-Resolution 3D CT with 12-Bit Depth Using a Diffusion Model with Adjacent Slice and Intensity Calibration Network. MICCAI (10) 2023: 366-375 - [c4]Kyungjin Cho, Eunjin Oh, Seunghyeok Oh:
Parameterized Algorithm for the Disjoint Path Problem on Planar Graphs: Exponential in k2 and Linear in n. SODA 2023: 3734-3758 - [c3]Shinwoo An, Kyungjin Cho, Eunjin Oh:
Faster Algorithms for Cycle Hitting Problems on Disk Graphs. WADS 2023: 29-42 - [i7]Hong-Jun Choi, Dongbin Na, Kyungjin Cho, Byunguk Bae, Seo Taek Kong, Hyunjoon An:
Self-accumulative Vision Transformer for Bone Age Assessment Using the Sauvegrain Method. CoRR abs/2303.16557 (2023) - [i6]Shinwoo An, Kyungjin Cho, Eunjin Oh:
Faster Algorithms for Cycle Hitting Problems on Disk Graphs. CoRR abs/2311.03665 (2023) - [i5]Kyungjin Cho, Jihun Shin, Eunjin Oh:
Approximate Distance and Shortest-Path Oracles for Fault-Tolerant Geometric Spanners. CoRR abs/2312.16397 (2023) - 2022
- [j3]Kyungjin Cho, Jiyeon Seo, Sunggu Kyung, Mingyu Kim, Gil-Sun Hong, Namkug Kim:
Bone suppression on pediatric chest radiographs via a deep learning-based cascade model. Comput. Methods Programs Biomed. 215: 106627 (2022) - [j2]Ki Duk Kim, Kyungjin Cho, Mingyu Kim, Kyung Hwa Lee, Seungjun Lee, Sang Min Lee, Kyung Hee Lee, Namkug Kim:
Enhancing deep learning based classifiers with inpainting anatomical side markers (L/R markers) for multi-center trials. Comput. Methods Programs Biomed. 220: 106705 (2022) - [j1]Sunggu Kyung, Keewon Shin, Hyunsu Jeong, Ki Duk Kim, Jooyoung Park, Kyungjin Cho, Jeong Hyun Lee, Gil-Sun Hong, Namkug Kim:
Improved performance and robustness of multi-task representation learning with consistency loss between pretexts for intracranial hemorrhage identification in head CT. Medical Image Anal. 81: 102489 (2022) - [i4]Kyungjin Cho, Eunjin Oh, Seunghyeok Oh:
Parameterized Algorithm for the Disjoint Path Problem on Planar Graphs: Exponential in k2 and Linear in n. CoRR abs/2211.03341 (2022) - 2021
- [c2]Kyungjin Cho, Eunjin Oh:
Linear-Time Approximation Scheme for k-Means Clustering of Axis-Parallel Affine Subspaces. ISAAC 2021: 46:1-46:13 - [i3]Ryoungwoo Jang, Minjee Kim, Da-in Eun, Kyungjin Cho, Jiyeon Seo, Namkug Kim:
Barcode Method for Generative Model Evaluation driven by Topological Data Analysis. CoRR abs/2106.02207 (2021) - [i2]Kyungjin Cho, Eunjin Oh:
Linear-Time Approximation Scheme for k-Means Clustering of Affine Subspaces. CoRR abs/2106.14176 (2021) - 2020
- [c1]Julia Plummer, Kyungjin Cho:
Integrating Narrative into the Design of Preschool Science Programs. ICLS 2020 - [i1]Kyungjin Cho, Eunjin Oh:
Optimal Algorithm for the Planar Two-Center Problem. CoRR abs/2007.08784 (2020)
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 2025-01-21 21:22 CET 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:
