<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Johannes Klaus Fichte | AC Group | TU Wien</title><link>https://ac.tuwien.ac.at/team/johannes-klaus-fichte/</link><atom:link href="https://ac.tuwien.ac.at/team/johannes-klaus-fichte/index.xml" rel="self" type="application/rss+xml"/><description>Johannes Klaus Fichte</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Sun, 01 Jan 2023 00:00:00 +0000</lastBuildDate><image><url>https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.png</url><title>Johannes Klaus Fichte</title><link>https://ac.tuwien.ac.at/team/johannes-klaus-fichte/</link></image><item><title>Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF</title><link>https://ac.tuwien.ac.at/publication/structure-aware-lower-bounds-and-broadening-the-horizon-of-tractability-for-qbf/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/structure-aware-lower-bounds-and-broadening-the-horizon-of-tractability-for-qbf/</guid><description/></item><item><title>Solving the Steiner Tree Problem with few Terminals</title><link>https://ac.tuwien.ac.at/publication/solving-the-steiner-tree-problem-with-few-terminals/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-the-steiner-tree-problem-with-few-terminals/</guid><description/></item><item><title>Towards Faster Reasoners by Using Transparent Huge Pages</title><link>https://ac.tuwien.ac.at/publication/towards-faster-reasoners-by-using-transparent-huge-pages/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/towards-faster-reasoners-by-using-transparent-huge-pages/</guid><description/></item><item><title>Backdoor Trees for Answer Set Programming</title><link>https://ac.tuwien.ac.at/publication/backdoor-trees-for-answer-set-programming/</link><pubDate>Sun, 01 Jan 2017 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/backdoor-trees-for-answer-set-programming/</guid><description/></item><item><title>Backdoors to Normality for Disjunctive Logic Programs</title><link>https://ac.tuwien.ac.at/publication/backdoors-to-normality-for-disjunctive-logic-programs-2/</link><pubDate>Thu, 01 Jan 2015 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/backdoors-to-normality-for-disjunctive-logic-programs-2/</guid><description/></item><item><title>Backdoors to Tractable Answer Set Programming</title><link>https://ac.tuwien.ac.at/publication/backdoors-to-tractable-answer-set-programming-3/</link><pubDate>Thu, 01 Jan 2015 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/backdoors-to-tractable-answer-set-programming-3/</guid><description/></item><item><title>Backdoors to Normality for Disjunctive Logic Programs</title><link>https://ac.tuwien.ac.at/publication/backdoors-to-normality-for-disjunctive-logic-programs/</link><pubDate>Tue, 01 Jan 2013 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/backdoors-to-normality-for-disjunctive-logic-programs/</guid><description/></item><item><title>Backdoors to Tractable Answer-Set Programming</title><link>https://ac.tuwien.ac.at/publication/backdoors-to-tractable-answer-set-programming-2/</link><pubDate>Sun, 01 Jan 2012 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/backdoors-to-tractable-answer-set-programming-2/</guid><description/></item><item><title>Backdoors to Tractable Answer-Set Programming</title><link>https://ac.tuwien.ac.at/publication/backdoors-to-tractable-answer-set-programming/</link><pubDate>Sat, 01 Jan 2011 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/backdoors-to-tractable-answer-set-programming/</guid><description/></item></channel></rss>