Oracle with P = NP ∩ coNP, but No Many-One Completeness in UP, DisjNP, and DisjCoNP. - Anton Ehrmanntraut; Fabian Egidy; Christian Glaßer (MFCS, 2022)

Upward Translation of Optimal and P-Optimal Proof Systems in the Boolean Hierarchy over NP. - Fabian Egidy; Christian Glaßer; Martin G. Herold (MFCS, 2023)

An Oracle with no UP-Complete Sets, but NP = PSPACE. - David Dingel; Fabian Egidy; Christian Glaßer (MFCS, 2024)

Oracle without Optimal Proof Systems outside Nondeterministic Subexponential Time. - Fabian Egidy; Christian Glaßer (CoRR, 2024)

The Complexity of Computing Second Solutions. - Fabian Egidy; Christian Glaßer; Fynn Godau (MFCS, 2025)

Optimal Proof Systems for Complex Sets Are Hard to Find. - Fabian Egidy; Christian Glaßer (STOC, 2025)