Hiêp Hàn
According to our database1,
Hiêp Hàn
authored at least 22 papers
between 2009 and 2020.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
On csauthors.net:
Bibliography
2020
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020
Proceedings of the LATIN 2020: Theoretical Informatics, 2020
2019
Almost partitioning 2?colored complete 3?uniform hypergraphs into two monochromatic tight or loose cycles.
J. Graph Theory, 2019
2018
SIAM J. Discret. Math., 2018
Improved Bound on the Maximum Number of Clique-Free Colorings with Two and Three Colors.
SIAM J. Discret. Math., 2018
2017
Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles.
Electron. Notes Discret. Math., 2017
Electron. Notes Discret. Math., 2017
Comb. Probab. Comput., 2017
2015
Electron. Notes Discret. Math., 2015
Electron. Notes Discret. Math., 2015
2013
Electron. Notes Discret. Math., 2013
Electron. Notes Discret. Math., 2013
2012
2011
PhD thesis, 2011
Electron. Notes Discret. Math., 2011
2010
Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions.
SIAM J. Comput., 2010
J. Comb. Theory, Ser. B, 2010
2009
SIAM J. Discret. Math., 2009
Electron. Notes Discret. Math., 2009