<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Jan Dreier; Robert Ganian; Marlene Gründel; Roohani Sharma; Simon Wietheger | AC Group | TU Wien</title><link>https://ac.tuwien.ac.at/team/jan-dreier-robert-ganian-marlene-grundel-roohani-sharma-simon-wietheger/</link><atom:link href="https://ac.tuwien.ac.at/team/jan-dreier-robert-ganian-marlene-grundel-roohani-sharma-simon-wietheger/index.xml" rel="self" type="application/rss+xml"/><description>Jan Dreier; Robert Ganian; Marlene Gründel; Roohani Sharma; Simon Wietheger</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Thu, 01 Jan 1970 00:00:00 +0000</lastBuildDate><image><url>https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.png</url><title>Jan Dreier; Robert Ganian; Marlene Gründel; Roohani Sharma; Simon Wietheger</title><link>https://ac.tuwien.ac.at/team/jan-dreier-robert-ganian-marlene-grundel-roohani-sharma-simon-wietheger/</link></image><item><title>Solving SAT via Treewidth Backdoors in Linear Time: Beyond Sparsity</title><link>https://ac.tuwien.ac.at/publication/solving-sat-via-treewidth-backdoors-in-linear-time-beyond-sparsity/</link><pubDate>Thu, 01 Jan 1970 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-sat-via-treewidth-backdoors-in-linear-time-beyond-sparsity/</guid><description/></item></channel></rss>