| Learning plackett-luce mixtures from partial preferences A Liu, Z Zhao, C Liao, P Lu, L Xia Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 4328-4335, 2019 | 45 | 2019 |
| An FPTAS for the hardcore model on random regular bipartite graphs C Liao, J Lin, P Lu, Z Mao Theoretical Computer Science 929, 174-190, 2022 | 35* | 2022 |
| Zeros of Holant problems: locations and algorithms H Guo, C Liao, P Lu, C Zhang ACM Transactions on Algorithms (TALG) 17 (1), 1-25, 2020 | 32 | 2020 |
| Counting hypergraph colourings in the local lemma regime H Guo, C Liao, P Lu, C Zhang Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018 | 25 | 2018 |
| Survivable network design revisited: Group-connectivity Q Chen, B Laekhanukit, C Liao, Y Zhang 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 5 | 2022 |
| Almost tight approximation hardness for single-source directed k-edge-connectivity C Liao, Q Chen, B Laekhanukit, Y Zhang arXiv preprint arXiv:2202.13088, 2022 | 3 | 2022 |
| PACE Solver Description: Hust-Solver-A Heuristic Algorithm of Directed Feedback Vertex Set Problem YM Du, QY Zhang, JZ Xu, SG Zhang, C Liao, ZH Chen, ZB Sun, ZX Su, ... 17th International Symposium on Parameterized and Exact Computation (IPEC …, 2022 | 2 | 2022 |
| The beachcombers’ problem: Walking and searching from an inner point of a line Y Chen, X Deng, Z Ji, C Liao Language and Automata Theory and Applications, 270-282, 2016 | 1 | 2016 |