<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Dani\"el~Paulusma | AC Group | TU Wien</title><link>https://ac.notready.eu/author/dani%5Cel~paulusma/</link><atom:link href="https://ac.notready.eu/author/dani%5Cel~paulusma/index.xml" rel="self" type="application/rss+xml"/><description>Dani\"el~Paulusma</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Tue, 01 Jan 2019 00:00:00 +0000</lastBuildDate><image><url>https://ac.notready.eu/media/logo_hu10234977157890132473.png</url><title>Dani\"el~Paulusma</title><link>https://ac.notready.eu/author/dani%5Cel~paulusma/</link></image><item><title>On the Parameterized Complexity of (k,s)-SAT</title><link>https://ac.notready.eu/publication/on-the-parameterized-complexity-of-k-s-sat-2/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/on-the-parameterized-complexity-of-k-s-sat-2/</guid><description/></item><item><title>On the Parameterized Complexity of (k,s)-SAT</title><link>https://ac.notready.eu/publication/on-the-parameterized-complexity-of-k-s-sat/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/on-the-parameterized-complexity-of-k-s-sat/</guid><description/></item></channel></rss>