| 2026 | AAAI | Structure-Aware Encodings of Argumentation Properties for Clique-width. | Yasir Mahmood, Markus Hecher, Johanna Groven, Johannes Klaus Fichte |
| 2026 | KR | Counting Complexity of ASP. | Max Bannach, Johannes Klaus Fichte, Johanna Groven, Markus Hecher |
| 2025 | AAAI | Counting and Reasoning with Plans. | David Speck, Markus Hecher, Daniel Gnad, Johannes Klaus Fichte, Augusto B. Corra |
| 2025 | AAAI | Dung's Argumentation Framework: Unveiling the Expressive Power with Inconsistent Databases. | Yasir Mahmood, Markus Hecher, Axel-Cyrille Ngonga Ngomo |
| 2025 | IJCAI | Facets in Argumentation: A Formal Approach to Argument Significance. | Johannes Klaus Fichte, Nicolas Frhlich, Markus Hecher, Victor Lagerkvist, Yasir Mahmood, Arne Meier, Jonathan Persson |
| 2025 | IWOCA | ETH Lower Bounds for n-Queens: Time Waits for Nobody. | Josh Brunner, Erik D. Demaine, Timothy Gomez, Markus Hecher, Meryl Zhang |
| 2025 | KR | Interactive Exploration of Plan Spaces. | Daniel Gnad, Markus Hecher, Sarah Alice Gaggl, Dominik Rusovac, David Speck, Johannes Klaus Fichte |
| 2025 | KR | Reasoning with Restricted Statistical Statements in Probabilistic Answer Set Programming: Complexity and Algorithms. | Damiano Azzolini, Markus Hecher |
| 2025 | KR | Counting Solutions Under Cardinality Constraints: Structure Counts in Counting. | Max Bannach, Markus Hecher |
| 2025 | KR | FastFound: Easing the ASP Bottleneck via Predicate-Decoupled Grounding. | Alexander Beiser, Martin Gebser, Markus Hecher, Stefan Woltran |
| 2025 | LICS | #P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? | Max Bannach, Erik D. Demaine, Timothy Gomez, Markus Hecher |
| 2025 | STACS | Structure-Guided Automated Reasoning. | Max Bannach, Markus Hecher |
| 2024 | AAAI | Parallel Empirical Evaluations: Resilience despite Concurrency. | Johannes Klaus Fichte, Tobias Geibinger, Markus Hecher, Matthias Schlgel |
| 2024 | AAAI | On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions? | Markus Hecher, Rafael Kiesel |
| 2024 | DNA | Domain-Based Nucleic-Acid Minimum Free Energy: Algorithmic Hardness and Parameterized Bounds. | Erik D. Demaine, Timothy Gomez, Elise Grizzell, Markus Hecher, Jayson Lynch, Robert Schweller, Ahmed Shalaby, Damien Woods |
| 2024 | ECAI | Rejection in Abstract Argumentation: Harder Than Acceptance? | Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier |
| 2024 | ICLP | A First Journey into the Complexity of Statistical Statements in Probabilistic Answer Set Programming. | Damiano Azzolini, Markus Hecher |
| 2024 | IJCAI | Finite Groundings for ASP with Functions: A Journey through Consistency. | Lukas Gerlach, David Carral, Markus Hecher |
| 2024 | IJCAI | Bypassing the ASP Bottleneck: Hybrid Grounding by Splitting and Rewriting. | Alexander Beiser, Markus Hecher, Kaan Unalan, Stefan Woltran |
| 2024 | IJCAI | Epistemic Logic Programs: Non-Ground and Counting Complexity. | Thomas Eiter, Johannes Klaus Fichte, Markus Hecher, Stefan Woltran |
| 2024 | IJCAI | Quantitative Claim-Centric Reasoning in Logic-Based Argumentation. | Markus Hecher, Yasir Mahmood, Arne Meier, Johannes Schmidt |
| 2024 | ISAAC | Easier Ways to Prove Counting Hard: A Dichotomy for Generalized #SAT, Applied to Constraint Graphs. | MIT Hardness Group, Josh Brunner, Erik D. Demaine, Jenny Diomidova, Timothy Gomez, Markus Hecher, Frederick Stock, Zixiang Zhou |
| 2024 | ICTAI | On Weighted Maximum Model Counting: Complexity and Fragments. | Max Bannach, Markus Hecher |
| 2024 | ICTAI | Forgetting in Counting and Bounded Treewidth. | Johannes Klaus Fichte, Markus Hecher |
| 2024 | KR | Navigating and Querying Answer Sets: How Hard Is It Really and Why? | Dominik Rusovac, Markus Hecher, Martin Gebser, Sarah Alice Gaggl, Johannes Klaus Fichte |
| 2024 | SAT | The Relative Strength of #SAT Proof Systems. | Olaf Beyersdorff, Johannes Klaus Fichte, Markus Hecher, Tim Hoffmann, Kaspar Kasche |
| 2024 | TAMC | Tight Double Exponential Lower Bounds. | Ivan Bliznets, Markus Hecher |
| 2023 | AAAI | Inconsistent Cores for ASP: The Perks and Perils of Non-monotonicity. | Johannes Klaus Fichte, Markus Hecher, Stefan Szeider |
| 2023 | AAAI | Characterizing Structural Hardness of Logic Programs: What Makes Cycles and Reachability Hard for Treewidth? | Markus Hecher |
| 2023 | ECAI | On the Structural Complexity of Grounding - Tackling the ASP Grounding Bottleneck via Epistemic Programs and Treewidth. | Viktor Besin, Markus Hecher, Stefan Woltran |
| 2023 | IJCAI | Treewidth-Aware Complexity for Evaluating Epistemic Logic Programs. | Jorge Fandinno, Markus Hecher |
| 2023 | IJCAI | Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation. | Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier |
| 2023 | KR | The Impact of Structure in Answer Set Counting: Fighting Cycles and its Limits. | Markus Hecher, Rafael Kiesel |
| 2023 | LICS | Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF. | Johannes Klaus Fichte, Robert Ganian, Markus Hecher, Friedrich Slivovsky, Sebastian Ordyniak |
| 2022 | AAAI | Tractable Abstract Argumentation via Backdoor-Treewidth. | Wolfgang Dvork, Markus Hecher, Matthias Knig, Andr Schidler, Stefan Szeider, Stefan Woltran |
| 2022 | AAAI | ApproxASP - a Scalable Approximate Answer Set Counter. | Mohimenul Kabir, Flavio O. Everardo, Ankit K. Shukla, Markus Hecher, Johannes Klaus Fichte, Kuldeep S. Meel |
| 2022 | IJCAI | Body-Decoupled Grounding via Solving: A Novel Approach on the ASP Bottleneck. | Viktor Besin, Markus Hecher, Stefan Woltran |
| 2022 | IJCAI | Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs (Extended Abstract). | Viktor Besin, Markus Hecher, Stefan Woltran |
| 2022 | IJCAI | Plausibility Reasoning via Projected Answer Set Counting - A Hybrid Approach. | Johannes Klaus Fichte, Markus Hecher, Mohamed A. Nadeem |
| 2022 | LPNMR | A Practical Account into Counting Dung's Extensions by Dynamic Programming. | Ridhwan Dewoprabowo, Johannes Klaus Fichte, Piotr Jerzy Gorczyca, Markus Hecher |
| 2022 | LPNMR | IASCAR: Incremental Answer Set Counting by Anytime Refinement. | Johannes Klaus Fichte, Sarah Alice Gaggl, Markus Hecher, Dominik Rusovac |
| 2022 | SAT | Proofs for Propositional Model Counting. | Johannes Klaus Fichte, Markus Hecher, Valentin Roland |
| 2021 | AAAI | Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard. | Jorge Fandinno, Markus Hecher |
| 2021 | AAAI | Knowledge-Base Degrees of Inconsistency: Complexity and Counting. | Johannes Klaus Fichte, Markus Hecher, Arne Meier |
| 2021 | CP | Complications for Computational Experiments from Modern Processors. | Johannes Klaus Fichte, Markus Hecher, Ciaran McCreesh, Anas Shahab |
| 2021 | CP | Parallel Model Counting with CUDA: Algorithm Engineering for Efficient Hardware Utilization. | Johannes Klaus Fichte, Markus Hecher, Valentin Roland |
| 2021 | ICLP | aspmc: An Algebraic Answer Set Counter. | Thomas Eiter, Markus Hecher, Rafael Kiesel |
| 2021 | IJCAI | Decomposition-Guided Reductions for Argumentation and Treewidth. | Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier |
| 2021 | KR | Treewidth-Aware Cycle Breaking for Algebraic Answer Set Counting. | Thomas Eiter, Markus Hecher, Rafael Kiesel |
| 2020 | AAAI | Structural Decompositions of Epistemic Logic Programs. | Markus Hecher, Michael Morak, Stefan Woltran |
| 2020 | CP | Treewidth-Aware Quantifier Elimination and Expansion for QCSP. | Johannes Klaus Fichte, Markus Hecher, Maximilian F. I. Kieler |
| 2020 | CP | A Time Leap Challenge for SAT-Solving. | Johannes Klaus Fichte, Markus Hecher, Stefan Szeider |
| 2020 | CP | Breaking Symmetries with RootClique and LexTopSort. | Johannes Klaus Fichte, Markus Hecher, Stefan Szeider |
| 2020 | ICLP | Structural Decompositions of Epistemic Logic Programs. | Markus Hecher, Michael Morak, Stefan Woltran |
| 2020 | ICTAI | Solving the Steiner Tree Problem with few Terminals. | Johannes Klaus Fichte, Markus Hecher, Andr Schidler |
| 2020 | KR | Treewidth-aware Reductions of Normal ASP to SAT - Is Normal ASP Harder than SAT after All? | Markus Hecher |
| 2020 | LICS | Lower Bounds for QBFs of Bounded Treewidth. | Johannes Klaus Fichte, Markus Hecher, Andreas Pfandler |
| 2020 | PADL | Exploiting Database Management Systems and Treewidth for Counting. | Johannes Klaus Fichte, Markus Hecher, Patrick Thier, Stefan Woltran |
| 2020 | SAT | Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology. | Markus Hecher, Patrick Thier, Stefan Woltran |
| 2019 | AAAI | Counting Complexity for Reasoning in Abstract Argumentation. | Johannes Klaus Fichte, Markus Hecher, Arne Meier |
| 2019 | CP | An Improved GPU-Based SAT Model Counter. | Johannes Klaus Fichte, Markus Hecher, Markus Zisser |
| 2019 | LPNMR | Treewidth and Counting Projected Answer Sets. | Johannes Klaus Fichte, Markus Hecher |
| 2018 | CP | An SMT Approach to Fractional Hypertree Width. | Johannes Klaus Fichte, Markus Hecher, Neha Lodha, Stefan Szeider |
| 2018 | ESA | Weighted Model Counting on the GPU by Exploiting Small Treewidth. | Johannes Klaus Fichte, Markus Hecher, Stefan Woltran, Markus Zisser |
| 2018 | KR | Exploiting Treewidth for Counting Projected Answer Sets. | Johannes Klaus Fichte, Markus Hecher |
| 2018 | LATA | Default Logic and Bounded Treewidth. | Johannes Klaus Fichte, Markus Hecher, Irina Schindler |
| 2018 | SAT | Exploiting Treewidth for Projected Model Counting and Its Limits. | Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran |
| 2017 | LPNMR | Answer Set Solving with Bounded Treewidth Revisited. | Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran |
| 2016 | AAAI | Subset Minimization in Dynamic Programming on Tree Decompositions. | Bernhard Bliem, Gnther Charwat, Markus Hecher, Stefan Woltran |
| 2016 | COMMA | On Efficiently Enumerating Semi-Stable Extensions via Dynamic Programming on Tree Decompositions. | Bernhard Bliem, Markus Hecher, Stefan Woltran |
| 2014 | JELIA | The D-FLAT System for Dynamic Programming on Tree Decompositions. | Michael Abseher, Bernhard Bliem, Gnther Charwat, Frederico Dusberger, Markus Hecher, Stefan Woltran |