我的研究兴趣是理论计算机科学。具体来说,最近的工作主要是关于计数、取样问题的近似算法和复杂性。
根据理论计算机科学惯例,论文作者按照姓氏首字母排序。
* Zeros of Holant problems: locations and algorithms
with Heng Guo, Chao Liao and Pinyan Lu, SODA’19
* Counting hypergraph colorings in the local lemma regime
with Heng Guo, Chao Liao and Pinyan Lu, STOC’18
* FPTAS for counting proper colorings on cubic graphs
with Pinyan Lu, Kuan Yang and Minshen Zhu, SODA’17
* Sampling in Potts model on sparse random graphs
with Yitong Yin, RANDOM’16
* FPTAS for hardcore and Ising models on hypergraphs
with Pinyan Lu and Kuan Yang, STACS’16
* Assignment and pricing in roommate market
with Pak Hay Chan, Xin Huang, Zhengyang Liu and, AAAI’16
* Counting problems in parameterized complexity
with Yijia Chen, Tsinghua Science and Technology, 2014
* FPTAS for counting weighted edge covers
with Jingcheng Liu and Pinyan Lu, ESA’14
* The complexity of ferromagnetic two-spin systems with external fields
with Jingcheng Liu and Pinyan Lu, RANDOM’14
* FPTAS for weighted Fibonacci gates and its applications
with Pinyan Lu and Menghui Wang, ICALP’14
* Multi-multiway cut problem on graphs of bounded branch width
with Xiaojie Deng and Bingkai Lin, FAW-AAIM’13
* Approximate counting via correlation decay on planar graphs
with Yitong Yin, SODA’13
* Radiation hybrid map construction problem parameterized
with Haitao Jiang and Binhai Zhu, Journal of Combinatorial Optimization, 2014
* Fixed-parameter tractability of almost CSP problem with decisive relations
with Hongyang Zhang, FAW-AAIM’12