The D-FLAT System for Dynamic Programming on Tree Decompositions. - Michael Abseher; Bernhard Bliem; Günther Charwat; Frederico Dusberger; Markus Hecher; Stefan Woltran (JELIA, 2014)

Subset Minimization in Dynamic Programming on Tree Decompositions. - Bernhard Bliem; Günther Charwat; Markus Hecher; Stefan Woltran (AAAI Workshop: Beyond NP, 2016)

On Efficiently Enumerating Semi-Stable Extensions via Dynamic Programming on Tree Decompositions. - Bernhard Bliem; Markus Hecher; Stefan Woltran (COMMA, 2016)

Counting Answer Sets via Dynamic Programming. - Johannes Klaus Fichte; Markus Hecher; Michael Morak; Stefan Woltran (CoRR, 2016)

D-FLAT2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy. - Bernhard Bliem; Günther Charwat; Markus Hecher; Stefan Woltran (Fundam. Informaticae, 2016)

Answer Set Solving with Bounded Treewidth Revisited. - Johannes Klaus Fichte; Markus Hecher; Michael Morak; Stefan Woltran (LPNMR, 2017)

An SMT Approach to Fractional Hypertree Width. - Johannes Klaus Fichte; Markus Hecher; Neha Lodha; Stefan Szeider (CP, 2018)

Weighted Model Counting on the GPU by Exploiting Small Treewidth. - Johannes Klaus Fichte; Markus Hecher; Stefan Woltran; Markus Zisser (ESA, 2018)

Exploiting Treewidth for Counting Projected Answer Sets. - Johannes Klaus Fichte; Markus Hecher (KR, 2018)

Exploiting Treewidth for Projected Model Counting and Its Limits. - Johannes Klaus Fichte; Markus Hecher; Michael Morak; Stefan Woltran (SAT, 2018)

Dynamic Programming on Tree Decompositions with D-FLAT. - Michael Abseher; Bernhard Bliem; Markus Hecher; Marius Moldovan; Stefan Woltran (Künstliche Intell., 2018)

An Improved GPU-Based SAT Model Counter. - Johannes Klaus Fichte; Markus Hecher; Markus Zisser (CP, 2019)

The PACE 2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration (Invited Paper). - Muhammad Ayaz Dzulfikar; Johannes Klaus Fichte; Markus Hecher (IPEC, 2019)

Treewidth and Counting Projected Answer Sets. - Johannes Klaus Fichte; Markus Hecher (LPNMR, 2019)

Answer Set Solving exploiting Treewidth and its Limits. - Markus Hecher (CoRR, 2019)

TE-ETH: Lower Bounds for QBFs of Bounded Treewidth. - Johannes Klaus Fichte; Markus Hecher; Andreas Pfandler (CoRR, 2019)

Inconsistency Proofs for ASP: The ASP - DRUPE Format. - Mario Alviano; Carmine Dodaro; Johannes Klaus Fichte; Markus Hecher; Tobias Philipp; Jakob Rath (Theory Pract. Log. Program., 2019)

Treewidth-Aware Quantifier Elimination and Expansion for QCSP. - Johannes Klaus Fichte; Markus Hecher; Maximilian F. I. Kieler (CP, 2020)

A Time Leap Challenge for SAT-Solving. - Johannes Klaus Fichte; Markus Hecher; Stefan Szeider (CP, 2020)

Breaking Symmetries with RootClique and LexTopSort. - Johannes Klaus Fichte; Markus Hecher; Stefan Szeider (CP, 2020)

Structural Decompositions of Epistemic Logic Programs. - Markus Hecher; Michael Morak; Stefan Woltran (ICLP Workshops, 2020)

Solving the Steiner Tree Problem with few Terminals. - Johannes Klaus Fichte; Markus Hecher; André Schidler (ICTAI, 2020)

