Kyungjin Cho
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Kyungjin Cho has a total of 72 co-authors. Here are the top co-authors by number of shared publications:
- Eunjin Oh
Department of Computer Science and Engineering POSTECH Pohang South Korea
6 shared publications Hien Thi Nguyen
Center for Water Cycle Research, Korea Institute of Science and Technology, Seoul 02792, Republic of Korea; Faculty of Environment and Labour Safety, Ton Duc Thang University, Ho Chi Minh City, Vietnam
4 shared publications- Seongpil Jeong
Center for Water Cycle Research Korea Institute of Science and Technology 5 Hwarang-ro 14-gil Seongbuk-gu 02792 Seoul Republic of Korea
4 shared publications - Shinwoo An
Department of Computer Science and Engineering POSTECH Pohang South Korea
4 shared publications Ana Gabriela Chuquer Licto
3 shared publications- Hyokwan Bae
Department of Urban and Environmental Engineering, Ulsan National Institute of Science and Technology (UNIST), Ulsan, Republic of Korea
3 shared publications
Latest Publications
- Open Access
- 17 October 2026
- Published by Elsevier in Journal of Environmental Management
- Vol. 419
Unrevealing biofouling in a solar-powered membrane distillation process operated with intermittent mode
- 17 October 2026
- Published by Elsevier in Journal of Environmental Management
- Vol. 419
Open AccessUnrevealing biofouling in a solar-powered membrane distillation process operated with intermittent mode
- Open Access
- 11 April 2025
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 39 (25) , 26886-26894
Pre-Assignment Problem for Unique Minimum Vertex Cover on Bounded Clique-Width Graphs
Horiyama et al. (AAAI 2024) considered the problem of generating instances with a unique minimum vertex cover under certain conditions. The Pre-assignment for Uniquification of Minimum Vertex Cover problem (shortly PAU-VC) is the problem, for given a graph G, to find a minimum set S of vertices in G such that there is a unique minimum vertex cover of G containing S. We show that PAU-VC is fixed parameter tractable parameterized by clique-width, which improves an exponential algorithm for trees given by Horiyama et al. Among natural graph classes with unbounded clique-width, we show that the problem can be solved in polynomial time on split graphs and unit interval graphs.
- 11 April 2025
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 39 (25) , 26886-26894
Open AccessPre-Assignment Problem for Unique Minimum Vertex Cover on Bounded Clique-Width Graphs
Horiyama et al. (AAAI 2024) considered the problem of generating instances with a unique minimum vertex cover under certain conditions. The Pre-assignment for Uniquification of Minimum Vertex Cover problem (shortly PAU-VC) is the problem, for given a graph G, to find a minimum set S of vertices in G such that there is a unique minimum vertex cover of G containing S. We show that PAU-VC is fixed parameter tractable parameterized by clique-width, which improves an exponential algorithm for trees given by Horiyama et al. Among natural graph classes with unbounded clique-width, we show that the problem can be solved in polynomial time on split graphs and unit interval graphs.
- Open Access
- 10 April 2025
- Published by Springer Nature in Advanced Composites and Hybrid Materials
- Vol. 8 (2) , 1-14
Electromagnetic-field-sensitive bridges based on urchin-like La/Cu-Fe3O4 nanocapsules for ultra-efficient phosphate recovery and water disinfection
- 10 April 2025
- Published by Springer Nature in Advanced Composites and Hybrid Materials
- Vol. 8 (2) , 1-14
Open AccessElectromagnetic-field-sensitive bridges based on urchin-like La/Cu-Fe3O4 nanocapsules for ultra-efficient phosphate recovery and water disinfection
- 19 March 2025
- Published by Elsevier in Journal of Hazardous Materials
- Vol. 491, 137995
In situ formed sulfide–mediated aging of polystyrene microplastics and its impact on the fate of heavy metals in anaerobic digestion
- 19 March 2025
- Published by Elsevier in Journal of Hazardous Materials
- Vol. 491, 137995
In situ formed sulfide–mediated aging of polystyrene microplastics and its impact on the fate of heavy metals in anaerobic digestion
- 15 February 2025
- Published by Elsevier in Bioresource Technology
- Vol. 422, 132235
Insights into high ammonia-resistant syntrophic microbiomes and metabolic pathways during continuous anaerobic digestion of cow manure
- 15 February 2025
- Published by Elsevier in Bioresource Technology
- Vol. 422, 132235
Insights into high ammonia-resistant syntrophic microbiomes and metabolic pathways during continuous anaerobic digestion of cow manure
- 4 February 2025
- Published by Elsevier in Environmental Research
- Vol. 270, 121038
An enzymatically modified adsorbent derived from an agro-residue mitigates the environmental risks of toxic antibiotic mixtures
- 4 February 2025
- Published by Elsevier in Environmental Research
- Vol. 270, 121038
An enzymatically modified adsorbent derived from an agro-residue mitigates the environmental risks of toxic antibiotic mixtures
- Open Access
- 30 December 2024
- Published by Academic Society for Appropriate Technology in Journal of Appropriate Technology
- Vol. 10 (3) , 199-206
Spreading the Desalination Technology as the Appropriate Option for the Drinking Water in Vietnam
Water scarcity is the one of the global risks. In order to compensate the sudden decrease in the water supply due to the increase in water demand and sudden variations of water resources due to the climate change, the alternative water resource could be required. Desalination technology is the water production method which can produce the fresh water from the seawater, the unlimited water resource on earth. In the Mekong delta area, Vietnam, the feasible water resources are the rainwater, groundwater, and Mekong river water. Because the climate in the Mekong delta area, Vietnam has the distinct rainy and dry seasons, the seawater intrusion has been occurred during the dry season due to the decreased Mekong river water by the Dam construction in the upper estuary and the increased seawater level. Therefore, the Mekong river water and groundwater have been affected by the seawater intrusion and become salty which are not proper for the agricultural and drinking water purposes. In order to provide the sustainable water in the rural areas in the Mekong delta area, Vietnam, the KIST and VKIST have been collaborated and suggested several the solar-power desalination systems. In this study, the collaborations and applications of the reverse osmosis plants were summarized.
- 30 December 2024
- Published by Academic Society for Appropriate Technology in Journal of Appropriate Technology
- Vol. 10 (3) , 199-206
Open AccessSpreading the Desalination Technology as the Appropriate Option for the Drinking Water in Vietnam
Water scarcity is the one of the global risks. In order to compensate the sudden decrease in the water supply due to the increase in water demand and sudden variations of water resources due to the climate change, the alternative water resource could be required. Desalination technology is the water production method which can produce the fresh water from the seawater, the unlimited water resource on earth. In the Mekong delta area, Vietnam, the feasible water resources are the rainwater, groundwater, and Mekong river water. Because the climate in the Mekong delta area, Vietnam has the distinct rainy and dry seasons, the seawater intrusion has been occurred during the dry season due to the decreased Mekong river water by the Dam construction in the upper estuary and the increased seawater level. Therefore, the Mekong river water and groundwater have been affected by the seawater intrusion and become salty which are not proper for the agricultural and drinking water purposes. In order to provide the sustainable water in the rural areas in the Mekong delta area, Vietnam, the KIST and VKIST have been collaborated and suggested several the solar-power desalination systems. In this study, the collaborations and applications of the reverse osmosis plants were summarized.
- Open Access
Pre-assignment problem for unique minimum vertex cover on bounded clique-width graphs
Horiyama et al. (AAAI 2024) considered the problem of generating instances with a unique minimum vertex cover under certain conditions. The Pre-assignment for Uniquification of Minimum Vertex Cover problem (shortly PAU-VC) is the problem, for given a graph $G$, to find a minimum set $S$ of vertices in $G$ such that there is a unique minimum vertex cover of $G$ containing $S$. We show that PAU-VC is fixed-parameter tractable parameterized by clique-width, which improves an exponential algorithm for trees given by Horiyama et al. Among natural graph classes with unbounded clique-width, we show that the problem can be solved in linear time on split graphs and unit interval graphs.Open AccessPre-assignment problem for unique minimum vertex cover on bounded clique-width graphs
Horiyama et al. (AAAI 2024) considered the problem of generating instances with a unique minimum vertex cover under certain conditions. The Pre-assignment for Uniquification of Minimum Vertex Cover problem (shortly PAU-VC) is the problem, for given a graph $G$, to find a minimum set $S$ of vertices in $G$ such that there is a unique minimum vertex cover of $G$ containing $S$. We show that PAU-VC is fixed-parameter tractable parameterized by clique-width, which improves an exponential algorithm for trees given by Horiyama et al. Among natural graph classes with unbounded clique-width, we show that the problem can be solved in linear time on split graphs and unit interval graphs. - Open Access
- 28 May 2024
- Published by Elsevier in Journal of Hazardous Materials
- Vol. 474, 134751
Comprehensive assessment of chlorination disinfection on microplastic-associated biofilms
- 28 May 2024
- Published by Elsevier in Journal of Hazardous Materials
- Vol. 474, 134751
Open AccessComprehensive assessment of chlorination disinfection on microplastic-associated biofilms
- Open Access
- 24 March 2024
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 38 (18) , 20087-20095
Approximate Distance Oracle for Fault-Tolerant Geometric Spanners
In this paper, we present approximate distance and shortest-path oracles for fault-tolerant Euclidean spanners motivated by the routing problem in real-world road networks. A fault-tolerant Euclidean spanner for a set of points in Euclidean space is a graph in which, despite the deletion of small number of any points, the distance between any two points in the damaged graph is an approximation of their Euclidean distance. Given a fault-tolerant Euclidean spanner and a small approximation factor, our data structure allows us to compute an approximate distance between two points in the damaged spanner in constant time when a query involves any two points and a small set of failed points. Additionally, by incorporating additional data structures, we can return a path itself in time almost linear in the length of the returned path. Both data structures require near-linear space.
- 24 March 2024
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 38 (18) , 20087-20095
Open AccessApproximate Distance Oracle for Fault-Tolerant Geometric Spanners
In this paper, we present approximate distance and shortest-path oracles for fault-tolerant Euclidean spanners motivated by the routing problem in real-world road networks. A fault-tolerant Euclidean spanner for a set of points in Euclidean space is a graph in which, despite the deletion of small number of any points, the distance between any two points in the damaged graph is an approximation of their Euclidean distance. Given a fault-tolerant Euclidean spanner and a small approximation factor, our data structure allows us to compute an approximate distance between two points in the damaged spanner in constant time when a query involves any two points and a small set of failed points. Additionally, by incorporating additional data structures, we can return a path itself in time almost linear in the length of the returned path. Both data structures require near-linear space.