 | 2012 |
|---|
| 9 |       | David Conlon,
Hiêp Hàn,
Yury Person,
Mathias Schacht:
Weak quasi-randomness for uniform hypergraphs.
Random Struct. Algorithms 40(1): 1-38 (2012) |
| 2011 |
|---|
| 8 | | Enno Buß,
Hiêp Hàn,
Mathias Schacht:
Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs.
Electronic Notes in Discrete Mathematics 38: 207-212 (2011) |
| 7 | | Hiêp Hàn,
Yury Person,
Mathias Schacht:
Note on forcing pairs.
Electronic Notes in Discrete Mathematics 38: 437-442 (2011) |
| 6 | | Hiêp Hàn:
Extremal hypergraph theory and algorithmic regularity lemma for sparse graphs.
Humboldt University of Berlin 2011 |
| 2010 |
|---|
| 5 | | Hiêp Hàn,
Mathias Schacht:
Dirac-type results for loose Hamilton cycles in uniform hypergraphs.
J. Comb. Theory, Ser. B 100(3): 332-346 (2010) |
| 4 | | Noga Alon,
Amin Coja-Oghlan,
Hiêp Hàn,
Mihyun Kang,
Vojtech Rödl,
Mathias Schacht:
Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions.
SIAM J. Comput. 39(6): 2336-2362 (2010) |
| 2009 |
|---|
| 3 | | Hiêp Hàn,
Yury Person,
Mathias Schacht:
Note on strong refutation algorithms for random k-SAT formulas.
Electronic Notes in Discrete Mathematics 35: 157-162 (2009) |
| 2 | | Hiêp Hàn,
Yury Person,
Mathias Schacht:
On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree.
SIAM J. Discrete Math. 23(2): 732-748 (2009) |
| 2007 |
|---|
| 1 | | Noga Alon,
Amin Coja-Oghlan,
Hiêp Hàn,
Mihyun Kang,
Vojtech Rödl,
Mathias Schacht:
Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions.
ICALP 2007: 789-800 |
Data released under the ODC-BY 1.0 license — See also our legal information page