J. Mark Keil, Debajyoti Mondal, Ehsan Moradi, Yakov Nekrich. Finding a Maximum Clique in a Grounded 1-Bend String Graph. J. Graph Algorithms Appl., 26(1):553-575, 2022. [doi]
@article{KeilMMN22,
title = {Finding a Maximum Clique in a Grounded 1-Bend String Graph},
author = {J. Mark Keil and Debajyoti Mondal and Ehsan Moradi and Yakov Nekrich},
year = {2022},
doi = {10.7155/jgaa.00608},
url = {https://doi.org/10.7155/jgaa.00608},
researchr = {https://researchr.org/publication/KeilMMN22},
cites = {0},
citedby = {0},
journal = {J. Graph Algorithms Appl.},
volume = {26},
number = {1},
pages = {553-575},
}