Iyad Kanj

Recent Publications

Coordinated Motion Planning is FPT on Discretized Simple Polygons
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj
53rd International Colloquium on Automata, Languages, and Programming, ICALP 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
Cite Project Project
Finding a Cluster in Incomplete Data
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
30th Annual European Symposium on Algorithms (ESA 2022) (Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz), volume 244 of Leibniz International Proceedings in Informatics (LIPIcs), pages 47:1-47:14, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
PDF Cite Project Project Project DOI
On the Parameterized Complexity of Clustering
Robert Ganian, Iyad Kanj, Stefan Szeider
2020, Technical report AC-TR-20-002, Algorithms and Complexity Group, TU Wien.
PDF Cite
On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank
Robert Ganian, Iyad Kanj, Stefan Szeider
Proceeding of AAAI-20, the Thirty-Fourth AAAI Conference on Artificial Intelligence, February 7–12, 2020, New York, pages 3906-3913, 2020, AAAI Press.
PDF Cite Project Project Project
Parameterized Algorithms for the Matrix Completion Problem
Robert Ganian, Iyad Kanj, Stefan Szeider
Proceeding of ICML, the Thirty-fifth International Conference on Machine Learning, Stockholm, July 10–15, 2018, pages 1642-1651, 2018, JMLR.org.
Note: ISSN: 1938-7228
PDF Cite
On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances
Ronald De Haan, Iyad Kanj, Stefan Szeider
2017, Technical report AC-TR-17-009, Algorithms and Complexity Group, TU Wien.
PDF Cite
On Existential MSO and its Relation to ETH
Robert Ganian, Ronald De Haan, Iyad Kanj, Stefan Szeider
41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016) (Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier), volume 58 of Leibniz International Proceedings in Informatics (LIPIcs), pages 42:1-42:14, 2016, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.
PDF Cite DOI
On the Subexponential Time Complexity of CSP
Iyad Kanj, Stefan Szeider
Proceedings of AAAI 2013, the 27th AAAI Conference on Artificial Intelligence, July 14-18, 2013, Bellevue, Washington, USA (Marie des Jardins and Michael L. Littman), pages 459-465, 2013, The AAAI Press.
Cite