A Perfect Sampler for Hypergraph Independent Sets. - Guoliang Qiu 001; Yanheng Wang 001; Chihao Zhang 001 (ICALP, 2022)

Counting Perfect Matchings in Dense Graphs Is Hard. - Nicolas El Maalouly; Yanheng Wang 001 (CoRR, 2022)

Approximating Klee's Measure Problem and a Lower Bound for Union Volume Estimation. - Karl Bringmann; Kasper Green Larsen; André Nusser; Eva Rotenberg; Yanheng Wang 001 (SoCG, 2025)

Dynamic and Streaming Algorithms for Union Volume Estimation. - Sujoy Bhore; Karl Bringmann; Timothy M. Chan; Yanheng Wang 001 (SoCG, 2026)