Jie Han - RankMe

64 papers A* 4B 2C 1Journal 56Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Non-linear Hamilton cycles in linear quasirandom and uniformly dense hypergraphs. J. Comb. Theory B Jie Han, Xichao Shu, Guanghui Wang
2026	J	`jnl`	Powers of Hamilton cycles in oriented and directed graphs. Comb. Probab. Comput. Louis DeBiasio, Jie Han, Allan Lo, Theodore Molla, Simón Piga, Andrew Treglown
2025	J	`jnl`	Hamiltonicity of sparse pseudorandom graphs. Comb. Probab. Comput. Asaf Ferber, Jie Han, Dingjia Mao, Roman Vershynin
2025	J	`jnl`	On the Keevash-Knox-Mycroft conjecture. J. Comb. Theory B Luyining Gan, Jie Han
2025	J	`jnl`	Transversal Hamilton Cycle in Hypergraph Systems. SIAM J. Discret. Math. Yangyang Cheng, Jie Han, Bin Wang, Guanghui Wang, Donglei Yang
2024	J	`jnl`	A Ramsey-Turán theory for tilings in graphs. Random Struct. Algorithms Jie Han, Patrick Morris, Guanghui Wang, Donglei Yang
2024	J	`jnl`	H-factors in graphs with small independence number. J. Comb. Theory B Ming Chen, Jie Han, Guanghui Wang, Donglei Yang
2024	J	`jnl`	Large Y3,2-tilings in 3-uniform hypergraphs. Eur. J. Comb. Jie Han, Lin Sun, Guanghui Wang
2024	J	`jnl`	On Powers of Hamilton Cycles in Ramsey-Turán Theory. SIAM J. Discret. Math. Ming Chen, Jie Han, Yantao Tang, Donglei Yang
2024	J	`jnl`	Spanning trees in graphs without large bipartite holes. Comb. Probab. Comput. Jie Han, Jie Hu, Lidan Ping, Guanghui Wang, Yi Wang, Donglei Yang
2023	J	`jnl`	An algorithmic version of the Hajnal-Szemer\'edi theorem. CoRR Luyining Gan, Jie Han, Jie Hu
2023	J	`jnl`	Clique-factors in graphs with sublinear ?-independence number. Comb. Probab. Comput. Jie Han, Ping Hu, Guanghui Wang, Donglei Yang
2023	J	`jnl`	Embedding clique-factors in graphs with low J. Comb. Theory B Fan Chang, Jie Han, Jaehoon Kim, Guanghui Wang, Donglei Yang
2023	J	`jnl`	Large Yk,b ${Y}_{k,b}$-tilings and Hamilton ℓ $\ell $-cycles in k $k$-uniform hypergraphs. J. Graph Theory Luyining Gan, Jie Han, Lin Sun, Guanghui Wang
2023	J	`jnl`	Tiling multipartite hypergraphs in quasi-random hypergraphs. J. Comb. Theory B Laihao Ding, Jie Han, Shumin Sun, Guanghui Wang, Wenling Zhou
2022	J	`jnl`	Covering 3-uniform hypergraphs by vertex-disjoint tight paths. J. Graph Theory Jie Han
2022	J	`jnl`	Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs. Random Struct. Algorithms Hiêp Hàn, Jie Han, Patrick Morris
2022	J	`jnl`	Factors in randomly perturbed hypergraphs. Random Struct. Algorithms Yulin Chang, Jie Han, Yoshiharu Kohayakawa, Patrick Morris, Guilherme Oliveira Mota
2022	J	`jnl`	Hamiltonicity in Cherry-quasirandom 3-graphs. Eur. J. Comb. Luyining Gan, Jie Han
2022	J	`jnl`	Matching of Given Sizes in Hypergraphs. SIAM J. Discret. Math. Yulin Chang, Huifen Ge, Jie Han, Guanghui Wang
2022	J	`jnl`	Minimum degree thresholds for Hamilton ( J. Comb. Theory B Hiêp Hàn, Jie Han, Yi Zhao
2022	B	`conf`	Protecting Semantic Information Using An Efficient Secret Key. ISIT Tao Guo, Jie Han, Huihui Wu, Yizhu Wang, Bo Bai, Wei Han
2022	J	`jnl`	Semantic Compression with Side Information: A Rate-Distortion Perspective. CoRR Tao Guo, Yizhu Wang, Jie Han, Huihui Wu, Bo Bai, Wei Han
2022	J	`jnl`	Structural Entropy of the Stochastic Block Models. Entropy Jie Han, Tao Guo, Qiaoqiao Zhou, Wei Han, Bo Bai, Gong Zhang
2022	A*	`conf`	The Decision Problem for Perfect Matchings in Dense Hypergraphs. ICALP Luyining Gan, Jie Han
2022	J	`jnl`	The decision problem for perfect matchings in dense hypergraphs. CoRR Luyining Gan, Jie Han
2022	J	`jnl`	Turán Number of Disjoint Triangles in 4-Partite Graphs. Electron. J. Comb. Jie Han, Yi Zhao
2021	J	`jnl`	Covering and tiling hypergraphs with tight cycles. Comb. Probab. Comput. Jie Han, Allan Lo, Nicolás Sanhueza-Matamala
2021	J	`jnl`	Finding any given 2-factor in sparse pseudorandom graphs efficiently. J. Graph Theory Jie Han, Yoshiharu Kohayakawa, Patrick Morris, Yury Person
2021	J	`jnl`	Near-perfect clique-factors in sparse pseudorandom graphs. Comb. Probab. Comput. Jie Han, Yoshiharu Kohayakawa, Yury Person
2021	A*	`conf`	Non-linear Hamilton cycles in linear quasi-random hypergraphs. SODA Jie Han, Xichao Shu, Guanghui Wang
2021	J	`jnl`	Structural Entropy of the Stochastic Block Models. CoRR Jie Han, Tao Guo, Qiaoqiao Zhou, Wei Han, Bo Bai, Gong Zhang
2021	—	`conf`	The K-Core Decomposition Algorithm Under the Framework of GraphBLAS. HPEC Longlong Li, Hu Chen, Ping Li, Jie Han, Guanghui Wang, Gong Zhang
2021	J	`jnl`	Tilings in randomly perturbed graphs: Bridging the gap between Hajnal-Szemerédi and Johansson-Kahn-Vu. Random Struct. Algorithms Jie Han, Patrick Morris, Andrew Treglown
2020	A*	`conf`	Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs. SODA Hiêp Hàn, Jie Han, Patrick Morris
2020	J	`jnl`	Hamiltonicity in randomly perturbed hypergraphs. J. Comb. Theory B Jie Han, Yi Zhao
2020	J	`jnl`	Matchings in k-partite k-uniform hypergraphs. J. Graph Theory Jie Han, Chuanyun Zang, Yi Zhao
2020	J	`jnl`	The complexity of perfect matchings and packings in dense hypergraphs. J. Comb. Theory B Jie Han, Andrew Treglown
2020	J	`jnl`	The multicolour size-Ramsey number of powers of paths. J. Comb. Theory B Jie Han, Matthew Jenssen, Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Barnaby Roberts
2020	J	`jnl`	The number of Gallai J. Comb. Theory B Josefran de Oliveira Bastos, Fabrício Siqueira Benevides, Jie Han
2019	J	`jnl`	Clique-factors in sparse pseudorandom graphs. Eur. J. Comb. Jie Han, Yoshiharu Kohayakawa, Patrick Morris, Yury Person
2019	J	`jnl`	Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles. Comb. Probab. Comput. Wei Gao, Jie Han, Yi Zhao
2019	A*	`conf`	Extremal and probabilistic results for order types. SODA Jie Han, Yoshiharu Kohayakawa, Marcelo Tadeu Sales, Henrique Stagni
2019	J	`jnl`	Finding any given 2-factor in sparse pseudorandom graphs efficiently. CoRR Jie Han, Yoshiharu Kohayakawa, Patrick Morris, Yury Person
2019	J	`jnl`	Powers of tight Hamilton cycles in randomly perturbed hypergraphs. Random Struct. Algorithms Wiebke Bedenknecht, Jie Han, Yoshiharu Kohayakawa, Guilherme Oliveira Mota
2019	J	`jnl`	Universality for bounded degree spanning trees in randomly perturbed graphs. Random Struct. Algorithms Julia Böttcher, Jie Han, Yoshiharu Kohayakawa, Richard Montgomery, Olaf Parczyk, Yury Person
2018	J	`jnl`	A degree version of the Hilton-Milner theorem. J. Comb. Theory A Peter Frankl, Jie Han, Hao Huang, Yi Zhao
2018	J	`jnl`	Near-perfect clique-factors in sparse pseudorandom graphs. Electron. Notes Discret. Math. Jie Han, Yoshiharu Kohayakawa, Yury Person
2018	J	`jnl`	On hypergraphs without loose cycles. Discret. Math. Jie Han, Yoshiharu Kohayakawa
2018	B	`conf`	Property Testing for Point Sets on the Plane. LATIN Jie Han, Yoshiharu Kohayakawa, Marcelo Tadeu Sales, Henrique Stagni
2017	J	`jnl`	Covering and tiling hypergraphs with tight cycles. Electron. Notes Discret. Math. Jie Han, Allan Lo, Nicolás Sanhueza-Matamala
2017	J	`jnl`	Exact Minimum Codegree Threshold for K - 4-Factors. Comb. Probab. Comput. Jie Han, Allan Lo, Andrew Treglown, Yi Zhao
2017	J	`jnl`	Forbidden Pairs and the Existence of a Spanning Halin Subgraph. Graphs Comb. Guantao Chen, Jie Han, Suil O, Songling Shan, Shoichi Tsuchiya
2017	J	`jnl`	Minimum Codegree Threshold for C 6 3-Factors in 3-Uniform Hypergraphs. Comb. Probab. Comput. Wei Gao, Jie Han
2017	J	`jnl`	Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs. J. Comb. Theory A Jie Han, Chuanyun Zang, Yi Zhao
2017	C	`conf`	The Complexity of Perfect Packings in Dense Graphs. TAMC Jie Han
2016	J	`jnl`	Forbidding Hamilton cycles in uniform hypergraphs. J. Comb. Theory A Jie Han, Yi Zhao
2016	J	`jnl`	Near Perfect Matchings in k-Uniform Hypergraphs II. SIAM J. Discret. Math. Jie Han
2016	J	`jnl`	Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture. SIAM J. Discret. Math. Jie Han
2015	J	`jnl`	Minimum codegree threshold for Hamilton ℓ-cycles in k-uniform hypergraphs. J. Comb. Theory A Jie Han, Yi Zhao
2015	J	`jnl`	Minimum vertex degree threshold for C43-tiling. J. Graph Theory Jie Han, Yi Zhao
2015	J	`jnl`	Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs. J. Comb. Theory B Jie Han, Yi Zhao
2015	J	`jnl`	Near Perfect Matchings in Comb. Probab. Comput. Jie Han
2013	J	`jnl`	On multipartite Hajnal-Szemerédi theorems. Discret. Math. Jie Han, Yi Zhao