People
Research
Courses
Updates
Jobs
Contact
Internal
Light
Dark
Automatic
Iyad Kanj
Recent Publications
Finding a Cluster in Incomplete Data
2022
On the Parameterized Complexity of Clustering
2020
On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank
2020
Parameterized Algorithms for the Matrix Completion Problem
2018
On Existential MSO and its Relation to ETH
2016
On the Subexponential Time Complexity of CSP
2013
Cite
×