<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Serge Gaspers | AC Group | TU Wien</title><link>https://ac.tuwien.ac.at/team/serge-gaspers/</link><atom:link href="https://ac.tuwien.ac.at/team/serge-gaspers/index.xml" rel="self" type="application/rss+xml"/><description>Serge Gaspers</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Thu, 01 Jan 2026 00:00:00 +0000</lastBuildDate><image><url>https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.png</url><title>Serge Gaspers</title><link>https://ac.tuwien.ac.at/team/serge-gaspers/</link></image><item><title>Backdoors to Satisfaction Continued</title><link>https://ac.tuwien.ac.at/publication/backdoors-to-satisfaction-continued/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/backdoors-to-satisfaction-continued/</guid><description/></item><item><title>Backdoor Sets for CSP</title><link>https://ac.tuwien.ac.at/publication/backdoor-sets-for-csp/</link><pubDate>Sun, 01 Jan 2017 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/backdoor-sets-for-csp/</guid><description/></item><item><title>Backdoors into heterogeneous classes of SAT and CSP</title><link>https://ac.tuwien.ac.at/publication/backdoors-into-heterogeneous-classes-of-sat-and-csp-2/</link><pubDate>Sun, 01 Jan 2017 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/backdoors-into-heterogeneous-classes-of-sat-and-csp-2/</guid><description/></item><item><title>Stable Matching with Uncertain Pairwise Preferences</title><link>https://ac.tuwien.ac.at/publication/stable-matching-with-uncertain-pairwise-preferences/</link><pubDate>Sun, 01 Jan 2017 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/stable-matching-with-uncertain-pairwise-preferences/</guid><description/></item><item><title>Backdoors to q-Horn</title><link>https://ac.tuwien.ac.at/publication/backdoors-to-q-horn-2/</link><pubDate>Fri, 01 Jan 2016 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/backdoors-to-q-horn-2/</guid><description/></item><item><title>Stable Matching with Uncertain Linear Preferences</title><link>https://ac.tuwien.ac.at/publication/stable-matching-with-uncertain-linear-preferences/</link><pubDate>Fri, 01 Jan 2016 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/stable-matching-with-uncertain-linear-preferences/</guid><description/></item><item><title>On finding optimal polytrees</title><link>https://ac.tuwien.ac.at/publication/on-finding-optimal-polytrees-2/</link><pubDate>Thu, 01 Jan 2015 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/on-finding-optimal-polytrees-2/</guid><description/></item><item><title>Backdoors into Heterogeneous Classes of SAT and CSP</title><link>https://ac.tuwien.ac.at/publication/backdoors-into-heterogeneous-classes-of-sat-and-csp/</link><pubDate>Wed, 01 Jan 2014 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/backdoors-into-heterogeneous-classes-of-sat-and-csp/</guid><description/></item><item><title>Guarantees and limits of preprocessing in constraint satisfaction and reasoning</title><link>https://ac.tuwien.ac.at/publication/guarantees-and-limits-of-preprocessing-in-constraint-satisfaction-and-reasoning/</link><pubDate>Wed, 01 Jan 2014 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/guarantees-and-limits-of-preprocessing-in-constraint-satisfaction-and-reasoning/</guid><description/></item><item><title>Backdoors to q-Horn</title><link>https://ac.tuwien.ac.at/publication/backdoors-to-q-horn/</link><pubDate>Tue, 01 Jan 2013 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/backdoors-to-q-horn/</guid><description/></item><item><title>Strong Backdoors to Bounded Treewidth SAT</title><link>https://ac.tuwien.ac.at/publication/strong-backdoors-to-bounded-treewidth-sat/</link><pubDate>Tue, 01 Jan 2013 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/strong-backdoors-to-bounded-treewidth-sat/</guid><description/></item><item><title>Backdoors to Acyclic SAT</title><link>https://ac.tuwien.ac.at/publication/backdoors-to-acyclic-sat-2/</link><pubDate>Sun, 01 Jan 2012 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/backdoors-to-acyclic-sat-2/</guid><description/></item><item><title>Backdoors to Satisfaction</title><link>https://ac.tuwien.ac.at/publication/backdoors-to-satisfaction-2/</link><pubDate>Sun, 01 Jan 2012 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/backdoors-to-satisfaction-2/</guid><description/></item><item><title>Don't Be Strict in Local Search!</title><link>https://ac.tuwien.ac.at/publication/don-t-be-strict-in-local-search/</link><pubDate>Sun, 01 Jan 2012 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/don-t-be-strict-in-local-search/</guid><description/></item><item><title>k-Gap Interval Graphs</title><link>https://ac.tuwien.ac.at/publication/k-gap-interval-graphs/</link><pubDate>Sun, 01 Jan 2012 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/k-gap-interval-graphs/</guid><description/></item><item><title>On Finding Optimal Polytrees</title><link>https://ac.tuwien.ac.at/publication/on-finding-optimal-polytrees/</link><pubDate>Sun, 01 Jan 2012 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/on-finding-optimal-polytrees/</guid><description/></item><item><title>Strong Backdoors to Nested Satisfiability</title><link>https://ac.tuwien.ac.at/publication/strong-backdoors-to-nested-satisfiability/</link><pubDate>Sun, 01 Jan 2012 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/strong-backdoors-to-nested-satisfiability/</guid><description/></item><item><title>Backdoors to Acyclic SAT</title><link>https://ac.tuwien.ac.at/publication/backdoors-to-acyclic-sat/</link><pubDate>Sat, 01 Jan 2011 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/backdoors-to-acyclic-sat/</guid><description/></item><item><title>Backdoors to Satisfaction</title><link>https://ac.tuwien.ac.at/publication/backdoors-to-satisfaction/</link><pubDate>Sat, 01 Jan 2011 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/backdoors-to-satisfaction/</guid><description/></item><item><title>Kernels for Global Constraints</title><link>https://ac.tuwien.ac.at/publication/kernels-for-global-constraints/</link><pubDate>Sat, 01 Jan 2011 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/kernels-for-global-constraints/</guid><description/></item><item><title>The Parameterized Complexity of Local Consistency</title><link>https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-local-consistency/</link><pubDate>Sat, 01 Jan 2011 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-local-consistency/</guid><description/></item></channel></rss>