| Rediscovering Argumentation Principles Utilizing Collective Attacks. | 0 | 0.34 | 2022 |
| Tractable Abstract Argumentation via Backdoor-Treewidth. | 0 | 0.34 | 2022 |
| Recursion in Abstract Argumentation is Hard - On the Complexity of Semantics Based on Weak Admissibility | 0 | 0.34 | 2022 |
| The Complexity Landscape Of Claim-Augmented Argumentation Frameworks | 0 | 0.34 | 2021 |
| Algorithms and conditional lower bounds for planning problems | 0 | 0.34 | 2021 |
| Joint Attacks And Accrual In Argumentation Frameworks | 0 | 0.34 | 2021 |
| Symbolic Time and Space Tradeoffs for Probabilistic Verification | 0 | 0.34 | 2021 |
| Graph-Classes of Argumentation Frameworks with Collective Attacks. | 0 | 0.34 | 2021 |
| On the Complexity of Preferred Semantics in Argumentation Frameworks with Bounded Cycle Length. | 0 | 0.34 | 2021 |
| Recursion In Abstract Argumentation Is Hard - On The Complexity Of Semantics Based On Weak Admissibility | 0 | 0.34 | 2021 |
| Complexity of abstract argumentation under a claim-centric view. | 0 | 0.34 | 2020 |
| ASPARTIX-V19 - An Answer-Set Programming Based System for Abstract Argumentation. | 0 | 0.34 | 2020 |
| Argumentation Semantics under a Claim-centric View: Properties, Expressiveness and Relation to SETAFs. | 0 | 0.34 | 2020 |
| On the different types of collective attacks in abstract argumentation: equivalence results for SETAFs | 0 | 0.34 | 2020 |
| Labelling-based Algorithms for SETAFs. | 0 | 0.34 | 2020 |
| Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs. | 0 | 0.34 | 2019 |
| Preprocessing Argumentation Frameworks via Replacement Patterns. | 0 | 0.34 | 2019 |
| A general notion of equivalence for abstract argumentation | 0 | 0.34 | 2019 |
| Strong Equivalence For Argumentation Frameworks With Collective Attacks | 0 | 0.34 | 2019 |
| Quasipolynomial Set-Based Symbolic Algorithms for Parity Games. | 0 | 0.34 | 2018 |
| Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter. | 1 | 0.35 | 2018 |
| On The Expressive Power Of Collective Attacks | 0 | 0.34 | 2018 |
| Computational Problems in Formal Argumentation and their Complexity. | 1 | 0.35 | 2017 |
| Welfare Maximization with Friends-of-Friends Network Externalities. | 2 | 0.36 | 2017 |
| Improved Set-based Symbolic Algorithms for Parity Games. | 0 | 0.34 | 2017 |
| Comparing the Expressiveness of Argumentation Semantics. | 2 | 0.36 | 2017 |
| Conditionally Optimal Algorithms for Generalized Büchi Games. | 0 | 0.34 | 2016 |
| On rejected arguments and implicit conflicts: The hidden power of argumentation semantics. | 1 | 0.34 | 2016 |
| Preferred semantics as socratic discussion | 8 | 0.47 | 2016 |
| Model and Objective Separation with Conditional Lower Bounds: Disjunction is Harder than Conjunction. | 3 | 0.38 | 2016 |
| Methods for solving reasoning problems in abstract argumentation - A survey | 36 | 1.11 | 2015 |
| Complexity-Sensitive Decision Procedures for Abstract Argumentation (Extended Abstract). | 0 | 0.34 | 2015 |
| Limiting Price Discrimination When Selling Products With Positive Network Externalities | 2 | 0.39 | 2014 |
| Characteristics of Multiple Viewpoints in Abstract Argumentation. | 26 | 1.36 | 2014 |
| Online Ad Assignment with an Ad Exchange. | 2 | 0.38 | 2014 |
| On the intertranslatability of argumentation semantics | 21 | 0.77 | 2014 |
| Compact Argumentation Frameworks. | 3 | 0.41 | 2014 |
| Reduction-Based Approaches to Implement Modgil's Extended Argumentation Frameworks. | 2 | 0.38 | 2014 |
| Resolution-Based Grounded Semantics Revisited. | 0 | 0.34 | 2014 |
| On the equivalence between logic programming semantics and argumentation semantics | 1 | 0.35 | 2013 |
| Parametric properties of ideal semantics. | 16 | 0.58 | 2013 |
| Complexity-sensitive decision procedures for abstract argumentation | 15 | 0.58 | 2012 |
| Towards fixed-parameter tractable algorithms for abstract argumentation | 7 | 0.44 | 2012 |
| Abstract argumentation via monadic second order logic | 9 | 0.47 | 2012 |
| Computational Aspects of cf2 and stage2 Argumentation Semantics. | 0 | 0.34 | 2012 |
| Computationale Aspekte der Abstrakten Argumentation. | 0 | 0.34 | 2012 |
| Technical Note: Exploring Σ^P_2 / Π^P_2-hardness for Argumentation Problems with fixed distance to tractable classes | 0 | 0.34 | 2012 |
| Parameterized splitting: a simple modification-based approach | 11 | 0.54 | 2012 |
| Augmenting tractable fragments of abstract argumentation | 19 | 0.68 | 2011 |
| dynPARTIX - A Dynamic Programming Reasoner for Abstract Argumentation | 6 | 0.57 | 2011 |
