Author:
Chen Jianer,Chu Zirui,Guo Ying,Yang Wei
Publisher
Springer International Publishing
Reference18 articles.
1. https://followthedata.wordpress.com/2014/06/24/data-size-estimates/
2. Chen, J., Guo, Y., Huang, Q.: Linear-time parameterized algorithms with limited local resources. Inf. Comput. 289, 104951 (2022). https://doi.org/10.1016/j.ic.2022.104951
3. Chen, J., Huang, Q., Kanj, I.A., Li, Q., Xia, G.: Streaming algorithms for graph $$k$$-matching with optimal or near-optimal update time. In: Proceedings of 32nd International Symposium on Algorithms and Computation (ISAAC 2021), Article No. 48, pp. 48:1–48:17 (2021)
4. Chen, J., Kanj, I.A., Jia, W.: Vertex cover: further observations and further improvements. J. Algorithms 41–2, 280–301 (2001)
5. Chitnis, R., Cormode, G., Esfandiari, H., Hajiaghayi, M., McGregor, A., Monemizadeh, M.: Kernelization via sampling with applications to finding matchings and related problems in dynamic graph streams. In: Proceedings of 27th ACM-SIAM Symposium on Discrete Algorithms (SODA 2016), pp. 1326–1344 (2016)