Hiep Han

I am a post-doctoral researcher at USP under the supervision of Yoshiharu Kohayakawa. My areas of interest include extremal combinatorics, (quasi-)random structures, probabilistic methods and algorithms & complexity. I defended my PhD in 2010 at the Department of Computer Science, Humboldt University, Berlin. My supervisor was Mathias Schacht. Before coming to São Paulo I spent one year at the Department of Mathematics, University of Hamburg.

Publications

Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs
(with E. Buß and M. Schacht) submitted
Weak quasi-randomness for uniform hypergraphs
(with D. Conlon, Y. Person, and M. Schacht) submitted
Quasi-randomness and algorithmic regularity for graphs with general degree distributions.
(with N. Alon, A. Coja-Oghlan, M. Kang, V. Rödl and M. Schacht)
SIAM Journal on Computing 39(6), 2336-2362, 2010.
Extended abstract appeared in Proceedings of ICALP 2007, 789-800.
Dirac-type results for loose Hamilton cycles in uniform hypergraphs
(with M. Schacht) Journal of Combinatorial Theory (B) 100(3), 332-346, 2010
Note on strong refutation algorithms for random k-SAT formulas
(with Y. Person and M. Schacht) Proceedings of LAGOS 2009, vol. 35 series. Electron. Notes Discrete Math. 157-162.
On perfect matchings in uniform hypergraphs with large minimum vertex degree
(with Y. Person and M. Schacht) SIAM Journal on Discrete Mathematics 23(2), 732-748, 2009.