A graph G with n vertices is called an outerstring if it has intersection representation a set of curves inside disk such that one endpoint every curve attached to the boundary disk. Given s segments, Maximum Independent Set ( MIS ) can be computed in O 3 time (Keil et al. (2017) [22] ). We examine fine-grained complexity problem on some well-known representations (e.g., line L -shapes, etc.), ...