Argyrios Deligkas | AC Group | TU Wienhttps://ac.tuwien.ac.at/team/argyrios-deligkas/Argyrios DeligkasHugo Blox Builder (https://hugoblox.com)en-usThu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngArgyrios Deligkashttps://ac.tuwien.ac.at/team/argyrios-deligkas/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/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/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 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/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/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/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/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/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 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 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/