Skip to content

Author

Russ Woodroofe

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 Oct 2026

Partitionability is NP-complete

We show that the problem of deciding whether a simplicial complex is partitionable is NP-complete in dimensions two and higher, answering a 1995 question of Kleinschmidt and Onn.

Russ Woodroofe · 0 citations

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