| The complexity of Kemeny elections E Hemaspaandra, H Spakowski, J Vogel Theoretical Computer Science 349 (3), 382-391, 2005 | 235 | 2005 |
| Exact complexity of the winner problem for Young elections J Rothe, H Spakowski, J Vogel Theory of Computing Systems 36 (4), 375-386, 2003 | 150 | 2003 |
| Θin2sup-Completeness: A Classical Approach for New Results H Spakowski, J Vogel International Conference on Foundations of Software Technology and …, 2000 | 42 | 2000 |
| An improved exact algorithm for the domatic number problem T Riege, J Rothe, H Spakowski, M Yamamoto Information Processing Letters 101 (3), 101-106, 2007 | 34 | 2007 |
| Generalized juntas and NP-hard sets G Erdélyi, LA Hemaspaandra, J Rothe, H Spakowski Theoretical Computer Science 410 (38-40), 3995-4000, 2009 | 24 | 2009 |
| Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP E Hemaspaandra, J Rothe, H Spakowski RAIRO-Theoretical Informatics and Applications 40 (1), 75-91, 2006 | 19* | 2006 |
| On the power of unambiguity in alternating machines H Spakowski, R Tripathi Theory of Computing Systems 41 (2), 291-326, 2007 | 10 | 2007 |
| Quantum and classical complexity classes: Separations, collapses, and closure properties H Spakowski, M Thakur, R Tripathi Information and Computation 200 (1), 1-34, 2005 | 10 | 2005 |
| Complexity of cycle length modularity problems in graphs E Hemaspaandra, H Spakowski, M Thakur Latin American Symposium on Theoretical Informatics, 509-518, 2004 | 10 | 2004 |
| Frequency of correctness versus average polynomial time G Erdélyi, LA Hemaspaandra, J Rothe, H Spakowski Information Processing Letters 109 (16), 946-949, 2009 | 9 | 2009 |
| LWPP and WPP are not uniformly gap-definable H Spakowski, R Tripathi Journal of Computer and System Sciences 72 (4), 660-689, 2006 | 7* | 2006 |
| Column: Team Diagonalization LA Hemaspaandra, H Spakowski ACM SIGACT News 49 (3), 51-61, 2018 | 2 | 2018 |
| Avoiding Simplicity is Complex E Allender, H Spakowski Theory of computing systems 51 (3), 282-296, 2012 | 2 | 2012 |
| The Robustness of LWPP and WPP, with an Application to Graph Reconstruction E Hemaspaandra, LA Hemaspaandra, H Spakowski, O Watanabe computational complexity 29 (2), 1-49, 2020 | 1 | 2020 |
| Hierarchical unambiguity H Spakowski, R Tripathi SIAM Journal on Computing 38 (5), 2079-2112, 2009 | 1 | 2009 |
| The operators minCh and maxCh on the polynomial hierarchy H Spakowski, J Vogel International Symposium on Fundamentals of Computation Theory, 524-535, 1999 | 1 | 1999 |
| On Limited Nondeterminism and ACC Circuit Lower Bounds H Spakowski Language and Automata Theory and Applications, 320-329, 2016 | | 2016 |
