Hantao Yu
1 indexed paper
Recent (6 mo)
1With code
0Influential cites
0Benchmarked
0Publications per year
126
Top categories
Complexity×1
Research Timeline
2026
Minimum Edge-Outerplanar Embeddings are Polynomial-Time Computable
This paper proves that the minimum edge-outerplanarity of a planar graph can be computed in polynomial time.
Highlighted terms show continued research focus across papers