Sets of Boolean Connectives That Make Argumentation Easier. - Nadia Creignou; Johannes Schmidt 001; Michael Thomas 001; Stefan Woltran (JELIA, 2010)

Complexity of Propositional Abduction for Restricted Sets of Boolean Functions. - Nadia Creignou; Johannes Schmidt 001; Michael Thomas 001 (KR, 2010)

Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight. - Nadia Creignou; Frédéric Olive; Johannes Schmidt 001 (SAT, 2011)

Complexity of logic-based argumentation in Post's framework. - Nadia Creignou; Johannes Schmidt 001; Michael Thomas 001; Stefan Woltran (Argument Comput., 2011)

Complexity of logic-based argumentation in Schaefer's framework. - Nadia Creignou; Uwe Egly; Johannes Schmidt 001 (COMMA, 2012)

On the Parameterized Complexity of Default Logic and Autoepistemic Logic. - Arne Meier; Johannes Schmidt 001; Michael Thomas 001; Heribert Vollmer (LATA, 2012)

Complexity Classifications for Propositional Abduction in Post's Framework. - Nadia Creignou; Johannes Schmidt 001; Michael Thomas 001 (J. Log. Comput., 2012)

Complexity classifications for nonmonotonic reasoning and enumeration. - Johannes Schmidt 001 (2012)

The Complexity of Abduction for Equality Constraint Languages. - Johannes Schmidt 001; Michal Wrona (CSL, 2013)

Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis. - Peter Jonsson; Victor Lagerkvist; Johannes Schmidt 001; Hannes Uppman (MFCS (2), 2014)

Complexity Classifications for Logic-Based Argumentation. - Nadia Creignou; Uwe Egly; Johannes Schmidt 001 (ACM Trans. Comput. Log., 2014)

On the parameterized complexity of non-monotonic logics. - Arne Meier; Irina Schindler; Johannes Schmidt 001; Michael Thomas 001; Heribert Vollmer (Arch. Math. Log., 2015)

The Weight in Enumeration. - Johannes Schmidt 001 (LATA, 2017)

Paradigms for Parameterized Enumeration. - Nadia Creignou; Arne Meier; Julian-Steffen Müller; Johannes Schmidt 001; Heribert Vollmer (Theory Comput. Syst., 2017)

Parameterised Complexity for Abduction. - Yasir Mahmood 002; Arne Meier; Johannes Schmidt 001 (CoRR, 2019)

Parameterised Complexity of Abduction in Schaefer's Framework. - Yasir Mahmood 002; Arne Meier; Johannes Schmidt 001 (LFCS, 2020)

Parameterized complexity of abduction in Schaefer's framework. - Yasir Mahmood 002; Arne Meier; Johannes Schmidt 001 (J. Log. Comput., 2021)

The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems. - Peter Jonsson; Victor Lagerkvist; Johannes Schmidt 001; Hannes Uppman (Theor. Comput. Sci., 2021)

Complexity of Reasoning with Cardinality Minimality Conditions. - Nadia Creignou; Frédéric Olive; Johannes Schmidt 001 (AAAI, 2023)

Parameterized Complexity of Logic-based Argumentation in Schaefer's Framework. - Yasir Mahmood 002; Arne Meier; Johannes Schmidt 001 (ACM Trans. Comput. Log., 2023)

Quantitative Claim-Centric Reasoning in Logic-Based Argumentation. - Markus Hecher; Yasir Mahmood 002; Arne Meier; Johannes Schmidt 001 (IJCAI, 2024)

Learning Tree Pattern Transformations. - Daniel Neider; Leif Sabellek; Johannes Schmidt 001; Fabian Vehlken; Thomas Zeume (ICDT, 2025)

A Fine-Grained Complexity View on Propositional Abduction - Algorithms and Lower Bounds. - Victor Lagerkvist; Mohamed Maizia; Johannes Schmidt 001 (CoRR, 2025)

Complexity of Faceted Explanations in Propositional Abduction. - Johannes Schmidt 001; Mohamed Maizia; Victor Lagerkvist; Johannes Klaus Fichte (CoRR, 2025)