Jungho Ahn
Orcid: 0000-0003-0511-1976
According to our database1,
Jungho Ahn
authored at least 15 papers
between 2020 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2025
The proper conflict-free k-coloring problem and the odd k-coloring problem are NP-complete on bipartite graphs.
Discret. Appl. Math., 2025
Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science, 2025
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025
Approximating Maximum Cut on Interval Graphs and Split Graphs Beyond Goemans-Williamson.
Proceedings of the Approximation, 2025
2024
Developing a Three-Dimensional Motion Data Analysis System Using the Hilbert-Huang Transform.
Proceedings of the 13th IEEE Global Conference on Consumer Electronics, 2024
2023
Unified Almost Linear Kernels for Generalized Covering and Packing Problems on Nowhere Dense Classes.
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023
2022
Towards Constant-Factor Approximation for Chordal/Distance-Hereditary Vertex Deletion.
Algorithmica, 2022
2021
Proceedings of the Algorithms and Complexity - 12th International Conference, 2021
2020
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020