Cite
Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings.
MLA
Giacomo, Emilio, et al. “Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings.” Theory of Computing Systems, vol. 49, no. 3, Oct. 2011, pp. 565–75. EBSCOhost, https://doi.org/10.1007/s00224-010-9275-6.
APA
Giacomo, E., Didimo, W., Liotta, G., & Meijer, H. (2011). Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings. Theory of Computing Systems, 49(3), 565–575. https://doi.org/10.1007/s00224-010-9275-6
Chicago
Giacomo, Emilio, Walter Didimo, Giuseppe Liotta, and Henk Meijer. 2011. “Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings.” Theory of Computing Systems 49 (3): 565–75. doi:10.1007/s00224-010-9275-6.