Selected papers that cite this one
- Dorit S. Hochbaum and Joseph (Seffi) Naor. Simple and fast algorithms for linear and integer programs with two variables per inequality. SIAM Journal on Computing, 23(6):1179-1192, December 1994.
- Franz Höfting and Egon Wanke. Minimum cost paths in periodic graphs. SIAM Journal on Computing, 24(5):1051-1067, October 1995.
- Madhav V. Marathe, Harry B. Hunt III, Richard E. Stearns, and Venkatesh Radhakrishnan. Approximation algorithms for PSPACE-hard hierarchically and periodically specified problems. SIAM Journal on Computing, 27(5):1237-1261, October 1998.
- Ji\v{r}í Matou\v{s}ek. Derandomization in computational geometry. Journal of Algorithms, 20(3):545-580, May 1996.
Selected references
- Kazuo Iwano and Kenneth Steiglitz. Testing for cycles in infinite graphs with periodic structure (extended abstract). In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pages 46-55, New York City, 25-27 May 1987.
- Richard M. Karp, Raymond E. Miller, and Shmuel Winograd. The organization of computations for uniform recurrence equations. Journal of the ACM, 14(3):563-590, July 1967.
- S. Rao Kosaraju and Gregory F. Sullivan. Detecting cycles in dynamic graphs in polynomial time (preliminary version). In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pages 398-406, Chicago, Illinois, 2-4 May 1988.
- Nimrod Megiddo. Applying parallel computation algorithms in the design of serial algorithms. Journal of the ACM, 30(4):852-865, October 1983.
- Nimrod Megiddo. Linear programming in linear time when the dimension is fixed. Journal of the ACM, 31(1):114-127, January 1984.