Παραπομπή σε μορφή APA (7η εκδ.)

Klein, P. N., Subramaniany, S., & Archives, T. P. S. U. C. (1993). A linear-processor polylog-time algorithm for shortest paths in planar graphs. http://www.cs.brown.edu/people/pnk/publications/1993parPlanarShort.ps.

Παραπομπή σε μορφή Chicago (17η εκδ.)

Klein, Philip N., Sairam Subramaniany, και The Pennsylvania State University CiteSeerX Archives. "A Linear-processor Polylog-time Algorithm for Shortest Paths in Planar Graphs." Http://www.cs.brown.edu/people/pnk/publications/1993parPlanarShort.ps 1993.

Παραπομπή σε μορφή MLA (9th εκδ.)

Klein, Philip N., et al. "A Linear-processor Polylog-time Algorithm for Shortest Paths in Planar Graphs." Http://www.cs.brown.edu/people/pnk/publications/1993parPlanarShort.ps, 1993.