Publisher
Springer Nature Switzerland
Reference21 articles.
1. Alon, N., Capalbo, M.R.: Finding disjoint paths in expanders deterministically and online. In: 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), October 20–23, 2007, Providence, RI, USA, Proceedings, pp. 518–524. IEEE Computer Society (2007). https://doi.org/10.1109/FOCS.2007.19
2. Bannister, M.J., Eppstein, D.: Randomized speedup of the Bellman-Ford algorithm. In: Martínez, C., Hwang, H-K (eds.), Proceedings of the 9th Meeting on Analytic Algorithmics and Combinatorics, ANALCO 2012, Kyoto, Japan, January 16, 2012, pp. 41–47. SIAM (2012). https://doi.org/10.1137/1.9781611973020.6
3. Beizer, B.: The analysis and synthesis of signal switching networks. In: Proceedings of the Symposium on Mathematical Theory of Automata, New York, April 1962, pp. 563–572. Polytechnic Press of the Polytechnic Institute of Brooklyn (1962)
4. Bellman, R.: On a routing problem. Q. Appl. Math. 16, 87–90 (1958). https://doi.org/10.1090/qam/102435
5. Bernstein, A., Nanongkai, D., Wulff-Nilsen, C.: Negative-weight single-source shortest paths in near-linear time. In: 63rd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2022, Denver, CO, USA, October 31 - November 3, 2022, pp. 600–611. IEEE (2022). https://doi.org/10.1109/FOCS54457.2022.00063