Before joining the University of Helsinki, Jiaheng Wang was a postdoctoral researcher at the University of Regensburg working in the Algorithms and Complexity Theory group (Lehrstuhl) led by Radu Curticapean, and a Postdoctoral Research Associate at the University of Edinburgh. He obtained his PhD degree at the University of Edinburgh under the supervision of Heng Guo.
Jiaheng's research interest lies in several topics in theoretical computer science, with a focus on algorithms and complexity for counting problems.
Selected papers:
[1] Radu Curticapean, Jiaheng Wang. Planar Perfect Matching Counting is as Hard as Determinants. Preprint, 2026. URL: https://arxiv.org/abs/2606.03975
[2] Radu Curticapean, Simon Döring, Daniel Neuen, Jiaheng Wang. Can you link up with treewidth? STACS 2025. URL: https://doi.org/10.4230/LIPIcs.STACS.2025.28
[3] Weiming Feng, Heng Guo, Chunyang Wang, Jiaheng Wang, Yitong Yin. Towards derandomising Markov chain Monte Carlo. SIAM Journal on Computing, Vol. 54, Iss. 3, pp. 775–813, 2025. Preliminary version in FOCS 2023. URL: https://epubs.siam.org/doi/full/10.1137/24M1663806
[4] Weiming Feng, Heng Guo, Mark Jerrum, Jiaheng Wang. A simple polynomial-time approximation algorithm for the total variation distance between two product distributions. TheoretiCS, Volume 2 (2023), Article 8, 1-7. Preliminary version in SOSA 2023. URL: https://theoretics.episciences.org/11465
[5] Andreas Galanis, Heng Guo, Jiaheng Wang. Inapproximability of counting hypergraph colourings. ACM Transactions on Computation Theory, 14(3-4):10, 1-33, 2022. URL: https://doi.org/10.1145/3558554