VLDB 2026 Research / reviewers in the wild / expert
Hailun Zheng
dblp:183/3210
· DBLP profile ↗
4ranked-venue papers
1as first author
2since 2021 · last 2026
0000-0001-9914-6218ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 since 2021Theory of computation · 2 · 1 first-author · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Transversal Numbers of Simplicial Polytopes, Spheres, and Pure ComplexesabstractAbstract. We prove new upper and lower bounds on transversal numbers of several classes of simplicial complexes. Specifically, we establish an upper bound on the transversal numbers of pure simplicial complexes in terms of the number of vertices and the number of facets and then provide constructions of pure simplicial complexes whose transversal numbers come close to this bound. We introduce a new family of [Formula: see text]-dimensional polytopes that could be considered as “siblings” of cyclic polytopes and show that the transversal ratios of such odd-dimensional polytopes are [Formula: see text]. The previous record for the transversal ratios of [Formula: see text]-polytopes was [Formula: see text]. Finally, we construct infinite families of 3-, 4-, and 5-dimensional simplicial spheres with transversal ratios converging to [Formula: see text], [Formula: see text], and [Formula: see text], respectively. The previous record was [Formula: see text], [Formula: see text], and [Formula: see text], respectively. Isabella Novik, Hailun Zheng |
SIAM J. Discret. Math. | 2 |
| 2024 | Affine Stresses: The Partition of Unity and Kalai's Reconstruction Conjectures
Isabella Novik, Hailun Zheng |
Discret. Comput. Geom. | 2 |
| 2019 | A Lower Bound Theorem for Centrally Symmetric Simplicial Polytopes
Steven Klee, Eran Nevo, Isabella Novik, Hailun Zheng |
Discret. Comput. Geom. | 4 |
| 2016 | Minimal Balanced Triangulations of Sphere Bundles over the CircleabstractWe determine the minimum number of vertices needed to provide balanced triangulations of $\mathbb{S}^{d-2}$-bundles over $\mathbb{S}^1$. If $d$ is odd and the bundle is orientable, or $d$ is even and the bundle is nonorientable, the minimum number of vertices is $3d$; otherwise, it is $3d+2$. Similar results apply to all balanced simplicial complexes that triangulate homology manifolds with $\beta_1\neq0$ and $\beta_2=0$, where $\beta_i$'s are the Betti numbers, computed with coefficients in $\mathbb{Q}$. Hailun Zheng |
SIAM J. Discret. Math. | 1 |