| Publication | Date of Publication | Type |
|---|
Altruism in coalition formation games
Annals of Mathematics and Artificial Intelligence | 2024-09-02 | Paper |
Controlling weighted voting games by deleting or adding players with or without changing the quota
Annals of Mathematics and Artificial Intelligence | 2024-09-02 | Paper |
| Core stability in altruistic coalition formation games | 2024-05-31 | Paper |
Stability, vertex stability, and unfrozenness for special graph classes
Theory of Computing Systems | 2024-02-09 | Paper |
The join can lower complexity
Lecture Notes in Computer Science | 2024-01-29 | Paper |
Intersection suffices for Boolean hierarchy equivalence
Lecture Notes in Computer Science | 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
Journal of Computer and System Sciences | 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
Artificial Intelligence | 2023-01-04 | Paper |
Structural control in weighted voting games
The B.E. Journal of Theoretical Economics | 2022-11-22 | Paper |
Complexity of shift bribery for iterative voting rules
Annals of Mathematics and Artificial Intelligence | 2022-11-17 | Paper |
The Complexity of Controlling Condorcet, Fallback, and k-Veto Elections by Replacing Candidates or Voters
Computer Science – Theory and Applications | 2022-10-19 | Paper |
| Collective acceptability in abstract argumentation | 2022-10-12 | Paper |
Altruistic Hedonic Games
Journal of Artificial Intelligence Research | 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
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 |
Control complexity in Borda elections: solving all open cases of offline control and some cases of online control
Artificial Intelligence | 2021-11-02 | Paper |
Acceptance in incomplete argumentation frameworks
Artificial Intelligence | 2021-11-02 | Paper |
Complexity of stability
Journal of Computer and System Sciences | 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
Theoretical Computer Science | 2021-06-23 | Paper |
Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints
Theoretical Computer Science | 2021-02-03 | Paper |
Duplication monotonicity in the allocation of indivisible goods
AI Communications | 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
Annals of Mathematics and Artificial Intelligence | 2020-09-18 | Paper |
Complexity of control in judgment aggregation for uniform premise-based quota rules
Journal of Computer and System Sciences | 2020-06-09 | Paper |
Hedonic games with ordinal preferences and thresholds
Journal of Artificial Intelligence Research | 2020-05-14 | Paper |
| Credulous and skeptical acceptance in incomplete argumentation frameworks | 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
Mathematical Social Sciences | 2019-08-13 | Paper |
Verification in incomplete argumentation frameworks
Artificial Intelligence | 2019-03-19 | Paper |
Bounds on the cost of stabilizing a cooperative game
Journal of Artificial Intelligence Research | 2019-01-18 | Paper |
| Cost of stability and least core in path-disruption games | 2018-08-29 | Paper |
| Control in judgment aggregation | 2018-08-29 | Paper |
| scientific article; zbMATH DE number 6928629 (Why is no real title available?) | 2018-08-29 | Paper |
| Complexity and approximability of egalitarian Nash product social welfare optimization in multiagent resource allocation | 2018-08-29 | Paper |
| Probabilistic path-disruption games | 2018-08-29 | Paper |
The complexity of probabilistic lobbying
Discrete Optimization | 2018-08-17 | Paper |
Complexity of control by partitioning veto elections and of control by adding candidates to plurality elections
Annals of Mathematics and Artificial Intelligence | 2018-07-20 | Paper |
| Complexity of control by partitioning veto and maximin elections and of control by adding candidates to plurality elections | 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 |
Strategy-proofness of scoring allocation correspondences for indivisible goods
Social Choice and Welfare | 2018-03-28 | Paper |
| Structural control in weighted voting games | 2018-03-21 | Paper |
| Scoring rules for the allocation of indivisible goods | 2017-07-18 | Paper |
The complexity of controlling candidate-sequential elections
Theoretical Computer Science | 2017-05-15 | Paper |
Path-disruption games: bribery and a probabilistic model
Theory of Computing Systems | 2017-03-31 | Paper |
Computational Aspects of Approval Voting
Studies in Choice and Welfare | 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
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 |
A statistical approach to calibrating the scores of biased reviewers of scientific papers
Metrika | 2016-04-11 | Paper |
Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules
Mathematical Social Sciences | 2015-12-18 | Paper |
| The possible winner problem with uncertain weights | 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 |
| Probabilistic path-disruption games | 2015-12-11 | Paper |
Complexity of bribery and control for uniform premise-based quota rules under various preference types
Algorithmic Decision Theory | 2015-11-04 | Paper |
Verification in attack-incomplete argumentation frameworks
Algorithmic Decision Theory | 2015-11-04 | Paper |
Verification in argument-incomplete argumentation frameworks
Algorithmic Decision Theory | 2015-11-04 | Paper |
Fairness and rank-weighted utilitarianism in resource allocation
Algorithmic Decision Theory | 2015-11-04 | Paper |
Control complexity in Bucklin and fallback voting: a theoretical analysis
Journal of Computer and System Sciences | 2015-02-20 | Paper |
Control complexity in Bucklin and fallback voting: an experimental analysis
Journal of Computer and System Sciences | 2015-02-20 | Paper |
Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods
Discrete Applied Mathematics | 2014-12-03 | Paper |
False-name manipulation in weighted voting games is hard for probabilistic polynomial time
Journal of Artificial Intelligence Research | 2014-07-30 | Paper |
False-Name Manipulation in Weighted Voting Games Is Hard for Probabilistic Polynomial Time
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation
Annals of Mathematics and Artificial Intelligence | 2014-02-25 | Paper |
Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey
Annals of Mathematics and Artificial Intelligence | 2014-02-25 | Paper |
The complexity of online manipulation of sequential elections
Journal of Computer and System Sciences | 2014-02-13 | Paper |
How to decrease the degree of envy in allocations of indivisible goods
Algorithmic Decision Theory | 2013-12-17 | Paper |
Computational aspects of manipulation and control in judgment aggregation
Algorithmic Decision Theory | 2013-12-17 | Paper |
The complexity of computing minimal unidirectional covering sets
Theory of Computing Systems | 2013-10-21 | Paper |
Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules
Information Processing Letters | 2012-05-04 | Paper |
How hard is it to bribe the judges? A study of the complexity of bribery in judgment aggregation
Algorithmic Decision Theory | 2011-10-28 | Paper |
Bribery in path-disruption games
Algorithmic Decision Theory | 2011-10-28 | Paper |
| Merging and splitting for power indices in weighted voting games and network flow games on hypergraphs | 2011-04-12 | 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 |
Frequency of correctness versus average polynomial time
Information Processing Letters | 2010-08-20 | Paper |
Exact algorithms for difficult graph problems
eXamen.press | 2010-07-19 | Paper |
The complexity of computing minimal unidirectional covering sets
Lecture Notes in Computer Science | 2010-05-28 | Paper |
An improved exact algorithm for the domatic number problem
Information Processing Letters | 2010-01-29 | Paper |
On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P
Information Processing Letters | 2010-01-29 | Paper |
Llull and Copeland Voting Computationally Resist Bribery and Constructive Control
Journal of Artificial Intelligence Research | 2009-12-10 | Paper |
The cost of stability in coalitional games
Algorithmic Game Theory | 2009-12-01 | Paper |
The three-color and two-color Tantrix\(^{\text{TM}}\) rotation puzzle problems are NP-complete via parsimonious reductions
Information and Computation | 2009-11-27 | Paper |
The Complexity of Probabilistic Lobbying
Algorithmic Decision Theory | 2009-11-17 | Paper |
Generalized juntas and NP-hard sets
Theoretical Computer Science | 2009-09-10 | Paper |
Hybrid Elections Broaden Complexity-Theoretic Resistance to Control
Mathematical Logic Quarterly | 2009-08-14 | Paper |
Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control
Mathematical Logic Quarterly | 2009-08-14 | 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 |
Satisfiability Parsimoniously Reduces to the Tantrix™ Rotation Puzzle Problem
Fundamenta Informaticae | 2009-06-23 | Paper |
Exact complexity of exact-four-colorability
Information Processing Letters | 2009-04-28 | Paper |
Satisfiability Parsimoniously Reduces to the TantrixTM Rotation Puzzle Problem
Lecture Notes in Computer Science | 2009-03-05 | Paper |
Sincere-Strategy Preference-Based Approval Voting Broadly Resists Control
Lecture Notes in Computer Science | 2009-02-03 | Paper |
The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions
Language and Automata Theory and Applications | 2008-11-20 | Paper |
Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functions
Theoretical Computer Science | 2008-07-31 | Paper |
Copeland Voting Fully Resists Constructive Control
Algorithmic Aspects in Information and Management | 2008-07-10 | Paper |
Komplexitätstheorie und Kryptologie
eXamen.press | 2008-06-24 | Paper |
On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time
Fundamentals of Computation Theory | 2008-02-26 | Paper |
Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
If P \(\neq\) NP then some strongly noninvertible functions are invertible
Theoretical Computer Science | 2006-10-20 | Paper |
Complexity of the exact domatic number problem and of the exact conveyor flow shop problem
Theory of Computing Systems | 2006-10-16 | 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 |
Complexity theory and cryptology. An introduction to cryptocomplexity.
Texts in Theoretical Computer Science. An EATCS Series | 2005-07-29 | Paper |
| scientific article; zbMATH DE number 2044511 (Why is no real title available?) | 2004-02-18 | Paper |
Exact complexity of the winner problem for Young elections
Theory of Computing Systems | 2003-08-26 | Paper |
| scientific article; zbMATH DE number 1953099 (Why is no real title available?) | 2003-07-25 | Paper |
Tally NP sets and easy census functions.
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1839441 (Why is no real title available?) | 2002-12-02 | Paper |
On characterizing the existence of partial one-way permutations
Information Processing Letters | 2002-07-14 | Paper |
Computing complete graph isomorphisms and Hamiltonian cycles from partial ones
Theory of Computing Systems | 2002-05-30 | Paper |
| scientific article; zbMATH DE number 1543037 (Why is no real title available?) | 2001-02-26 | Paper |
Restrictive Acceptance Suffices for Equivalence Problems
LMS Journal of Computation and Mathematics | 2000-09-25 | Paper |
A second step towards complexity-theoretic analogs of Rice's Theorem
Theoretical Computer Science | 2000-08-21 | Paper |
Characterizing the existence of one-way permutations
Theoretical Computer Science | 2000-08-21 | Paper |
| scientific article; zbMATH DE number 1482586 (Why is no real title available?) | 2000-07-30 | Paper |
Creating strong, total, commutative, associative one-way functions from any one-way function in complexity theory
Journal of Computer and System Sciences | 2000-06-27 | Paper |
scientific article; zbMATH DE number 1452707 (Why is no real title available?)
Chicago Journal of Theoretical Computer Science | 2000-05-29 | Paper |
| scientific article; zbMATH DE number 1390058 (Why is no real title available?) | 2000-04-26 | Paper |
| scientific article; zbMATH DE number 1222583 (Why is no real title available?) | 1999-06-21 | Paper |
Boolean operations, joins, and the extended low hierarchy
Theoretical Computer Science | 1999-01-12 | Paper |
| scientific article; zbMATH DE number 1222577 (Why is no real title available?) | 1998-11-11 | Paper |
Exact analysis of Dodgson elections
Journal of the ACM | 1998-11-04 | Paper |
Easy sets and hard certificate schemes
Acta Informatica | 1997-12-10 | Paper |
Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets
SIAM Journal on Computing | 1997-05-26 | Paper |
| scientific article; zbMATH DE number 874695 (Why is no real title available?) | 1996-05-06 | Paper |
Upward separation for FewP and related classes
Information Processing Letters | 1995-02-16 | Paper |
| scientific article; zbMATH DE number 638299 (Why is no real title available?) | 1994-10-13 | Paper |
