<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Robert Ganian | AC Group | TU Wien</title><link>https://ac.tuwien.ac.at/team/robert-ganian/</link><atom:link href="https://ac.tuwien.ac.at/team/robert-ganian/index.xml" rel="self" type="application/rss+xml"/><description>Robert Ganian</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/robert-ganian/avatar_hu18159238656431242719.jpg</url><title>Robert Ganian</title><link>https://ac.tuwien.ac.at/team/robert-ganian/</link></image><item><title>FWF Cluster of Excellence: Bilateral Artificial Intelligence</title><link>https://ac.tuwien.ac.at/project/fwf-cluster-of-excellence-bilateral-artificial-intelligence/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/project/fwf-cluster-of-excellence-bilateral-artificial-intelligence/</guid><description>&lt;p>&lt;strong>&lt;a href="https://www.fwf.ac.at/en/research-radar/10.55776/COE12" target="_blank" rel="noopener">🌐 Visit the official FWF Project Radar Page&lt;/a>&lt;/strong>&lt;/p>
&lt;p>The project Bilateral AI aims at lifting artificial intelligence (AI) to the next level. Current AI systems are in a sense narrow. They center on a specific application or task such as object or speech recognition. Our project will combine two of the most important types of AI which have been developed separately so far: symbolic and sub-symbolic AI. While symbolic AI works with clearly defined logical rules, sub-symbolic AI (such as ChatGPT) is based on training a machine with the help of large datasets to create intelligent behavior. This integration, resulting in a Broad AI, is intended to mirror something that humans do naturally: the simultaneous use of cognition and reasoning skills. But what exactly is Broad AI? As opposed to Narrow AI, which is characterized by task specific skills, Broad AI aims at solving a wide array of problems, rather than being limited to a single task or domain. By combining sub-symbolic AI (machine learning, ML) with symbolic AI (knowledge representation and reasoning, KRR), Bilateral AI provides the means to develop the foundations of the capabilities and skill acquisition for problem solving by a Broad AI. Harnessing the full potential of both symbolic and sub-symbolic approaches can open new avenues for AI that are better at solving new problems, adapting to a wide variety of environments, having better reasoning skills, and being more efficient in terms of both computation and data use. These key features allow for a vast range of use cases for Broad AI, starting with drug development and medicine, over planning and scheduling, to autonomous traffic management and recommendation systems. With fairness, transparency, and explainability as top priorities, developing Broad AI is also essential for addressing ethical concerns and ensuring a positive impact on our society. These concerns play a central role as cross-cutting aspect in our project. The Broad AI resulting from the bilateral AI approach would use its own sensory perceptions to perform abstractions and engage in a logical thinking process. The AI could then, for example, organize a trip, minimize carbon emissions, or renovate a house as cost- effectively and ecologically as possible. In other words, AI could perform complex planning taking all aspects into account. Sepp Hochreiter, Director of Research: Broad AI could potentially improve our everyday lives as well as system-relevant aspects and processes - such as energy, transportation and healthcare - by becoming more environmentally sustainable, efficient and resource-friendly.&lt;/p></description></item><item><title>Parameterized Graph Drawing</title><link>https://ac.tuwien.ac.at/project/parameterized-graph-drawing/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/project/parameterized-graph-drawing/</guid><description>&lt;ul>
&lt;li>Funding organization: &lt;a href="https://www.wwtf.at/wwtf/" target="_blank" rel="noopener">Vienna Science and Technology Fund&lt;/a>, WWTF&lt;/li>
&lt;li>Project number: ICT22-029 (&lt;a href="https://www.wwtf.at/funding/programmes/ict/#ICT22" target="_blank" rel="noopener">Information and Communication Technology 2022&lt;/a>)&lt;/li>
&lt;/ul>
&lt;h2 id="project-team">Project Team&lt;/h2>
&lt;p>&lt;a href="https://ac.tuwien.ac.at/team/robert-ganian/">Robert Ganian&lt;/a> (Principal Investigator)&lt;/p>
&lt;p>&lt;a href="https://ac.tuwien.ac.at/team/martin-nollenburg/">Martin Nöllenburg&lt;/a> (Principal Investigator)&lt;/p>
&lt;p>&lt;a href="https://ac.tuwien.ac.at/team/simon-dominik-fink/">Simon Dominik Fink&lt;/a> (Postdoctoral Researcher)&lt;/p>
&lt;p>&lt;a href="https://ac.tuwien.ac.at/team/thomas-depian/">Thomas Depian&lt;/a> (PhD Student)&lt;/p>
&lt;p>&lt;a href="https://ac.tuwien.ac.at/team/alexander-firbas/">Alexander Firbas&lt;/a> (PhD Student)&lt;/p>
&lt;p>
&lt;figure >
&lt;div class="d-flex justify-content-center">
&lt;div class="w-100" >&lt;img alt="The Project Team" srcset="
/project/parameterized-graph-drawing/PGD-Group-scaled_hu17816735023089785297.webp 400w,
/project/parameterized-graph-drawing/PGD-Group-scaled_hu17537728813777461662.webp 760w,
/project/parameterized-graph-drawing/PGD-Group-scaled_hu10296446682098410735.webp 1200w"
src="https://ac.tuwien.ac.at/project/parameterized-graph-drawing/PGD-Group-scaled_hu17816735023089785297.webp"
width="760"
height="507"
loading="lazy" data-zoomable />&lt;/div>
&lt;/div>&lt;/figure>
&lt;/p>
&lt;h2 id="heading">&lt;/h2>
&lt;h2 id="research-statement">Research Statement&lt;/h2>
&lt;p>The project is centered around two well-established fields of information and communication technology: (1) graph drawing and visualization, which deals with the construction and analysis of geometric representations of graphs and networks subject to specific layout conventions, and (2) parameterized complexity analysis, which offers the tools to design efficient algorithms as well as lower bounds custom-tailored to the specific structural properties of relevant inputs. Recent advances have highlighted the huge potential for the application of parameterized techniques on graph drawing and visualization problems. The two PIs of this proposal – Robert Ganian and Martin Nöllenburg – have already spearheaded an initial push to bring the two fields closer together, and this proposal will allow them to bring these efforts into fruition by targeting and resolving some of the most prominent questions in this intersection.&lt;/p>
&lt;p>The project focuses on developing the tools and frameworks that will facilitate the parameterized analysis of central problems in graph drawing and visualization. The work is split into four fundamental themes, covering Extension Problems, Linear and Layered Layouts, Geometric Graph Representations and Bridges to Network Visualization. The output of each theme will include not only new algorithms but also tight lower bounds and, where relevant, implementations, significantly advancing the state of the art in these increasingly prominent fields of research.&lt;/p></description></item><item><title>A Fixed-Parameter Algorithm for Extending Upward Planar Drawings</title><link>https://ac.tuwien.ac.at/publication/a-fixed-parameter-algorithm-for-extending-upward-planar-drawings/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-fixed-parameter-algorithm-for-extending-upward-planar-drawings/</guid><description/></item><item><title>A Parameterized-Complexity Framework for Finding Local Optima</title><link>https://ac.tuwien.ac.at/publication/a-parameterized-complexity-framework-for-finding-local-optima/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-parameterized-complexity-framework-for-finding-local-optima/</guid><description/></item><item><title>A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphs</title><link>https://ac.tuwien.ac.at/publication/a-quasi-polynomial-time-algorithm-for-3-coloring-circle-graphs/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-quasi-polynomial-time-algorithm-for-3-coloring-circle-graphs/</guid><description/></item><item><title>A structural complexity analysis of synchronous dynamical systems</title><link>https://ac.tuwien.ac.at/publication/a-structural-complexity-analysis-of-synchronous-dynamical-systems-2/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-structural-complexity-analysis-of-synchronous-dynamical-systems-2/</guid><description/></item><item><title>Bilateral Treewidth for QBF: Where Strategies and Resolution Meet</title><link>https://ac.tuwien.ac.at/publication/bilateral-treewidth-for-qbf-where-strategies-and-resolution-meet/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/bilateral-treewidth-for-qbf-where-strategies-and-resolution-meet/</guid><description/></item><item><title>Circle Graph 3-Coloring: Can Simplicity Beat SAT?</title><link>https://ac.tuwien.ac.at/publication/circle-graph-3-coloring-can-simplicity-beat-sat/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/circle-graph-3-coloring-can-simplicity-beat-sat/</guid><description/></item><item><title>Computing Twin-Width via Treedepth and Vertex Integrity</title><link>https://ac.tuwien.ac.at/publication/computing-twin-width-via-treedepth-and-vertex-integrity/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/computing-twin-width-via-treedepth-and-vertex-integrity/</guid><description/></item><item><title>Coordinated Motion Planning Is FPT on Discretized Simple Polygons</title><link>https://ac.tuwien.ac.at/publication/coordinated-motion-planning-is-fpt-on-discretized-simple-polygons/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/coordinated-motion-planning-is-fpt-on-discretized-simple-polygons/</guid><description/></item><item><title>Fair Correlation Clustering Meets Graph Parameters</title><link>https://ac.tuwien.ac.at/publication/fair-correlation-clustering-meets-graph-parameters/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/fair-correlation-clustering-meets-graph-parameters/</guid><description/></item><item><title>Fine-Grained Complexity of Computing Degree-Constrained Spanning Trees</title><link>https://ac.tuwien.ac.at/publication/fine-grained-complexity-of-computing-degree-constrained-spanning-trees/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/fine-grained-complexity-of-computing-degree-constrained-spanning-trees/</guid><description/></item><item><title>From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem</title><link>https://ac.tuwien.ac.at/publication/from-data-completion-to-problems-on-hypercubes-a-parameterized-analysis-of-the-independent-set-problem-2/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/from-data-completion-to-problems-on-hypercubes-a-parameterized-analysis-of-the-independent-set-problem-2/</guid><description/></item><item><title>Gateways to Tractability for Satisfiability in Pearl’s Causal Hierarchy</title><link>https://ac.tuwien.ac.at/publication/gateways-to-tractability-for-satisfiability-in-pearls-causal-hierarchy/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/gateways-to-tractability-for-satisfiability-in-pearls-causal-hierarchy/</guid><description/></item><item><title>Makespan Minimization in Split Learning: From Theory to Practice</title><link>https://ac.tuwien.ac.at/publication/makespan-minimization-in-split-learning-from-theory-to-practice/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/makespan-minimization-in-split-learning-from-theory-to-practice/</guid><description/></item><item><title>Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity</title><link>https://ac.tuwien.ac.at/publication/matrix-editing-meets-fair-clustering-parameterized-algorithms-and-complexity/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/matrix-editing-meets-fair-clustering-parameterized-algorithms-and-complexity/</guid><description/></item><item><title>Not All Degree Constraints Are Created Equal when Computing Spanning Trees</title><link>https://ac.tuwien.ac.at/publication/not-all-degree-constraints-are-created-equal-when-computing-spanning-trees/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/not-all-degree-constraints-are-created-equal-when-computing-spanning-trees/</guid><description/></item><item><title>Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy</title><link>https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-coordinated-motion-planning-minimizing-energy-2/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-coordinated-motion-planning-minimizing-energy-2/</guid><description/></item><item><title>Parameterized Complexity of Efficient Sortation</title><link>https://ac.tuwien.ac.at/publication/parameterized-complexity-of-efficient-sortation/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/parameterized-complexity-of-efficient-sortation/</guid><description/></item><item><title>Perfect Rectangular Tilings with Two Colors</title><link>https://ac.tuwien.ac.at/publication/perfect-rectangular-tilings-with-two-colors/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/perfect-rectangular-tilings-with-two-colors/</guid><description/></item><item><title>Routing few robots in a crowded network</title><link>https://ac.tuwien.ac.at/publication/routing-few-robots-in-a-crowded-network-2/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/routing-few-robots-in-a-crowded-network-2/</guid><description/></item><item><title>The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern</title><link>https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-ordering-a-graph-while-avoiding-a-forbidden-pattern-2/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-ordering-a-graph-while-avoiding-a-forbidden-pattern-2/</guid><description/></item><item><title>The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern</title><link>https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-ordering-a-graph-while-avoiding-a-forbidden-pattern/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-ordering-a-graph-while-avoiding-a-forbidden-pattern/</guid><description/></item><item><title>The Complexity of Envy-Free Graph Cutting</title><link>https://ac.tuwien.ac.at/publication/the-complexity-of-envy-free-graph-cutting-2/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-complexity-of-envy-free-graph-cutting-2/</guid><description/></item><item><title>The Complexity of Extending Fair Allocations of Indivisible Goods</title><link>https://ac.tuwien.ac.at/publication/the-complexity-of-extending-fair-allocations-of-indivisible-goods-2/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-complexity-of-extending-fair-allocations-of-indivisible-goods-2/</guid><description/></item><item><title>The Parameterized Complexity of Coordinated Motion Planning</title><link>https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-coordinated-motion-planning-2/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-coordinated-motion-planning-2/</guid><description/></item><item><title>The Parameterized Complexity Of Extending Stack Layouts</title><link>https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-extending-stack-layouts-2/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-extending-stack-layouts-2/</guid><description/></item><item><title>The Peculiarities of Extending Queue Layouts</title><link>https://ac.tuwien.ac.at/publication/the-peculiarities-of-extending-queue-layouts/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-peculiarities-of-extending-queue-layouts/</guid><description/></item><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>Two-Layer Drawings with a Tree on Top: Vertex Splits and Fixed-Parameter Algorithms</title><link>https://ac.tuwien.ac.at/publication/two-layer-drawings-with-a-tree-on-top-vertex-splits-and-fixed-parameter-algorithms-2/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/two-layer-drawings-with-a-tree-on-top-vertex-splits-and-fixed-parameter-algorithms-2/</guid><description/></item><item><title>Two-Layer Drawings with a Tree on Top: Vertex Splits and Fixed-Parameter Algorithms</title><link>https://ac.tuwien.ac.at/publication/two-layer-drawings-with-a-tree-on-top-vertex-splits-and-fixed-parameter-algorithms/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/two-layer-drawings-with-a-tree-on-top-vertex-splits-and-fixed-parameter-algorithms/</guid><description/></item><item><title>A Minor-Testing Approach for Coordinated Motion Planning with Sliding Robots</title><link>https://ac.tuwien.ac.at/publication/a-minor-testing-approach-for-coordinated-motion-planning-with-sliding-robots/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-minor-testing-approach-for-coordinated-motion-planning-with-sliding-robots/</guid><description/></item><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>Approximate Evaluation of Quantitative Second Order Queries</title><link>https://ac.tuwien.ac.at/publication/approximate-evaluation-of-quantitative-second-order-queries/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/approximate-evaluation-of-quantitative-second-order-queries/</guid><description/></item><item><title>Computing Twin-Width Parameterized by the Feedback Edge Number and Vertex Integrity</title><link>https://ac.tuwien.ac.at/publication/computing-twin-width-parameterized-by-the-feedback-edge-number-and-vertex-integrity/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/computing-twin-width-parameterized-by-the-feedback-edge-number-and-vertex-integrity/</guid><description/></item><item><title>Crossing and Independent Families Among Polygons</title><link>https://ac.tuwien.ac.at/publication/crossing-and-independent-families-among-polygons/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/crossing-and-independent-families-among-polygons/</guid><description/></item><item><title>Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms</title><link>https://ac.tuwien.ac.at/publication/linear-layouts-revisited-stacks-queues-and-exact-algorithms/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/linear-layouts-revisited-stacks-queues-and-exact-algorithms/</guid><description/></item><item><title>Parameterized Algorithms for Multiagent Pathfinding on Trees</title><link>https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-multiagent-pathfinding-on-trees/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-multiagent-pathfinding-on-trees/</guid><description/></item><item><title>Parameterized Complexity in Machine Learning</title><link>https://ac.tuwien.ac.at/publication/parameterized-complexity-in-machine-learning/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/parameterized-complexity-in-machine-learning/</guid><description/></item><item><title>Parameterized Complexity of Caching in Networks</title><link>https://ac.tuwien.ac.at/publication/parameterized-complexity-of-caching-in-networks/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/parameterized-complexity-of-caching-in-networks/</guid><description/></item><item><title>Partial Level Planarity Parameterized by the Size of the Missing Graph</title><link>https://ac.tuwien.ac.at/publication/partial-level-planarity-parameterized-by-the-size-of-the-missing-graph/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/partial-level-planarity-parameterized-by-the-size-of-the-missing-graph/</guid><description/></item><item><title>Pathways to Tractability for Geometric Thickness</title><link>https://ac.tuwien.ac.at/publication/pathways-to-tractability-for-geometric-thickness/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/pathways-to-tractability-for-geometric-thickness/</guid><description/></item><item><title>Pathways to Tractability for Geometric Thickness (Best Paper Award)</title><link>https://ac.tuwien.ac.at/publication/pathways-to-tractability-for-geometric-thickness-best-paper-award/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/pathways-to-tractability-for-geometric-thickness-best-paper-award/</guid><description/></item><item><title>Routing Few Robots in a Crowded Network</title><link>https://ac.tuwien.ac.at/publication/routing-few-robots-in-a-crowded-network/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/routing-few-robots-in-a-crowded-network/</guid><description/></item><item><title>Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth</title><link>https://ac.tuwien.ac.at/publication/space-efficient-parameterized-algorithms-on-graphs-of-low-shrubdepth/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/space-efficient-parameterized-algorithms-on-graphs-of-low-shrubdepth/</guid><description/></item><item><title>Structural Parameterizations of Simultaneous Planarity</title><link>https://ac.tuwien.ac.at/publication/structural-parameterizations-of-simultaneous-planarity/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/structural-parameterizations-of-simultaneous-planarity/</guid><description/></item><item><title>The Complexity of Extending Fair Allocations of Indivisible Goods</title><link>https://ac.tuwien.ac.at/publication/the-complexity-of-extending-fair-allocations-of-indivisible-goods/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-complexity-of-extending-fair-allocations-of-indivisible-goods/</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>The Computational Complexity of Positive Non-Clashing Teaching in Graphs</title><link>https://ac.tuwien.ac.at/publication/the-computational-complexity-of-positive-non-clashing-teaching-in-graphs/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-computational-complexity-of-positive-non-clashing-teaching-in-graphs/</guid><description/></item><item><title>The Peculiarities of Extending Queue Layouts</title><link>https://ac.tuwien.ac.at/publication/the-peculiarities-of-extending-queue-layouts-2/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-peculiarities-of-extending-queue-layouts-2/</guid><description/></item><item><title>Training One-Dimensional Graph Neural Networks is NP-Hard</title><link>https://ac.tuwien.ac.at/publication/training-one-dimensional-graph-neural-networks-is-np-hard/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/training-one-dimensional-graph-neural-networks-is-np-hard/</guid><description/></item><item><title>A Tight Subexponential-Time Algorithm for Two-Page Book Embedding</title><link>https://ac.tuwien.ac.at/publication/a-tight-subexponential-time-algorithm-for-two-page-book-embedding/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-tight-subexponential-time-algorithm-for-two-page-book-embedding/</guid><description/></item><item><title>Bounding and Computing Obstacle Numbers of Graphs</title><link>https://ac.tuwien.ac.at/publication/bounding-and-computing-obstacle-numbers-of-graphs-2/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/bounding-and-computing-obstacle-numbers-of-graphs-2/</guid><description/></item><item><title>Computing Twin-Width Parameterized by the Feedback Edge Number</title><link>https://ac.tuwien.ac.at/publication/computing-twin-width-parameterized-by-the-feedback-edge-number/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/computing-twin-width-parameterized-by-the-feedback-edge-number/</guid><description/></item><item><title>Exact Algorithms for Clustered Planarity with Linear Saturators</title><link>https://ac.tuwien.ac.at/publication/exact-algorithms-for-clustered-planarity-with-linear-saturators/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/exact-algorithms-for-clustered-planarity-with-linear-saturators/</guid><description/></item><item><title>Exploiting New Types of Structure for Fixed Parameter Tractability</title><link>https://ac.tuwien.ac.at/project/1828-2/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/project/1828-2/</guid><description>&lt;p>Funding Organisation: &lt;a href="http://www.fwf.ac.at" target="_blank" rel="noopener">The Austrian Science Funds&lt;/a>, FWF&lt;br>
Project Number: &lt;a href="http://pf.fwf.ac.at/de/wissenschaft-konkret/project-finder/32105" target="_blank" rel="noopener">FWF P26696&lt;/a>&lt;/p>
&lt;h2 id="project-team">Project Team&lt;/h2>
&lt;ul>
&lt;li>Eduard Eiben&lt;/li>
&lt;li>&lt;a href="https://ac.tuwien.ac.at/team/robert-ganian/">Robert Ganian&lt;/a>&lt;/li>
&lt;li>Ramanujan Sridharan&lt;/li>
&lt;li>&lt;a href="https://ac.tuwien.ac.at/team/stefan-szeider/">Stefan Szeider&lt;/a> (Principal Investigator)&lt;/li>
&lt;/ul>
&lt;h2 id="topic">Topic&lt;/h2>
&lt;p>Many important computational problems are intractable on general instances. However, realistic problem instances often contain a certain hidden structure that can be exploited to solve the problem efficiently. Such instances form a tractable class (or an island of tractability). Previous research has identified a large number of tractable classes for various NP-hard problems.&lt;/p>
&lt;p>The aim of this project is to develop a rigorous framework for exploiting new kinds of structure on a wide range of problem inputs; in particular, this framework will be based on the established notion of a modulator to a tractable class of instances, which applies to problem instances that may be placed in a tractable class by a small number of local changes. The type of structure exploited by algorithms developed within the proposed research is fundamentally different from the structure exploited by known state-of-the-art approaches. This will allow us to handle natural instances where all presently known state-of-the-art approaches remain unfeasible.&lt;/p></description></item><item><title>Extending Orthogonal Planar Graph Drawings is Fixed-parameter Tractable</title><link>https://ac.tuwien.ac.at/publication/extending-orthogonal-planar-graph-drawings-is-fixed-parameter-tractable-2/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/extending-orthogonal-planar-graph-drawings-is-fixed-parameter-tractable-2/</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>Graphs with at most two moplexes</title><link>https://ac.tuwien.ac.at/publication/graphs-with-at-most-two-moplexes/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/graphs-with-at-most-two-moplexes/</guid><description/></item><item><title>Minimizing Switches in Cased Graph Drawings</title><link>https://ac.tuwien.ac.at/publication/minimizing-switches-in-cased-graph-drawings/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/minimizing-switches-in-cased-graph-drawings/</guid><description/></item><item><title>New Frontiers for Parameterized Complexity</title><link>https://ac.tuwien.ac.at/project/new-frontiers-for-parameterized-complexity/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/project/new-frontiers-for-parameterized-complexity/</guid><description>&lt;p>Funding Organisation: &lt;a href="http://www.fwf.ac.at" target="_blank" rel="noopener">The Austrian Science Fund&lt;/a>, FWF&lt;br>
Duration: 1 September 2018 – 31 August 2022&lt;br>
Project Number: &lt;a href="https://pf.fwf.ac.at/de/wissenschaft-konkret/project-finder/43598" target="_blank" rel="noopener">FWF P 31336&lt;/a>&lt;/p>
&lt;h2 id="project-team">Project Team&lt;/h2>
&lt;ul>
&lt;li>&lt;a href="https://ac.tuwien.ac.at/team/robert-ganian/">Robert Ganian&lt;/a> (Principal Investigator)&lt;/li>
&lt;li>Thekla Hamm&lt;/li>
&lt;li>Kirill Simonov&lt;/li>
&lt;li>Viktoriia Korchemna&lt;/li>
&lt;/ul>
&lt;h2 id="research-statement">Research Statement&lt;/h2>
&lt;p>Many important computational problems are intractable on general instances. However, realistic problem instances often contain a certain hidden structure that can be exploited to solve the problem efficiently. The parameterized complexity paradigm provides the perfect tools and techniques to formalize, quantify and exploit various forms of structure in order to efficiently solve a plethora of NP-hard problems. This paradigm has been applied in many fundamental areas of computer science with great success, including graph algorithms, computational logic, boolean satisfiability, constraint satisfaction and others. However, there are prominent areas of computer science where we still lack a thorough understanding of the parameterized complexity of key computational problems.&lt;/p>
&lt;p>This project aims at investigating the parameterized complexity of fundamental problems in two such high-impact areas: integer linear programming and machine learning. The obtained results will allow the design of efficient algorithms capable of exploiting various natural forms of structure in order to find exact solutions for NP-hard problems in these important areas of computer science. A secondary aim of the project is to apply newly obtained insights and advancements in other, including more traditional, frontiers of parameterized complexity research.&lt;/p></description></item><item><title>Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy</title><link>https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-coordinated-motion-planning-minimizing-energy/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-coordinated-motion-planning-minimizing-energy/</guid><description/></item><item><title>Parameterized Analysis in Artificial Intelligence</title><link>https://ac.tuwien.ac.at/project/parameterized-analysis-in-ai/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/project/parameterized-analysis-in-ai/</guid><description>&lt;ul>
&lt;li>Funding organization: &lt;a href="http://www.fwf.ac.at" target="_blank" rel="noopener">The Austrian Science Funds&lt;/a>, FWF&lt;/li>
&lt;li>Project number: &lt;a href="https://pf.fwf.ac.at/de/wissenschaft-konkret/project-finder/49217" target="_blank" rel="noopener">Y 1329 START-Programm&lt;/a> (ParAI)&lt;/li>
&lt;li>Grant DOI: &lt;a href="https://www.fwf.ac.at/en/research-radar/10.55776/Y1329" target="_blank" rel="noopener">10.55776/Y1329&lt;/a>&lt;/li>
&lt;/ul>
&lt;h2 id="project-team">Project Team&lt;/h2>
&lt;ul>
&lt;li>&lt;a href="https://ac.tuwien.ac.at/team/robert-ganian/">Robert Ganian&lt;/a>&lt;/li>
&lt;li>&lt;a href="https://ac.tuwien.ac.at/team/phuc-hung-hoang/">Phuc Hung Hoang&lt;/a>&lt;/li>
&lt;li>&lt;a href="https://ac.tuwien.ac.at/team/simon-wietheger/">Simon Wietheger&lt;/a>&lt;/li>
&lt;li>&lt;a href="https://ac.tuwien.ac.at/team/mathis-teva-rocton/">Mathis Teva Rocton&lt;/a>&lt;/li>
&lt;li>&lt;a href="https://ac.tuwien.ac.at/team/liana-khazaliya/">Liana Khazaliya&lt;/a>&lt;/li>
&lt;/ul>
&lt;p>
&lt;figure >
&lt;div class="d-flex justify-content-center">
&lt;div class="w-100" >&lt;img alt="Graphical Abstract" srcset="
/project/parameterized-analysis-in-ai/ganian_graphical_abstract_hu14537686416956763397.webp 400w,
/project/parameterized-analysis-in-ai/ganian_graphical_abstract_hu12894820465632160120.webp 760w,
/project/parameterized-analysis-in-ai/ganian_graphical_abstract_hu14200159767029673520.webp 1200w"
src="https://ac.tuwien.ac.at/project/parameterized-analysis-in-ai/ganian_graphical_abstract_hu14537686416956763397.webp"
width="760"
height="586"
loading="lazy" data-zoomable />&lt;/div>
&lt;/div>&lt;/figure>
&lt;/p>
&lt;p>&lt;em>Picture credits: Soeren Nickel, 2020&lt;/em>&lt;/p>
&lt;h2 id="research-statement">Research Statement&lt;/h2>
&lt;p>Parameterized complexity theory is a well-established paradigm used for the fine-grained analysis of computational problems. Such analysis can provide efficient algorithms for these problems by exploiting subtle structural properties of relevant inputs, as well as powerful lower bounds that rule out efficient algorithms even for severely restricted instances. Parameterized complexity analysis has found great success across numerous fields of computer science, with notable examples including graph algorithms, computational geometry, database theory, computational logic and constraint satisfaction. In the highly prominent fields of artificial intelligence (AI) and machine learning (ML) – areas which have become an ubiquitous part of today&amp;rsquo;s society – we see a distinct lack of foundational research targeting the fine-grained, parameterized complexity of fundamental problems. The goal of this six-year project is to change this.&lt;/p>
&lt;h2 id="a-parameterized-toolbox-for-problems-in-ai-and-ml">A Parameterized Toolbox for Problems in AI and ML&lt;/h2>
&lt;p>One main objective of this project is the development of new innovative tools and machinery that allows us to apply the parameterized complexity framework in this setting. Indeed, most of the existing tools developed in parameterized complexity theory are designed to work in the setting of discrete problems on graphs. On the other hand, many problems of interest in AI and ML do not admit straightforward graph representations and/or contain non-discrete components. The development of the required tools will then go hand in hand with obtaining new algorithms and matching lower bounds for the studied problems.&lt;/p></description></item><item><title>Revisiting Causal Discovery from a Complexity-Theoretic Perspective</title><link>https://ac.tuwien.ac.at/publication/revisiting-causal-discovery-from-a-complexity-theoretic-perspective/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/revisiting-causal-discovery-from-a-complexity-theoretic-perspective/</guid><description/></item><item><title>Slim Tree-Cut Width</title><link>https://ac.tuwien.ac.at/publication/slim-tree-cut-width-2/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/slim-tree-cut-width-2/</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>The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width</title><link>https://ac.tuwien.ac.at/publication/the-fine-grained-complexity-of-graph-homomorphism-parameterized-by-clique-width-2/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-fine-grained-complexity-of-graph-homomorphism-parameterized-by-clique-width-2/</guid><description/></item><item><title>The Parameterized Complexity Landscape of the Unsplittable Flow Problem</title><link>https://ac.tuwien.ac.at/publication/the-parameterized-complexity-landscape-of-the-unsplittable-flow-problem/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-parameterized-complexity-landscape-of-the-unsplittable-flow-problem/</guid><description/></item><item><title>The Parameterized Complexity of Extending Stack Layouts</title><link>https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-extending-stack-layouts/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-extending-stack-layouts/</guid><description/></item><item><title>The Parameterized Complexity Of Extending Stack Layouts</title><link>https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-extending-stack-layouts-3/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-extending-stack-layouts-3/</guid><description/></item><item><title>Twin-Width Meets Feedback Edges and Vertex Integrity</title><link>https://ac.tuwien.ac.at/publication/twin-width-meets-feedback-edges-and-vertex-integrity/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/twin-width-meets-feedback-edges-and-vertex-integrity/</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 Structural Complexity Analysis of Synchronous Dynamical Systems</title><link>https://ac.tuwien.ac.at/publication/a-structural-complexity-analysis-of-synchronous-dynamical-systems/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-structural-complexity-analysis-of-synchronous-dynamical-systems/</guid><description/></item><item><title>Consistency Checking Problems: A Gateway to Parameterized Sample Complexity</title><link>https://ac.tuwien.ac.at/publication/consistency-checking-problems-a-gateway-to-parameterized-sample-complexity/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/consistency-checking-problems-a-gateway-to-parameterized-sample-complexity/</guid><description/></item><item><title>Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable</title><link>https://ac.tuwien.ac.at/publication/extending-orthogonal-planar-graph-drawings-is-fixed-parameter-tractable/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/extending-orthogonal-planar-graph-drawings-is-fixed-parameter-tractable/</guid><description/></item><item><title>Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable</title><link>https://ac.tuwien.ac.at/publication/extending-orthogonal-planar-graph-drawings-is-fixed-parameter-tractable-3/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/extending-orthogonal-planar-graph-drawings-is-fixed-parameter-tractable-3/</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>From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem</title><link>https://ac.tuwien.ac.at/publication/from-data-completion-to-problems-on-hypercubes-a-parameterized-analysis-of-the-independent-set-problem/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/from-data-completion-to-problems-on-hypercubes-a-parameterized-analysis-of-the-independent-set-problem/</guid><description/></item><item><title>Group Activity Selection with Few Agent Types</title><link>https://ac.tuwien.ac.at/publication/group-activity-selection-with-few-agent-types/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/group-activity-selection-with-few-agent-types/</guid><description/></item><item><title>Hedonic diversity games: A complexity picture with more than two colors</title><link>https://ac.tuwien.ac.at/publication/hedonic-diversity-games-a-complexity-picture-with-more-than-two-colors-2/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/hedonic-diversity-games-a-complexity-picture-with-more-than-two-colors-2/</guid><description/></item><item><title>Maximizing Social Welfare in Score-Based Social Distance Games</title><link>https://ac.tuwien.ac.at/publication/maximizing-social-welfare-in-score-based-social-distance-games/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/maximizing-social-welfare-in-score-based-social-distance-games/</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>New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162)</title><link>https://ac.tuwien.ac.at/publication/new-frontiers-of-parameterized-complexity-in-graph-drawing-dagstuhl-seminar-23162/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/new-frontiers-of-parameterized-complexity-in-graph-drawing-dagstuhl-seminar-23162/</guid><description/></item><item><title>On the parameterized complexity of clustering problems for incomplete data</title><link>https://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-clustering-problems-for-incomplete-data/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-clustering-problems-for-incomplete-data/</guid><description/></item><item><title>Parameterized complexity of envy-free resource allocation in social networks</title><link>https://ac.tuwien.ac.at/publication/parameterized-complexity-of-envy-free-resource-allocation-in-social-networks-2/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/parameterized-complexity-of-envy-free-resource-allocation-in-social-networks-2/</guid><description/></item><item><title>Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth</title><link>https://ac.tuwien.ac.at/publication/space-efficient-parameterized-algorithms-on-graphs-of-low-shrubdepth-2/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/space-efficient-parameterized-algorithms-on-graphs-of-low-shrubdepth-2/</guid><description/></item><item><title>Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF</title><link>https://ac.tuwien.ac.at/publication/structure-aware-lower-bounds-and-broadening-the-horizon-of-tractability-for-qbf/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/structure-aware-lower-bounds-and-broadening-the-horizon-of-tractability-for-qbf/</guid><description/></item><item><title>The Computational Complexity of Concise Hypersphere Classification</title><link>https://ac.tuwien.ac.at/publication/the-computational-complexity-of-concise-hypersphere-classification/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-computational-complexity-of-concise-hypersphere-classification/</guid><description/></item><item><title>The Parameterized Complexity of Coordinated Motion Planning</title><link>https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-coordinated-motion-planning/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-coordinated-motion-planning/</guid><description/></item><item><title>The Parameterized Complexity of Network Microaggregation</title><link>https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-network-microaggregation/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-network-microaggregation/</guid><description/></item><item><title>Worbel: Aggregating Point Labels into Word Clouds</title><link>https://ac.tuwien.ac.at/publication/worbel-aggregating-point-labels-into-word-clouds-2/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/worbel-aggregating-point-labels-into-word-clouds-2/</guid><description/></item><item><title>A Unifying Framework for Characterizing and Computing Width Measures</title><link>https://ac.tuwien.ac.at/publication/a-unifying-framework-for-characterizing-and-computing-width-measures/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-unifying-framework-for-characterizing-and-computing-width-measures/</guid><description/></item><item><title>Algorithmic Applications of Tree-Cut Width</title><link>https://ac.tuwien.ac.at/publication/algorithmic-applications-of-tree-cut-width-2/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/algorithmic-applications-of-tree-cut-width-2/</guid><description/></item><item><title>An efficient algorithm for counting Markov equivalent DAGs</title><link>https://ac.tuwien.ac.at/publication/an-efficient-algorithm-for-counting-markov-equivalent-dags-2/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/an-efficient-algorithm-for-counting-markov-equivalent-dags-2/</guid><description/></item><item><title>Bounding and Computing Obstacle Numbers of Graphs</title><link>https://ac.tuwien.ac.at/publication/bounding-and-computing-obstacle-numbers-of-graphs/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/bounding-and-computing-obstacle-numbers-of-graphs/</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><item><title>Finding a Cluster in Incomplete Data</title><link>https://ac.tuwien.ac.at/publication/finding-a-cluster-in-incomplete-data/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/finding-a-cluster-in-incomplete-data/</guid><description/></item><item><title>Hedonic Diversity Games: A Complexity Picture with More than Two Colors</title><link>https://ac.tuwien.ac.at/publication/hedonic-diversity-games-a-complexity-picture-with-more-than-two-colors/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/hedonic-diversity-games-a-complexity-picture-with-more-than-two-colors/</guid><description/></item><item><title>On Covering Segments with Unit Intervals</title><link>https://ac.tuwien.ac.at/publication/on-covering-segments-with-unit-intervals-2/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/on-covering-segments-with-unit-intervals-2/</guid><description/></item><item><title>Parameterized Algorithms for Queue Layouts</title><link>https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-queue-layouts-3/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-queue-layouts-3/</guid><description/></item><item><title>Parameterized Algorithms for Queue Layouts</title><link>https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-queue-layouts/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-queue-layouts/</guid><description/></item><item><title>Parameterized Algorithms for Upward Planarity</title><link>https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-upward-planarity/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-upward-planarity/</guid><description/></item><item><title>Preface: 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, August 22-26, 2022, Vienna, Austria</title><link>https://ac.tuwien.ac.at/publication/preface-47th-international-symposium-on-mathematical-foundations-of-computer-science-mfcs-2022-august-22-26-2022-vienna-austria/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/preface-47th-international-symposium-on-mathematical-foundations-of-computer-science-mfcs-2022-august-22-26-2022-vienna-austria/</guid><description/></item><item><title>Preface: Ninth workshop on graph classes, optimization, and Width Parameters, Vienna, Austria</title><link>https://ac.tuwien.ac.at/publication/preface-ninth-workshop-on-graph-classes-optimization-and-width-parameters-vienna-austria/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/preface-ninth-workshop-on-graph-classes-optimization-and-width-parameters-vienna-austria/</guid><description/></item><item><title>Slim Tree-Cut Width</title><link>https://ac.tuwien.ac.at/publication/slim-tree-cut-width/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/slim-tree-cut-width/</guid><description/></item><item><title>Sum-of-Products with Default Values: Algorithms and Complexity Results</title><link>https://ac.tuwien.ac.at/publication/sum-of-products-with-default-values-algorithms-and-complexity-results-3/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/sum-of-products-with-default-values-algorithms-and-complexity-results-3/</guid><description/></item><item><title>Testing Upward Planarity of Partial 2-Trees</title><link>https://ac.tuwien.ac.at/publication/testing-upward-planarity-of-partial-2-trees/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/testing-upward-planarity-of-partial-2-trees/</guid><description/></item><item><title>The Complexity of Envy-Free Graph Cutting</title><link>https://ac.tuwien.ac.at/publication/the-complexity-of-envy-free-graph-cutting/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-complexity-of-envy-free-graph-cutting/</guid><description/></item><item><title>The Complexity of k-Means Clustering when Little is Known</title><link>https://ac.tuwien.ac.at/publication/the-complexity-of-k-means-clustering-when-little-is-known/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-complexity-of-k-means-clustering-when-little-is-known/</guid><description/></item><item><title>The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width</title><link>https://ac.tuwien.ac.at/publication/the-fine-grained-complexity-of-graph-homomorphism-parameterized-by-clique-width/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-fine-grained-complexity-of-graph-homomorphism-parameterized-by-clique-width/</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>Weighted Model Counting with Twin-Width</title><link>https://ac.tuwien.ac.at/publication/weighted-model-counting-with-twin-width/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/weighted-model-counting-with-twin-width/</guid><description/></item><item><title>Crossing-Optimal Extension of Simple Drawings</title><link>https://ac.tuwien.ac.at/publication/crossing-optimal-extension-of-simple-drawings/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/crossing-optimal-extension-of-simple-drawings/</guid><description/></item><item><title>Graphs with two moplexes</title><link>https://ac.tuwien.ac.at/publication/graphs-with-two-moplexes/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/graphs-with-two-moplexes/</guid><description/></item><item><title>Measuring what matters: A hybrid approach to dynamic programming with treewidth</title><link>https://ac.tuwien.ac.at/publication/measuring-what-matters-a-hybrid-approach-to-dynamic-programming-with-treewidth-2/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/measuring-what-matters-a-hybrid-approach-to-dynamic-programming-with-treewidth-2/</guid><description/></item><item><title>New Width Parameters for SAT and Sharp-SAT</title><link>https://ac.tuwien.ac.at/publication/new-width-parameters-for-sat-and-sharp-sat/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/new-width-parameters-for-sat-and-sharp-sat/</guid><description/></item><item><title>On Strict (Outer-)Confluent Graphs</title><link>https://ac.tuwien.ac.at/publication/on-strict-outer-confluent-graphs-3/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/on-strict-outer-confluent-graphs-3/</guid><description/></item><item><title>On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem</title><link>https://ac.tuwien.ac.at/publication/on-structural-parameterizations-of-the-bounded-degree-vertex-deletion-problem-2/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/on-structural-parameterizations-of-the-bounded-degree-vertex-deletion-problem-2/</guid><description/></item><item><title>On Structural Parameterizations of the Edge Disjoint Paths Problem</title><link>https://ac.tuwien.ac.at/publication/on-structural-parameterizations-of-the-edge-disjoint-paths-problem/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/on-structural-parameterizations-of-the-edge-disjoint-paths-problem/</guid><description/></item><item><title>Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293)</title><link>https://ac.tuwien.ac.at/publication/parameterized-complexity-in-graph-drawing-dagstuhl-seminar-21293/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/parameterized-complexity-in-graph-drawing-dagstuhl-seminar-21293/</guid><description/></item><item><title>The complexity landscape of decompositional parameters for ILP: Programs with Few Global Variables and Constraints</title><link>https://ac.tuwien.ac.at/publication/the-complexity-landscape-of-decompositional-parameters-for-ilp-programs-with-few-global-variables-and-constraints/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-complexity-landscape-of-decompositional-parameters-for-ilp-programs-with-few-global-variables-and-constraints/</guid><description/></item><item><title>The Complexity of Bayesian Network Learning: Revisiting the Superstructure</title><link>https://ac.tuwien.ac.at/publication/the-complexity-of-bayesian-network-learning-revisiting-the-superstructure/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-complexity-of-bayesian-network-learning-revisiting-the-superstructure/</guid><description/></item><item><title>The Complexity of Object Association in Multiple Object Tracking</title><link>https://ac.tuwien.ac.at/publication/the-complexity-of-object-association-in-multiple-object-tracking/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-complexity-of-object-association-in-multiple-object-tracking/</guid><description/></item><item><title>The Parameterized Complexity of Clustering Incomplete Data</title><link>https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-clustering-incomplete-data-2/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-clustering-incomplete-data-2/</guid><description/></item><item><title>The Parameterized Complexity of Clustering Incomplete Data</title><link>https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-clustering-incomplete-data/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-clustering-incomplete-data/</guid><description/></item><item><title>The Parameterized Complexity of Connected Fair Division</title><link>https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-connected-fair-division/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-connected-fair-division/</guid><description/></item><item><title>The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths</title><link>https://ac.tuwien.ac.at/publication/the-power-of-cut-based-parameters-for-computing-edge-disjoint-paths-2/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-power-of-cut-based-parameters-for-computing-edge-disjoint-paths-2/</guid><description/></item><item><title>Towards a Polynomial Kernel for Directed Feedback Vertex Set</title><link>https://ac.tuwien.ac.at/publication/towards-a-polynomial-kernel-for-directed-feedback-vertex-set-2/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/towards-a-polynomial-kernel-for-directed-feedback-vertex-set-2/</guid><description/></item><item><title>Worbel: Aggregating Point Labels into Word Clouds</title><link>https://ac.tuwien.ac.at/publication/worbel-aggregating-point-labels-into-word-clouds-3/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/worbel-aggregating-point-labels-into-word-clouds-3/</guid><description/></item><item><title>Worbel: Aggregating Point Labels into Word Clouds</title><link>https://ac.tuwien.ac.at/publication/worbel-aggregating-point-labels-into-word-clouds/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/worbel-aggregating-point-labels-into-word-clouds/</guid><description/></item><item><title>An Efficient Algorithm for Counting Markov Equivalent DAGs</title><link>https://ac.tuwien.ac.at/publication/an-efficient-algorithm-for-counting-markov-equivalent-dags/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/an-efficient-algorithm-for-counting-markov-equivalent-dags/</guid><description/></item><item><title>Extending Nearly Complete 1-Planar Drawings in Polynomial Time</title><link>https://ac.tuwien.ac.at/publication/extending-nearly-complete-1-planar-drawings-in-polynomial-time-2/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/extending-nearly-complete-1-planar-drawings-in-polynomial-time-2/</guid><description/></item><item><title>Extending Nearly Complete 1-Planar Drawings in Polynomial Time</title><link>https://ac.tuwien.ac.at/publication/extending-nearly-complete-1-planar-drawings-in-polynomial-time/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/extending-nearly-complete-1-planar-drawings-in-polynomial-time/</guid><description/></item><item><title>Extending Partial 1-Planar Drawings</title><link>https://ac.tuwien.ac.at/publication/extending-partial-1-planar-drawings-2/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/extending-partial-1-planar-drawings-2/</guid><description/></item><item><title>Extending Partial 1-Planar Drawings</title><link>https://ac.tuwien.ac.at/publication/extending-partial-1-planar-drawings/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/extending-partial-1-planar-drawings/</guid><description/></item><item><title>Fixed-Parameter Tractability of Dependency QBF with Structural Parameters</title><link>https://ac.tuwien.ac.at/publication/fixed-parameter-tractability-of-dependency-qbf-with-structural-parameters-2/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/fixed-parameter-tractability-of-dependency-qbf-with-structural-parameters-2/</guid><description/></item><item><title>Fixed-Parameter Tractability of Dependency QBF with Structural Parameters</title><link>https://ac.tuwien.ac.at/publication/fixed-parameter-tractability-of-dependency-qbf-with-structural-parameters/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/fixed-parameter-tractability-of-dependency-qbf-with-structural-parameters/</guid><description/></item><item><title>Foreword: Eighth Workshop on Graph Classes, Optimization, and Width Parameters, Toronto, Ontario, Canada</title><link>https://ac.tuwien.ac.at/publication/foreword-eighth-workshop-on-graph-classes-optimization-and-width-parameters-toronto-ontario-canada/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/foreword-eighth-workshop-on-graph-classes-optimization-and-width-parameters-toronto-ontario-canada/</guid><description/></item><item><title>On Covering Segments with Unit Intervals</title><link>https://ac.tuwien.ac.at/publication/on-covering-segments-with-unit-intervals/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/on-covering-segments-with-unit-intervals/</guid><description/></item><item><title>On Existential MSO and Its Relation to ETH</title><link>https://ac.tuwien.ac.at/publication/on-existential-mso-and-its-relation-to-eth/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/on-existential-mso-and-its-relation-to-eth/</guid><description/></item><item><title>On the Parameterized Complexity of Clustering</title><link>https://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-clustering/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-clustering/</guid><description/></item><item><title>On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank</title><link>https://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-clustering-incomplete-data-into-subspaces-of-small-rank/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-clustering-incomplete-data-into-subspaces-of-small-rank/</guid><description/></item><item><title>Parameterized Algorithms for Book Embedding Problems</title><link>https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-book-embedding-problems-2/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-book-embedding-problems-2/</guid><description/></item><item><title>Parameterized Algorithms for Queue Layouts</title><link>https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-queue-layouts-2/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-queue-layouts-2/</guid><description/></item><item><title>Parameterized Algorithms for Queue Layouts</title><link>https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-queue-layouts-4/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-queue-layouts-4/</guid><description/></item><item><title>Parameterized Complexity of Envy-Free Resource Allocation in Social Networks</title><link>https://ac.tuwien.ac.at/publication/parameterized-complexity-of-envy-free-resource-allocation-in-social-networks/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/parameterized-complexity-of-envy-free-resource-allocation-in-social-networks/</guid><description/></item><item><title>Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP</title><link>https://ac.tuwien.ac.at/publication/stable-matchings-with-diversity-constraints-affirmative-action-is-beyond-np/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/stable-matchings-with-diversity-constraints-affirmative-action-is-beyond-np/</guid><description/></item><item><title>The Complexity Landscape of Resource-Constrained Scheduling</title><link>https://ac.tuwien.ac.at/publication/the-complexity-landscape-of-resource-constrained-scheduling/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-complexity-landscape-of-resource-constrained-scheduling/</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><item><title>Using decomposition-parameters for QBF: Mind the prefix!</title><link>https://ac.tuwien.ac.at/publication/using-decomposition-parameters-for-qbf-mind-the-prefix-2/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/using-decomposition-parameters-for-qbf-mind-the-prefix-2/</guid><description/></item><item><title>A Join-Based Hybrid Parameter for Constraint Satisfaction</title><link>https://ac.tuwien.ac.at/publication/a-join-based-hybrid-parameter-for-constraint-satisfaction-2/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-join-based-hybrid-parameter-for-constraint-satisfaction-2/</guid><description/></item><item><title>A Join-Based Hybrid Parameter for Constraint Satisfaction</title><link>https://ac.tuwien.ac.at/publication/a-join-based-hybrid-parameter-for-constraint-satisfaction/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-join-based-hybrid-parameter-for-constraint-satisfaction/</guid><description/></item><item><title>Counting linear extensions: Parameterizations by treewidth</title><link>https://ac.tuwien.ac.at/publication/counting-linear-extensions-parameterizations-by-treewidth/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/counting-linear-extensions-parameterizations-by-treewidth/</guid><description/></item><item><title>Group Activity Selection with Few Agent Types</title><link>https://ac.tuwien.ac.at/publication/group-activity-selection-with-few-agent-types-2/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/group-activity-selection-with-few-agent-types-2/</guid><description/></item><item><title>Integer Programming and Incidence Treedepth</title><link>https://ac.tuwien.ac.at/publication/integer-programming-and-incidence-treedepth/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/integer-programming-and-incidence-treedepth/</guid><description/></item><item><title>Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth</title><link>https://ac.tuwien.ac.at/publication/measuring-what-matters-a-hybrid-approach-to-dynamic-programming-with-treewidth/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/measuring-what-matters-a-hybrid-approach-to-dynamic-programming-with-treewidth/</guid><description/></item><item><title>On Strict (Outer-)Confluent Graphs</title><link>https://ac.tuwien.ac.at/publication/on-strict-outer-confluent-graphs-2/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/on-strict-outer-confluent-graphs-2/</guid><description/></item><item><title>On Strict (Outer-)Confluent Graphs</title><link>https://ac.tuwien.ac.at/publication/on-strict-outer-confluent-graphs/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/on-strict-outer-confluent-graphs/</guid><description/></item><item><title>On the Complexity Landscape of Connected f-Factor Problems</title><link>https://ac.tuwien.ac.at/publication/on-the-complexity-landscape-of-connected-f-factor-problems/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/on-the-complexity-landscape-of-connected-f-factor-problems/</guid><description/></item><item><title>Parameterized Algorithms for Book Embedding Problems</title><link>https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-book-embedding-problems-3/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-book-embedding-problems-3/</guid><description/></item><item><title>Parameterized Algorithms for Book Embedding Problems</title><link>https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-book-embedding-problems/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-book-embedding-problems/</guid><description/></item><item><title>Parameterized Complexity of Asynchronous Border Minimization</title><link>https://ac.tuwien.ac.at/publication/parameterized-complexity-of-asynchronous-border-minimization-2/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/parameterized-complexity-of-asynchronous-border-minimization-2/</guid><description/></item><item><title>SAT-Encodings for Treecut Width and Treedepth</title><link>https://ac.tuwien.ac.at/publication/sat-encodings-for-treecut-width-and-treedepth-2/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/sat-encodings-for-treecut-width-and-treedepth-2/</guid><description/></item><item><title>SAT-Encodings for Treecut Width and Treedepth</title><link>https://ac.tuwien.ac.at/publication/sat-encodings-for-treecut-width-and-treedepth/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/sat-encodings-for-treecut-width-and-treedepth/</guid><description/></item><item><title>Shrub-Depth: Capturing Height of Dense Graphs</title><link>https://ac.tuwien.ac.at/publication/shrub-depth-capturing-height-of-dense-graphs/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/shrub-depth-capturing-height-of-dense-graphs/</guid><description/></item><item><title>Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions: A Survey</title><link>https://ac.tuwien.ac.at/publication/solving-integer-linear-programs-by-exploiting-variable-constraint-interactions-a-survey/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-integer-linear-programs-by-exploiting-variable-constraint-interactions-a-survey/</guid><description/></item><item><title>Solving integer quadratic programming via explicit and structural restrictions</title><link>https://ac.tuwien.ac.at/publication/solving-integer-quadratic-programming-via-explicit-and-structural-restrictions/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-integer-quadratic-programming-via-explicit-and-structural-restrictions/</guid><description/></item><item><title>The Parameterized Complexity of Cascading Portfolio Scheduling</title><link>https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-cascading-portfolio-scheduling-2/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-cascading-portfolio-scheduling-2/</guid><description/></item><item><title>The Parameterized Complexity of Cascading Portfolio Scheduling</title><link>https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-cascading-portfolio-scheduling/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-cascading-portfolio-scheduling/</guid><description/></item><item><title>The Power of Cut-Based Parameters for Computing Edge Disjoint Paths</title><link>https://ac.tuwien.ac.at/publication/the-power-of-cut-based-parameters-for-computing-edge-disjoint-paths/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-power-of-cut-based-parameters-for-computing-edge-disjoint-paths/</guid><description/></item><item><title>A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion</title><link>https://ac.tuwien.ac.at/publication/a-single-exponential-fixed-parameter-algorithm-for-distance-hereditary-vertex-deletion-2/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-single-exponential-fixed-parameter-algorithm-for-distance-hereditary-vertex-deletion-2/</guid><description/></item><item><title>A Structural Approach to Activity Selection</title><link>https://ac.tuwien.ac.at/publication/a-structural-approach-to-activity-selection/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-structural-approach-to-activity-selection/</guid><description/></item><item><title>Meta-kernelization using well-structured modulators</title><link>https://ac.tuwien.ac.at/publication/meta-kernelization-using-well-structured-modulators-2/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/meta-kernelization-using-well-structured-modulators-2/</guid><description/></item><item><title>On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem</title><link>https://ac.tuwien.ac.at/publication/on-structural-parameterizations-of-the-bounded-degree-vertex-deletion-problem/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/on-structural-parameterizations-of-the-bounded-degree-vertex-deletion-problem/</guid><description/></item><item><title>On the complexity of rainbow coloring problems</title><link>https://ac.tuwien.ac.at/publication/on-the-complexity-of-rainbow-coloring-problems-2/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/on-the-complexity-of-rainbow-coloring-problems-2/</guid><description/></item><item><title>Parameterized Algorithms for the Matrix Completion Problem</title><link>https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-the-matrix-completion-problem/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-the-matrix-completion-problem/</guid><description/></item><item><title>Small Resolution Proofs for QBF using Dependency Treewidth</title><link>https://ac.tuwien.ac.at/publication/small-resolution-proofs-for-qbf-using-dependency-treewidth/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/small-resolution-proofs-for-qbf-using-dependency-treewidth/</guid><description/></item><item><title>Solving Problems on Graphs of High Rank-Width</title><link>https://ac.tuwien.ac.at/publication/solving-problems-on-graphs-of-high-rank-width-2/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-problems-on-graphs-of-high-rank-width-2/</guid><description/></item><item><title>Sum-of-Products with Default Values: Algorithms and Complexity Results</title><link>https://ac.tuwien.ac.at/publication/sum-of-products-with-default-values-algorithms-and-complexity-results-2/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/sum-of-products-with-default-values-algorithms-and-complexity-results-2/</guid><description/></item><item><title>Sum-of-Products with Default Values: Algorithms and Complexity Results</title><link>https://ac.tuwien.ac.at/publication/sum-of-products-with-default-values-algorithms-and-complexity-results/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/sum-of-products-with-default-values-algorithms-and-complexity-results/</guid><description/></item><item><title>The complexity landscape of decompositional parameters for ILP</title><link>https://ac.tuwien.ac.at/publication/the-complexity-landscape-of-decompositional-parameters-for-ilp-2/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-complexity-landscape-of-decompositional-parameters-for-ilp-2/</guid><description/></item><item><title>Unary Integer Linear Programming with Structural Restrictions</title><link>https://ac.tuwien.ac.at/publication/unary-integer-linear-programming-with-structural-restrictions/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/unary-integer-linear-programming-with-structural-restrictions/</guid><description/></item><item><title>Backdoor Treewidth for SAT</title><link>https://ac.tuwien.ac.at/publication/backdoor-treewidth-for-sat-2/</link><pubDate>Sun, 01 Jan 2017 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/backdoor-treewidth-for-sat-2/</guid><description/></item><item><title>Backdoor Treewidth for SAT</title><link>https://ac.tuwien.ac.at/publication/backdoor-treewidth-for-sat/</link><pubDate>Sun, 01 Jan 2017 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/backdoor-treewidth-for-sat/</guid><description/></item><item><title>Combining Treewidth and Backdoors for CSP</title><link>https://ac.tuwien.ac.at/publication/combining-treewidth-and-backdoors-for-csp/</link><pubDate>Sun, 01 Jan 2017 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/combining-treewidth-and-backdoors-for-csp/</guid><description/></item><item><title>Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting</title><link>https://ac.tuwien.ac.at/publication/discovering-archipelagos-of-tractability-for-constraint-satisfaction-and-counting-2/</link><pubDate>Sun, 01 Jan 2017 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/discovering-archipelagos-of-tractability-for-constraint-satisfaction-and-counting-2/</guid><description/></item><item><title>Going Beyond Primal Treewidth for (M)ILP</title><link>https://ac.tuwien.ac.at/publication/going-beyond-primal-treewidth-for-m-ilp/</link><pubDate>Sun, 01 Jan 2017 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/going-beyond-primal-treewidth-for-m-ilp/</guid><description/></item><item><title>New Width Parameters for Model Counting</title><link>https://ac.tuwien.ac.at/publication/new-width-parameters-for-model-counting-2/</link><pubDate>Sun, 01 Jan 2017 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/new-width-parameters-for-model-counting-2/</guid><description/></item><item><title>New Width Parameters for Model Counting</title><link>https://ac.tuwien.ac.at/publication/new-width-parameters-for-model-counting/</link><pubDate>Sun, 01 Jan 2017 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/new-width-parameters-for-model-counting/</guid><description/></item><item><title>On Structural Parameterizations of the Edge Disjoint Paths Problem</title><link>https://ac.tuwien.ac.at/publication/on-structural-parameterizations-of-the-edge-disjoint-paths-problem-2/</link><pubDate>Sun, 01 Jan 2017 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/on-structural-parameterizations-of-the-edge-disjoint-paths-problem-2/</guid><description/></item><item><title>Solving Integer Linear Programs with a Small Number of Global Variables and Constraints</title><link>https://ac.tuwien.ac.at/publication/solving-integer-linear-programs-with-a-small-number-of-global-variables-and-constraints/</link><pubDate>Sun, 01 Jan 2017 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-integer-linear-programs-with-a-small-number-of-global-variables-and-constraints/</guid><description/></item><item><title>Towards a Polynomial Kernel for Directed Feedback Vertex Set</title><link>https://ac.tuwien.ac.at/publication/towards-a-polynomial-kernel-for-directed-feedback-vertex-set/</link><pubDate>Sun, 01 Jan 2017 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/towards-a-polynomial-kernel-for-directed-feedback-vertex-set/</guid><description/></item><item><title>A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion</title><link>https://ac.tuwien.ac.at/publication/a-single-exponential-fixed-parameter-algorithm-for-distance-hereditary-vertex-deletion/</link><pubDate>Fri, 01 Jan 2016 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-single-exponential-fixed-parameter-algorithm-for-distance-hereditary-vertex-deletion/</guid><description/></item><item><title>Are There Any Good Digraph Measures?</title><link>https://ac.tuwien.ac.at/publication/are-there-any-good-digraph-measures/</link><pubDate>Fri, 01 Jan 2016 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/are-there-any-good-digraph-measures/</guid><description/></item><item><title>Backdoors to Tractable Valued CSP</title><link>https://ac.tuwien.ac.at/publication/backdoors-to-tractable-valued-csp/</link><pubDate>Fri, 01 Jan 2016 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/backdoors-to-tractable-valued-csp/</guid><description/></item><item><title>Counting Linear Extensions: Parameterizations by Treewidth</title><link>https://ac.tuwien.ac.at/publication/counting-linear-extensions-parameterizations-by-treewidth-2/</link><pubDate>Fri, 01 Jan 2016 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/counting-linear-extensions-parameterizations-by-treewidth-2/</guid><description/></item><item><title>Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting</title><link>https://ac.tuwien.ac.at/publication/discovering-archipelagos-of-tractability-for-constraint-satisfaction-and-counting/</link><pubDate>Fri, 01 Jan 2016 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/discovering-archipelagos-of-tractability-for-constraint-satisfaction-and-counting/</guid><description/></item><item><title>FO Model Checking of Interval Graphs</title><link>https://ac.tuwien.ac.at/publication/fo-model-checking-of-interval-graphs-2/</link><pubDate>Fri, 01 Jan 2016 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/fo-model-checking-of-interval-graphs-2/</guid><description/></item><item><title>Meta-Kernelization with Structural Parameters</title><link>https://ac.tuwien.ac.at/publication/meta-kernelization-with-structural-parameters-2/</link><pubDate>Fri, 01 Jan 2016 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/meta-kernelization-with-structural-parameters-2/</guid><description/></item><item><title>Model Checking Existential Logic on Partially Ordered Sets</title><link>https://ac.tuwien.ac.at/publication/model-checking-existential-logic-on-partially-ordered-sets-2/</link><pubDate>Fri, 01 Jan 2016 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/model-checking-existential-logic-on-partially-ordered-sets-2/</guid><description/></item><item><title>On Existential MSO and its Relation to ETH</title><link>https://ac.tuwien.ac.at/publication/on-existential-mso-and-its-relation-to-eth-2/</link><pubDate>Fri, 01 Jan 2016 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/on-existential-mso-and-its-relation-to-eth-2/</guid><description/></item><item><title>On the Complexity Landscape of Connected f-factor Problems</title><link>https://ac.tuwien.ac.at/publication/on-the-complexity-landscape-of-connected-f-factor-problems-2/</link><pubDate>Fri, 01 Jan 2016 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/on-the-complexity-landscape-of-connected-f-factor-problems-2/</guid><description/></item><item><title>Polynomial-Time Construction of Optimal MPI Derived Datatype Trees</title><link>https://ac.tuwien.ac.at/publication/polynomial-time-construction-of-optimal-mpi-derived-datatype-trees/</link><pubDate>Fri, 01 Jan 2016 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/polynomial-time-construction-of-optimal-mpi-derived-datatype-trees/</guid><description/></item><item><title>Quantified Conjunctive Queries on Partially Ordered Sets</title><link>https://ac.tuwien.ac.at/publication/quantified-conjunctive-queries-on-partially-ordered-sets-2/</link><pubDate>Fri, 01 Jan 2016 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/quantified-conjunctive-queries-on-partially-ordered-sets-2/</guid><description/></item><item><title>The Complexity Landscape of Decompositional Parameters for ILP</title><link>https://ac.tuwien.ac.at/publication/the-complexity-landscape-of-decompositional-parameters-for-ilp/</link><pubDate>Fri, 01 Jan 2016 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-complexity-landscape-of-decompositional-parameters-for-ilp/</guid><description/></item><item><title>Using Decomposition-Parameters for QBF: Mind the Prefix!</title><link>https://ac.tuwien.ac.at/publication/using-decomposition-parameters-for-qbf-mind-the-prefix/</link><pubDate>Fri, 01 Jan 2016 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/using-decomposition-parameters-for-qbf-mind-the-prefix/</guid><description/></item><item><title>Algorithmic Applications of Tree-Cut Width</title><link>https://ac.tuwien.ac.at/publication/algorithmic-applications-of-tree-cut-width/</link><pubDate>Thu, 01 Jan 2015 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/algorithmic-applications-of-tree-cut-width/</guid><description/></item><item><title>Community Structure Inspired Algorithms for SAT and \#SAT</title><link>https://ac.tuwien.ac.at/publication/community-structure-inspired-algorithms-for-sat-and-sat/</link><pubDate>Thu, 01 Jan 2015 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/community-structure-inspired-algorithms-for-sat-and-sat/</guid><description/></item><item><title>Improving Vertex Cover as a Graph Parameter</title><link>https://ac.tuwien.ac.at/publication/improving-vertex-cover-as-a-graph-parameter/</link><pubDate>Thu, 01 Jan 2015 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/improving-vertex-cover-as-a-graph-parameter/</guid><description/></item><item><title>Meta-Kernelization using Well-Structured Modulators</title><link>https://ac.tuwien.ac.at/publication/meta-kernelization-using-well-structured-modulators/</link><pubDate>Thu, 01 Jan 2015 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/meta-kernelization-using-well-structured-modulators/</guid><description/></item><item><title>On the Complexity of Rainbow Coloring Problems</title><link>https://ac.tuwien.ac.at/publication/on-the-complexity-of-rainbow-coloring-problems/</link><pubDate>Thu, 01 Jan 2015 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/on-the-complexity-of-rainbow-coloring-problems/</guid><description/></item><item><title>Parameterized Complexity of Asynchronous Border Minimization</title><link>https://ac.tuwien.ac.at/publication/parameterized-complexity-of-asynchronous-border-minimization/</link><pubDate>Thu, 01 Jan 2015 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/parameterized-complexity-of-asynchronous-border-minimization/</guid><description/></item><item><title>Solving Problems on Graphs of High Rank-Width</title><link>https://ac.tuwien.ac.at/publication/solving-problems-on-graphs-of-high-rank-width/</link><pubDate>Thu, 01 Jan 2015 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-problems-on-graphs-of-high-rank-width/</guid><description/></item><item><title>Digraph width measures in parameterized algorithmics</title><link>https://ac.tuwien.ac.at/publication/digraph-width-measures-in-parameterized-algorithmics/</link><pubDate>Wed, 01 Jan 2014 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/digraph-width-measures-in-parameterized-algorithmics/</guid><description/></item><item><title>Lower bounds on the complexity of MSO1 model-checking</title><link>https://ac.tuwien.ac.at/publication/lower-bounds-on-the-complexity-of-mso1-model-checking-2/</link><pubDate>Wed, 01 Jan 2014 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/lower-bounds-on-the-complexity-of-mso1-model-checking-2/</guid><description/></item><item><title>Model checking existential logic on partially ordered sets</title><link>https://ac.tuwien.ac.at/publication/model-checking-existential-logic-on-partially-ordered-sets/</link><pubDate>Wed, 01 Jan 2014 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/model-checking-existential-logic-on-partially-ordered-sets/</guid><description/></item><item><title>Quantified Conjunctive Queries on Partially Ordered Sets</title><link>https://ac.tuwien.ac.at/publication/quantified-conjunctive-queries-on-partially-ordered-sets/</link><pubDate>Wed, 01 Jan 2014 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/quantified-conjunctive-queries-on-partially-ordered-sets/</guid><description/></item><item><title>A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width</title><link>https://ac.tuwien.ac.at/publication/a-unified-approach-to-polynomial-algorithms-on-graphs-of-bounded-bi-rank-width/</link><pubDate>Tue, 01 Jan 2013 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-unified-approach-to-polynomial-algorithms-on-graphs-of-bounded-bi-rank-width/</guid><description/></item><item><title>Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width</title><link>https://ac.tuwien.ac.at/publication/better-algorithms-for-satisfiability-problems-for-formulas-of-bounded-rank-width-2/</link><pubDate>Tue, 01 Jan 2013 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/better-algorithms-for-satisfiability-problems-for-formulas-of-bounded-rank-width-2/</guid><description/></item><item><title>Cops-and-robbers: remarks and problems</title><link>https://ac.tuwien.ac.at/publication/cops-and-robbers-remarks-and-problems/</link><pubDate>Tue, 01 Jan 2013 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/cops-and-robbers-remarks-and-problems/</guid><description/></item><item><title>Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes</title><link>https://ac.tuwien.ac.at/publication/expanding-the-expressive-power-of-monadic-second-order-logic-on-restricted-graph-classes/</link><pubDate>Tue, 01 Jan 2013 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/expanding-the-expressive-power-of-monadic-second-order-logic-on-restricted-graph-classes/</guid><description/></item><item><title>FO Model Checking of Interval Graphs</title><link>https://ac.tuwien.ac.at/publication/fo-model-checking-of-interval-graphs/</link><pubDate>Tue, 01 Jan 2013 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/fo-model-checking-of-interval-graphs/</guid><description/></item><item><title>Meta-kernelization with Structural Parameters</title><link>https://ac.tuwien.ac.at/publication/meta-kernelization-with-structural-parameters/</link><pubDate>Tue, 01 Jan 2013 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/meta-kernelization-with-structural-parameters/</guid><description/></item><item><title>Lower Bounds on the Complexity of MSO1 Model-Checking</title><link>https://ac.tuwien.ac.at/publication/lower-bounds-on-the-complexity-of-mso1-model-checking/</link><pubDate>Sun, 01 Jan 2012 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/lower-bounds-on-the-complexity-of-mso1-model-checking/</guid><description/></item><item><title>When Trees Grow Low: Shrubs and Fast MSO1</title><link>https://ac.tuwien.ac.at/publication/when-trees-grow-low-shrubs-and-fast-mso1/</link><pubDate>Sun, 01 Jan 2012 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/when-trees-grow-low-shrubs-and-fast-mso1/</guid><description/></item><item><title>Clique-width: When Hard Does Not Mean Impossible</title><link>https://ac.tuwien.ac.at/publication/clique-width-when-hard-does-not-mean-impossible/</link><pubDate>Sat, 01 Jan 2011 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/clique-width-when-hard-does-not-mean-impossible/</guid><description/></item><item><title>New Results on the Complexity of the Max- and Min-Rep Problems</title><link>https://ac.tuwien.ac.at/publication/new-results-on-the-complexity-of-the-max-and-min-rep-problems/</link><pubDate>Sat, 01 Jan 2011 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/new-results-on-the-complexity-of-the-max-and-min-rep-problems/</guid><description/></item><item><title>Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics</title><link>https://ac.tuwien.ac.at/publication/twin-cover-beyond-vertex-cover-in-parameterized-algorithmics/</link><pubDate>Sat, 01 Jan 2011 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/twin-cover-beyond-vertex-cover-in-parameterized-algorithmics/</guid><description/></item><item><title>Are There Any Good Digraph Width Measures?</title><link>https://ac.tuwien.ac.at/publication/are-there-any-good-digraph-width-measures/</link><pubDate>Fri, 01 Jan 2010 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/are-there-any-good-digraph-width-measures/</guid><description/></item><item><title>Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width</title><link>https://ac.tuwien.ac.at/publication/better-algorithms-for-satisfiability-problems-for-formulas-of-bounded-rank-width/</link><pubDate>Fri, 01 Jan 2010 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/better-algorithms-for-satisfiability-problems-for-formulas-of-bounded-rank-width/</guid><description/></item><item><title>New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes</title><link>https://ac.tuwien.ac.at/publication/new-results-on-the-complexity-of-oriented-colouring-on-restricted-digraph-classes/</link><pubDate>Fri, 01 Jan 2010 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/new-results-on-the-complexity-of-oriented-colouring-on-restricted-digraph-classes/</guid><description/></item><item><title>On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width</title><link>https://ac.tuwien.ac.at/publication/on-parse-trees-and-myhill-nerode-type-tools-for-handling-graphs-of-bounded-rank-width/</link><pubDate>Fri, 01 Jan 2010 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/on-parse-trees-and-myhill-nerode-type-tools-for-handling-graphs-of-bounded-rank-width/</guid><description/></item><item><title>Thread Graphs, Linear Rank-Width and Their Algorithmic Applications</title><link>https://ac.tuwien.ac.at/publication/thread-graphs-linear-rank-width-and-their-algorithmic-applications/</link><pubDate>Fri, 01 Jan 2010 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/thread-graphs-linear-rank-width-and-their-algorithmic-applications/</guid><description/></item><item><title>Better Polynomial Algorithms on Graphs of Bounded Rank-Width</title><link>https://ac.tuwien.ac.at/publication/better-polynomial-algorithms-on-graphs-of-bounded-rank-width/</link><pubDate>Thu, 01 Jan 2009 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/better-polynomial-algorithms-on-graphs-of-bounded-rank-width/</guid><description/></item><item><title>On Digraph Width Measures in Parameterized Algorithmics</title><link>https://ac.tuwien.ac.at/publication/on-digraph-width-measures-in-parameterized-algorithmics/</link><pubDate>Thu, 01 Jan 2009 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/on-digraph-width-measures-in-parameterized-algorithmics/</guid><description/></item><item><title>The Parameterized Complexity of Oriented Colouring</title><link>https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-oriented-colouring/</link><pubDate>Thu, 01 Jan 2009 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-oriented-colouring/</guid><description/></item><item><title>Automata approach to graphs of bounded rank-width</title><link>https://ac.tuwien.ac.at/publication/automata-approach-to-graphs-of-bounded-rank-width/</link><pubDate>Tue, 01 Jan 2008 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/automata-approach-to-graphs-of-bounded-rank-width/</guid><description/></item></channel></rss>