Lower Bounds for QBFs of Bounded Treewidth. - Johannes Klaus Fichte; Markus Hecher; Andreas Pfandler (LICS, 2020)

Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology. - Markus Hecher; Patrick Thier; Stefan Woltran (SAT, 2020)

Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard. - Jorge Fandinno; Markus Hecher (AAAI, 2021)

Knowledge-Base Degrees of Inconsistency: Complexity and Counting. - Johannes Klaus Fichte; Markus Hecher; Arne Meier (AAAI, 2021)

Complications for Computational Experiments from Modern Processors. - Johannes Klaus Fichte; Markus Hecher; Ciaran McCreesh; Anas Shahab (CP, 2021)

Parallel Model Counting with CUDA: Algorithm Engineering for Efficient Hardware Utilization. - Johannes Klaus Fichte; Markus Hecher; Valentin Roland (CP, 2021)

aspmc: An Algebraic Answer Set Counter. - Thomas Eiter; Markus Hecher; Rafael Kiesel (ICLP Workshops, 2021)

Decomposition-Guided Reductions for Argumentation and Treewidth. - Johannes Klaus Fichte; Markus Hecher; Yasir Mahmood 002; Arne Meier (IJCAI, 2021)

Treewidth-Aware Cycle Breaking for Algebraic Answer Set Counting. - Thomas Eiter; Markus Hecher; Rafael Kiesel (KR, 2021)

DynASP2.5: Dynamic Programming on Tree Decompositions in Action. - Johannes Klaus Fichte; Markus Hecher; Michael Morak; Stefan Woltran (Algorithms, 2021)

The Model Counting Competition 2020. - Johannes Klaus Fichte; Markus Hecher; Florim Hamiti (ACM J. Exp. Algorithmics, 2021)

Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs. - Viktor Besin; Markus Hecher; Stefan Woltran (Theory Pract. Log. Program., 2021)

Advanced tools and methods for treewidth-based problem solving - Markus Hecher (2021)

Werkzeuge und Methoden zum Lösen von Problemen mittels Baumweite . - Markus Hecher (Ausgezeichnete Informatikdissertationen, 2021)

Advanced Tools and Methods for Treewidth-Based Problem Solving - Markus Hecher (IOS Press, 2022)

Tractable Abstract Argumentation via Backdoor-Treewidth. - Wolfgang Dvorák; Markus Hecher; Matthias König 002; André Schidler; Stefan Szeider; Stefan Woltran (AAAI, 2022)

ApproxASP - a Scalable Approximate Answer Set Counter. - Mohimenul Kabir; Flavio O. Everardo; Ankit K. Shukla; Markus Hecher; Johannes Klaus Fichte; Kuldeep S. Meel (AAAI, 2022)

Body-Decoupled Grounding via Solving: A Novel Approach on the ASP Bottleneck. - Viktor Besin; Markus Hecher; Stefan Woltran (IJCAI, 2022)

Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs (Extended Abstract). - Viktor Besin; Markus Hecher; Stefan Woltran (IJCAI, 2022)

Plausibility Reasoning via Projected Answer Set Counting - A Hybrid Approach. - Johannes Klaus Fichte; Markus Hecher; Mohamed A. Nadeem (IJCAI, 2022)

A Practical Account into Counting Dung's Extensions by Dynamic Programming. - Ridhwan Dewoprabowo; Johannes Klaus Fichte; Piotr Jerzy Gorczyca; Markus Hecher (LPNMR, 2022)

Proofs for Propositional Model Counting. - Johannes Klaus Fichte; Markus Hecher; Valentin Roland (SAT, 2022)

Treewidth-aware reductions of normal ASP to SAT - Is normal ASP harder than SAT after all? - Markus Hecher (Artif. Intell., 2022)

Advanced Tools and Methods for Treewidth-Based Problem Solving - Extended Abstract. - Markus Hecher (CoRR, 2022)

Default logic and bounded treewidth. - Johannes Klaus Fichte; Markus Hecher; Irina Schindler (Inf. Comput., 2022)

