default search action
Liren Shan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c13]Jinshuo Dong
, Jason D. Hartline
Error-Tolerant E-Discovery Protocols. CSLAW 2024: 24-35 - [c12]Konstantin Makarychev, Yury Makarychev, Liren Shan, Aravindan Vijayaraghavan:
Higher-Order Cheeger Inequality for Partitioning with Buffers. SODA 2024: 2236-2274 - [i18]Jinshuo Dong, Jason D. Hartline, Liren Shan, Aravindan Vijayaraghavan:
Error-Tolerant E-Discovery Protocols. CoRR abs/2401.17952 (2024) - [i17]Hong Liu, Liren Shan, Han Bao, Ronghui You, Yuhao Yi, Jiancheng Lv:
LiD-FL: Towards List-Decodable Federated Learning. CoRR abs/2408.04963 (2024) - 2023
- [c11]Jason D. Hartline, Liren Shan, Yingkai Li, Yifan Wu:
Optimal Scoring Rules for Multi-dimensional Effort. COLT 2023: 2624-2650 - [c10]Charlie Carlson, Jafar Jafarov, Konstantin Makarychev, Yury Makarychev, Liren Shan:
Approximation Algorithm for Norm Multiway Cut. ESA 2023: 32:1-32:14 - [c9]Konstantin Makarychev, Liren Shan:
Random Cuts are Optimal for Explainable k-Medians. NeurIPS 2023 - [i16]Konstantin Makarychev, Liren Shan:
Random Cuts are Optimal for Explainable k-Medians. CoRR abs/2304.09113 (2023) - [i15]Charlie Carlson, Jafar Jafarov, Konstantin Makarychev, Yury Makarychev, Liren Shan:
Approximation Algorithms for Norm Multiway Cut. CoRR abs/2308.08373 (2023) - [i14]Konstantin Makarychev, Yury Makarychev, Liren Shan, Aravindan Vijayaraghavan:
Higher-Order Cheeger Inequality for Partitioning with Buffers. CoRR abs/2308.10160 (2023) - 2022
- [j4]Yuhao Yi
Edge Deletion Algorithms for Minimizing Spread in SIR Epidemic Models. SIAM J. Control. Optim. 60(2): S246-S273 (2022) - [c8]Jason D. Hartline, Daniel W. Linna Jr., Liren Shan, Alex Tang:
Algorithmic Learning Foundations for Common Law. CSLAW 2022: 109-117 - [c7]Yingkai Li, Jason D. Hartline, Liren Shan, Yifan Wu
Optimization of Scoring Rules. EC 2022: 988-989 - [c6]Konstantin Makarychev, Liren Shan:
Explainable k-means: don't be greedy, plant bigger trees! STOC 2022: 1629-1642 - [i13]Jason D. Hartline, Daniel W. Linna Jr., Liren Shan, Alex Tang:
Algorithmic Learning Foundations for Common Law. CoRR abs/2209.02866 (2022) - [i12]Jason D. Hartline, Liren Shan, Yingkai Li, Yifan Wu:
Optimal Scoring Rules for Multi-dimensional Effort. CoRR abs/2211.03302 (2022) - [i11]Yuhao Yi, Liren Shan, Philip E. Paré, Karl Henrik Johansson:
Fair Curing and Network Design in SIS Epidemic Processes. CoRR abs/2211.06028 (2022) - 2021
- [c5]Konstantin Makarychev, Liren Shan:
Near-Optimal Algorithms for Explainable k-Medians and k-Means. ICML 2021: 7358-7367 - [i10]Konstantin Makarychev, Liren Shan:
Near-optimal Algorithms for Explainable k-Medians and k-Means. CoRR abs/2107.00798 (2021) - [i9]Konstantin Makarychev, Liren Shan:
Explainable k-means. Don't be greedy, plant bigger trees! CoRR abs/2111.03193 (2021) - 2020
- [c4]Konstantin Makarychev, Aravind Reddy, Liren Shan:
Improved Guarantees for k-means++ and k-means++ Parallel. NeurIPS 2020 - [i8]Jason D. Hartline, Yingkai Li, Liren Shan, Yifan Wu:
Optimization of Scoring Rules. CoRR abs/2007.02905 (2020) - [i7]Konstantin Makarychev, Aravind Reddy, Liren Shan:
Improved Guarantees for k-means++ and k-means++ Parallel. CoRR abs/2010.14487 (2020) - [i6]Yuhao Yi, Liren Shan, Philip E. Paré, Karl Henrik Johansson:
Edge Deletion Algorithms for Minimizing Spread in SIR Epidemic Models. CoRR abs/2011.11087 (2020)
2010 – 2019
- 2019
- [c3]Huan Li, Richard Peng, Liren Shan, Yuhao Yi, Zhongzhi Zhang
Current Flow Group Closeness Centrality for Complex Networks? WWW 2019: 961-971 - [i5]Yingkai Li, Edmund Y. Lou, Liren Shan:
Stochastic Linear Optimization with Adversarial Corruption. CoRR abs/1909.02109 (2019) - 2018
- [j3]Liren Shan, Huan Li, Zhongzhi Zhang
Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket. Theor. Comput. Sci. 720: 47-54 (2018) - [c2]Liren Shan, Yuhao Yi, Zhongzhi Zhang:
Improving Information Centrality of a Node in Complex Networks by Adding Edges. IJCAI 2018: 3535-3541 - [c1]Yuhao Yi, Liren Shan, Huan Li, Zhongzhi Zhang:
Biharmonic Distance Related Centrality for Edges in Weighted Networks. IJCAI 2018: 3620-3626 - [i4]Huan Li, Richard Peng, Liren Shan, Yuhao Yi, Zhongzhi Zhang:
Current Flow Group Closeness Centrality for Complex Networks. CoRR abs/1802.02556 (2018) - [i3]Liren Shan, Huan Li, Zhongzhi Zhang:
Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket. CoRR abs/1803.00829 (2018) - [i2]Liren Shan, Yuhao Yi, Zhongzhi Zhang:
Improving information centrality of a node in complex networks by adding edges. CoRR abs/1804.06540 (2018) - 2017
- [j2]Liren Shan, Huan Li, Zhongzhi Zhang
Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph. Theor. Comput. Sci. 677: 12-30 (2017) - [j1]Yuhao Yi, Zhongzhi Zhang
Robustness of First- and Second-Order Consensus Algorithms for a Noisy Scale-Free Small-World Koch Network. IEEE Trans. Control. Syst. Technol. 25(1): 342-350 (2017) - [i1]Liren Shan, Huan Li, Zhongzhi Zhang:
Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph. CoRR abs/1703.09023 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-19 00:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: