2 papers
cs.CC2026
Dense Pinwheel Packing Is Strongly NP-Complete
Yusuke Kobayashi, Bingkai Lin, Joseph Swernofsky
An instance of {\sc Pinwheel Packing} is a list of positive integers . A feasible schedule assigns one task to every integer time so that every interval of co…
math.CO2019
-Galvin families
Johan Håstad, Guillaume Lagarde, Joseph Swernofsky
The Galvin problem asks for the minimum size of a family with the property that, for any set of size , there is a set $S \in…