Cite
Efficient Algorithm for Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon.
MLA
Sadhu, Sanjib, et al. “Efficient Algorithm for Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon.” International Journal of Foundations of Computer Science, vol. 31, no. 04, June 2020, pp. 421–43. EBSCOhost, https://doi.org/10.1142/S0129054120500173.
APA
Sadhu, S., Roy, S., Nandi, S., Nandy, S. C., & Roy, S. (2020). Efficient Algorithm for Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon. International Journal of Foundations of Computer Science, 31(04), 421–443. https://doi.org/10.1142/S0129054120500173
Chicago
Sadhu, Sanjib, Sasanka Roy, Soumen Nandi, Subhas C. Nandy, and Suchismita Roy. 2020. “Efficient Algorithm for Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon.” International Journal of Foundations of Computer Science 31 (04): 421–43. doi:10.1142/S0129054120500173.