| Publication | Date of Publication | Type |
|---|
| Altruism in coalition formation games | 2024-09-02 | Paper |
| Controlling weighted voting games by deleting or adding players with or without changing the quota | 2024-09-02 | Paper |
| Core stability in altruistic coalition formation games | 2024-05-31 | Paper |
| Stability, vertex stability, and unfrozenness for special graph classes | 2024-02-09 | Paper |
| The join can lower complexity | 2024-01-29 | Paper |
| Intersection suffices for Boolean hierarchy equivalence | 2023-12-12 | Paper |
| Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with Costs | 2023-11-14 | Paper |
| Complexity of Stability. | 2023-11-14 | Paper |
| The possible winner with uncertain weights problem | 2023-08-21 | Paper |
| Manipulation in communication structures of graph-restricted weighted voting games | 2023-03-31 | Paper |
| Fair and efficient allocation with few agent types, few item types, or small value levels | 2023-01-04 | Paper |
| Structural control in weighted voting games | 2022-11-22 | Paper |
| Complexity of shift bribery for iterative voting rules | 2022-11-17 | Paper |
| The Complexity of Controlling Condorcet, Fallback, and k-Veto Elections by Replacing Candidates or Voters | 2022-10-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5039141 | 2022-10-12 | Paper |
| Altruistic Hedonic Games | 2022-10-06 | Paper |
| Controlling weighted voting games by deleting or adding players with or without changing the quota | 2022-08-30 | Paper |
| Complexity of nonemptiness in control argumentation frameworks | 2022-06-15 | Paper |
| The possible winner problem with uncertain weights revisited | 2022-05-20 | Paper |
| The complexity of online bribery in sequential elections | 2022-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5018515 | 2021-12-20 | Paper |
| Control complexity in Borda elections: solving all open cases of offline control and some cases of online control | 2021-11-02 | Paper |
| Acceptance in incomplete argumentation frameworks | 2021-11-02 | Paper |
| Complexity of stability | 2021-10-28 | Paper |
| The Last Voting Rule Is Home: Complexity of Control by Partition of Candidates or Voters in Maximin Elections | 2021-07-06 | Paper |
| Complexity of Possible and Necessary Existence Problems in Abstract Argumentation | 2021-07-06 | Paper |
| Local fairness in hedonic games via individual threshold coalitions | 2021-06-23 | Paper |
| Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints | 2021-02-03 | Paper |
| Duplication monotonicity in the allocation of indivisible goods | 2021-01-20 | Paper |
| Control and Bribery in Voting | 2020-11-12 | Paper |
| The price to pay for forgoing normalization in fair division of indivisible goods | 2020-09-18 | Paper |
| Complexity of control in judgment aggregation for uniform premise-based quota rules | 2020-06-09 | Paper |
| Hedonic Games with Ordinal Preferences and Thresholds | 2020-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5215684 | 2020-02-12 | Paper |
| Refugee allocation in the setting of hedonic games | 2020-01-27 | Paper |
| Optimizing social welfare in social networks | 2020-01-27 | Paper |
| Borda-induced hedonic games with friends, enemies, and neutral players | 2019-08-13 | Paper |
| Verification in incomplete argumentation frameworks | 2019-03-19 | Paper |
| Bounds on the Cost of Stabilizing a Cooperative Game | 2019-01-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4583942 | 2018-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4583946 | 2018-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4583963 | 2018-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4583955 | 2018-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4583957 | 2018-08-29 | Paper |
| The complexity of probabilistic lobbying | 2018-08-17 | Paper |
| Complexity of control by partitioning veto elections and of control by adding candidates to plurality elections | 2018-07-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4576180 | 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 |
| Strategy-proofness of scoring allocation correspondences for indivisible goods | 2018-03-28 | Paper |
| Structural Control in Weighted Voting Games. | 2018-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5282956 | 2017-07-18 | Paper |
| The complexity of controlling candidate-sequential elections | 2017-05-15 | Paper |
| Path-disruption games: bribery and a probabilistic model | 2017-03-31 | Paper |
| Computational Aspects of Approval Voting | 2016-11-08 | Paper |
| Toward the complexity of the existence of wonderfully stable partitions and strictly core stable coalition structures in enemy-oriented hedonic games | 2016-09-16 | Paper |
| Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP | 2016-06-09 | Paper |
| A statistical approach to calibrating the scores of biased reviewers of scientific papers | 2016-04-11 | Paper |
| Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules | 2015-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3457207 | 2015-12-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3457243 | 2015-12-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3455635 | 2015-12-11 | Paper |
| Complexity of Bribery and Control for Uniform Premise-Based Quota Rules Under Various Preference Types | 2015-11-04 | Paper |
| Verification in Attack-Incomplete Argumentation Frameworks | 2015-11-04 | Paper |
| Verification in Argument-Incomplete Argumentation Frameworks | 2015-11-04 | Paper |
| Fairness and Rank-Weighted Utilitarianism in Resource Allocation | 2015-11-04 | Paper |
| Control complexity in Bucklin and fallback voting: a theoretical analysis | 2015-02-20 | Paper |
| Control complexity in Bucklin and fallback voting: an experimental analysis | 2015-02-20 | Paper |
| Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods | 2014-12-03 | Paper |
| False-Name Manipulation in Weighted Voting Games is Hard for Probabilistic Polynomial Time | 2014-07-30 | Paper |
| False-Name Manipulation in Weighted Voting Games Is Hard for Probabilistic Polynomial Time | 2014-03-31 | Paper |
| A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation | 2014-02-25 | Paper |
| Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey | 2014-02-25 | Paper |
| The complexity of online manipulation of sequential elections | 2014-02-13 | Paper |
| How to Decrease the Degree of Envy in Allocations of Indivisible Goods | 2013-12-17 | Paper |
| Computational Aspects of Manipulation and Control in Judgment Aggregation | 2013-12-17 | Paper |
| The complexity of computing minimal unidirectional covering sets | 2013-10-21 | Paper |
| Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules | 2012-05-04 | Paper |
| How Hard Is it to Bribe the Judges? A Study of the Complexity of Bribery in Judgment Aggregation | 2011-10-28 | Paper |
| Bribery in Path-Disruption Games | 2011-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5392508 | 2011-04-12 | Paper |
| The shield that never was: societies with single-peaked preferences are more open to manipulation and control | 2011-02-21 | Paper |
| Frequency of correctness versus average polynomial time | 2010-08-20 | Paper |
| Exakte Algorithmen für schwere Graphenprobleme | 2010-07-19 | Paper |
| The complexity of computing minimal unidirectional covering sets | 2010-05-28 | Paper |
| An improved exact algorithm for the domatic number problem | 2010-01-29 | Paper |
| On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P | 2010-01-29 | Paper |
| Llull and Copeland Voting Computationally Resist Bribery and Constructive Control | 2009-12-10 | Paper |
| The Cost of Stability in Coalitional Games | 2009-12-01 | Paper |
| The three-color and two-color Tantrix\(^{\text{TM}}\) rotation puzzle problems are NP-complete via parsimonious reductions | 2009-11-27 | Paper |
| The Complexity of Probabilistic Lobbying | 2009-11-17 | Paper |
| Generalized juntas and NP-hard sets | 2009-09-10 | Paper |
| Hybrid Elections Broaden Complexity-Theoretic Resistance to Control | 2009-08-14 | Paper |
| Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control | 2009-08-14 | 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 |
| Satisfiability Parsimoniously Reduces to the Tantrix™ Rotation Puzzle Problem | 2009-06-23 | Paper |
| Exact complexity of exact-four-colorability | 2009-04-28 | Paper |
| Satisfiability Parsimoniously Reduces to the TantrixTM Rotation Puzzle Problem | 2009-03-05 | Paper |
| Sincere-Strategy Preference-Based Approval Voting Broadly Resists Control | 2009-02-03 | Paper |
| The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions | 2008-11-20 | Paper |
| Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functions | 2008-07-31 | Paper |
| Copeland Voting Fully Resists Constructive Control | 2008-07-10 | Paper |
| Komplexitätstheorie und Kryptologie | 2008-06-24 | Paper |
| On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time | 2008-02-26 | Paper |
| Theoretical Computer Science | 2006-11-01 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| If P \(\neq\) NP then some strongly noninvertible functions are invertible | 2006-10-20 | Paper |
| Complexity of the exact domatic number problem and of the exact conveyor flow shop problem | 2006-10-16 | Paper |
| Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP | 2006-02-22 | Paper |
| Complexity theory and cryptology. An introduction to cryptocomplexity. | 2005-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448375 | 2004-02-18 | Paper |
| Exact complexity of the winner problem for Young elections | 2003-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414503 | 2003-07-25 | Paper |
| Tally NP sets and easy census functions. | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4782706 | 2002-12-02 | Paper |
| On characterizing the existence of partial one-way permutations | 2002-07-14 | Paper |
| Computing complete graph isomorphisms and Hamiltonian cycles from partial ones | 2002-05-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4520487 | 2001-02-26 | Paper |
| Restrictive Acceptance Suffices for Equivalence Problems | 2000-09-25 | Paper |
| A second step towards complexity-theoretic analogs of Rice's Theorem | 2000-08-21 | Paper |
| Characterizing the existence of one-way permutations | 2000-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4492919 | 2000-07-30 | Paper |
| Creating strong, total, commutative, associative one-way functions from any one-way function in complexity theory | 2000-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4484664 | 2000-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934323 | 2000-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218122 | 1999-06-21 | Paper |
| Boolean operations, joins, and the extended low hierarchy | 1999-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218116 | 1998-11-11 | Paper |
| Exact analysis of Dodgson elections | 1998-11-04 | Paper |
| Easy sets and hard certificate schemes | 1997-12-10 | Paper |
| Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets | 1997-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4877117 | 1996-05-06 | Paper |
| Upward separation for FewP and related classes | 1995-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4305297 | 1994-10-13 | Paper |
