| Publication | Date of Publication | Type |
|---|
The complexity of \((P_k,P_\ell )\)-arrowing
Journal of Computer and System Sciences | 2025-12-11 | Paper |
Finding optimal solutions with neighborly help
Algorithmica | 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
Lecture Notes in Computer Science | 2023-06-02 | Paper |
Query order in the polynomial hierarchy
Fundamentals of Computation Theory | 2022-12-09 | Paper |
Query optimization using rewrite rules
Rewriting Techniques and Applications | 2022-12-09 | Paper |
Search versus Decision for Election Manipulation Problems
ACM Transactions on Computation Theory | 2022-12-05 | Paper |
A downward translation in the polynomial hierarchy
Lecture Notes in Computer Science | 2022-11-09 | Paper |
Finding Optimal Solutions With Neighborly Help.
(available as arXiv preprint) | 2022-07-21 | Paper |
The complexity of online bribery in sequential elections
Journal of Computer and System Sciences | 2022-04-04 | Paper |
| scientific article; zbMATH DE number 7450032 (Why is no real title available?) | 2021-12-20 | Paper |
scientific article; zbMATH DE number 7450032 (Why is no real title available?)
(available as arXiv preprint) | 2021-12-20 | Paper |
Complexity of stability
Journal of Computer and System Sciences | 2021-10-28 | Paper |
The robustness of LWPP and WPP, with an application to graph reconstruction
(available as arXiv preprint) | 2021-08-04 | Paper |
Election score can be harder than winner
(available as arXiv preprint) | 2021-07-06 | Paper |
The robustness of LWPP and WPP, with an application to graph reconstruction
Computational Complexity | 2021-05-25 | Paper |
| Dogson's rule and Yong's rule | 2020-11-12 | Paper |
| Modeling single-peakedness for votes with ties | 2018-08-29 | Paper |
Modeling single-peakedness for votes with ties
(available as arXiv preprint) | 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
Automata, Languages and Programming | 2018-07-04 | Paper |
The complexity of controlling candidate-sequential elections
Theoretical Computer Science | 2017-05-15 | Paper |
Search versus decision for election manipulation problems
(available as arXiv preprint) | 2017-01-30 | Paper |
Computational Aspects of Approval Voting
Studies in Choice and Welfare | 2016-11-08 | Paper |
Manipulation complexity of same-system runoff elections
Annals of Mathematics and Artificial Intelligence | 2016-09-16 | Paper |
Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP
Information Processing Letters | 2016-06-09 | Paper |
| Weighted manipulation for four-candidate Llull is easy | 2015-12-11 | Paper |
| Online voter control in sequential elections | 2015-12-11 | Paper |
Online voter control in sequential elections
(available as arXiv preprint) | 2015-12-11 | Paper |
More natural models of electoral control by partition
Algorithmic Decision Theory | 2015-11-04 | Paper |
Complexity of manipulative actions when voting with ties
Algorithmic Decision Theory | 2015-11-04 | Paper |
The complexity of manipulative attacks in nearly single-peaked electorates
Artificial Intelligence | 2015-08-27 | Paper |
Bypassing combinatorial protections: polynomial-time algorithms for single-peaked electorates
Journal of Artificial Intelligence Research | 2015-08-25 | Paper |
Weighted electoral control
Journal of Artificial Intelligence Research | 2015-04-22 | Paper |
The complexity of online manipulation of sequential elections
Journal of Computer and System Sciences | 2014-02-13 | Paper |
| On the complexity of elementary modal logics | 2013-03-19 | Paper |
A Universally Defined Undecidable Unimodal Logic
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
Multimode control attacks on elections
Journal of Artificial Intelligence Research | 2011-03-08 | Paper |
The shield that never was: societies with single-peaked preferences are more open to manipulation and control
Information and Computation | 2011-02-21 | Paper |
Generalized modal satisfiability
Journal of Computer and System Sciences | 2010-08-18 | Paper |
On the complexity of kings
Theoretical Computer Science | 2010-02-09 | Paper |
Llull and Copeland Voting Computationally Resist Bribery and Constructive Control
Journal of Artificial Intelligence Research | 2009-12-10 | Paper |
How hard is bribery in elections?
Journal of Artificial Intelligence Research | 2009-12-10 | Paper |
Hybrid Elections Broaden Complexity-Theoretic Resistance to Control
Mathematical Logic Quarterly | 2009-08-14 | Paper |
Isomorphic implication
Theory of Computing Systems | 2009-08-06 | Paper |
A Richer Understanding of the Complexity of Election Systems
Fundamental Problems in Computing | 2009-08-05 | Paper |
Anyone but him: the complexity of precluding an alternative
Artificial Intelligence | 2009-07-09 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
Copeland Voting Fully Resists Constructive Control
Algorithmic Aspects in Information and Management | 2008-07-10 | Paper |
Generalized Modal Satisfiability
STACS 2006 | 2008-03-19 | Paper |
On the Complexity of Kings
Fundamentals of Computation Theory | 2008-02-26 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Complexity results in graph reconstruction
Discrete Applied Mathematics | 2007-02-19 | Paper |
Dichotomy for voting systems
Journal of Computer and System Sciences | 2007-01-22 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
The complexity of Kemeny elections
Theoretical Computer Science | 2006-03-20 | Paper |
Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP
RAIRO - Theoretical Informatics and Applications | 2006-02-22 | Paper |
Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP
RAIRO - Theoretical Informatics and Applications | 2006-02-22 | Paper |
Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP
RAIRO - Theoretical Informatics and Applications | 2006-02-22 | Paper |
All superlinear inverse schemes are coNP-hard
Theoretical Computer Science | 2005-12-06 | Paper |
Extending Downward Collapse from 1-versus-2 Queries tom-versus-m+ 1 Queries
SIAM Journal on Computing | 2005-09-16 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
| scientific article; zbMATH DE number 1993590 (Why is no real title available?) | 2003-10-21 | Paper |
| scientific article; zbMATH DE number 1953099 (Why is no real title available?) | 2003-07-25 | Paper |
| scientific article; zbMATH DE number 1948177 (Why is no real title available?) | 2003-07-10 | Paper |
Almost-everywhere superiority for quantum polynomial time
Information and Computation | 2003-01-14 | Paper |
The Minimization Problem for Boolean Formulas
SIAM Journal on Computing | 2003-01-05 | Paper |
| scientific article; zbMATH DE number 1759396 (Why is no real title available?) | 2002-11-04 | Paper |
The complexity of poor man's logic
Journal of Logic and Computation | 2002-01-07 | Paper |
| scientific article; zbMATH DE number 1670487 (Why is no real title available?) | 2001-11-11 | Paper |
| scientific article; zbMATH DE number 1543293 (Why is no real title available?) | 2001-02-27 | Paper |
| scientific article; zbMATH DE number 1543330 (Why is no real title available?) | 2001-02-27 | Paper |
| scientific article; zbMATH DE number 1500520 (Why is no real title available?) | 2001-01-29 | Paper |
Census techniques collapse space classes
Information Processing Letters | 2000-08-14 | Paper |
| scientific article; zbMATH DE number 1304327 (Why is no real title available?) | 1999-08-31 | Paper |
Exact analysis of Dodgson elections
Journal of the ACM | 1998-11-04 | Paper |
\(R_{1-tt}^Template:\mathcal SN\)(NP) distinguishes robust many-one and Turing completeness
Theory of Computing Systems | 1998-10-01 | Paper |
A Downward Collapse within the Polynomial Hierarchy
SIAM Journal on Computing | 1998-09-21 | Paper |
| scientific article; zbMATH DE number 1091107 (Why is no real title available?) | 1997-11-25 | Paper |
The price of universality
Notre Dame Journal of Formal Logic | 1997-07-01 | Paper |
\(p\)-Selective sets and reducing search to decision vs. self-reducibility
Journal of Computer and System Sciences | 1997-03-31 | Paper |
SPARSE Reduces Conjunctively to TALLY
SIAM Journal on Computing | 1995-11-01 | Paper |
| scientific article; zbMATH DE number 757645 (Why is no real title available?) | 1995-05-23 | Paper |
| scientific article; zbMATH DE number 512801 (Why is no real title available?) | 1994-03-10 | Paper |
A modal perspective on the computational complexity of attribute value grammar
Journal of Logic, Language and Information | 1994-02-22 | Paper |
Quasi-injective reductions
Theoretical Computer Science | 1994-02-22 | Paper |
The relative power of logspace and polynomial time reductions
Computational Complexity | 1994-01-19 | Paper |
| scientific article; zbMATH DE number 176522 (Why is no real title available?) | 1993-05-18 | Paper |
