| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q5145805 | 2021-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5226949 | 2019-08-02 | Paper |
| On checking skeptical and ideal admissibility in abstract argumentation frameworks | 2019-06-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5357222 | 2017-09-14 | Paper |
| Looking-ahead in backtracking algorithms for abstract argumentation | 2016-10-17 | Paper |
| An improved upper bound on the non-3-colourability threshold | 2016-06-09 | Paper |
| Characteristics of multiple viewpoints in abstract argumentation | 2015-12-09 | Paper |
| Algorithms for decision problems in argument systems under preferred semantics | 2015-08-27 | Paper |
| Parametric properties of ideal semantics | 2015-06-26 | Paper |
| Automata for infinite argumentation structures | 2015-06-26 | Paper |
| Algorithms for Argumentation Semantics: Labeling Attacks as a Generalization of Labeling Arguments | 2014-05-16 | Paper |
| Computing Preferred Extensions in Abstract Argumentation: A SAT-Based Approach | 2014-03-31 | Paper |
| On the Instantiation of Knowledge Bases in Abstract Argumentation Frameworks | 2013-10-04 | Paper |
| Semi-stable semantics | 2012-10-19 | Paper |
| Irrationality in Persuasive Argumentation | 2012-07-23 | Paper |
| On the resolution-based family of abstract argumentation semantics and its grounded instance | 2011-06-17 | Paper |
| Weighted argument systems: basic definitions, algorithms, and complexity results | 2011-06-17 | Paper |
| Computation in extended argumentation frameworks | 2011-05-11 | Paper |
| Solving coalitional resource games | 2010-03-16 | Paper |
| The computational complexity of ideal semantics | 2009-12-21 | Paper |
| A logical characterisation of qualitative coalitional games | 2009-11-30 | Paper |
| Argumentation in artificial intelligence | 2009-07-09 | Paper |
| Computational properties of argument systems satisfying graph-theoretic constraints | 2009-07-09 | Paper |
| Audiences in argumentation frameworks | 2009-07-09 | Paper |
| Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks | 2008-10-27 | Paper |
| The complexity of deciding reachability properties of distributed negotiation schemes | 2008-05-28 | Paper |
| The complexity of contract negotiation | 2007-10-23 | Paper |
| On the computational complexity of coalitional resource games | 2007-10-23 | Paper |
| Logics in Artificial Intelligence | 2006-10-25 | Paper |
| Logics in Artificial Intelligence | 2006-10-25 | Paper |
| The complexity of agent design problems: Determinism and history dependence | 2006-09-12 | Paper |
| AI*IA 2005: Advances in Artificial Intelligence | 2006-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3379036 | 2006-04-06 | Paper |
| On the computational complexity of qualitative coalitional games | 2006-02-07 | Paper |
| Two party immediate response disputes: Properties and efficiency | 2006-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5715692 | 2006-01-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4739289 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473060 | 2004-08-04 | Paper |
| On the complexity of Boolean functions computed by lazy oracles | 2003-10-15 | Paper |
| The maximum length of prime implicates for instances of 3-SAT | 2003-08-28 | Paper |
| Coherence in finite argument systems. | 2003-01-21 | Paper |
| Leafy spanning trees in hypercubes | 2002-01-02 | Paper |
| A sharp threshold for the phase transition of a restricted satisfiability problem for Horn clauses | 2001-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4520773 | 2001-02-27 | Paper |
| Complexity-theoretic models of phase transitions in search problems | 2000-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942047 | 2000-03-19 | Paper |
| Multiprocessor simulation strategies with optimal speed-up | 1997-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5286632 | 1993-07-01 | Paper |
| An Algorithm to Generate Random Large Combinational Circuits | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036697 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3994882 | 1992-09-17 | Paper |
| Comment on Kochol's paper ``Efficient monotone circuits for threshold functions | 1990-01-01 | Paper |
| On monotone simulations on nonmonotone networks | 1989-01-01 | Paper |
| A result on k-valent graphs and its application to a graph embedding problem | 1987-01-01 | Paper |
| The complexity of central slice functions | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3694708 | 1985-01-01 | Paper |
| A 2.5 n lower bound on the monotone network complexity of \(T^ n_ 3\) | 1985-01-01 | Paper |
