| Paradigms for parameterized enumeration N Creignou, A Meier, JS Müller, J Schmidt, H Vollmer Theory of Computing Systems 60, 737-758, 2017 | 54 | 2017 |
| Enumeration: Algorithms and complexity J Schmidt Preprint, available at https://www. thi. uni-hannover. de/fileadmin …, 2009 | 26 | 2009 |
| Enumerating all solutions of a Boolean CSP by non-decreasing weight N Creignou, F Olive, J Schmidt Theory and Applications of Satisfiability Testing-SAT 2011: 14th …, 2011 | 25 | 2011 |
| Complexity of propositional abduction for restricted sets of Boolean functions N Creignou, J Schmidt, M Thomas Twelfth International Conference on the Principles of Knowledge …, 2010 | 16 | 2010 |
| Complexity of logic-based argumentation in Post's framework N Creignou, J Schmidt, M Thomas, S Woltran Argument & Computation 2 (2-3), 107-129, 2011 | 14 | 2011 |
| Complexity classifications for propositional abduction in Post's framework N Creignou, J Schmidt, M Thomas Journal of Logic and Computation 22 (5), 1145-1170, 2012 | 11 | 2012 |
| Sets of boolean connectives that make argumentation easier N Creignou, J Schmidt, M Thomas, S Woltran European Workshop on Logics in Artificial Intelligence, 117-129, 2010 | 11 | 2010 |
| On the parameterized complexity of default logic and autoepistemic logic A Meier, J Schmidt, M Thomas, H Vollmer International Conference on Language and Automata Theory and Applications …, 2012 | 10 | 2012 |
| Complexity classifications for logic-based argumentation N Creignou, U Egly, J Schmidt ACM Transactions on Computational Logic (TOCL) 15 (3), 1-20, 2014 | 9 | 2014 |
| On the parameterized complexity of non-monotonic logics A Meier, I Schindler, J Schmidt, M Thomas, H Vollmer Archive for mathematical logic 54 (5), 685-710, 2015 | 7 | 2015 |
| Theory and applications of satisfiability testing N Creignou, F Olive, J Schmidt SAT, 5-8, 2016 | 6 | 2016 |
| Parameterized complexity of abduction in Schaefer’s framework Y Mahmood, A Meier, J Schmidt Journal of Logic and Computation 31 (1), 266-296, 2021 | 5 | 2021 |
| Relating the time complexity of optimization problems in light of the exponential-time hypothesis P Jonsson, V Lagerkvist, J Schmidt, H Uppman Mathematical Foundations of Computer Science 2014: 39th International …, 2014 | 4 | 2014 |
| The complexity of abduction for equality constraint languages J Schmidt, M Wrona Computer Science Logic 2013 (CSL 2013), 2013 | 3 | 2013 |
| Parameterised complexity for abduction Y Mahmood, A Meier, J Schmidt CoRR, abs/1906.00703, 2019 | 2 | 2019 |
| Parameterized complexity of logic-based argumentation in Schaefer’s framework Y Mahmood, A Meier, J Schmidt ACM Transactions on Computational Logic 24 (3), 1-25, 2023 | 1 | 2023 |
| The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems P Jonsson, V Lagerkvist, J Schmidt, H Uppman Theoretical Computer Science 892, 1-24, 2021 | 1 | 2021 |
| The Weight in Enumeration J Schmidt International Conference on Language and Automata Theory and Applications …, 2017 | 1 | 2017 |
| Complexity of logic-based argumentation in Schaefer's framework N Creignou, J Schmidt, U Egly 4th Conference on Computational Models of Argument (COMMA), Vienna, Austria …, 2012 | 1 | 2012 |
| Complexity of reasoning with cardinality minimality conditions N Creignou, F Olive, J Schmidt Proceedings of the AAAI Conference on Artificial Intelligence 37 (4), 3932-3940, 2023 | | 2023 |
