Finding a Maximum Clique in a Grounded 1-Bend String Graph

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]

Authors

J. Mark Keil

This author has not been identified. Look up 'J. Mark Keil' in Google

Debajyoti Mondal

This author has not been identified. Look up 'Debajyoti Mondal' in Google

Ehsan Moradi

This author has not been identified. Look up 'Ehsan Moradi' in Google

Yakov Nekrich

This author has not been identified. Look up 'Yakov Nekrich' in Google