Wang, P. Y., Kitamura, N., Izumi, T., & Masuzawa, T. (2025). Approximation hardness of domination problems on generalized convex graphs. Theoretical Computer Science, 1028, N.PAG. https://doi.org/10.1016/j.tcs.2024.115035
Chicago Style (17th ed.) CitationWang, Po Yuan, Naoki Kitamura, Taisuke Izumi, and Toshimitsu Masuzawa. "Approximation Hardness of Domination Problems on Generalized Convex Graphs." Theoretical Computer Science 1028 (2025): N.PAG. https://doi.org/10.1016/j.tcs.2024.115035.
MLA (9th ed.) CitationWang, Po Yuan, et al. "Approximation Hardness of Domination Problems on Generalized Convex Graphs." Theoretical Computer Science, vol. 1028, 2025, p. N.PAG, https://doi.org/10.1016/j.tcs.2024.115035.
Warning: These citations may not always be 100% accurate.