Taekang Eom

Orcid: 0009-0009-6110-8035

According to our database¹, Taekang Eom authored at least 5 papers between 2020 and 2026.

Collaborative distances:

Dijkstra number² of five.
Erdős number³ of four.

Timeline

Legend:

Book In proceedings Article PhD thesis Dataset Other

Links

On csauthors.net:

Bibliography

2026

Shortcutting the Diameter of a Polygon.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2026

2024

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

[BibT_eX]

[DOI]

Taekang Eom

Hee-Kap Ahn

Inf. Process. Lett., 2024

2021

Largest triangles in a polygon.

[BibT_eX]

[DOI]

Seungjun Lee

Taekang Eom

Hee-Kap Ahn

Comput. Geom., 2021

Largest Similar Copies of Convex Polygons in Polygonal Domains.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Taekang Eom

Seungjun Lee

Hee-Kap Ahn

CoRR, 2020

Taekang Eom

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...