Photo of Johannes Klaus Fichte

Johannes Klaus Fichte

Associate Professor

My research interest is in computational algorithmics, complexity, and practical applications thereof, including implementations of parameterized algorithms for various combinatorial hard problems.

My research

My research interest is in computational algorithmics, complexity, and practical applications thereof, including implementations of parameterized algorithms for various combinatorial hard problems. I focus on model counting propositional formulas and various formalisms in AI, the Boolean satisfiability problem (SAT), and answer-set programming (ASP). I have an industry background in applications of data analysis and evaluation in health care.

See my Google Scholar or DBLP for more information and recent publications.

Publications

2026

Max Bannach, Johannes Klaus Fichte, Johanna Groven, Markus Hecher (2026) Counting Complexity of ASP Proceedings of the 23rd International Conference on Principles of Knowledge Representation and Reasoning (Conference paper)
Johannes Klaus Fichte, Stefan Szeider (2026) Reverse-Engineering Constraint Models from CNFs: An Agentic Approach Proceedings of the 17th International Workshop on Pragmatics of SAT (Conference paper)
Johannes Klaus Fichte, Johanna Groven, Peter Jonsson, Victor Lagerkvist, Jorke M. de Vlas (2026) Maximum Satisfiability of Simple Temporal Problems Proceedings of the 35th International Joint Conference on Artificial Intelligence (Conference paper)
Zeynep G. Saribatur, Markus Hecher, Johannes Klaus Fichte (2026) Abstracting the Indistinguishable in ASP Proceedings of the 35th International Joint Conference on Artificial Intelligence (Conference paper)
Johannes Schmidt, Mohamed Maizia, Victor Lagerkvist, Johannes Klaus Fichte (2026) Representative Sets in Propositional Abduction Proceedings of the 42nd International Conference on Logic Programming (Conference paper) https://dx.doi.org/10.4204/EPTCS.450.1

About the division

Colleagues at AIICS

About the department