Keil, J. Mark, Debajyoti Mondal, Ehsan Moradi, and Yakov Nekrich. “Finding a Maximum Clique in a Grounded 1-Bend String Graph”. Journal of Graph Algorithms and Applications 26, no. 4 (July 1, 2022): 553–575. Accessed March 14, 2025. https://jgaa-v4.cs.brown.edu/index.php/jgaa/article/view/paper608.