On multipartite Hajnal-Szemerédi theorems. - Jie Han 002; Yi Zhao 005 (Discret. Math., 2013)

Near Perfect Matchings in k-Uniform Hypergraphs. - Jie Han 002 (Comb. Probab. Comput., 2015)

Minimum codegree threshold for Hamilton ℓ-cycles in k-uniform hypergraphs. - Jie Han 002; Yi Zhao 005 (J. Comb. Theory A, 2015)

Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs. - Jie Han 002; Yi Zhao 005 (J. Comb. Theory B, 2015)

Minimum vertex degree threshold for C43-tiling. - Jie Han 002; Yi Zhao 005 (J. Graph Theory, 2015)

Forbidding Hamilton cycles in uniform hypergraphs. - Jie Han 002; Yi Zhao 005 (J. Comb. Theory A, 2016)

Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture. - Jie Han 002 (SIAM J. Discret. Math., 2016)

Near Perfect Matchings in k-Uniform Hypergraphs II. - Jie Han 002 (SIAM J. Discret. Math., 2016)

The Complexity of Perfect Packings in Dense Graphs. - Jie Han 002 (TAMC, 2017)

Minimum Codegree Threshold for C 6 3-Factors in 3-Uniform Hypergraphs. - Wei Gao; Jie Han 002 (Comb. Probab. Comput., 2017)

Exact Minimum Codegree Threshold for K - 4-Factors. - Jie Han 002; Allan Lo; Andrew Treglown; Yi Zhao 005 (Comb. Probab. Comput., 2017)

Covering and tiling hypergraphs with tight cycles. - Jie Han 002; Allan Lo; Nicolás Sanhueza-Matamala (Electron. Notes Discret. Math., 2017)

Forbidden Pairs and the Existence of a Spanning Halin Subgraph. - Guantao Chen; Jie Han 002; Suil O; Songling Shan; Shoichi Tsuchiya (Graphs Comb., 2017)

Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs. - Jie Han 002; Chuanyun Zang; Yi Zhao 005 (J. Comb. Theory A, 2017)

Property Testing for Point Sets on the Plane. - Jie Han 002; Yoshiharu Kohayakawa; Marcelo Tadeu Sales; Henrique Stagni (LATIN, 2018)

On hypergraphs without loose cycles. - Jie Han 002; Yoshiharu Kohayakawa (Discret. Math., 2018)

Near-perfect clique-factors in sparse pseudorandom graphs. - Jie Han 002; Yoshiharu Kohayakawa; Yury Person (Electron. Notes Discret. Math., 2018)

A degree version of the Hilton-Milner theorem. - Peter Frankl; Jie Han 002; Hao Huang 005; Yi Zhao 005 (J. Comb. Theory A, 2018)

Extremal and probabilistic results for order types. - Jie Han 002; Yoshiharu Kohayakawa; Marcelo Tadeu Sales; Henrique Stagni (SODA, 2019)

Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles. - Wei Gao; Jie Han 002; Yi Zhao 005 (Comb. Probab. Comput., 2019)

Clique-factors in sparse pseudorandom graphs. - Jie Han 002; Yoshiharu Kohayakawa; Patrick Morris 001; Yury Person (Eur. J. Comb., 2019)

Powers of tight Hamilton cycles in randomly perturbed hypergraphs. - Wiebke Bedenknecht; Jie Han 002; Yoshiharu Kohayakawa; Guilherme Oliveira Mota (Random Struct. Algorithms, 2019)

Universality for bounded degree spanning trees in randomly perturbed graphs. - Julia Böttcher; Jie Han 002; Yoshiharu Kohayakawa; Richard Montgomery 001; Olaf Parczyk; Yury Person (Random Struct. Algorithms, 2019)

The complexity of perfect matchings and packings in dense hypergraphs. - Jie Han 002; Andrew Treglown (J. Comb. Theory B, 2020)

The number of Gallai k-colorings of complete graphs. - Josefran de Oliveira Bastos; Fabrício Siqueira Benevides; Jie Han 002 (J. Comb. Theory B, 2020)

The multicolour size-Ramsey number of powers of paths. - Jie Han 002; Matthew Jenssen; Yoshiharu Kohayakawa; Guilherme Oliveira Mota; Barnaby Roberts (J. Comb. Theory B, 2020)

Hamiltonicity in randomly perturbed hypergraphs. - Jie Han 002; Yi Zhao 005 (J. Comb. Theory B, 2020)

Matchings in k-partite k-uniform hypergraphs. - Jie Han 002; Chuanyun Zang; Yi Zhao 005 (J. Graph Theory, 2020)

The K-Core Decomposition Algorithm Under the Framework of GraphBLAS. - Longlong Li; Hu Chen; Ping Li; Jie Han 002; Guanghui Wang 002; Gong Zhang 001 (HPEC, 2021)

Non-linear Hamilton cycles in linear quasi-random hypergraphs. - Jie Han 002; Xichao Shu; Guanghui Wang 002 (SODA, 2021)

