| 2023 | ICML | The Computational Complexity of Concise Hypersphere Classification. | Eduard Eiben, Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider |
| 2018 | AAAI | Improved Results for Minimum Constraint Removal. | Eduard Eiben, Jonathan Gemmell, Iyad A. Kanj, Andrew Youngdahl |
| 2018 | ESA | Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. | Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen |
| 2018 | ICALP | How to Navigate Through Obstacles?. | Eduard Eiben, Iyad A. Kanj |
| 2018 | ICML | Parameterized Algorithms for the Matrix Completion Problem. | Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider |
| 2017 | WADS | The Complexity of Tree Partitioning. | Zhao An, Qilong Feng, Iyad A. Kanj, Ge Xia |
| 2016 | GD | Twins in Subdivision Drawings of Hypergraphs. | Ren van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge |
| 2016 | MFCS | On Existential MSO and its Relation to ETH. | Robert Ganian, Ronald de Haan, Iyad A. Kanj, Stefan Szeider |
| 2015 | STACS | Flip Distance Is in FPT Time O(n+ k * c^k). | Iyad A. Kanj, Ge Xia |
| 2014 | COCOA | Algorithms for Cut Problems on Trees. | Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu |
| 2014 | COCOA | Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications. | Iyad A. Kanj, Stefan Szeider |
| 2014 | CP | Subexponential Time Complexity of CSP with Global Constraints. | Ronald de Haan, Iyad A. Kanj, Stefan Szeider |
| 2014 | ICTAI | Small Unsatisfiable Subsets in Constraint Satisfaction. | Ronald de Haan, Iyad A. Kanj, Stefan Szeider |
| 2013 | AAAI | On the Subexponential Time Complexity of CSP. | Iyad A. Kanj, Stefan Szeider |
| 2013 | SAT | Local Backbones. | Ronald de Haan, Iyad A. Kanj, Stefan Szeider |
| 2013 | WADS | When Is Weighted Satisfiability FPT? | Iyad A. Kanj, Ge Xia |
| 2012 | COCOA | On Certain Geometric Properties of the Yao-Yao Graphs. | Iyad A. Kanj, Ge Xia |
| 2011 | WADS | Multicut in Trees Viewed through the Eyes of Vertex Cover. | Jianer Chen, Jia-Hao Fan, Iyad A. Kanj, Yang Liu, Fenghui Zhang |
| 2011 | WG | On the Independence Number of Graphs with Maximum Degree 3. | Iyad A. Kanj, Fenghui Zhang |
| 2010 | Algosensors | Improved Local Algorithms for Spanner Construction. | Iyad A. Kanj, Ge Xia |
| 2009 | COCOON | Convex Recoloring Revisited: Complexity and Exact Algorithms. | Iyad A. Kanj, Dieter Kratsch |
| 2009 | DCOSS | Local Construction of Spanners in the 3-D Space. | Iyad A. Kanj, Ge Xia, Fenghui Zhang |
| 2009 | ISAAC | Editing Graphs into Disjoint Unions of Dense Clusters. | Jiong Guo, Iyad A. Kanj, Christian Komusiewicz, Johannes Uhlmann |
| 2009 | TAMC | On Parameterized Exponential Time Complexity. | Jianer Chen, Iyad A. Kanj, Ge Xia |
| 2009 | TAMC | On Spanners of Geometric Graphs. | Iyad A. Kanj |
| 2009 | WG | The Parameterized Complexity of Some Minimum Label Problems. | Michael R. Fellows, Jiong Guo, Iyad A. Kanj |
| 2009 | WG | Local Algorithms for Edge Colorings in UDGs. | Iyad A. Kanj, Andreas Wiese, Fenghui Zhang |
| 2008 | STACS | On the Induced Matching Problem. | Iyad A. Kanj, Michael J. Pelsmajer, Ge Xia, Marcus Schaefer |
| 2008 | STACS | On Geometric Spanners of Euclidean and Unit Disk Graphs. | Iyad A. Kanj, Ljubomir Perkovic |
| 2008 | WG | On the Pseudo-achromatic Number Problem. | Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang |
| 2007 | INFOCOM | Separability and Topology Control of Quasi Unit Disk Graphs. | Jianer Chen, Anxiao Jiang, Iyad A. Kanj, Ge Xia, Fenghui Zhang |
| 2006 | Algosensors | Improved Stretch Factor for Bounded-Degree Planar Power Spanners of Wireless Ad-Hoc Networks. | Iyad A. Kanj, Ljubomir Perkovic |
| 2006 | COCOON | Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms. | Iyad A. Kanj, Luay Nakhleh, Ge Xia |
| 2006 | MFCS | Improved Parameterized Upper Bounds for Vertex Cover. | Jianer Chen, Iyad A. Kanj, Ge Xia |
| 2005 | COCOON | Untitled record | Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia |
| 2005 | STACS | Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size. | Jianer Chen, Henning Fernau, Iyad A. Kanj, Ge Xia |
| 2004 | MFCS | Polynomial Time Approximation Schemes and Parameterized Complexity. | Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia |
| 2004 | STOC | Linear FPT reductions and computational lower bounds. | Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia |
| 2003 | ICALP | Genus Characterizes the Complexity of Graph Problems: Some Tight Results. | Jianer Chen, Iyad A. Kanj, Ljubomir Perkovic, Eric Sedgwick, Ge Xia |
| 2003 | ISAAC | Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems. | Jianer Chen, Iyad A. Kanj, Ge Xia |
| 2002 | ICPP | Hypercube Network Fault Tolerance: A Probabilistic Approach. | Jianer Chen, Iyad A. Kanj, Guojun Wang |
| 2002 | LATIN | Improved Exact Algorithms for MAX-SAT. | Jianer Chen, Iyad A. Kanj |
| 2002 | MFCS | Improved Parameterized Algorithms for Planar Dominating Set. | Iyad A. Kanj, Ljubomir Perkovic |
| 2001 | WG | On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms. | Jianer Chen, Iyad A. Kanj |
| 2000 | ISAAC | On Approximating Minimum Vertex Cover for Graphs with Perfect Matching. | Jianer Chen, Iyad A. Kanj |
| 1999 | WG | Vertex Cover: Further Observations and Further Improvements. | Jianer Chen, Iyad A. Kanj, Weijia Jia |
| 1998 | ISAAC | The Inapproximability of Non NP-hard Optimization Problems. | Liming Cai, David W. Juedes, Iyad A. Kanj |