Here is an accessible algorithms paper. It&#x27;s a cute puzzle problem. It was inspired by answers on cs.stackexchange.<p>Efficient Algorithms for Envy-Free Stick Division With Fewest Cuts
<a href="http:&#x2F;&#x2F;arxiv.org&#x2F;abs&#x2F;1502.04048" rel="nofollow">http:&#x2F;&#x2F;arxiv.org&#x2F;abs&#x2F;1502.04048</a>