| Approximation algorithms for submodular data summarization with a knapsack constraint K Han, S Cui, T Zhu, E Zhang, B Wu, Z Yin, T Xu, S Tang, H Huang Proceedings of the ACM on Measurement and Analysis of Computing Systems 5 (1 ¡K, 2021 | 21 | 2021 |
| Deterministic approximation for submodular maximization over a matroid in nearly linear time K Han, S Cui, B Wu Advances in Neural Information Processing Systems 33, 430-441, 2020 | 19 | 2020 |
| Randomized Algorithms for Submodular Function Maximization with a -System Constraint S Cui, K Han, T Zhu, J Tang, B Wu, H Huang International Conference on Machine Learning, 2222-2232, 2021 | 14 | 2021 |
| Efficient and effective algorithms for revenue maximization in social advertising K Han, B Wu, J Tang, S Cui, C Aslay, LVS Lakshmanan Proceedings of the 2021 international conference on management of data, 671-684, 2021 | 9 | 2021 |
| Streaming algorithms for constrained submodular maximization S Cui, K Han, J Tang, H Huang, X Li, Z Li Proceedings of the ACM on Measurement and Analysis of Computing Systems 6 (3 ¡K, 2022 | 6 | 2022 |
| Practical parallel algorithms for submodular maximization subject to a knapsack constraint with nearly optimal adaptivity S Cui, K Han, J Tang, H Huang, X Li, A Zhiyuli Proceedings of the AAAI Conference on Artificial Intelligence 37 (6), 7261-7269, 2023 | 5 | 2023 |
| Randomized pricing with deferred acceptance for revenue maximization with submodular objectives H Huang, K Han, S Cui, J Tang Proceedings of the ACM Web Conference 2023, 3530-3540, 2023 | 5 | 2023 |
| Constrained Subset Selection from Data Streams for Profit Maximization S Cui, K Han, J Tang, H Huang Proceedings of the ACM Web Conference 2023, 1822-1831, 2023 | 3 | 2023 |
| Triple eagle: simple, fast and practical budget-feasible mechanisms K Han, Y Wu, H Huang, S Cui Advances in Neural Information Processing Systems 36, 2024 | 2 | 2024 |
| Chromatic correlation clustering, revisited Q Xiu, K Han, J Tang, S Cui, H Huang Advances in Neural Information Processing Systems 35, 26147-26159, 2022 | 2 | 2022 |
| Deletion-Robust Submodular Maximization with Knapsack Constraints S Cui, K Han, H Huang Proceedings of the AAAI Conference on Artificial Intelligence 38 (10), 11695 ¡K, 2024 | 1 | 2024 |
| Practical Parallel Algorithms for Non-Monotone Submodular Maximization S Cui, K Han, J Tang, H Huang, X Li, A Zhiyuli, H Li arXiv preprint arXiv:2308.10656, 2023 | 1 | 2023 |
| Streaming Algorithms for Constrained Submodular Maximization S Cui, K Han, J Tang, H Huang, X Li, Z Li ACM SIGMETRICS Performance Evaluation Review 51 (1), 65-66, 2023 | 1 | 2023 |
| Fairness in Streaming Submodular Maximization Subject to a Knapsack Constraint S Cui, K Han, S Tang, F Li, J Luo Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and ¡K, 2024 | | 2024 |
| Deletion-Robust Submodular Maximization under a Knapsack Constraint W Sun, K Han, S Cui 2023 IEEE International Conference on High Performance Computing ¡K, 2023 | | 2023 |
| The Power of Randomization: Efficient and Effective Algorithms for Constrained Submodular Maximization K Han, S Cui, T Zhu, J Tang, B Wu, H Huang arXiv preprint arXiv:2106.07116, 2021 | | 2021 |
Kai HanProfessor, School of Computer Science and Technology, Soochow UniversityVerified email at suda.edu.cn
![Shuang Cui¡]±Z²n¡^](https://scholar.googleusercontent.com/citations?view_op=view_photo&user=2e_9NCQAAAAJ&citpid=6)