| Publication | Date of Publication | Type |
|---|
| Finding optimal solutions with neighborly help | 2024-05-30 | Paper |
| Complexity of conformant election manipulation | 2024-05-29 | Paper |
| The complexity of \((P_k, P_\ell ) \)-arrowing | 2024-05-29 | Paper |
| Complexity of Stability. | 2023-11-14 | Paper |
| Formal methods for NFA equivalence: QBFs, witness extraction, and encoding verification | 2023-06-02 | Paper |
| Query order in the polynomial hierarchy | 2022-12-09 | Paper |
| Query optimization using rewrite rules | 2022-12-09 | Paper |
| Search versus Decision for Election Manipulation Problems | 2022-12-05 | Paper |
| A downward translation in the polynomial hierarchy | 2022-11-09 | Paper |
| Finding Optimal Solutions With Neighborly Help. | 2022-07-21 | Paper |
| The complexity of online bribery in sequential elections | 2022-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5018515 | 2021-12-20 | Paper |
| Complexity of stability | 2021-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5005153 | 2021-08-04 | Paper |
| Election Score Can Be Harder than Winner | 2021-07-06 | Paper |
| The robustness of LWPP and WPP, with an application to graph reconstruction | 2021-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5133008 | 2020-11-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4583938 | 2018-08-29 | Paper |
| Dichotomy for Pure Scoring Rules Under Manipulative Electoral Actions | 2018-07-12 | Paper |
| Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP | 2018-07-04 | Paper |
| The complexity of controlling candidate-sequential elections | 2017-05-15 | Paper |
| Search versus Decision for Election Manipulation Problems | 2017-01-30 | Paper |
| Computational Aspects of Approval Voting | 2016-11-08 | Paper |
| Manipulation complexity of same-system runoff elections | 2016-09-16 | Paper |
| Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP | 2016-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3457231 | 2015-12-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3457243 | 2015-12-11 | Paper |
| More Natural Models of Electoral Control by Partition | 2015-11-04 | Paper |
| Complexity of Manipulative Actions When Voting with Ties | 2015-11-04 | Paper |
| The complexity of manipulative attacks in nearly single-peaked electorates | 2015-08-27 | Paper |
| Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates | 2015-08-25 | Paper |
| Weighted Electoral Control | 2015-04-22 | Paper |
| The complexity of online manipulation of sequential elections | 2014-02-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4910732 | 2013-03-19 | Paper |
| A Universally Defined Undecidable Unimodal Logic | 2011-08-17 | Paper |
| Multimode control attacks on elections | 2011-03-08 | Paper |
| The shield that never was: societies with single-peaked preferences are more open to manipulation and control | 2011-02-21 | Paper |
| Generalized modal satisfiability | 2010-08-18 | Paper |
| On the complexity of kings | 2010-02-09 | Paper |
| Llull and Copeland Voting Computationally Resist Bribery and Constructive Control | 2009-12-10 | Paper |
| How hard is bribery in elections? | 2009-12-10 | Paper |
| Hybrid Elections Broaden Complexity-Theoretic Resistance to Control | 2009-08-14 | Paper |
| Isomorphic implication | 2009-08-06 | Paper |
| A Richer Understanding of the Complexity of Election Systems | 2009-08-05 | Paper |
| Anyone but him: the complexity of precluding an alternative | 2009-07-09 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| Copeland Voting Fully Resists Constructive Control | 2008-07-10 | Paper |
| Generalized Modal Satisfiability | 2008-03-19 | Paper |
| On the Complexity of Kings | 2008-02-26 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Complexity results in graph reconstruction | 2007-02-19 | Paper |
| Dichotomy for voting systems | 2007-01-22 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| The complexity of Kemeny elections | 2006-03-20 | Paper |
| Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP | 2006-02-22 | Paper |
| All superlinear inverse schemes are coNP-hard | 2005-12-06 | Paper |
| Extending Downward Collapse from 1-versus-2 Queries tom-versus-m+ 1 Queries | 2005-09-16 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4431234 | 2003-10-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414503 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411838 | 2003-07-10 | Paper |
| Almost-everywhere superiority for quantum polynomial time | 2003-01-14 | Paper |
| The Minimization Problem for Boolean Formulas | 2003-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536344 | 2002-11-04 | Paper |
| The complexity of poor man's logic | 2002-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753683 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4520757 | 2001-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4520804 | 2001-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501537 | 2001-01-29 | Paper |
| Census techniques collapse space classes | 2000-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4251058 | 1999-08-31 | Paper |
| Exact analysis of Dodgson elections | 1998-11-04 | Paper |
| \(R_{1-tt}^{{\mathcal SN}}\)(NP) distinguishes robust many-one and Turing completeness | 1998-10-01 | Paper |
| A Downward Collapse within the Polynomial Hierarchy | 1998-09-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4366882 | 1997-11-25 | Paper |
| The price of universality | 1997-07-01 | Paper |
| \(p\)-Selective sets and reducing search to decision vs. self-reducibility | 1997-03-31 | Paper |
| SPARSE Reduces Conjunctively to TALLY | 1995-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4833777 | 1995-05-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281494 | 1994-03-10 | Paper |
| A modal perspective on the computational complexity of attribute value grammar | 1994-02-22 | Paper |
| Quasi-injective reductions | 1994-02-22 | Paper |
| The relative power of logspace and polynomial time reductions | 1994-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035688 | 1993-05-18 | Paper |
