|
| | Preview | Author(s) | Title | Type | Issue Date |
| 1 |  | Fichte, Johannes K. ; Le Berre, Daniel ; Hecher, Markus ; Szeider, Stefan | The silent (r)evolution of SAT | Article Artikel    | Jun-2023 |
| 2 | | Fichte, Johannes ; Hecher, Markus ; Roland, Valentin | Parallel Model Counting with {CUDA:} Algorithm Engineering for Efficient Hardware Utilization | Konferenzbeitrag Inproceedings | 2021 |
| 3 | | Fichte, Johannes ; Hecher, Markus ; McCreesh, Ciaran ; Shahab, Anas | Complications for Computational Experiments from Modern Processors | Konferenzbeitrag Inproceedings | 2021 |
| 4 | | Fichte, Johannes K. ; Hecher, Markus ; Morak, Michael ; Woltran, Stefan | DynASP2.5: Dynamic Programming on Tree Decompositions in Action | Artikel Article | 2021 |
| 5 | | FICHTE, JOHANNES K. ; HECHER, MARKUS ; THIER, PATRICK ; WOLTRAN, STEFAN | Exploiting Database Management Systems and Treewidth for Counting | Artikel Article | 2021 |
| 6 | | Fichte, Johannes ; Hecher, Markus ; Mahmood, Yasir ; Meier, Arne | Decomposition-Guided Reductions for Argumentation and Treewidth | Konferenzbeitrag Inproceedings | 2021 |
| 7 | | Fandinno, Jorge ; Hecher, Markus | Treewidth-Aware Complexity in {ASP:} Not all Positive Cycles are Equally Hard | Konferenzbeitrag Inproceedings | 2021 |
| 8 | | Eiter, Thomas ; Hecher, Markus ; Kiesel, Rafael | Treewidth-Aware Cycle Breaking for Algebraic Answer Set Counting | Konferenzbeitrag Inproceedings | 2021 |
| 9 | | Fichte, Johannes ; Hecher, Markus ; Meier, Arne | Knowledge-Base Degrees of Inconsistency: Complexity and Counting | Konferenzbeitrag Inproceedings | 2021 |
| 10 | | Eiter, Thomas ; Hecher, Markus ; Kiesel, Rafael | Treewidth-Aware Cycle Breaking for Algebraic Answer Set Counting | Konferenzbeitrag Inproceedings | 2021 |
| 11 | | Hecher, Markus ; Thier, Patrick ; Woltran, Stefan | Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology | Konferenzbeitrag Inproceedings | 2020 |
| 12 | | Fichte, Johannes K. ; Hecher, Markus ; Pfandler, Andreas | Lower Bounds for QBFs of Bounded Treewidth | Konferenzbeitrag Inproceedings | 2020 |
| 13 | | Hecher, Markus | Treewidth-aware Reductions of Normal ASP to SAT - Is Normal ASP Harder than SAT after All? | Konferenzbeitrag Inproceedings | 2020 |
| 14 | | Hecher, Markus ; Morak, Michael ; Woltran, Stefan | Structural Decompositions of Epistemic Logic Programs | Konferenzbeitrag Inproceedings | 2020 |
| 15 | | Fandinno, Jorge ; Hecher, Markus | Treewidth-Aware Complexity in ASP:Not all Positive Cycles are Equally Hard | Konferenzbeitrag Inproceedings | 2020 |
| 16 | | Everardo, Flavio ; Hecher, Markus ; Shukla, Ankit | An Approximate Model Counter for ASP | Konferenzbeitrag Inproceedings | 2020 |
| 17 | | Hecher, Markus | Treewidth-Aware Reductions of normal ASP to SAT - Is normal ASP harder than SAT after all? | Präsentation Presentation | 2020 |
| 18 | | Everardo, Flavio ; Hecher, Markus ; Shukla, Ankit | Extending XORRO with Approximate Model Counting | Präsentation Presentation | 2020 |
| 19 | | Hecher, Markus ; Thier, Patrick ; Woltran, Stefan | Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology | Präsentation Presentation | 2020 |
| 20 | | Fichte, Johannes ; Hecher, Markus | Counting with Bounded Treewidth: Meta Algorithm and Runtime Guarantees | Konferenzbeitrag Inproceedings | 2020 |
