Pin-Hsian Lee

Orcid: 0009-0009-2677-4614

According to our database1, Pin-Hsian Lee authored at least 2 papers between 2025 and 2026.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Determining the Outerthickness of Graphs Is NP-Hard.
CoRR, February, 2026

2025
On the Complexity of Finding 1-Center Spanning Trees.
Proceedings of the 19th International Symposium on Algorithms and Data Structures, 2025


  Loading...