Liren Shan

Orcid: 0000-0002-4273-3005

According to our database1, Liren Shan authored at least 21 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Error-Tolerant E-Discovery Protocols.
CoRR, 2024

2023
Higher-Order Cheeger Inequality for Partitioning with Buffers.
CoRR, 2023

Approximation Algorithms for Norm Multiway Cut.
CoRR, 2023

Random Cuts are Optimal for Explainable k-Medians.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Approximation Algorithm for Norm Multiway Cut.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Optimal Scoring Rules for Multi-dimensional Effort.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022
Edge Deletion Algorithms for Minimizing Spread in SIR Epidemic Models.
SIAM J. Control. Optim., 2022

Fair Curing and Network Design in SIS Epidemic Processes.
CoRR, 2022

Explainable <i>k</i>-means: don't be greedy, plant bigger trees!
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Optimization of Scoring Rules.
Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

Algorithmic Learning Foundations for Common Law.
Proceedings of the 2022 Symposium on Computer Science and Law, 2022

2021
Explainable k-means. Don't be greedy, plant bigger trees!
CoRR, 2021

Near-Optimal Algorithms for Explainable k-Medians and k-Means.
Proceedings of the 38th International Conference on Machine Learning, 2021

2020
Improved Guarantees for k-means++ and k-means++ Parallel.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019
Stochastic Linear Optimization with Adversarial Corruption.
CoRR, 2019

Current Flow Group Closeness Centrality for Complex Networks?
Proceedings of the World Wide Web Conference, 2019

2018
Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket.
Theor. Comput. Sci., 2018

Biharmonic Distance Related Centrality for Edges in Weighted Networks.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Improving Information Centrality of a Node in Complex Networks by Adding Edges.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

2017
Robustness of First- and Second-Order Consensus Algorithms for a Noisy Scale-Free Small-World Koch Network.
IEEE Trans. Control. Syst. Technol., 2017

Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph.
Theor. Comput. Sci., 2017


  Loading...