The Good, the Bad, and the Odd: Cycles in Answer-Set Programs. - Johannes Klaus Fichte (ESSLLI Student Sessions, 2011)

Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution. - Albert Atserias; Johannes Klaus Fichte; Marc Thurley (J. Artif. Intell. Res., 2011)

Backdoors to the Tractability of Answer Set Programming. - Johannes Klaus Fichte (Theory Pract. Log. Program., 2013)

Backdoors to tractable answer set programming. - Johannes Klaus Fichte; Stefan Szeider (Artif. Intell., 2015)

Backdoors to Normality for Disjunctive Logic Programs. - Johannes Klaus Fichte; Stefan Szeider (ACM Trans. Comput. Log., 2015)

Dual-normal logic programs - the forgotten class. - Johannes Klaus Fichte; Miroslaw Truszczynski; Stefan Woltran (Theory Pract. Log. Program., 2015)

Towards an integrated health research process: A cloud-based approach. - Matthieu-P. Schapranow; Matthias Uflacker; Murat Sariyar; Sebastian C. Semler; Johannes Klaus Fichte; Dietmar Schielke; Kismet Ekinci; Thomas Zahn (IEEE BigData, 2016)

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

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

Backdoor Trees for Answer Set Programming. - Johannes Klaus Fichte; Stefan Szeider (ASPOCP@LPNMR, 2017)

SAT-Based Local Improvement for Finding Tree Decompositions of Small Width. - Johannes Klaus Fichte; Neha Lodha; Stefan Szeider (SAT, 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)

Proceedings of the elevent Workshop on Answer Set Programming and Other Computing Paradigms 2018. - Jorge Fandinno; Johannes Klaus Fichte (CoRR, 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)

A multiparametric view on answer set programming. - Johannes Klaus Fichte; Martin Kronegger; Stefan Woltran (Ann. Math. Artif. Intell., 2019)

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

Proceedings of the twelfth Workshop on Answer Set Programming and Other Computing Paradigms 2019. - Jorge Fandinno; Johannes Klaus Fichte (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)

Towards Faster Reasoners by Using Transparent Huge Pages. - Johannes Klaus Fichte; Norbert Manthey; Julian Stecklina; André Schidler (CP, 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)

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)

Decomposition-Guided Reductions for Argumentation and Treewidth. - Johannes Klaus Fichte; Markus Hecher; Yasir Mahmood 002; Arne Meier (IJCAI, 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)

Rushing and Strolling among Answer Sets - Navigation Made Easy. - Johannes Klaus Fichte; Sarah Alice Gaggl; Dominik Rusovac (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)

A Quantitative Symbolic Approach to Individual Human Reasoning. - Emmanuelle Dietz; Johannes Klaus Fichte; Florim Hamiti (CogSci, 2022)

Model Counting, its Relationship to Symbolic Quantitative AI, and a Glimpse into Practical Solving. - Johannes Klaus Fichte (SAFA@COMMA, 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)

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)

Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation. - Johannes Klaus Fichte; Markus Hecher; Yasir Mahmood 002; Arne Meier (IJCAI, 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)

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)

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

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

Epistemic Logic Programs: Non-Ground and Counting Complexity. - Thomas Eiter; Johannes Klaus Fichte; Markus Hecher; Stefan Woltran (IJCAI, 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)

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

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

Strong Backdoors for Default Logic. - Johannes Klaus Fichte; Arne Meier; Irena Schindler (ACM Trans. Comput. Log., 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)

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)

Complexity of Faceted Explanations in Propositional Abduction. - Johannes Schmidt 001; Mohamed Maizia; Victor Lagerkvist; Johannes Klaus Fichte (CoRR, 2025)