Exploiting Database Management Systems and Treewidth for Counting. - Johannes Klaus Fichte; Markus Hecher; Patrick Thier; Stefan Woltran (Theory Pract. Log. Program., 2022)

Inconsistent Cores for ASP: The Perks and Perils of Non-monotonicity. - Johannes Klaus Fichte; Markus Hecher; Stefan Szeider (AAAI, 2023)

Characterizing Structural Hardness of Logic Programs: What Makes Cycles and Reachability Hard for Treewidth? - Markus Hecher (AAAI, 2023)

Grounding Planning Tasks Using Tree Decompositions and Iterated Solving. - Augusto B. Corrêa; Markus Hecher; Malte Helmert; Davide Mario Longo; Florian Pommerening; Stefan Woltran (ICAPS, 2023)

On the Structural Complexity of Grounding - Tackling the ASP Grounding Bottleneck via Epistemic Programs and Treewidth. - Viktor Besin; Markus Hecher; Stefan Woltran (ECAI, 2023)

Treewidth-Aware Complexity for Evaluating Epistemic Logic Programs. - Jorge Fandinno; Markus Hecher (IJCAI, 2023)

Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation. - Johannes Klaus Fichte; Markus Hecher; Yasir Mahmood 002; Arne Meier (IJCAI, 2023)

The Impact of Structure in Answer Set Counting: Fighting Cycles and its Limits. - Markus Hecher; Rafael Kiesel (KR, 2023)

Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF. - Johannes Klaus Fichte; Robert Ganian; Markus Hecher; Friedrich Slivovsky; Sebastian Ordyniak (LICS, 2023)

Solving Projected Model Counting by Utilizing Treewidth and its Limits. - Johannes Klaus Fichte; Markus Hecher; Michael Morak; Patrick Thier; Stefan Woltran (Artif. Intell., 2023)

Advanced tools and methods for treewidth-based problem solving. - Markus Hecher (it Inf. Technol., 2023)

The Silent (R)evolution of SAT. - Johannes Klaus Fichte; Daniel Le Berre; Markus Hecher; Stefan Szeider (Commun. ACM, 2023)

Parallel Empirical Evaluations: Resilience despite Concurrency. - Johannes Klaus Fichte; Tobias Geibinger; Markus Hecher; Matthias Schlögel (AAAI, 2024)

On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions? - Markus Hecher; Rafael Kiesel (AAAI, 2024)

Domain-Based Nucleic-Acid Minimum Free Energy: Algorithmic Hardness and Parameterized Bounds. - Erik D. Demaine; Timothy Gomez; Elise Grizzell; Markus Hecher; Jayson Lynch; Robert T. Schweller; Ahmed Shalaby 005; Damien Woods (DNA, 2024)

Rejection in Abstract Argumentation: Harder Than Acceptance? - Johannes Klaus Fichte; Markus Hecher; Yasir Mahmood 002; Arne Meier (ECAI, 2024)

A First Journey into the Complexity of Statistical Statements in Probabilistic Answer Set Programming. - Damiano Azzolini; Markus Hecher (ICLP Workshops, 2024)

On Weighted Maximum Model Counting: Complexity and Fragments. - Max Bannach; Markus Hecher (ICTAI, 2024)

Forgetting in Counting and Bounded Treewidth. - Johannes Klaus Fichte; Markus Hecher (ICTAI, 2024)

Finite Groundings for ASP with Functions: A Journey through Consistency. - Lukas Gerlach 002; David Carral; Markus Hecher (IJCAI, 2024)

Bypassing the ASP Bottleneck: Hybrid Grounding by Splitting and Rewriting. - Alexander Beiser; Markus Hecher; Kaan Unalan; Stefan Woltran (IJCAI, 2024)

Epistemic Logic Programs: Non-Ground and Counting Complexity. - Thomas Eiter; Johannes Klaus Fichte; Markus Hecher; Stefan Woltran (IJCAI, 2024)

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

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 (ISAAC, 2024)

