Seonghyuk Im
Orcid: 0000-0003-1996-6801
According to our database1,
Seonghyuk Im
authored at least 4 papers
between 2016 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2025
2022
The proper conflict-free $k$-coloring problem and the odd $k$-coloring problem are NP-complete on bipartite graphs.
CoRR, 2022
2018
2016