On the complexity of scheduling unit-time jobs with OR-precedence constraints. - Berit Johannes (Oper. Res. Lett., 2005)

Scheduling parallel jobs to minimize the makespan. - Berit Johannes (J. Sched., 2006)

Completeness in the Polynomial Hierarchy and PSPACE for many natural problems derived from NP. - Christoph Grüne; Berit Johannes; James B. Orlin; Lasse Wulf (CoRR, 2026)