Author:
Fujie Tetsuya,Higashikawa Yuya,Katoh Naoki,Teruyama Junichi,Tokuni Yuki
Publisher
Springer International Publishing
Reference28 articles.
1. Agarwal, P.K., Sharir, M., Shor, P.: Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences. J. Comb. Theory Ser. A 52(2), 228–274 (1989)
2. Alstrup, S., Gavoille, C., Kaplan, H., Rauhe, T.: Nearest common ancestors: a survey and a new distributed algorithm. In: Proceedings of the 14th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 2002), pp. 258–264 (2002)
3. Arumugam, G.P., Augustine, J., Golin, M.J., Srikanthan, P.: Minmax regret $$k$$-sink location on a dynamic path network with uniform capacities. Algorithmica 81(9), 3534–3585 (2019)
4. Lecture Notes in Computer Science;MA Bender,2000
5. Lecture Notes in Computer Science;R Benkoczi,2018
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献