<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Prabhakar Ragde | AC Group | TU Wien</title><link>https://ac.tuwien.ac.at/team/prabhakar-ragde/</link><atom:link href="https://ac.tuwien.ac.at/team/prabhakar-ragde/index.xml" rel="self" type="application/rss+xml"/><description>Prabhakar Ragde</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Mon, 01 Jan 2007 00:00:00 +0000</lastBuildDate><image><url>https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.png</url><title>Prabhakar Ragde</title><link>https://ac.tuwien.ac.at/team/prabhakar-ragde/</link></image><item><title>Solving \#SAT using Vertex Covers</title><link>https://ac.tuwien.ac.at/publication/solving-sat-using-vertex-covers-2/</link><pubDate>Mon, 01 Jan 2007 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-sat-using-vertex-covers-2/</guid><description/></item><item><title>Solving \#SAT using Vertex Covers</title><link>https://ac.tuwien.ac.at/publication/solving-sat-using-vertex-covers/</link><pubDate>Sun, 01 Jan 2006 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-sat-using-vertex-covers/</guid><description/></item><item><title>Detecting Backdoor Sets with Respect to Horn and Binary Clauses</title><link>https://ac.tuwien.ac.at/publication/detecting-backdoor-sets-with-respect-to-horn-and-binary-clauses/</link><pubDate>Thu, 01 Jan 2004 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/detecting-backdoor-sets-with-respect-to-horn-and-binary-clauses/</guid><description/></item></channel></rss>