Efficient Algorithms for Range Longest Increasing Subsequence and its Colored Variants

The authors present efficient algorithms for solving the range longest increasing subsequence (Range-LIS) problem and its colored variants, breaking the quadratic barrier in several settings.