Author:
Bishnu Arijit,Ghosh Arijit,Kolay Sudeshna,Mishra Gopinath,Saurabh Saket
Publisher
Springer International Publishing
Reference19 articles.
1. Assadi, S., Khanna, S., Li, Y.: Tight bounds for single-pass streaming complexity of the set cover problem. In: STOC, pp. 698–711 (2016)
2. Bishnu, A., Ghosh, A., Kolay, S., Mishra, G., Saurabh, S.: Fixed-parameter tractability of graph deletion problems over data streams. CoRR, abs/1906.05458 (2019)
3. Bury, M., et al.: Structural results on matching estimation with applications to streaming. Algorithmica 81(1), 367–392 (2019)
4. Chitnis, R., Cormode, G.: Towards a theory of parameterized streaming algorithms. In: IPEC, vol. 148, pp. 7:1–7:15 (2019)
5. Chitnis, R., et al.: Kernelization via sampling with applications to finding matchings and related problems in dynamic graph streams. In: SODA, pp. 1326–1344 (2016)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献