The Operators minCh and maxCh on the Polynomial Hierarchy. - Holger Spakowski; Jörg Vogel 001 (FCT, 1999)

Theta2p-Completeness: A Classical Approach for New Results. - Holger Spakowski; Jörg Vogel 001 (FSTTCS, 2000)

Exact Complexity of Exact-Four-Colorability and of the Winner Problem for Young Elections. - Jörg Rothe; Holger Spakowski; Jörg Vogel 001 (IFIP TCS, 2002)

Exact Complexity of the Winner Problem for Young Elections. - Jörg Rothe; Holger Spakowski; Jörg Vogel 001 (Theory Comput. Syst., 2003)

Degree Bounds on Polynomials and Relativization Theory. - Holger Spakowski; Rahul Tripathi (IFIP TCS, 2004)

Complexity of Cycle Length Modularity Problems in Graphs. - Edith Hemaspaandra; Holger Spakowski; Mayur Thakur (LATIN, 2004)

Completeness for parallel access to NP and counting class separations. - Holger Spakowski (2005)

Completeness for parallel access to NP and counting class separation. - Holger Spakowski (Ausgezeichnete Informatikdissertationen, 2005)

Quantum and classical complexity classes: Separations, collapses, and closure properties. - Holger Spakowski; Mayur Thakur; Rahul Tripathi (Inf. Comput., 2005)

The complexity of Kemeny elections. - Edith Hemaspaandra; Holger Spakowski; Jörg Vogel 001 (Theor. Comput. Sci., 2005)

Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP. - Edith Hemaspaandra; Jörg Rothe; Holger Spakowski (RAIRO Theor. Informatics Appl., 2006)

LWPP and WPP are not uniformly gap-definable. - Holger Spakowski; Rahul Tripathi (J. Comput. Syst. Sci., 2006)

On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time. - Gábor Erdélyi; Lane A. Hemaspaandra; Jörg Rothe; Holger Spakowski (FCT, 2007)

An improved exact algorithm for the domatic number problem. - Tobias Riege; Jörg Rothe; Holger Spakowski; Masaki Yamamoto 001 (Inf. Process. Lett., 2007)

On the Power of Unambiguity in Alternating Machines. - Holger Spakowski; Rahul Tripathi (Theory Comput. Syst., 2007)

Frequency of Correctness versus Average-Case Polynomial Time and Generalized Juntas - Gábor Erdélyi; Lane A. Hemaspaandra; Jörg Rothe; Holger Spakowski (CoRR, 2008)

Frequency of correctness versus average polynomial time. - Gábor Erdélyi; Lane A. Hemaspaandra; Jörg Rothe; Holger Spakowski (Inf. Process. Lett., 2009)

Hierarchical Unambiguity. - Holger Spakowski; Rahul Tripathi (SIAM J. Comput., 2009)

Generalized juntas and NP-hard sets. - Gábor Erdélyi; Lane A. Hemaspaandra; Jörg Rothe; Holger Spakowski (Theor. Comput. Sci., 2009)

Avoiding Simplicity is Complex. - Eric Allender; Holger Spakowski (Theory Comput. Syst., 2012)

On Limited Nondeterminism and ACC Circuit Lower Bounds. - Holger Spakowski (LATA, 2016)

Team Diagonalization. - Lane A. Hemaspaandra; Holger Spakowski (CoRR, 2018)

Column: Team Diagonalization. - Lane A. Hemaspaandra; Holger Spakowski (SIGACT News, 2018)

The Robustness of LWPP and WPP, with an Application to Graph Reconstruction. - Edith Hemaspaandra; Lane A. Hemaspaandra; Holger Spakowski; Osamu Watanabe 001 (Comput. Complex., 2020)