2 papers
cs.DS2021
Ruler Wrapping
Travis Gagie, Mozhgan Saeidi, Allan Sapucaia
In 1985 Hopcroft, Joseph and Whitesides showed it is NP-complete to decide whether a carpenter's ruler with segments of given positive lengths can be folded into a line of at most…
cs.CG2020
Solving the Minimum Convex Partition of Point Sets with Integer Programming
Allan Sapucaia, Pedro J. de Rezende, Cid C. de Souza
The partition of a problem into smaller sub-problems satisfying certain properties is often a key ingredient in the design of divide-and-conquer algorithms. For questions related t…