Skip to content

Author

Yusuke Kobayashi

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

Dense Pinwheel Packing Is Strongly NP-Complete

An instance of {\sc Pinwheel Packing} is a list of positive integers $a_1,\ldots,a_k$. A feasible schedule assigns one task to every integer time so that every interval of $a_i$ consecutive times contains task $i$. The instance is \emph{dense} when $\sum_i1/a_i=1$. We prove that {\sc Dense Pinwheel Packing} is NP-compl...

Yusuke Kobayashi, Bing-Kai Lin, Joseph Swernofsky · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.