Hsin-Hao Su
Email: hsinhao[at] umich [dot] edu

I started to pursuit my PhD degree at University of Michigan from 2010.09, working with Professor Seth Pettie. Before coming here, I got my BS degree from National Tsing Hua University in Taiwan. I am interested in graph algorithms, combinatorial optimization problems, and approximation algorithms.

Publications:

1. Ran Duan and Hsin-Hao Su, A Scaling Algorithm for Maximum Weight Matching in Bipartite Graphs, to appear in SODA 2012. [pdf]

2. L.P. Yeh, B.F. Wang, and H.H. Su, Efficient Algorithms for the Problems of Enumerating Cuts by Non-decreasing Weights, Algorithmica, 56 (2010) 297-312. [pdf]

3. H.H. Su, C.L. Lu, and C.Y. Tang, An Improved Algorithm for Finding a Length-Constrained Maximum-Density Subtree in a Tree, Information Processing Letters, 109 (2008) 161-164. [pdf]