ParAI | AC Group | TU Wienhttps://ac.tuwien.ac.at/tag/parai/ParAIHugo Blox Builder (https://hugoblox.com)en-usThu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngParAIhttps://ac.tuwien.ac.at/tag/parai/A Fixed-Parameter Algorithm for Extending Upward Planar Drawingshttps://ac.tuwien.ac.at/publication/a-fixed-parameter-algorithm-for-extending-upward-planar-drawings/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-fixed-parameter-algorithm-for-extending-upward-planar-drawings/A Parameterized-Complexity Framework for Finding Local Optimahttps://ac.tuwien.ac.at/publication/a-parameterized-complexity-framework-for-finding-local-optima/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-parameterized-complexity-framework-for-finding-local-optima/A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphshttps://ac.tuwien.ac.at/publication/a-quasi-polynomial-time-algorithm-for-3-coloring-circle-graphs/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-quasi-polynomial-time-algorithm-for-3-coloring-circle-graphs/A structural complexity analysis of synchronous dynamical systemshttps://ac.tuwien.ac.at/publication/a-structural-complexity-analysis-of-synchronous-dynamical-systems-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-structural-complexity-analysis-of-synchronous-dynamical-systems-2/Bilateral Treewidth for QBF: Where Strategies and Resolution Meethttps://ac.tuwien.ac.at/publication/bilateral-treewidth-for-qbf-where-strategies-and-resolution-meet/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/bilateral-treewidth-for-qbf-where-strategies-and-resolution-meet/Circle Graph 3-Coloring: Can Simplicity Beat SAT?https://ac.tuwien.ac.at/publication/circle-graph-3-coloring-can-simplicity-beat-sat/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/circle-graph-3-coloring-can-simplicity-beat-sat/Computing Twin-Width via Treedepth and Vertex Integrityhttps://ac.tuwien.ac.at/publication/computing-twin-width-via-treedepth-and-vertex-integrity/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-twin-width-via-treedepth-and-vertex-integrity/Coordinated Motion Planning Is FPT on Discretized Simple Polygonshttps://ac.tuwien.ac.at/publication/coordinated-motion-planning-is-fpt-on-discretized-simple-polygons/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/coordinated-motion-planning-is-fpt-on-discretized-simple-polygons/Fair Correlation Clustering Meets Graph Parametershttps://ac.tuwien.ac.at/publication/fair-correlation-clustering-meets-graph-parameters/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/fair-correlation-clustering-meets-graph-parameters/Fine-Grained Complexity of Computing Degree-Constrained Spanning Treeshttps://ac.tuwien.ac.at/publication/fine-grained-complexity-of-computing-degree-constrained-spanning-trees/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/fine-grained-complexity-of-computing-degree-constrained-spanning-trees/From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problemhttps://ac.tuwien.ac.at/publication/from-data-completion-to-problems-on-hypercubes-a-parameterized-analysis-of-the-independent-set-problem-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/from-data-completion-to-problems-on-hypercubes-a-parameterized-analysis-of-the-independent-set-problem-2/Gateways to Tractability for Satisfiability in Pearl’s Causal Hierarchyhttps://ac.tuwien.ac.at/publication/gateways-to-tractability-for-satisfiability-in-pearls-causal-hierarchy/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/gateways-to-tractability-for-satisfiability-in-pearls-causal-hierarchy/Makespan Minimization in Split Learning: From Theory to Practicehttps://ac.tuwien.ac.at/publication/makespan-minimization-in-split-learning-from-theory-to-practice/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/makespan-minimization-in-split-learning-from-theory-to-practice/Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexityhttps://ac.tuwien.ac.at/publication/matrix-editing-meets-fair-clustering-parameterized-algorithms-and-complexity/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/matrix-editing-meets-fair-clustering-parameterized-algorithms-and-complexity/Not All Degree Constraints Are Created Equal when Computing Spanning Treeshttps://ac.tuwien.ac.at/publication/not-all-degree-constraints-are-created-equal-when-computing-spanning-trees/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/not-all-degree-constraints-are-created-equal-when-computing-spanning-trees/Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energyhttps://ac.tuwien.ac.at/publication/parameterized-algorithms-for-coordinated-motion-planning-minimizing-energy-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-coordinated-motion-planning-minimizing-energy-2/Parameterized Complexity of Efficient Sortationhttps://ac.tuwien.ac.at/publication/parameterized-complexity-of-efficient-sortation/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-of-efficient-sortation/Perfect Rectangular Tilings with Two Colorshttps://ac.tuwien.ac.at/publication/perfect-rectangular-tilings-with-two-colors/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/perfect-rectangular-tilings-with-two-colors/Routing few robots in a crowded networkhttps://ac.tuwien.ac.at/publication/routing-few-robots-in-a-crowded-network-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/routing-few-robots-in-a-crowded-network-2/The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Patternhttps://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-ordering-a-graph-while-avoiding-a-forbidden-pattern-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-ordering-a-graph-while-avoiding-a-forbidden-pattern-2/The Complexity of Envy-Free Graph Cuttinghttps://ac.tuwien.ac.at/publication/the-complexity-of-envy-free-graph-cutting-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-envy-free-graph-cutting-2/The Complexity of Extending Fair Allocations of Indivisible Goodshttps://ac.tuwien.ac.at/publication/the-complexity-of-extending-fair-allocations-of-indivisible-goods-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-extending-fair-allocations-of-indivisible-goods-2/The Parameterized Complexity of Coordinated Motion Planninghttps://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-coordinated-motion-planning-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-coordinated-motion-planning-2/Tractability via Low Dimensionality: The Parameterized Complexity of Training Quantized Neural Networkshttps://ac.tuwien.ac.at/publication/tractability-via-low-dimensionality-the-parameterized-complexity-of-training-quantized-neural-networks/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/tractability-via-low-dimensionality-the-parameterized-complexity-of-training-quantized-neural-networks/Two-Layer Drawings with a Tree on Top: Vertex Splits and Fixed-Parameter Algorithmshttps://ac.tuwien.ac.at/publication/two-layer-drawings-with-a-tree-on-top-vertex-splits-and-fixed-parameter-algorithms-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/two-layer-drawings-with-a-tree-on-top-vertex-splits-and-fixed-parameter-algorithms-2/A Minor-Testing Approach for Coordinated Motion Planning with Sliding Robotshttps://ac.tuwien.ac.at/publication/a-minor-testing-approach-for-coordinated-motion-planning-with-sliding-robots/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-minor-testing-approach-for-coordinated-motion-planning-with-sliding-robots/A Structural Complexity Analysis of Hierarchical Task Network Planninghttps://ac.tuwien.ac.at/publication/a-structural-complexity-analysis-of-hierarchical-task-network-planning/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-structural-complexity-analysis-of-hierarchical-task-network-planning/Approximate Evaluation of Quantitative Second Order Querieshttps://ac.tuwien.ac.at/publication/approximate-evaluation-of-quantitative-second-order-queries/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/approximate-evaluation-of-quantitative-second-order-queries/Computing Twin-Width Parameterized by the Feedback Edge Number and Vertex Integrityhttps://ac.tuwien.ac.at/publication/computing-twin-width-parameterized-by-the-feedback-edge-number-and-vertex-integrity/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-twin-width-parameterized-by-the-feedback-edge-number-and-vertex-integrity/Crossing and Independent Families Among Polygonshttps://ac.tuwien.ac.at/publication/crossing-and-independent-families-among-polygons/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/crossing-and-independent-families-among-polygons/Hot off the Press: Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithmshttps://ac.tuwien.ac.at/publication/hot-off-the-press-near-tight-runtime-guarantees-for-many-objective-evolutionary-algorithms/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/hot-off-the-press-near-tight-runtime-guarantees-for-many-objective-evolutionary-algorithms/Linear Layouts Revisited: Stacks, Queues, and Exact Algorithmshttps://ac.tuwien.ac.at/publication/linear-layouts-revisited-stacks-queues-and-exact-algorithms/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/linear-layouts-revisited-stacks-queues-and-exact-algorithms/Metric Dimension and Geodetic Set Parameterized by Vertex Coverhttps://ac.tuwien.ac.at/publication/metric-dimension-and-geodetic-set-parameterized-by-vertex-cover/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/metric-dimension-and-geodetic-set-parameterized-by-vertex-cover/PACE Solver Description: Bad Dominating Set Makerhttps://ac.tuwien.ac.at/publication/pace-solver-description-bad-dominating-set-maker/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/pace-solver-description-bad-dominating-set-maker/Parameterized Algorithms for Multiagent Pathfinding on Treeshttps://ac.tuwien.ac.at/publication/parameterized-algorithms-for-multiagent-pathfinding-on-trees/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-multiagent-pathfinding-on-trees/Parameterized Complexity in Machine Learninghttps://ac.tuwien.ac.at/publication/parameterized-complexity-in-machine-learning/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-in-machine-learning/Parameterized Complexity of Caching in Networkshttps://ac.tuwien.ac.at/publication/parameterized-complexity-of-caching-in-networks/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-of-caching-in-networks/Pathways to Tractability for Geometric Thickness (Best Paper Award)https://ac.tuwien.ac.at/publication/pathways-to-tractability-for-geometric-thickness-best-paper-award/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/pathways-to-tractability-for-geometric-thickness-best-paper-award/Routing Few Robots in a Crowded Networkhttps://ac.tuwien.ac.at/publication/routing-few-robots-in-a-crowded-network/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/routing-few-robots-in-a-crowded-network/Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepthhttps://ac.tuwien.ac.at/publication/space-efficient-parameterized-algorithms-on-graphs-of-low-shrubdepth/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/space-efficient-parameterized-algorithms-on-graphs-of-low-shrubdepth/Structural Parameterizations of Simultaneous Planarityhttps://ac.tuwien.ac.at/publication/structural-parameterizations-of-simultaneous-planarity/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/structural-parameterizations-of-simultaneous-planarity/The Complexity of Extending Fair Allocations of Indivisible Goodshttps://ac.tuwien.ac.at/publication/the-complexity-of-extending-fair-allocations-of-indivisible-goods/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-extending-fair-allocations-of-indivisible-goods/The complexity of optimizing atomic congestionhttps://ac.tuwien.ac.at/publication/the-complexity-of-optimizing-atomic-congestion-2/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-optimizing-atomic-congestion-2/The Computational Complexity of Positive Non-Clashing Teaching in Graphshttps://ac.tuwien.ac.at/publication/the-computational-complexity-of-positive-non-clashing-teaching-in-graphs/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-computational-complexity-of-positive-non-clashing-teaching-in-graphs/The Peculiarities of Extending Queue Layoutshttps://ac.tuwien.ac.at/publication/the-peculiarities-of-extending-queue-layouts-2/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-peculiarities-of-extending-queue-layouts-2/Training One-Dimensional Graph Neural Networks is NP-Hardhttps://ac.tuwien.ac.at/publication/training-one-dimensional-graph-neural-networks-is-np-hard/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/training-one-dimensional-graph-neural-networks-is-np-hard/A Tight Subexponential-Time Algorithm for Two-Page Book Embeddinghttps://ac.tuwien.ac.at/publication/a-tight-subexponential-time-algorithm-for-two-page-book-embedding/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-tight-subexponential-time-algorithm-for-two-page-book-embedding/Bounding and Computing Obstacle Numbers of Graphshttps://ac.tuwien.ac.at/publication/bounding-and-computing-obstacle-numbers-of-graphs-2/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/bounding-and-computing-obstacle-numbers-of-graphs-2/Computing Twin-Width Parameterized by the Feedback Edge Numberhttps://ac.tuwien.ac.at/publication/computing-twin-width-parameterized-by-the-feedback-edge-number/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-twin-width-parameterized-by-the-feedback-edge-number/Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphshttps://ac.tuwien.ac.at/publication/conflict-free-coloring-graphs-of-bounded-clique-width-and-intersection-graphs/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/conflict-free-coloring-graphs-of-bounded-clique-width-and-intersection-graphs/Counting Vanishing Matrix-Vector Productshttps://ac.tuwien.ac.at/publication/counting-vanishing-matrix-vector-products/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/counting-vanishing-matrix-vector-products/Crossing Number Is NP-Hard for Constant Path-Width (And Tree-Width)https://ac.tuwien.ac.at/publication/crossing-number-is-np-hard-for-constant-path-width-and-tree-width/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/crossing-number-is-np-hard-for-constant-path-width-and-tree-width/Enumerating Minimal Solution Sets for Metric Graph Problemshttps://ac.tuwien.ac.at/publication/enumerating-minimal-solution-sets-for-metric-graph-problems/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/enumerating-minimal-solution-sets-for-metric-graph-problems/Exact Algorithms for Clustered Planarity with Linear Saturatorshttps://ac.tuwien.ac.at/publication/exact-algorithms-for-clustered-planarity-with-linear-saturators/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/exact-algorithms-for-clustered-planarity-with-linear-saturators/Fixed-Parameter Algorithms for Computing Bend-Restricted RAC Drawings of Graphshttps://ac.tuwien.ac.at/publication/fixed-parameter-algorithms-for-computing-bend-restricted-rac-drawings-of-graphs/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/fixed-parameter-algorithms-for-computing-bend-restricted-rac-drawings-of-graphs/Generating All Invertible Matrices by Row Operationshttps://ac.tuwien.ac.at/publication/generating-all-invertible-matrices-by-row-operations/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/generating-all-invertible-matrices-by-row-operations/Graphs with at most two moplexeshttps://ac.tuwien.ac.at/publication/graphs-with-at-most-two-moplexes/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/graphs-with-at-most-two-moplexes/Hot off the Press: The First Proven Performance Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) on a Combinatorial Optimization Problemhttps://ac.tuwien.ac.at/publication/hot-off-the-press-the-first-proven-performance-guarantees-for-the-non-dominated-sorting-genetic-algorithm-ii-nsga-ii-on-a-combinatorial-optimization-problem/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/hot-off-the-press-the-first-proven-performance-guarantees-for-the-non-dominated-sorting-genetic-algorithm-ii-nsga-ii-on-a-combinatorial-optimization-problem/Hypergraph Dualization with FPT-delay Parameterized by the Degeneracy and Dimensionhttps://ac.tuwien.ac.at/publication/hypergraph-dualization-with-fpt-delay-parameterized-by-the-degeneracy-and-dimension/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/hypergraph-dualization-with-fpt-delay-parameterized-by-the-degeneracy-and-dimension/Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithmshttps://ac.tuwien.ac.at/publication/near-tight-runtime-guarantees-for-many-objective-evolutionary-algorithms/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/near-tight-runtime-guarantees-for-many-objective-evolutionary-algorithms/Non-Clashing Teaching Maps for Balls in Graphshttps://ac.tuwien.ac.at/publication/non-clashing-teaching-maps-for-balls-in-graphs/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/non-clashing-teaching-maps-for-balls-in-graphs/Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energyhttps://ac.tuwien.ac.at/publication/parameterized-algorithms-for-coordinated-motion-planning-minimizing-energy/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-coordinated-motion-planning-minimizing-energy/Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Coverhttps://ac.tuwien.ac.at/publication/problems-in-np-can-admit-double-exponential-lower-bounds-when-parameterized-by-treewidth-or-vertex-cover/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/problems-in-np-can-admit-double-exponential-lower-bounds-when-parameterized-by-treewidth-or-vertex-cover/Revisiting Causal Discovery from a Complexity-Theoretic Perspectivehttps://ac.tuwien.ac.at/publication/revisiting-causal-discovery-from-a-complexity-theoretic-perspective/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/revisiting-causal-discovery-from-a-complexity-theoretic-perspective/Slim Tree-Cut Widthhttps://ac.tuwien.ac.at/publication/slim-tree-cut-width-2/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/slim-tree-cut-width-2/Smash and grab: The 0*6 scoring game on graphshttps://ac.tuwien.ac.at/publication/smash-and-grab-the-0-6-scoring-game-on-graphs/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/smash-and-grab-the-0-6-scoring-game-on-graphs/The Complexity of Fair Division of Indivisible Items with Externalitieshttps://ac.tuwien.ac.at/publication/the-complexity-of-fair-division-of-indivisible-items-with-externalities/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-fair-division-of-indivisible-items-with-externalities/The Complexity of Optimizing Atomic Congestionhttps://ac.tuwien.ac.at/publication/the-complexity-of-optimizing-atomic-congestion/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-optimizing-atomic-congestion/The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Widthhttps://ac.tuwien.ac.at/publication/the-fine-grained-complexity-of-graph-homomorphism-parameterized-by-clique-width-2/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-fine-grained-complexity-of-graph-homomorphism-parameterized-by-clique-width-2/The k-Opt Algorithm for the Traveling Salesman Problem Has Exponential Running Time for k \(\geq\) 5https://ac.tuwien.ac.at/publication/the-k-opt-algorithm-for-the-traveling-salesman-problem-has-exponential-running-time-for-k-geq-5/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-k-opt-algorithm-for-the-traveling-salesman-problem-has-exponential-running-time-for-k-geq-5/The Parameterized Complexity Landscape of the Unsplittable Flow Problemhttps://ac.tuwien.ac.at/publication/the-parameterized-complexity-landscape-of-the-unsplittable-flow-problem/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-landscape-of-the-unsplittable-flow-problem/The Parameterized Complexity Of Extending Stack Layoutshttps://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-extending-stack-layouts-3/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-extending-stack-layouts-3/Twin-Width Meets Feedback Edges and Vertex Integrityhttps://ac.tuwien.ac.at/publication/twin-width-meets-feedback-edges-and-vertex-integrity/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/twin-width-meets-feedback-edges-and-vertex-integrity/A Parameterized Theory of PAC Learninghttps://ac.tuwien.ac.at/publication/a-parameterized-theory-of-pac-learning/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-parameterized-theory-of-pac-learning/A Polyhedral Perspective on Tropical Convolutionshttps://ac.tuwien.ac.at/publication/a-polyhedral-perspective-on-tropical-convolutions/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-polyhedral-perspective-on-tropical-convolutions/A Structural Complexity Analysis of Synchronous Dynamical Systemshttps://ac.tuwien.ac.at/publication/a-structural-complexity-analysis-of-synchronous-dynamical-systems/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-structural-complexity-analysis-of-synchronous-dynamical-systems/Consistency Checking Problems: A Gateway to Parameterized Sample Complexityhttps://ac.tuwien.ac.at/publication/consistency-checking-problems-a-gateway-to-parameterized-sample-complexity/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/consistency-checking-problems-a-gateway-to-parameterized-sample-complexity/Deterministic Constrained Multilinear Detectionhttps://ac.tuwien.ac.at/publication/deterministic-constrained-multilinear-detection/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/deterministic-constrained-multilinear-detection/Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractablehttps://ac.tuwien.ac.at/publication/extending-orthogonal-planar-graph-drawings-is-fixed-parameter-tractable-3/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/extending-orthogonal-planar-graph-drawings-is-fixed-parameter-tractable-3/Fast Convolutions for Near-Convex Sequenceshttps://ac.tuwien.ac.at/publication/fast-convolutions-for-near-convex-sequences/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/fast-convolutions-for-near-convex-sequences/Fixed-Parameter Algorithms for Computing RAC Drawings of Graphshttps://ac.tuwien.ac.at/publication/fixed-parameter-algorithms-for-computing-rac-drawings-of-graphs/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/fixed-parameter-algorithms-for-computing-rac-drawings-of-graphs/From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problemhttps://ac.tuwien.ac.at/publication/from-data-completion-to-problems-on-hypercubes-a-parameterized-analysis-of-the-independent-set-problem/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/from-data-completion-to-problems-on-hypercubes-a-parameterized-analysis-of-the-independent-set-problem/Group Activity Selection with Few Agent Typeshttps://ac.tuwien.ac.at/publication/group-activity-selection-with-few-agent-types/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/group-activity-selection-with-few-agent-types/Hedonic diversity games: A complexity picture with more than two colorshttps://ac.tuwien.ac.at/publication/hedonic-diversity-games-a-complexity-picture-with-more-than-two-colors-2/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/hedonic-diversity-games-a-complexity-picture-with-more-than-two-colors-2/Maximizing Social Welfare in Score-Based Social Distance Gameshttps://ac.tuwien.ac.at/publication/maximizing-social-welfare-in-score-based-social-distance-games/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/maximizing-social-welfare-in-score-based-social-distance-games/Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parametershttps://ac.tuwien.ac.at/publication/metric-dimension-parameterized-by-feedback-vertex-set-and-other-structural-parameters/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/metric-dimension-parameterized-by-feedback-vertex-set-and-other-structural-parameters/New Complexity-Theoretic Frontiers of Tractability for Neural Network Traininghttps://ac.tuwien.ac.at/publication/new-complexity-theoretic-frontiers-of-tractability-for-neural-network-training/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/new-complexity-theoretic-frontiers-of-tractability-for-neural-network-training/On the parameterized complexity of clustering problems for incomplete datahttps://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-clustering-problems-for-incomplete-data/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-clustering-problems-for-incomplete-data/Parameterized complexity of envy-free resource allocation in social networkshttps://ac.tuwien.ac.at/publication/parameterized-complexity-of-envy-free-resource-allocation-in-social-networks-2/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-of-envy-free-resource-allocation-in-social-networks-2/Sample compression schemes for balls in graphshttps://ac.tuwien.ac.at/publication/sample-compression-schemes-for-balls-in-graphs/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/sample-compression-schemes-for-balls-in-graphs/Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepthhttps://ac.tuwien.ac.at/publication/space-efficient-parameterized-algorithms-on-graphs-of-low-shrubdepth-2/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/space-efficient-parameterized-algorithms-on-graphs-of-low-shrubdepth-2/Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBFhttps://ac.tuwien.ac.at/publication/structure-aware-lower-bounds-and-broadening-the-horizon-of-tractability-for-qbf/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/structure-aware-lower-bounds-and-broadening-the-horizon-of-tractability-for-qbf/The Computational Complexity of Concise Hypersphere Classificationhttps://ac.tuwien.ac.at/publication/the-computational-complexity-of-concise-hypersphere-classification/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-computational-complexity-of-concise-hypersphere-classification/The Parameterized Complexity of Coordinated Motion Planninghttps://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-coordinated-motion-planning/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-coordinated-motion-planning/The Parameterized Complexity of Network Microaggregationhttps://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-network-microaggregation/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-network-microaggregation/Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidthhttps://ac.tuwien.ac.at/publication/upward-and-orthogonal-planarity-are-w-1-hard-parameterized-by-treewidth/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/upward-and-orthogonal-planarity-are-w-1-hard-parameterized-by-treewidth/A Unifying Framework for Characterizing and Computing Width Measureshttps://ac.tuwien.ac.at/publication/a-unifying-framework-for-characterizing-and-computing-width-measures/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-unifying-framework-for-characterizing-and-computing-width-measures/Algorithmic Applications of Tree-Cut Widthhttps://ac.tuwien.ac.at/publication/algorithmic-applications-of-tree-cut-width-2/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/algorithmic-applications-of-tree-cut-width-2/An efficient algorithm for counting Markov equivalent DAGshttps://ac.tuwien.ac.at/publication/an-efficient-algorithm-for-counting-markov-equivalent-dags-2/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-efficient-algorithm-for-counting-markov-equivalent-dags-2/Bounding and Computing Obstacle Numbers of Graphshttps://ac.tuwien.ac.at/publication/bounding-and-computing-obstacle-numbers-of-graphs/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/bounding-and-computing-obstacle-numbers-of-graphs/Detours in Directed Graphshttps://ac.tuwien.ac.at/publication/detours-in-directed-graphs/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/detours-in-directed-graphs/Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cutshttps://ac.tuwien.ac.at/publication/edge-cut-width-an-algorithmically-driven-analogue-of-treewidth-based-on-edge-cuts/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/edge-cut-width-an-algorithmically-driven-analogue-of-treewidth-based-on-edge-cuts/Finding a Cluster in Incomplete Datahttps://ac.tuwien.ac.at/publication/finding-a-cluster-in-incomplete-data/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/finding-a-cluster-in-incomplete-data/Fine-grained Complexity of Partial Minimum Satisfiabilityhttps://ac.tuwien.ac.at/publication/fine-grained-complexity-of-partial-minimum-satisfiability/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/fine-grained-complexity-of-partial-minimum-satisfiability/FPT Approximation for Fair Minimum-Load Clusteringhttps://ac.tuwien.ac.at/publication/fpt-approximation-for-fair-minimum-load-clustering/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/fpt-approximation-for-fair-minimum-load-clustering/Hedonic Diversity Games: A Complexity Picture with More than Two Colorshttps://ac.tuwien.ac.at/publication/hedonic-diversity-games-a-complexity-picture-with-more-than-two-colors/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/hedonic-diversity-games-a-complexity-picture-with-more-than-two-colors/Longest Cycle above Erdős–Gallai Boundhttps://ac.tuwien.ac.at/publication/longest-cycle-above-erdos-gallai-bound/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/longest-cycle-above-erdos-gallai-bound/On Covering Segments with Unit Intervalshttps://ac.tuwien.ac.at/publication/on-covering-segments-with-unit-intervals-2/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-covering-segments-with-unit-intervals-2/Parameterised Partially-Predrawn Crossing Numberhttps://ac.tuwien.ac.at/publication/parameterised-partially-predrawn-crossing-number/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterised-partially-predrawn-crossing-number/Parameterized Algorithms for Queue Layoutshttps://ac.tuwien.ac.at/publication/parameterized-algorithms-for-queue-layouts/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-queue-layouts/Parameterized Algorithms for Upward Planarityhttps://ac.tuwien.ac.at/publication/parameterized-algorithms-for-upward-planarity/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-upward-planarity/Slim Tree-Cut Widthhttps://ac.tuwien.ac.at/publication/slim-tree-cut-width/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/slim-tree-cut-width/Sum-of-Products with Default Values: Algorithms and Complexity Resultshttps://ac.tuwien.ac.at/publication/sum-of-products-with-default-values-algorithms-and-complexity-results-3/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/sum-of-products-with-default-values-algorithms-and-complexity-results-3/Testing Upward Planarity of Partial 2-Treeshttps://ac.tuwien.ac.at/publication/testing-upward-planarity-of-partial-2-trees/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/testing-upward-planarity-of-partial-2-trees/The Complexity of Envy-Free Graph Cuttinghttps://ac.tuwien.ac.at/publication/the-complexity-of-envy-free-graph-cutting/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-envy-free-graph-cutting/The Complexity of k-Means Clustering when Little is Knownhttps://ac.tuwien.ac.at/publication/the-complexity-of-k-means-clustering-when-little-is-known/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-k-means-clustering-when-little-is-known/The Complexity of Temporal Vertex Cover in Small-Degree Graphshttps://ac.tuwien.ac.at/publication/the-complexity-of-temporal-vertex-cover-in-small-degree-graphs/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-temporal-vertex-cover-in-small-degree-graphs/The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Widthhttps://ac.tuwien.ac.at/publication/the-fine-grained-complexity-of-graph-homomorphism-parameterized-by-clique-width/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-fine-grained-complexity-of-graph-homomorphism-parameterized-by-clique-width/Threshold Treewidth and Hypertree Widthhttps://ac.tuwien.ac.at/publication/threshold-treewidth-and-hypertree-width-3/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/threshold-treewidth-and-hypertree-width-3/Weighted Model Counting with Twin-Widthhttps://ac.tuwien.ac.at/publication/weighted-model-counting-with-twin-width/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/weighted-model-counting-with-twin-width/Computing Kemeny Rankings from d-Euclidean Preferenceshttps://ac.tuwien.ac.at/publication/computing-kemeny-rankings-from-d-euclidean-preferences/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-kemeny-rankings-from-d-euclidean-preferences/Crossing-Optimal Extension of Simple Drawingshttps://ac.tuwien.ac.at/publication/crossing-optimal-extension-of-simple-drawings/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/crossing-optimal-extension-of-simple-drawings/Graphs with two moplexeshttps://ac.tuwien.ac.at/publication/graphs-with-two-moplexes/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/graphs-with-two-moplexes/Measuring what matters: A hybrid approach to dynamic programming with treewidthhttps://ac.tuwien.ac.at/publication/measuring-what-matters-a-hybrid-approach-to-dynamic-programming-with-treewidth-2/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/measuring-what-matters-a-hybrid-approach-to-dynamic-programming-with-treewidth-2/New Width Parameters for SAT and Sharp-SAThttps://ac.tuwien.ac.at/publication/new-width-parameters-for-sat-and-sharp-sat/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/new-width-parameters-for-sat-and-sharp-sat/On Strict (Outer-)Confluent Graphshttps://ac.tuwien.ac.at/publication/on-strict-outer-confluent-graphs-3/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-strict-outer-confluent-graphs-3/On Structural Parameterizations of the Edge Disjoint Paths Problemhttps://ac.tuwien.ac.at/publication/on-structural-parameterizations-of-the-edge-disjoint-paths-problem/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-structural-parameterizations-of-the-edge-disjoint-paths-problem/The complexity landscape of decompositional parameters for ILP: Programs with Few Global Variables and Constraintshttps://ac.tuwien.ac.at/publication/the-complexity-landscape-of-decompositional-parameters-for-ilp-programs-with-few-global-variables-and-constraints/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-landscape-of-decompositional-parameters-for-ilp-programs-with-few-global-variables-and-constraints/The Complexity of Bayesian Network Learning: Revisiting the Superstructurehttps://ac.tuwien.ac.at/publication/the-complexity-of-bayesian-network-learning-revisiting-the-superstructure/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-bayesian-network-learning-revisiting-the-superstructure/The Complexity of Object Association in Multiple Object Trackinghttps://ac.tuwien.ac.at/publication/the-complexity-of-object-association-in-multiple-object-tracking/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-object-association-in-multiple-object-tracking/The Parameterized Complexity of Clustering Incomplete Datahttps://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-clustering-incomplete-data/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-clustering-incomplete-data/The Parameterized Complexity of Connected Fair Divisionhttps://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-connected-fair-division/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-connected-fair-division/Worbel: Aggregating Point Labels into Word Cloudshttps://ac.tuwien.ac.at/publication/worbel-aggregating-point-labels-into-word-clouds-3/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/worbel-aggregating-point-labels-into-word-clouds-3/On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rankhttps://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-clustering-incomplete-data-into-subspaces-of-small-rank/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-clustering-incomplete-data-into-subspaces-of-small-rank/Algorithmic Extensions of Dirac's Theoremhttps://ac.tuwien.ac.at/publication/algorithmic-extensions-of-dirac-s-theorem/Thu, 01 Jan 1970 00:00:00 +0000https://ac.tuwien.ac.at/publication/algorithmic-extensions-of-dirac-s-theorem/