CiteSeer.IST HomeCheck: The following citations are predicted to all refer to the same paper. Details
David Eppstein, "Finding the k shortest paths", Proc. 35 th Symp. Foundations of Computer Science, IEEE, pp.154-165, 1994.
D. Eppstein, "Finding the k Shortest Paths", Proc. 25th IEEE Annual Symposium on Foundation of Computer Science, pp. 154--165, 1994.
D.Eppstein. "Finding the k Shortest Paths", IEEE FOCS'94, pp154-165, 1994.
D. Eppstein, "Finding the K shortest paths," SIAM J. Computing, vol.28, no.2, pp.652--673, 1998.
D. Eppstein, "Finding the K Shortest Paths", SLAM J. Computing 28:0(1999) pp. 652-673.
D. Eppstein, " Finding k-shortest paths" , SIAM J. on .Computing, vol.28, no 2, pp.652-673, 1998
D. Eppstein, " Finding k-shortest paths" , SIAM J. on .Computing, vol.28, no 2, pp.652-673, 1998
D. Eppstein, "Finding the k shortest paths," in Proceedings of the 35th Annual Symposium on Foundations of Computer Science. IEEE, Nov. 1994, pp. 154 -- 165.
D. Eppstein, "Finding k-shortest paths", SIAM J. on .Computing, vol.28, no 2, pp.652-673, 1998
David Eppstein, "Finding the k shortest paths", Technical Report, UC Irvine, http://www.ics.uci.edu/~eppstein/, 1997.
D. Eppstein, "Finding the k shortest paths," Tech. Rep., Dep. of Info. and Comp. Sci., University of California, 1994.
D. Eppstein, "Finding the k shortest paths," Dep. of Info. and Comp. Sci., University of California, Tech. Rep., 1994.
D. Eppstein, "Finding the k shortest paths," SIAM Journal of Computing, vol. 28, no. 2, pp. 652--673, 1999.
David Eppstein, "Finding the k shortest paths," SIAM J. Computing, vol. 28, no. 2, pp. 652--673, 1998.
D. Eppstein, "Finding the k shortest paths," SIAM Journal of Computing, vol. 28, no. 2, pp. 652--673, 1999.
D. Eppstein, "Finding the K Shortest Paths," SIAM J. Computing, vol. 28, no. 2, pp. 652--673, 1998.
D. Eppstein, "Finding the k shortest paths," SIAM J. Computing, vol. 28, no. 2, pp. 652--673, 1998.
D. Eppstein, "Finding the k shortest paths," Tech. Rep., Dep. of Info. and Comp. Sci., University of California, 1994.
D. Eppstein, "Finding the k shortest paths," SIAM J. Computing,vol. 28(2), pp. 652--673, 1998.
D. Eppstein, "Finding the k Shortest Paths," SIAM J. Computing, vol. 28, no. 2, pp. 652--673, 1998. [Online]. Available: http://www.ics.uci.edu/eppstein/pubs/ Epp-SJC-99.pdf
D. Eppstein, "Finding the k shortest paths," SIAM Journal of Computing, vol. 28, no. 2, pp. 652--673, 1999.
D. Eppstein, "Finding the k shortest path," Proceedings of 35th Annual Symposium on Foundations of Computer Science, pp. 154-165, 1994.