The max clique problem in classes of string-graphs

Abstract A string-graph is an intersection graph of a set of curves in the plane. Investigating the complexity of the max clique problem for some classes of string-graphs we obtain NP- completeness results on one hand and polynomial time algorithms on the other hand for string-graph-classes of at first sight surprising similarity.