| Answer set solving with bounded treewidth revisited JK Fichte, M Hecher, M Morak, S Woltran Logic Programming and Nonmonotonic Reasoning: 14th International Conference …, 2017 | 43 | 2017 |
| The model counting competition 2020 JK Fichte, M Hecher, F Hamiti Journal of Experimental Algorithmics (JEA) 26, 1-26, 2021 | 37 | 2021 |
| Exploiting treewidth for projected model counting and its limits JK Fichte, M Hecher, M Morak, S Woltran Theory and Applications of Satisfiability Testing–SAT 2018: 21st …, 2018 | 31 | 2018 |
| Exploiting database management systems and treewidth for counting JK Fichte, M Hecher, P Thier, S Woltran Theory and Practice of Logic Programming 22 (1), 128-157, 2022 | 29 | 2022 |
| Taming high treewidth with abstraction, nested dynamic programming, and database technology M Hecher, P Thier, S Woltran Theory and Applications of Satisfiability Testing–SAT 2020: 23rd …, 2020 | 29 | 2020 |
| The PACE 2019 parameterized algorithms and computational experiments challenge: the fourth iteration MA Dzulfikar, JK Fichte, M Hecher 14th International Symposium on Parameterized and Exact Computation (IPEC 2019), 2019 | 29 | 2019 |
| Weighted model counting on the GPU by exploiting small treewidth JK Fichte, M Hecher, S Woltran, M Zisser 26th Annual European Symposium on Algorithms (ESA 2018), 2018 | 27 | 2018 |
| The D-FLAT system for dynamic programming on tree decompositions M Abseher, B Bliem, G Charwat, F Dusberger, M Hecher, S Woltran Logics in Artificial Intelligence: 14th European Conference, JELIA 2014 …, 2014 | 27 | 2014 |
| An SMT approach to fractional hypertree width JK Fichte, M Hecher, N Lodha, S Szeider Principles and Practice of Constraint Programming: 24th International …, 2018 | 25 | 2018 |
| Counting complexity for reasoning in abstract argumentation JK Fichte, M Hecher, A Meier Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 2827-2834, 2019 | 22 | 2019 |
| An improved GPU-based SAT model counter JK Fichte, M Hecher, M Zisser Principles and Practice of Constraint Programming: 25th International …, 2019 | 22 | 2019 |
| D-FLAT^ 2: Subset minimization in dynamic programming on tree decompositions made easy B Bliem, G Charwat, M Hecher, S Woltran Fundamenta Informaticae 147 (1), 27-61, 2016 | 22 | 2016 |
| A time leap challenge for SAT-solving JK Fichte, M Hecher, S Szeider Principles and Practice of Constraint Programming: 26th International …, 2020 | 20 | 2020 |
| Lower bounds for QBFs of bounded treewidth JK Fichte, M Hecher, A Pfandler Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer …, 2020 | 20 | 2020 |
| Treewidth and counting projected answer sets JK Fichte, M Hecher Logic Programming and Nonmonotonic Reasoning: 15th International Conference …, 2019 | 19 | 2019 |
| DynASP2. 5: Dynamic programming on tree decompositions in action JK Fichte, M Hecher, M Morak, S Woltran Algorithms 14 (3), 81, 2021 | 18 | 2021 |
| D-flat: progress report M Abseher, B Bliem, G Charwat, F Dusberger, M Hecher, S Woltran | 17 | 2014 |
| Treewidth-aware reductions of normal ASP to SAT–Is normal ASP harder than SAT after all? M Hecher Artificial Intelligence 304, 103651, 2022 | 15 | 2022 |
| Treewidth-aware cycle breaking for algebraic answer set counting T Eiter, M Hecher, R Kiesel Proceedings of the International Conference on Principles of Knowledge …, 2021 | 13 | 2021 |
| Default logic and bounded treewidth JK Fichte, M Hecher, I Schindler Language and Automata Theory and Applications: 12th International Conference …, 2018 | 13* | 2018 |
