Chang, E., Choi, S., Kwon, D., Park, H., Yap, C., & SCIENCE, C. (2013). Shortest path amidst disc obstacles is computable.
Chicago Style CitationChang, E.-C., S.W Choi, D. Kwon, H. Park, C.K Yap, and COMPUTER SCIENCE. Shortest Path Amidst Disc Obstacles Is Computable. 2013.
MLA引文Chang, E.-C., et al. Shortest Path Amidst Disc Obstacles Is Computable. 2013.
警告:這些引文格式不一定是100%准確.