APA (7th ed.) Citation

Chen, J., Kanchi, S. P., & Kanevsky, A. (1993). On the complexity of graph embeddings. Texas A & M University, Computer Science Dept..

Chicago Style (17th ed.) Citation

Chen, Jianer, Saroja P. Kanchi, and Arkady Kanevsky. On the Complexity of Graph Embeddings. College Station, Tex.: Texas A & M University, Computer Science Dept., 1993.

MLA (9th ed.) Citation

Chen, Jianer, et al. On the Complexity of Graph Embeddings. Texas A & M University, Computer Science Dept., 1993.