7 citations · 7 across the 1 of their papers we have counts for
2 papers
cs.DM2026★ 7 cited
Proof of the Density Threshold Conjecture for Pinwheel Scheduling
Akitoshi Kawamura
In the pinwheel scheduling problem, each task is associated with a positive integer called its period, and we want to (perpetually) schedule one task per day so that each…
cs.DM2025
A Computer-Assisted Proof of the Optimal Density Bound for Pinwheel Covering
Akitoshi Kawamura, Yusuke Kobayashi
In the covering version of the pinwheel scheduling problem, a daily task must be assigned to agents under the constraint that agent can perform the task at most once in any $a_…