Here are some examples of in-text citation in body of paper and Reference list.
We note that a deterministic near-linear time min-cut algorithm is known for planar graphs . We are not aware of anyone else that
has observed that a large minimum degree in a simple graph implies few minimum cuts, though it does appear that this fact could also
be derived from the cactus representation . For more detailed history for the global minimum cut problem, we refer the reader to
the book by Schrijver .
Our presentation is necessarily at a high level, omitting many details, but the interested reader can find the complete
specification online [91, 103] if they would like to read more about this issue.
The point is that to find a minimum cut, they just have to guess a vertex t on the side that s does not belong to. The s-t cuts
are understood via Menger’s classic theorem . Kohler et al.  designed DCCP, a datagram congestion control protocol without
reliability. Within this process, two partial formalizations were done, one using finite state machines, and one using colored Petri
nets by Vanit-Anunchai et al. .
 P. Chalermsook, J. Fakcharoenphol, and D. Nanongkai. 2004. A deterministic near-linear time algorithm for finding
minimum cuts in planar graphs. In Proceedings of the 15th SODA. 828–829.
 Efim A. Dinitz, A. V. Karzanov, and Micael V. Lomonosov. 1976. A structure of the system of all minimum cuts of a
graph. In Studies in Discrete Optimization, A.A. Fridman (Ed.). 290–306.
 Karl Menger. 1927. Zur allgemeinen Kurventheorie. Fund. Math. 10 (1927), 96–115.
 A. Schrijver. 2003. Combinatorial Optimization: Polyhedra and Efficiency. Springer, NY.
 Eddie Kohler, Mark Handley, and Sally Floyd. 2006. Designing DCCP: Congestion control without reliability. In
Proceedings of the 2006 Conference on Applications, Technologies, Architectures, and Protocols for Computer
Communications (SIGCOMM’06). ACM, New York, 27–38. DOI:https://doi.org/10.1145/1159913.1159918
 Tom Ridge, Michael Norrish, and Peter Sewell. 2009. TCP, UDP, and Sockets: Volume 3: The Service-Level
Specification.Technical Report UCAM-CL-TR-742. Computer Laboratory, University of Cambridge. 305pp.Retrieved
 The Netsem Project. [n.d.]. Web page. Retrieved from http://www.cl.cam.ac.uk/users/pes20/Netsem/.
 Somsak Vanit-Anunchai, Jonathan Billington, and Tul Kongprakaiwoot. 2005. Discovering chatter and incompleteness
in the datagram congestion control protocol. In Proceedings of the 25th IFIP WG 6.1 International Conference on Formal
Techniques for Networked and Distributed Systems (FORTE’05). Springer-Verlag, Berlin, 143–158.