Iyad Kanj | AC Group | TU Wienhttps://ac.tuwien.ac.at/team/iyad-kanj/Iyad KanjHugo Blox Builder (https://hugoblox.com)en-usThu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngIyad Kanjhttps://ac.tuwien.ac.at/team/iyad-kanj/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/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/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 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/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/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/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/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/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/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/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/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/The Parameterized Complexity of Clustering Incomplete Datahttps://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-clustering-incomplete-data-2/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-clustering-incomplete-data-2/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/On Covering Segments with Unit Intervalshttps://ac.tuwien.ac.at/publication/on-covering-segments-with-unit-intervals/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-covering-segments-with-unit-intervals/On Existential MSO and Its Relation to ETHhttps://ac.tuwien.ac.at/publication/on-existential-mso-and-its-relation-to-eth/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-existential-mso-and-its-relation-to-eth/On the Parameterized Complexity of Clusteringhttps://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-clustering/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-clustering/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/The Parameterized Complexity of Cascading Portfolio Schedulinghttps://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-cascading-portfolio-scheduling-2/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-cascading-portfolio-scheduling-2/The Parameterized Complexity of Cascading Portfolio Schedulinghttps://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-cascading-portfolio-scheduling/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-cascading-portfolio-scheduling/Parameterized Algorithms for the Matrix Completion Problemhttps://ac.tuwien.ac.at/publication/parameterized-algorithms-for-the-matrix-completion-problem/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-the-matrix-completion-problem/On the parameterized complexity of finding small unsatisfiable subsets of CNF formulas and CSP instanceshttps://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-finding-small-unsatisfiable-subsets-of-cnf-formulas-and-csp-instances-2/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-finding-small-unsatisfiable-subsets-of-cnf-formulas-and-csp-instances-2/On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instanceshttps://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-finding-small-unsatisfiable-subsets-of-cnf-formulas-and-csp-instances/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-finding-small-unsatisfiable-subsets-of-cnf-formulas-and-csp-instances/On Existential MSO and its Relation to ETHhttps://ac.tuwien.ac.at/publication/on-existential-mso-and-its-relation-to-eth-2/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-existential-mso-and-its-relation-to-eth-2/On the Subexponential Time Complexity of CSPhttps://ac.tuwien.ac.at/publication/on-the-subexponential-time-complexity-of-csp-2/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-subexponential-time-complexity-of-csp-2/