KEIL, J. Mark; MONDAL, Debajyoti; MORADI, Ehsan; NEKRICH, Yakov. Finding a Maximum Clique in a Grounded 1-Bend String Graph. Journal of Graph Algorithms and Applications, [S. l.], v. 26, n. 4, p. 553–575, 2022. DOI: 10.7155/jgaa.00608. Disponível em: https://jgaa.info/index.php/jgaa/article/view/paper608. Acesso em: 22 dec. 2024.