| 2026 | SIGCSE | Conceptual Models for Teaching and Learning Computer Science Theory. | Kimberly Fluet, Lane A. Hemaspaandra, Christopher Homan |
| 2024 | EUMAS | Search Versus Search for Collapsing Electoral Control Types. | Benjamin Carleton, Michael C. Chavrimootoo, Lane A. Hemaspaandra, David E. Narvez, Conor Taliancich, Henry B. Welles |
| 2022 | MFCS | Gaps, Ambiguity, and Establishing Complexity-Class Containments via Iterative Constant-Setting. | Lane A. Hemaspaandra, Mandar Juvekar, Arian Nadjimzadah, Patrick A. Phillips |
| 2019 | LATA | Closure and Nonclosure Properties of the Compressible and Rankable Sets. | Jackson Abascal, Lane A. Hemaspaandra, Shir Maimon, Daniel Rubery |
| 2019 | SOFSEM | Existence Versus Exploitation: The Opacity of Backdoors and Backbones Under a Weak Assumption. | Lane A. Hemaspaandra, David E. Narvez |
| 2018 | AAAI | Computational Social Choice and Computational Complexity: BFFs? | Lane A. Hemaspaandra |
| 2018 | MFCS | The Robustness of LWPP and WPP, with an Application to Graph Reconstruction. | Edith Hemaspaandra, Lane A. Hemaspaandra, Holger Spakowski, Osamu Watanabe |
| 2017 | AAAI | The Opacity of Backbones. | Lane A. Hemaspaandra, David E. Narvez |
| 2015 | IJCAI | The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates (Extended Abstract). | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra |
| 2014 | AAAI | A Control Dichotomy for Pure Scoring Rules. | Edith Hemaspaandra, Lane A. Hemaspaandra, Henning Schnoor |
| 2013 | IJCAI | Control in the Presence of Manipulators: Cooperative and Competitive Cases. | Zack Fitzsimmons, Edith Hemaspaandra, Lane A. Hemaspaandra |
| 2013 | STACS | Search versus Decision for Election Manipulation Problems. | Edith Hemaspaandra, Lane A. Hemaspaandra, Curtis Menton |
| 2013 | TARK | The Complexity of Online Manipulation of Sequential Elections. | Edith Hemaspaandra, Lane A. Hemaspaandra, Jrg Rothe |
| 2012 | ECAI | Online Voter Control in Sequential Elections. | Edith Hemaspaandra, Lane A. Hemaspaandra, Jrg Rothe |
| 2012 | ECAI | Controlling Candidate-Sequential Elections. | Edith Hemaspaandra, Lane A. Hemaspaandra, Jrg Rothe |
| 2011 | TARK | The complexity of manipulative attacks in nearly single-peaked electorates. | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra |
| 2010 | AAAI | Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates. | Felix Brandt, Markus Brill, Edith Hemaspaandra, Lane A. Hemaspaandra |
| 2009 | IJCAI | Multimode Control Attacks on Elections. | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra |
| 2009 | TARK | The shield that never was: societies with single-peaked preferences are more open to manipulation and control. | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jrg Rothe |
| 2008 | AAIM | The Complexity of Power-Index Comparison. | Piotr Faliszewski, Lane A. Hemaspaandra |
| 2008 | AAIM | Copeland Voting Fully Resists Constructive Control. | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jrg Rothe |
| 2007 | AAAI | Llull and Copeland Voting Broadly Resist Bribery and Control. | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jrg Rothe |
| 2007 | FCT | On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time. | Gbor Erdlyi, Lane A. Hemaspaandra, Jrg Rothe, Holger Spakowski |
| 2007 | FCT | On the Complexity of Kings. | Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tantau, Osamu Watanabe |
| 2007 | IJCAI | Hybrid Elections Broaden Complexity-Theoretic Resistance to Control. | Edith Hemaspaandra, Lane A. Hemaspaandra, Jrg Rothe |
| 2006 | AAAI | The Complexity of Bribery in Elections. | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra |
| 2006 | MFCS | Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners. | Christopher M. Homan, Lane A. Hemaspaandra |
| 2006 | SOFSEM | P-Selectivity, Immunity, and the Power of One Bit. | Lane A. Hemaspaandra, Leen Torenvliet |
| 2006 | TAMC | Cluster Computing and the Power of Edge Recognition. | Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub |
| 2005 | AAAI | Anyone but Him: The Complexity of Precluding an Alternative. | Edith Hemaspaandra, Lane A. Hemaspaandra, Jrg Rothe |
| 2005 | COCOON | Query-Monotonic Turing Reductions. | Lane A. Hemaspaandra, Mayur Thakur |
| 2004 | LATIN | The Complexity of Finding Top-Toda-Equivalence-Class Members. | Lane A. Hemaspaandra, Mitsunori Ogihara, Mohammed Javeed Zaki, Marius Zimand |
| 2004 | MFCS | All Superlinear Inverse Schemes Are coNP-Hard. | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel |
| 2004 | MFCS | Complexity Results in Graph Reconstruction. | Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi |
| 2003 | DLT | Computation with Absolutely No Space Overhead. | Lane A. Hemaspaandra, Proshanto Mukherji, Till Tantau |
| 2003 | STACS | Competing Provers Yield Improved Karp-Lipton Collapse Results. | Jin-yi Cai, Venkatesan T. Chakaravarthy, Lane A. Hemaspaandra, Mitsunori Ogihara |
| 2001 | COCOON | Algebraic Properties for P-Selectivity. | Lane A. Hemaspaandra, Harald Hempel, Arfst Nickelsen |
| 2001 | FCT | If P != NP Then Some Strongly Noninvertible Functions Are Invertible. | Lane A. Hemaspaandra, Kari Pasanen, Jrg Rothe |
| 2001 | ICALP | The Complexity of Computing the Size of an Interval. | Lane A. Hemaspaandra, Sven Kosub, Klaus W. Wagner |
| 2000 | MFCS | Computational Politics: Electoral Systems. | Edith Hemaspaandra, Lane A. Hemaspaandra |
| 2000 | MFCS | Reducing the Number of Solutions of NP Functions. | Lane A. Hemaspaandra, Mitsunori Ogihara, Gerd Wechsung |
| 1999 | FCT | Restrictive Acceptance Suffices for Equivalence Problems. | Bernd Borchert, Lane A. Hemaspaandra, Jrg Rothe |
| 1999 | STACS | Extending Downward Collapse from 1-versus-2 Queries to j-versus-j+1 Queries. | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel |
| 1998 | COCOON | Robust Reductions. | Jin-yi Cai, Lane A. Hemaspaandra, Gerd Wechsung |
| 1998 | MFCS | A Second Step Towards Circuit Complexity-Theoretic Analogs of Rice's Theorem. | Lane A. Hemaspaandra, Jrg Rothe |
| 1997 | CIAC | R | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel |
| 1997 | CIAC | On Sets with Easy Certificates and the Existence of One-Way Permutations. | Lane A. Hemaspaandra, Jrg Rothe, Gerd Wechsung |
| 1997 | FCT | Query Order in the Polynomial Hierarchy. | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel |
| 1997 | ICALP | Exact Analysis of Dodgson Elections: Lewis Carroll's 1876 Voting System is Complete for Parallel Access to NP. | Edith Hemaspaandra, Lane A. Hemaspaandra, Jrg Rothe |
| 1997 | STACS | A Downward Translation in the Polynomial Hierarchy. | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel |
| 1996 | COCOON | The Join Can Lower Complexity. | Lane A. Hemaspaandra, Zhigen Jiang, Jrg Rothe, Osamu Watanabe |
| 1995 | COCOON | Intersection Suffices for Boolean Hierarchy Equivalence. | Lane A. Hemaspaandra, Jrg Rothe |
| 1995 | MFCS | Witness-Isomorphic Reductions and the Local Search Problem (Extended Abstract). | Sophie Fischer, Lane A. Hemaspaandra, Leen Torenvliet |
| 1995 | STACS | Pseudorandom Generators and the Frequency of Simplicity. | Yenjo Han, Lane A. Hemaspaandra |
| 1994 | ISAAC | Computing Solutions Uniquely collapses the Polynomial Hierarchy. | Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman |
| 1993 | ISAAC | Threshold Computation and Cryptographic Security. | Yenjo Han, Lane A. Hemaspaandra, Thomas Thierauf |