Photo of Johannes Klaus Fichte

Johannes Klaus Fichte

Associate Professor

Research Interest

My work interests 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 satisfiablity 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.



Johannes Klaus Fichte, Daniel Le Berre, Markus Hecher, Stefan Szeider (2023) The Silent (R)evolution of SAT Communications of the ACM, Vol. 66, p. 64-72 Continue to DOI
Johannes K. Fichte, Robert Ganian, Markus Hecher, Friedrich Slivovsky, Sebastian Ordyniak (2023) Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF 2023 38TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, LICS Continue to DOI
Johannes Klaus Fichte, Markus Hecher, Mahmood Yasir, Arne Meier (2023) Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence (IJCAI-23), p. 3212-3220 Continue to DOI