Finding any given 2-factor in sparse pseudorandom graphs efficiently. - Jie Han 002; Yoshiharu Kohayakawa; Patrick Morris 001; Yury Person (J. Graph Theory, 2021)

Tilings in randomly perturbed graphs: Bridging the gap between Hajnal-Szemerédi and Johansson-Kahn-Vu. - Jie Han 002; Patrick Morris 001; Andrew Treglown (Random Struct. Algorithms, 2021)

The Decision Problem for Perfect Matchings in Dense Hypergraphs. - Luyining Gan; Jie Han 002 (ICALP, 2022)

Protecting Semantic Information Using An Efficient Secret Key. - Tao Guo 003; Jie Han 002; Huihui Wu; Yizhu Wang; Bo Bai 001; Wei Han 004 (ISIT, 2022)

Turán Number of Disjoint Triangles in 4-Partite Graphs. - Jie Han 002; Yi Zhao 005 (Electron. J. Comb., 2022)

Semantic Compression with Side Information: A Rate-Distortion Perspective. - Tao Guo 003; Yizhu Wang; Jie Han 002; Huihui Wu; Bo Bai 001; Wei Han 004 (CoRR, 2022)

Hamiltonicity in Cherry-quasirandom 3-graphs. - Luyining Gan; Jie Han 002 (Eur. J. Comb., 2022)

Structural Entropy of the Stochastic Block Models. - Jie Han 002; Tao Guo 003; Qiaoqiao Zhou; Wei Han 004; Bo Bai 001; Gong Zhang 001 (Entropy, 2022)

Minimum degree thresholds for Hamilton (k/2)-cycles in k-uniform hypergraphs. - Hiêp Hàn; Jie Han 002; Yi Zhao 005 (J. Comb. Theory B, 2022)

Covering 3-uniform hypergraphs by vertex-disjoint tight paths. - Jie Han 002 (J. Graph Theory, 2022)

Factors in randomly perturbed hypergraphs. - Yulin Chang; Jie Han 002; Yoshiharu Kohayakawa; Patrick Morris 001; Guilherme Oliveira Mota (Random Struct. Algorithms, 2022)

Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs. - Hiêp Hàn; Jie Han 002; Patrick Morris 001 (Random Struct. Algorithms, 2022)

Matching of Given Sizes in Hypergraphs. - Yulin Chang; Huifen Ge; Jie Han 002; Guanghui Wang 002 (SIAM J. Discret. Math., 2022)

An algorithmic version of the Hajnal-Szemer 'edi theorem. - Luyining Gan; Jie Han 002; Jie Hu (CoRR, 2023)

Clique-factors in graphs with sublinear ?-independence number. - Jie Han 002; Ping Hu; Guanghui Wang 002; Donglei Yang (Comb. Probab. Comput., 2023)

Tiling multipartite hypergraphs in quasi-random hypergraphs. - Laihao Ding; Jie Han 002; Shumin Sun; Guanghui Wang 002; Wenling Zhou (J. Comb. Theory B, 2023)

Embedding clique-factors in graphs with low ℓ-independence number. - Fan Chang; Jie Han 002; Jaehoon Kim; Guanghui Wang 002; Donglei Yang (J. Comb. Theory B, 2023)

Large Yk,b ${Y}_{k,b}$-tilings and Hamilton ℓ $ ell $-cycles in k $k$-uniform hypergraphs. - Luyining Gan; Jie Han 002; Lin Sun; Guanghui Wang 002 (J. Graph Theory, 2023)

Spanning trees in graphs without large bipartite holes. - Jie Han 002; Jie Hu; Lidan Ping; Guanghui Wang 002; Yi Wang; Donglei Yang (Comb. Probab. Comput., 2024)

Large Y3,2-tilings in 3-uniform hypergraphs. - Jie Han 002; Lin Sun; Guanghui Wang 002 (Eur. J. Comb., 2024)

H-factors in graphs with small independence number. - Ming Chen; Jie Han 002; Guanghui Wang 002; Donglei Yang (J. Comb. Theory B, 2024)

On Powers of Hamilton Cycles in Ramsey-Turán Theory. - Ming Chen; Jie Han 002; Yantao Tang; Donglei Yang (SIAM J. Discret. Math., 2024)

A Ramsey-Turán theory for tilings in graphs. - Jie Han 002; Patrick Morris 001; Guanghui Wang 002; Donglei Yang (Random Struct. Algorithms, 2024)

Hamiltonicity of sparse pseudorandom graphs. - Asaf Ferber; Jie Han 002; Dingjia Mao; Roman Vershynin (Comb. Probab. Comput., 2025)

On the Keevash-Knox-Mycroft conjecture. - Luyining Gan; Jie Han 002 (J. Comb. Theory B, 2025)

Transversal Hamilton Cycle in Hypergraph Systems. - Yangyang Cheng; Jie Han 002; Bin Wang; Guanghui Wang 002; Donglei Yang (SIAM J. Discret. Math., 2025)