Jie Han

Orcid: 0000-0002-2013-2962

Affiliations:
  • Beijing Institute of Technology, School of Mathematics and Statistics, China
  • University of Rhode Island, Kingston, RI, USA
  • University of São Paulo, Institute of Mathematics and Statistics, Brazil
  • Georgia State University, Department of Mathematics and Statistics, Atlanta, GA, USA (PhD 2015)


According to our database1, Jie Han authored at least 50 papers between 2013 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A Ramsey-Turán theory for tilings in graphs.
Random Struct. Algorithms, January, 2024

Spanning trees in graphs without large bipartite holes.
Comb. Probab. Comput., 2024

2023
Large Yk,b ${Y}_{k,b}$-tilings and Hamilton ℓ $\ell $-cycles in k $k$-uniform hypergraphs.
J. Graph Theory, November, 2023

Embedding clique-factors in graphs with low <i>ℓ</i>-independence number.
J. Comb. Theory B, July, 2023

Tiling multipartite hypergraphs in quasi-random hypergraphs.
J. Comb. Theory B, May, 2023

Clique-factors in graphs with sublinear ?-independence number.
Comb. Probab. Comput., 2023

An algorithmic version of the Hajnal-Szemer\'edi theorem.
CoRR, 2023

2022
Matching of Given Sizes in Hypergraphs.
SIAM J. Discret. Math., September, 2022

Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs.
Random Struct. Algorithms, 2022

Factors in randomly perturbed hypergraphs.
Random Struct. Algorithms, 2022

Covering 3-uniform hypergraphs by vertex-disjoint tight paths.
J. Graph Theory, 2022

Minimum degree thresholds for Hamilton (<i>k</i>/2)-cycles in <i>k</i>-uniform hypergraphs.
J. Comb. Theory B, 2022

Structural Entropy of the Stochastic Block Models.
Entropy, 2022

Hamiltonicity in Cherry-quasirandom 3-graphs.
Eur. J. Comb., 2022

Semantic Compression with Side Information: A Rate-Distortion Perspective.
CoRR, 2022

Turán Number of Disjoint Triangles in 4-Partite Graphs.
Electron. J. Comb., 2022

Protecting Semantic Information Using An Efficient Secret Key.
Proceedings of the IEEE International Symposium on Information Theory, 2022

The Decision Problem for Perfect Matchings in Dense Hypergraphs.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021
Tilings in randomly perturbed graphs: Bridging the gap between Hajnal-Szemerédi and Johansson-Kahn-Vu.
Random Struct. Algorithms, 2021

Finding any given 2-factor in sparse pseudorandom graphs efficiently.
J. Graph Theory, 2021

Non-linear Hamilton cycles in linear quasi-random hypergraphs.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

The K-Core Decomposition Algorithm Under the Framework of GraphBLAS.
Proceedings of the 2021 IEEE High Performance Extreme Computing Conference, 2021

2020
Matchings in k-partite k-uniform hypergraphs.
J. Graph Theory, 2020

Hamiltonicity in randomly perturbed hypergraphs.
J. Comb. Theory B, 2020

The multicolour size-Ramsey number of powers of paths.
J. Comb. Theory B, 2020

The number of Gallai <i>k</i>-colorings of complete graphs.
J. Comb. Theory B, 2020

The complexity of perfect matchings and packings in dense hypergraphs.
J. Comb. Theory B, 2020

2019
Universality for bounded degree spanning trees in randomly perturbed graphs.
Random Struct. Algorithms, 2019

Powers of tight Hamilton cycles in randomly perturbed hypergraphs.
Random Struct. Algorithms, 2019

Clique-factors in sparse pseudorandom graphs.
Eur. J. Comb., 2019

Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles.
Comb. Probab. Comput., 2019

Extremal and probabilistic results for order types.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018
A degree version of the Hilton-Milner theorem.
J. Comb. Theory A, 2018

Near-perfect clique-factors in sparse pseudorandom graphs.
Electron. Notes Discret. Math., 2018

On hypergraphs without loose cycles.
Discret. Math., 2018

Property Testing for Point Sets on the Plane.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017
Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs.
J. Comb. Theory A, 2017

Forbidden Pairs and the Existence of a Spanning Halin Subgraph.
Graphs Comb., 2017

Covering and tiling hypergraphs with tight cycles.
Electron. Notes Discret. Math., 2017

Exact Minimum Codegree Threshold for K - 4-Factors.
Comb. Probab. Comput., 2017

Minimum Codegree Threshold for C 6 3-Factors in 3-Uniform Hypergraphs.
Comb. Probab. Comput., 2017

The Complexity of Perfect Packings in Dense Graphs.
Proceedings of the Theory and Applications of Models of Computation, 2017

2016
Near Perfect Matchings in k-Uniform Hypergraphs II.
SIAM J. Discret. Math., 2016

Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture.
SIAM J. Discret. Math., 2016

Forbidding Hamilton cycles in uniform hypergraphs.
J. Comb. Theory A, 2016

2015
Minimum vertex degree threshold for C43-tiling.
J. Graph Theory, 2015

Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs.
J. Comb. Theory B, 2015

Minimum codegree threshold for Hamilton ℓ-cycles in k-uniform hypergraphs.
J. Comb. Theory A, 2015

Near Perfect Matchings in <i>k</i>-Uniform Hypergraphs.
Comb. Probab. Comput., 2015

2013
On multipartite Hajnal-Szemerédi theorems.
Discret. Math., 2013


  Loading...