Before revision: In arXiv 1705.11035 , the widely known linear time algorithm for computing the maximum area triangle in a convex polygon was found incorrect by Keikha et. al. , and whether it can still be solved in linear time was proposed as an open problem.
After revision: In  , the widely known linear time algorithm for computing the maximum area triangle in a convex polygon was found incorrect by Keikha et. al. , and whether it can still be solved in linear time was proposed as an open problem.