APA (7th ed.) Citation

Raikwar, H., & Karmakar, S. (2022, November). Fully Dynamic Algorithm for the Steiner Tree Problem in Planar Graphs. International Symposium on Computing and Networking Workshops (Online), 416-420. https://doi.org/10.1109/CANDARW57323.2022.00064

Chicago Style (17th ed.) Citation

Raikwar, Hemraj, and Sushanta Karmakar. "Fully Dynamic Algorithm for the Steiner Tree Problem in Planar Graphs." International Symposium on Computing and Networking Workshops (Online) Nov. 2022: 416-420. https://doi.org/10.1109/CANDARW57323.2022.00064.

MLA (9th ed.) Citation

Raikwar, Hemraj, and Sushanta Karmakar. "Fully Dynamic Algorithm for the Steiner Tree Problem in Planar Graphs." International Symposium on Computing and Networking Workshops (Online), Nov. 2022, pp. 416-420, https://doi.org/10.1109/CANDARW57323.2022.00064.