<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Cornelius Brand | AC Group | TU Wien</title><link>https://ac.tuwien.ac.at/team/cornelius-brand/</link><atom:link href="https://ac.tuwien.ac.at/team/cornelius-brand/index.xml" rel="self" type="application/rss+xml"/><description>Cornelius Brand</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.tuwien.ac.at/media/logo_hu10234977157890132473.png</url><title>Cornelius Brand</title><link>https://ac.tuwien.ac.at/team/cornelius-brand/</link></image><item><title>A Structural Complexity Analysis of Hierarchical Task Network Planning</title><link>https://ac.tuwien.ac.at/publication/a-structural-complexity-analysis-of-hierarchical-task-network-planning/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-structural-complexity-analysis-of-hierarchical-task-network-planning/</guid><description/></item><item><title>The complexity of optimizing atomic congestion</title><link>https://ac.tuwien.ac.at/publication/the-complexity-of-optimizing-atomic-congestion-2/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-complexity-of-optimizing-atomic-congestion-2/</guid><description/></item><item><title>Counting Vanishing Matrix-Vector Products</title><link>https://ac.tuwien.ac.at/publication/counting-vanishing-matrix-vector-products/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/counting-vanishing-matrix-vector-products/</guid><description/></item><item><title>Fixed-Parameter Algorithms for Computing Bend-Restricted RAC Drawings of Graphs</title><link>https://ac.tuwien.ac.at/publication/fixed-parameter-algorithms-for-computing-bend-restricted-rac-drawings-of-graphs/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/fixed-parameter-algorithms-for-computing-bend-restricted-rac-drawings-of-graphs/</guid><description/></item><item><title>The Complexity of Optimizing Atomic Congestion</title><link>https://ac.tuwien.ac.at/publication/the-complexity-of-optimizing-atomic-congestion/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-complexity-of-optimizing-atomic-congestion/</guid><description/></item><item><title>A Parameterized Theory of PAC Learning</title><link>https://ac.tuwien.ac.at/publication/a-parameterized-theory-of-pac-learning/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-parameterized-theory-of-pac-learning/</guid><description/></item><item><title>A Polyhedral Perspective on Tropical Convolutions</title><link>https://ac.tuwien.ac.at/publication/a-polyhedral-perspective-on-tropical-convolutions/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-polyhedral-perspective-on-tropical-convolutions/</guid><description/></item><item><title>Deterministic Constrained Multilinear Detection</title><link>https://ac.tuwien.ac.at/publication/deterministic-constrained-multilinear-detection/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/deterministic-constrained-multilinear-detection/</guid><description/></item><item><title>Fast Convolutions for Near-Convex Sequences</title><link>https://ac.tuwien.ac.at/publication/fast-convolutions-for-near-convex-sequences/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/fast-convolutions-for-near-convex-sequences/</guid><description/></item><item><title>Fixed-Parameter Algorithms for Computing RAC Drawings of Graphs</title><link>https://ac.tuwien.ac.at/publication/fixed-parameter-algorithms-for-computing-rac-drawings-of-graphs/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/fixed-parameter-algorithms-for-computing-rac-drawings-of-graphs/</guid><description/></item><item><title>New Complexity-Theoretic Frontiers of Tractability for Neural Network Training</title><link>https://ac.tuwien.ac.at/publication/new-complexity-theoretic-frontiers-of-tractability-for-neural-network-training/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/new-complexity-theoretic-frontiers-of-tractability-for-neural-network-training/</guid><description/></item><item><title>Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts</title><link>https://ac.tuwien.ac.at/publication/edge-cut-width-an-algorithmically-driven-analogue-of-treewidth-based-on-edge-cuts/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/edge-cut-width-an-algorithmically-driven-analogue-of-treewidth-based-on-edge-cuts/</guid><description/></item></channel></rss>