<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Andr{\'{e}} Schidler | AC Group | TU Wien</title><link>https://ac.notready.eu/author/andr%5Ce-schidler/</link><atom:link href="https://ac.notready.eu/author/andr%5Ce-schidler/index.xml" rel="self" type="application/rss+xml"/><description>Andr{\'{e}} Schidler</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Wed, 01 Jan 2025 00:00:00 +0000</lastBuildDate><image><url>https://ac.notready.eu/media/logo_hu10234977157890132473.png</url><title>Andr{\'{e}} Schidler</title><link>https://ac.notready.eu/author/andr%5Ce-schidler/</link></image><item><title>Analyzing Reformulation Performance in Core-Guided MaxSAT Solving</title><link>https://ac.notready.eu/publication/analyzing-reformulation-performance-in-core-guided-maxsat-solving/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/analyzing-reformulation-performance-in-core-guided-maxsat-solving/</guid><description/></item><item><title>A Dynamic MaxSAT-based Approach to Directed Feedback Vertex Sets</title><link>https://ac.notready.eu/publication/a-dynamic-maxsat-based-approach-to-directed-feedback-vertex-sets/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/a-dynamic-maxsat-based-approach-to-directed-feedback-vertex-sets/</guid><description/></item><item><title>Computing optimal hypertree decompositions with SAT</title><link>https://ac.notready.eu/publication/computing-optimal-hypertree-decompositions-with-sat-2/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/computing-optimal-hypertree-decompositions-with-sat-2/</guid><description/></item><item><title>PACE Solver Description: DAGer - Cutting out Cycles with MaxSAT</title><link>https://ac.notready.eu/publication/pace-solver-description-dager-cutting-out-cycles-with-maxsat/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/pace-solver-description-dager-cutting-out-cycles-with-maxsat/</guid><description/></item><item><title>SAT-Based Local Search for Plane Subgraph Partitions (CG Challenge)</title><link>https://ac.notready.eu/publication/sat-based-local-search-for-plane-subgraph-partitions-cg-challenge/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/sat-based-local-search-for-plane-subgraph-partitions-cg-challenge/</guid><description/></item><item><title>Solving the Steiner Tree Problem with few Terminals</title><link>https://ac.notready.eu/publication/solving-the-steiner-tree-problem-with-few-terminals/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/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.notready.eu/publication/towards-faster-reasoners-by-using-transparent-huge-pages/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/towards-faster-reasoners-by-using-transparent-huge-pages/</guid><description/></item></channel></rss>