Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph. - Liren Shan; Huan Li 002; Zhongzhi Zhang (Theor. Comput. Sci., 2017)

Robustness of First- and Second-Order Consensus Algorithms for a Noisy Scale-Free Small-World Koch Network. - Yuhao Yi; Zhongzhi Zhang; Liren Shan; Guanrong Chen (IEEE Trans. Control. Syst. Technol., 2017)

Improving Information Centrality of a Node in Complex Networks by Adding Edges. - Liren Shan; Yuhao Yi; Zhongzhi Zhang (IJCAI, 2018)

Biharmonic Distance Related Centrality for Edges in Weighted Networks. - Yuhao Yi; Liren Shan; Huan Li 002; Zhongzhi Zhang (IJCAI, 2018)

Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket. - Liren Shan; Huan Li 002; Zhongzhi Zhang (Theor. Comput. Sci., 2018)

Current Flow Group Closeness Centrality for Complex Networks? - Huan Li 002; Richard Peng; Liren Shan; Yuhao Yi; Zhongzhi Zhang (WWW, 2019)

Stochastic Linear Optimization with Adversarial Corruption. - Yingkai Li; Edmund Y. Lou; Liren Shan (CoRR, 2019)

Improved Guarantees for k-means++ and k-means++ Parallel. - Konstantin Makarychev; Aravind Reddy; Liren Shan (NeurIPS, 2020)

Near-Optimal Algorithms for Explainable k-Medians and k-Means. - Konstantin Makarychev; Liren Shan (ICML, 2021)

Explainable k-means. Don't be greedy, plant bigger trees! - Konstantin Makarychev; Liren Shan (CoRR, 2021)

Algorithmic Learning Foundations for Common Law. - Jason D. Hartline; Daniel W. Linna Jr.; Liren Shan; Alex Tang (CSLAW, 2022)

Optimization of Scoring Rules. - Yingkai Li; Jason D. Hartline; Liren Shan; Yifan Wu 005 (EC, 2022)

Explainable k-means: don't be greedy, plant bigger trees! - Konstantin Makarychev; Liren Shan (STOC, 2022)

Fair Curing and Network Design in SIS Epidemic Processes. - Yuhao Yi; Liren Shan; Philip E. Paré; Karl Henrik Johansson (CoRR, 2022)

Edge Deletion Algorithms for Minimizing Spread in SIR Epidemic Models. - Yuhao Yi; Liren Shan; Philip E. Paré; Karl Henrik Johansson (SIAM J. Control. Optim., 2022)

Optimal Scoring Rules for Multi-dimensional Effort. - Jason D. Hartline; Liren Shan; Yingkai Li; Yifan Wu 005 (COLT, 2023)

Approximation Algorithm for Norm Multiway Cut. - Charlie Carlson; Jafar Jafarov; Konstantin Makarychev; Yury Makarychev; Liren Shan (ESA, 2023)

Random Cuts are Optimal for Explainable k-Medians. - Konstantin Makarychev; Liren Shan (NeurIPS, 2023)

Approximation Algorithms for Norm Multiway Cut. - Charlie Carlson; Jafar Jafarov; Konstantin Makarychev; Yury Makarychev; Liren Shan (CoRR, 2023)

Dynamic Curing and Network Design in SIS Epidemic Processes. - Yuhao Yi; Liren Shan; Philip E. Paré; Karl Henrik Johansson (CDC, 2024)

Error-Tolerant E-Discovery Protocols. - Jinshuo Dong; Jason D. Hartline; Liren Shan; Aravindan Vijayaraghavan (CSLAW, 2024)

Higher-Order Cheeger Inequality for Partitioning with Buffers. - Konstantin Makarychev; Yury Makarychev; Liren Shan; Aravindan Vijayaraghavan (SODA, 2024)

LiD-FL: Towards List-Decodable Federated Learning. - Hong Liu; Liren Shan; Han Bao; Ronghui You; Yuhao Yi; Jiancheng Lv (AAAI, 2025)

Computing High-dimensional Confidence Sets for Arbitrary Distributions. - Chao Gao; Liren Shan; Vaidehi Srinivas; Aravindan Vijayaraghavan (COLT, 2025)

Heterogeneous Multi-agent Multi-armed Bandits on Stochastic Block Models. - Mengfan Xu; Liren Shan; Fatemeh Ghaffari; Xuchuang Wang; Xutong Liu 002; Mohammad Hajiesmaili (CoRR, 2025)

Multi-dimensional Test Design. - Xiaoyun Qiu; Liren Shan (CoRR, 2025)

Verifying Classification with Limited Disclosure. - Siddharth Bhandari; Liren Shan (CoRR, 2025)

Volume Optimality in Conformal Prediction with Structured Prediction Sets. - Chao Gao; Liren Shan; Vaidehi Srinivas; Aravindan Vijayaraghavan (CoRR, 2025)