<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Manuel Sorge | AC Group | TU Wien</title><link>https://ac.tuwien.ac.at/team/manuel-sorge/</link><atom:link href="https://ac.tuwien.ac.at/team/manuel-sorge/index.xml" rel="self" type="application/rss+xml"/><description>Manuel Sorge</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/team/manuel-sorge/avatar_hu17453187385571768209.jpg</url><title>Manuel Sorge</title><link>https://ac.tuwien.ac.at/team/manuel-sorge/</link></image><item><title>Tractability via Low Dimensionality: The Parameterized Complexity of Training Quantized Neural Networks</title><link>https://ac.tuwien.ac.at/publication/tractability-via-low-dimensionality-the-parameterized-complexity-of-training-quantized-neural-networks/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/tractability-via-low-dimensionality-the-parameterized-complexity-of-training-quantized-neural-networks/</guid><description/></item><item><title>Optimal Decision Tree Pruning Revisited: Algorithms and Complexity</title><link>https://ac.tuwien.ac.at/publication/optimal-decision-tree-pruning-revisited-algorithms-and-complexity/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/optimal-decision-tree-pruning-revisited-algorithms-and-complexity/</guid><description/></item><item><title>Planarizing Graphs and their Drawings by Vertex Splitting</title><link>https://ac.tuwien.ac.at/publication/planarizing-graphs-and-their-drawings-by-vertex-splitting-2/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/planarizing-graphs-and-their-drawings-by-vertex-splitting-2/</guid><description/></item><item><title>The complexity of cluster vertex splitting and company</title><link>https://ac.tuwien.ac.at/publication/the-complexity-of-cluster-vertex-splitting-and-company-2/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-complexity-of-cluster-vertex-splitting-and-company-2/</guid><description/></item><item><title>The Complexity of Cluster Vertex Splitting and Company</title><link>https://ac.tuwien.ac.at/publication/the-complexity-of-cluster-vertex-splitting-and-company/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-complexity-of-cluster-vertex-splitting-and-company/</guid><description/></item><item><title>On Computing Optimal Tree Ensembles</title><link>https://ac.tuwien.ac.at/publication/on-computing-optimal-tree-ensembles/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/on-computing-optimal-tree-ensembles/</guid><description/></item><item><title>Planarizing Graphs and their Drawings by Vertex Splitting</title><link>https://ac.tuwien.ac.at/publication/planarizing-graphs-and-their-drawings-by-vertex-splitting/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/planarizing-graphs-and-their-drawings-by-vertex-splitting/</guid><description/></item><item><title>The Influence of Dimensions on the Complexity of Computing Decision Trees</title><link>https://ac.tuwien.ac.at/publication/the-influence-of-dimensions-on-the-complexity-of-computing-decision-trees/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-influence-of-dimensions-on-the-complexity-of-computing-decision-trees/</guid><description/></item><item><title>Threshold Treewidth and Hypertree Width</title><link>https://ac.tuwien.ac.at/publication/threshold-treewidth-and-hypertree-width-3/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/threshold-treewidth-and-hypertree-width-3/</guid><description/></item><item><title>Turbocharging Heuristics for Weak Coloring Numbers</title><link>https://ac.tuwien.ac.at/publication/turbocharging-heuristics-for-weak-coloring-numbers/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/turbocharging-heuristics-for-weak-coloring-numbers/</guid><description/></item><item><title>Threshold Treewidth and Hypertree Width</title><link>https://ac.tuwien.ac.at/publication/threshold-treewidth-and-hypertree-width-2/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/threshold-treewidth-and-hypertree-width-2/</guid><description/></item><item><title>Threshold Treewidth and Hypertree Width</title><link>https://ac.tuwien.ac.at/publication/threshold-treewidth-and-hypertree-width/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/threshold-treewidth-and-hypertree-width/</guid><description/></item></channel></rss>