Navigating and Querying Answer Sets: How Hard Is It Really and Why? - Dominik Rusovac; Markus Hecher; Martin Gebser; Sarah Alice Gaggl; Johannes Klaus Fichte (KR, 2024)

Structure-Guided Cube-and-Conquer for MaxSAT. - Max Bannach; Markus Hecher (NFM, 2024)

Finite Groundings for ASP with Functions: A Journey through Consistency (Extended Abstract). - Lukas Gerlach 002; David Carral; Markus Hecher (NMR, 2024)

The Relative Strength of #SAT Proof Systems. - Olaf Beyersdorff; Johannes Klaus Fichte; Markus Hecher; Tim Hoffmann; Kaspar Kasche (SAT, 2024)

Tight Double Exponential Lower Bounds. - Ivan Bliznets; Markus Hecher (TAMC, 2024)

aspmc: New frontiers of algebraic answer set counting. - Thomas Eiter; Markus Hecher; Rafael Kiesel (Artif. Intell., 2024)

Extended Version of: On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions? - Markus Hecher; Rafael Kiesel (CoRR, 2024)

Folding One Polyhedral Metric Graph into Another. - Lily Chung; Erik D. Demaine; Martin L. Demaine; Markus Hecher; Rebecca Lin; Jayson Lynch; Chie Nara (CoRR, 2024)

Continuous Flattening and Reversing of Convex Polyhedral Linkages. - Erik D. Demaine; Martin L. Demaine; Markus Hecher; Rebecca Lin; Victor Luo; Chie Nara (CoRR, 2024)

Counting Complexity for Reasoning in Abstract Argumentation. - Johannes Klaus Fichte; Markus Hecher; Arne Meier (J. Artif. Intell. Res., 2024)

IASCAR: Incremental Answer Set Counting by Anytime Refinement. - Johannes Klaus Fichte; Sarah Alice Gaggl; Markus Hecher; Dominik Rusovac (Theory Pract. Log. Program., 2024)

Counting and Reasoning with Plans. - David Speck 001; Markus Hecher; Daniel Gnad 001; Johannes Klaus Fichte; Augusto B. Corrêa (AAAI, 2025)

Dung's Argumentation Framework: Unveiling the Expressive Power with Inconsistent Databases. - Yasir Mahmood 002; Markus Hecher; Axel-Cyrille Ngonga Ngomo (AAAI, 2025)

ETH Lower Bounds for n-Queens: Time Waits for Nobody. - Josh Brunner; Erik D. Demaine; Timothy Gomez; Markus Hecher; Meryl Zhang (IWOCA, 2025)

Strong Structural Bounds for MaxSAT: The Fine Details of Using Neuromorphic and Quantum Hardware Accelerators. - Max Bannach; Jai Grover; Markus Hecher (NFM, 2025)

Hardness of Traversing Gadget Systems with Small Bandwidth. - MIT Gadgets Group; Erik D. Demaine; Jenny Diomidova; Timothy Gomez; Markus Hecher; Jayson Lynch (SAND, 2025)

Structure-Guided Automated Reasoning. - Max Bannach; Markus Hecher (STACS, 2025)

The Model Counting Competitions 2021-2023. - Johannes Klaus Fichte; Markus Hecher (CoRR, 2025)

Facets in Argumentation: A Formal Approach to Argument Significance. - Johannes Klaus Fichte; Nicolas Fröhlich 001; Markus Hecher; Victor Lagerkvist; Yasir Mahmood 002; Arne Meier; Jonathan Persson (CoRR, 2025)

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? - Max Bannach; Erik D. Demaine; Timothy Gomez; Markus Hecher (CoRR, 2025)

Automated Hybrid Grounding Using Structural and Data-Driven Heuristics. - Alexander Beiser; Markus Hecher; Stefan Woltran (CoRR, 2025)