Finding a Maximum Clique in a Grounded 1-Bend String Graph. Keil, J. M., Mondal, D., Moradi, E., & Nekrich, Y. J. Graph Algorithms Appl., 26(1):553-575, 2022.
Finding a Maximum Clique in a Grounded 1-Bend String Graph. [link]Link  Finding a Maximum Clique in a Grounded 1-Bend String Graph. [link]Paper  bibtex   
@article{journals/jgaa/KeilMMN22,
  added-at = {2023-05-12T00:00:00.000+0200},
  author = {Keil, J. Mark and Mondal, Debajyoti and Moradi, Ehsan and Nekrich, Yakov},
  biburl = {https://www.bibsonomy.org/bibtex/2c3d036a22dfcc5b9088b7dcebd7cbff5/dblp},
  ee = {https://doi.org/10.7155/jgaa.00608},
  interhash = {4a51dee76573baebded6e5c62022bb56},
  intrahash = {c3d036a22dfcc5b9088b7dcebd7cbff5},
  journal = {J. Graph Algorithms Appl.},
  keywords = {dblp},
  number = 1,
  pages = {553-575},
  timestamp = {2024-04-08T16:44:33.000+0200},
  title = {Finding a Maximum Clique in a Grounded 1-Bend String Graph.},
  url = {http://dblp.uni-trier.de/db/journals/jgaa/jgaa26.html#KeilMMN22},
  volume = 26,
  year = 2022
}

Downloads: 0