Journal of the ACM Bibliography

Selected papers that cite this one

• Gerth Stølting Brodal, Jesper Larsson Träff, and Christos D. Zaroliagis. A parallel priority queue with constant time operations. Journal of Parallel and Distributed Computing, 49(1):4-21, 25 February 1998.

• Bernard Chazelle. A faster deterministic algorithm for minimum spanning trees. In 38th Annual Symposium on Foundations of Computer Science, pages 22-31, Miami Beach, Florida, 20-22 October 1997. IEEE.

• Lin Chen. Solving the shortest-paths problems on bipartite permutation graphs efficiently. Information Processing Letters, 55(5):259-264, 15 September 1995.

• Joseph Cheriyan and Torben Hagerup. A randomized maximum-flow algorithm. SIAM Journal on Computing, 24(2):203-226, April 1995.

• Boris V. Cherkassky, Andrew V. Goldberg, and Craig Silverstein. Buckets, heaps, lists, and monotone priority queues. In Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 83-92, New Orleans, Louisiana, 5-7 January 1997.

• Dorit Dor, Shay Halperin, and Uri Zwick. All pairs almost shortest paths. In 37th Annual Symposium on Foundations of Computer Science, pages 452-461, Burlington, Vermont, 14-16 October 1996. IEEE.

• Guy Even, Joseph (Seffi) Naor, Satish Rao, and Baruch Schieber. Fast approximate graph partitioning algorithms. In Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 639-648, New Orleans, Louisiana, 5-7 January 1997.

• Greg N. Frederickson. Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spaning trees. SIAM Journal on Computing, 26(2):484-538, April 1997.

• Greg N. Frederickson. Planar graph decomposition and all pairs shortest paths. Journal of the ACM, 38(1):162-204, January 1991.

• Greg N. Frederickson. Using cellular graph embeddings in solving all pairs shortest paths problems. Journal of Algorithms, 19(1):45-85, July 1995.

• G. N. Frederickson. Searching among intervals and compact routing tables. Algorithmica, 15(5):448-466, May 1996.

• Harold N. Gabow and Ying Xu. Efficient theoretic and practical algorithms for linear matroid intersection problems. Journal of Computer and System Sciences, 53(1):129-147, August 1996.

• Andrew V. Goldberg. Scaling algorithms for the shortest paths problem. SIAM Journal on Computing, 24(3):494-504, June 1995.

• Refael Hassin and Arie Tamir. On the minimum diameter spanning tree problem. Information Processing Letters, 53(2):109-111, 27 January 1995.

• Monika R. Henzinger, Philip Klein, Satish Rao, and Sairam Subramanian. Faster shortest-path algorithms for planar graphs. Journal of Computer and System Sciences, 55(1):3-23, August 1997.

• David R. Karger. Random sampling in matroids, with applications to graph connectivity and minimum spanning trees. In 34th Annual Symposium on Foundations of Computer Science, pages 84-93, Palo Alto, California, 3-5 November 1993. IEEE.

• Philip Klein, Serge Plotkin, Clifford Stein, and Éva Tardos. Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts. SIAM Journal on Computing, 23(3):466-487, June 1994.

• Philip Klein, Satish Rao, Monika Rauch, and Sairam Subramanian. Faster shortest-path algorithms for planar graphs. In Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, pages 27-37, Montréal, Québec, Canada, 23-25 May 1994.

• Stavros G. Kolliopoulos and Clifford Stein. Finding real-valued single-source shortest paths in o(n^3) expected time. Journal of Algorithms, 28(1):125-141, July 1998.

• Rajeev Motwani. Realization of matrices and directed graphs. Journal of Algorithms, 27(1):61-74, April 1998.

• Enrico Nardelli, Guido Proietti, and Peter Widmayer. Finding the detour-critical edge of a shortest path between two nodes. Information Processing Letters, 67(1):51-54, 16 July 1998.

• Madan Natu and Shu-Cherng Fang. On the point-to-point connection problem. Information Processing Letters, 53(6):333-336, 24 March 1995.

• G. Ramalingam and Thomas Reps. An incremental algorithm for a generalization of the shortest-path problem. Journal of Algorithms, 21(2):267-305, September 1996.

• Raimund Seidel. On the all-pairs-shortest-path problem in unweighted undirected graphs. Journal of Computer and System Sciences, 51(3):400-403, December 1995.

• H. Seidl. Least and Greatest Solutions of Equations over N Nordic Journal of Computing, 3(1):41-62, Spring 1996.

• Thomas H. Spencer. Time-work tradeoffs for parallel algorithms. Journal of the ACM, 44(5):742-778, September 1997.

• Mechthild Stoer and Frank Wagner. A simple min-cut algorithm. Journal of the ACM, 44(4):585-591, July 1997.

• Tadao Takaoka. Shortest path algorithms for nearly acyclic directed graphs. Theoretical Computer Science, 203(1):143-150, 6 August 1998.

• Mikkel Thorup. Undirected single source shortest paths in linear time. In 38th Annual Symposium on Foundations of Computer Science, pages 12-21, Miami Beach, Florida, 20-22 October 1997. IEEE.

• Takeshi Tokuyama and Jun Nakano. Efficient algorithms for the Hitchcock transportation problem. SIAM Journal on Computing, 24(3):563-578, June 1995.

• Guoliang Xue, Shangzhi Sun, and J. Ben Rosen. Fast data transmission and maximal dynamic flow. Information Processing Letters, 66(3):127-132, 15 May 1998.

• Chung-Do Yang, D. T. Lee, and C. K. Wong. Rectilinear path problems among rectilinear obstacles revisited. SIAM Journal on Computing, 24(3):457-472, June 1995.

Shortcuts: