1 citations · 1 across the 6 of their papers we have counts for
4 papers · 1 filter
Pentagon Minimization without Computation
John Mackey, Bernardo Subercaseaux
Erdős and Guy initiated a line of research studying , the minimum number of convex -gons one can obtain by placing points in the plane without any three of them bein…
Formal Verification of the Empty Hexagon Number
Bernardo Subercaseaux, Wojciech Nawrocki, James Gallicchio +3
A recent breakthrough in computer-assisted mathematics showed that every set of points in the plane in general position (i.e., without three on a common line) contains an empt…
Assortment Optimization For Conference Goodies With Indifferent Attendees
Fernanda Gutiérrez, Bernardo Subercaseaux
Conferences such as FUN with Algorithms routinely buy goodies (e.g., t-shirts, coffee mugs, etc) for their attendees. Often, said goodies come in different types, varying by color…
PackIt! Gamified Rectangle Packing
Thomas Garrison, Marijn J. H. Heule, Bernardo Subercaseaux
We present and analyze PackIt!, a turn-based game consisting of packing rectangles on an grid. PackIt! can be easily played on paper, either as a competitive two-playe…