Taekang Eom

According to our database, Taekang Eom authored at least 4 papers between 2020 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

A linear-time algorithm for the center problem in weighted cycle graphs.

Taekang Eom, Hee-Kap Ahn

Inf. Process. Lett., 2024

2021

Largest triangles in a polygon.

Seungjun Lee, Taekang Eom, Hee-Kap Ahn

Comput. Geom., 2021

Largest Similar Copies of Convex Polygons in Polygonal Domains.

Taekang Eom, Seungjun Lee, Hee-Kap Ahn

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

2020

Largest similar copies of convex polygons amidst polygonal obstacles.

Taekang Eom, Seungjun Lee, Hee-Kap Ahn

CoRR, 2020