2 problems

Algorithmic ribbonness conjecture. If an alternating knot admits a ribbon disk with three critical points, then it is algorithmically ribbon.

Two-minima one-saddle conjecture. If $L$ bounds a ribbon surface with two minima and a single saddle point, then $L$ is algorithmically ribbon.