PGD | AC Group | TU Wienhttps://ac.tuwien.ac.at/tag/pgd/PGDHugo Blox Builder (https://hugoblox.com)en-usThu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngPGDhttps://ac.tuwien.ac.at/tag/pgd/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 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/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/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/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/On the Complexity of Extending Storylineshttps://ac.tuwien.ac.at/publication/on-the-complexity-of-extending-storylines/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-complexity-of-extending-storylines/On the Recognition of Outerplanar Graphs with Queue Number 1https://ac.tuwien.ac.at/publication/on-the-recognition-of-outerplanar-graphs-with-queue-number-1/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-recognition-of-outerplanar-graphs-with-queue-number-1/Paged Geophylogenies: A Coloring Approach to External Labeling with Tree Constraintshttps://ac.tuwien.ac.at/publication/paged-geophylogenies-a-coloring-approach-to-external-labeling-with-tree-constraints/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/paged-geophylogenies-a-coloring-approach-to-external-labeling-with-tree-constraints/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/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/Point Set Embeddability with List Constraintshttps://ac.tuwien.ac.at/publication/point-set-embeddability-with-list-constraints/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/point-set-embeddability-with-list-constraints/Realizing Planar Linkages in Polygonal Domainshttps://ac.tuwien.ac.at/publication/realizing-planar-linkages-in-polygonal-domains/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/realizing-planar-linkages-in-polygonal-domains/Revisiting Graph Modification via Disk Scaling: From One Radius to Interval-Based Radiihttps://ac.tuwien.ac.at/publication/revisiting-graph-modification-via-disk-scaling-from-one-radius-to-interval-based-radii/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/revisiting-graph-modification-via-disk-scaling-from-one-radius-to-interval-based-radii/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 (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/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/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/The Parameterized Complexity Of Extending Stack Layoutshttps://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-extending-stack-layouts-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-extending-stack-layouts-2/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/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/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/Visualizing Treewidthhttps://ac.tuwien.ac.at/publication/visualizing-treewidth-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/visualizing-treewidth-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/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/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/On Planar Unit-Length Linear Linkages in Polygonal Domainshttps://ac.tuwien.ac.at/publication/on-planar-unit-length-linear-linkages-in-polygonal-domains/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-planar-unit-length-linear-linkages-in-polygonal-domains/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/Partial Level Planarity Parameterized by the Size of the Missing Graphhttps://ac.tuwien.ac.at/publication/partial-level-planarity-parameterized-by-the-size-of-the-missing-graph/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/partial-level-planarity-parameterized-by-the-size-of-the-missing-graph/Pathways to Tractability for Geometric Thicknesshttps://ac.tuwien.ac.at/publication/pathways-to-tractability-for-geometric-thickness/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/pathways-to-tractability-for-geometric-thickness/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 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/Transitions in Dynamic Point Labelinghttps://ac.tuwien.ac.at/publication/transitions-in-dynamic-point-labeling-2/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/transitions-in-dynamic-point-labeling-2/Visualizing Treewidthhttps://ac.tuwien.ac.at/publication/visualizing-treewidth/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/visualizing-treewidth/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/Extending Orthogonal Planar Graph Drawings is Fixed-parameter Tractablehttps://ac.tuwien.ac.at/publication/extending-orthogonal-planar-graph-drawings-is-fixed-parameter-tractable-2/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/extending-orthogonal-planar-graph-drawings-is-fixed-parameter-tractable-2/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/Minimizing Switches in Cased Graph Drawingshttps://ac.tuwien.ac.at/publication/minimizing-switches-in-cased-graph-drawings/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/minimizing-switches-in-cased-graph-drawings/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/The Complexity of Cluster Vertex Splitting and Companyhttps://ac.tuwien.ac.at/publication/the-complexity-of-cluster-vertex-splitting-and-company/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-cluster-vertex-splitting-and-company/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/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-extending-stack-layouts/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/Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractablehttps://ac.tuwien.ac.at/publication/extending-orthogonal-planar-graph-drawings-is-fixed-parameter-tractable/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/extending-orthogonal-planar-graph-drawings-is-fixed-parameter-tractable/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/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/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/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/