Using Nondeterminism to Design Deterministic Algorithms. - Jianer Chen; Donald K. Friesen; Weijia Jia 001; Iyad A. Kanj (FSTTCS, 2001)

On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms. - Jianer Chen; Iyad A. Kanj (WG, 2001)

Vertex Cover: Further Observations and Further Improvements. - Jianer Chen; Iyad A. Kanj; Weijia Jia 001 (J. Algorithms, 2001)

Efficient All-to-All Broadcast Schemes in Distributed-Memory Parallel Computers. - Eunseuk Oh; Iyad A. Kanj (HPCS, 2002)

Improved Exact Algorithms for MAX-SAT. - Jianer Chen; Iyad A. Kanj (LATIN, 2002)

Improved Parameterized Algorithms for Planar Dominating Set. - Iyad A. Kanj; Ljubomir Perkovic (MFCS, 2002)

The inapproximability of non-NP-hard optimization problems. - Liming Cai; David W. Juedes; Iyad A. Kanj (Theor. Comput. Sci., 2002)

Genus Characterizes the Complexity of Graph Problems: Some Tight Results. - Jianer Chen; Iyad A. Kanj; Ljubomir Perkovic; Eric Sedgwick; Ge Xia (ICALP, 2003)

Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms. - Jianer Chen; Iyad A. Kanj (J. Comput. Syst. Sci., 2003)

Parameterized Algorithms for Feedback Vertex Set. - Iyad A. Kanj; Michael J. Pelsmajer; Marcus Schaefer 001 (IWPEC, 2004)

Linear FPT reductions and computational lower bounds. - Jianer Chen; Xiuzhen Huang; Iyad A. Kanj; Ge Xia (STOC, 2004)

Using Nondeterminism to Design Efficient Deterministic Algorithms. - Jianer Chen; Donald K. Friesen; Weijia Jia 001; Iyad A. Kanj (Algorithmica, 2004)

Improved exact algorithms for MAX-SAT. - Jianer Chen; Iyad A. Kanj (Discret. Appl. Math., 2004)

W-Hardness Under Linear FPT-Reductions: Structural Properties and Further Applications. - Jianer Chen; Xiuzhen Huang; Iyad A. Kanj; Ge Xia (COCOON, 2005)

Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems. - Jianer Chen; Iyad A. Kanj; Ge Xia (Algorithmica, 2005)

Tight lower bounds for certain parameterized NP-hard problems. - Jianer Chen; Benny Chor; Mike Fellows; Xiuzhen Huang; David W. Juedes; Iyad A. Kanj; Ge Xia (Inf. Comput., 2005)

Hypercube Network Fault Tolerance: A Probabilistic Approach. - Jianer Chen; Iyad A. Kanj; Guojun Wang 001 (J. Interconnect. Networks, 2005)

On approximating minimum vertex cover for graphs with perfect matching. - Jianer Chen; Iyad A. Kanj (Theor. Comput. Sci., 2005)

Improved Stretch Factor for Bounded-Degree Planar Power Spanners of Wireless Ad-Hoc Networks. - Iyad A. Kanj; Ljubomir Perkovic (ALGOSENSORS, 2006)

Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms. - Iyad A. Kanj; Luay Nakhleh; Ge Xia (COCOON, 2006)

On the Effective Enumerability of NP Problems. - Jianer Chen; Iyad A. Kanj; Jie Meng; Ge Xia; Fenghui Zhang (IWPEC, 2006)

Improved Parameterized Upper Bounds for Vertex Cover. - Jianer Chen; Iyad A. Kanj; Ge Xia (MFCS, 2006)

On the computational hardness based on linear FPT-reductions. - Jianer Chen; Xiuzhen Huang; Iyad A. Kanj; Ge Xia (J. Comb. Optim., 2006)

Strong computational lower bounds via parameterized complexity. - Jianer Chen; Xiuzhen Huang; Iyad A. Kanj; Ge Xia (J. Comput. Syst. Sci., 2006)

Strictly-Localized Construction of Near-Optimal Power Spanners for Wireless Ad-Hoc Networks. - Iyad A. Kanj; Ljubomir Perkovic; Ge Xia (DIALM-POMC, 2007)

Seeing the Trees and Their Branches in the Forest is Hard. - Iyad A. Kanj; Luay Nakhleh; Cuong Than; Ge Xia (ICTCS, 2007)

Polynomial time approximation schemes and parameterized complexity. - Jianer Chen; Xiuzhen Huang; Iyad A. Kanj; Ge Xia (Discret. Appl. Math., 2007)

Genus characterizes the complexity of certain graph problems: Some tight results. - Jianer Chen; Iyad A. Kanj; Ljubomir Perkovic; Eric Sedgwick; Ge Xia (J. Comput. Syst. Sci., 2007)

Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size. - Jianer Chen; Henning Fernau; Iyad A. Kanj; Ge Xia (SIAM J. Comput., 2007)

On Geometric Spanners of Euclidean and Unit Disk Graphs. - Iyad A. Kanj; Ljubomir Perkovic (STACS, 2008)

Computing Lightweight Spanners Locally. - Iyad A. Kanj; Ljubomir Perkovic; Ge Xia (DISC, 2008)

Foreword from the Guest Editors. - Jianer Chen; Iyad A. Kanj (Algorithmica, 2008)

The Compatibility of Binary Characters on Phylogenetic Networks: Complexity and Parameterized Algorithms. - Iyad A. Kanj; Luay Nakhleh; Ge Xia (Algorithmica, 2008)

Seeing the trees and their branches in the network is hard. - Iyad A. Kanj; Luay Nakhleh; Cuong Than; Ge Xia (Theor. Comput. Sci., 2008)

On the Dilation of Delaunay Triangulations of Points in Convex Position. - Shiliang Cui; Iyad A. Kanj; Ge Xia (CCCG, 2009)

Convex Recoloring Revisited: Complexity and Exact Algorithms. - Iyad A. Kanj; Dieter Kratsch (COCOON, 2009)

Local Construction of Spanners in the 3-D Space. - Iyad A. Kanj; Ge Xia; Fenghui Zhang (DCOSS, 2009)

What Makes Equitable Connected Partition Easy. - Rosa Enciso; Michael R. Fellows; Jiong Guo; Iyad A. Kanj; Frances A. Rosamond; Ondrej Suchý 001 (IWPEC, 2009)

On Spanners of Geometric Graphs. - Iyad A. Kanj (TAMC, 2009)

On the pseudo-achromatic number problem. - Jianer Chen; Iyad A. Kanj; Jie Meng; Ge Xia; Fenghui Zhang (Theor. Comput. Sci., 2009)

On parameterized exponential time complexity. - Jianer Chen; Iyad A. Kanj; Ge Xia (Theor. Comput. Sci., 2009)

Local Construction of Near-Optimal Power Spanners for Wireless Ad Hoc Networks. - Iyad A. Kanj; Ljubomir Perkovic; Ge Xia (IEEE Trans. Mob. Comput., 2009)

The parameterized complexity of some minimum label problems. - Michael R. Fellows; Jiong Guo; Iyad A. Kanj (J. Comput. Syst. Sci., 2010)

On Spanners and Lightweight Spanners of Geometric Graphs. - Iyad A. Kanj; Ljubomir Perkovic; Ge Xia (SIAM J. Comput., 2010)

Improved upper bounds for vertex cover. - Jianer Chen; Iyad A. Kanj; Ge Xia (Theor. Comput. Sci., 2010)

Safe Approximation and Its Relation to Kernelization. - Jiong Guo; Iyad A. Kanj; Stefan Kratsch (IPEC, 2011)

Editing Graphs into Disjoint Unions of Dense Clusters. - Jiong Guo; Iyad A. Kanj; Christian Komusiewicz; Johannes Uhlmann (Algorithmica, 2011)

On the stretch factor of Delaunay triangulations of points in convex position. - Shiliang Cui; Iyad A. Kanj; Ge Xia (Comput. Geom., 2011)

What makes normalized weighted satisfiability tractable - Iyad A. Kanj; Ge Xia (CoRR, 2011)

On the induced matching problem. - Iyad A. Kanj; Michael J. Pelsmajer; Marcus Schaefer 001; Ge Xia (J. Comput. Syst. Sci., 2011)

Local algorithms for edge colorings in UDGs. - Iyad A. Kanj; Andreas Wiese; Fenghui Zhang (Theor. Comput. Sci., 2011)

Separability and topology control of quasi unit disk graphs. - Jianer Chen; Anxiao Jiang; Iyad A. Kanj; Ge Xia; Fenghui Zhang (Wirel. Networks, 2011)

Parameterized Complexity and Subexponential-Time Computability. - Jianer Chen; Iyad A. Kanj (The Multivariate Algorithmic Revolution and Beyond, 2012)

Multicut in trees viewed through the eyes of vertex cover. - Jianer Chen; Jia-Hao Fan; Iyad A. Kanj; Yang Liu 002; Fenghui Zhang (J. Comput. Syst. Sci., 2012)

Improved local algorithms for spanner construction. - Iyad A. Kanj; Ge Xia (Theor. Comput. Sci., 2012)

Local Construction of Spanners in the 3D Space. - Jonathan P. Jenkins; Iyad A. Kanj; Ge Xia; Fenghui Zhang (IEEE Trans. Mob. Comput., 2012)

On the Subexponential Time Complexity of CSP. - Iyad A. Kanj; Stefan Szeider (AAAI, 2013)

Geometric spanners: Recent results and open directions. - Iyad Kanj (ICCIT, 2013)

The Radiation Hybrid Map Construction Problem Is FPT. - Iyad A. Kanj; Ge Xia; Binhai Zhu (ISBRA, 2013)

Local Backbones. - Ronald de Haan; Iyad A. Kanj; Stefan Szeider (SAT, 2013)

When Is Weighted Satisfiability FPT? - Iyad A. Kanj; Ge Xia (WADS, 2013)

Parameterized top-K algorithms. - Jianer Chen; Iyad A. Kanj; Jie Meng; Ge Xia; Fenghui Zhang (Theor. Comput. Sci., 2013)

On the independence number of graphs with maximum degree 3. - Iyad A. Kanj; Fenghui Zhang (Theor. Comput. Sci., 2013)

Algorithms for Cut Problems on Trees. - Iyad A. Kanj; Guohui Lin; Tian Liu 001; Weitian Tong; Ge Xia; Jinhui Xu 001; Boting Yang; Fenghui Zhang; Peng Zhang 008; Binhai Zhu (COCOA, 2014)

There are Plane Spanners of Maximum Degree 4. - Nicolas Bonichon; Iyad A. Kanj; Ljubomir Perkovic; Ge Xia (SoCG, 2014)

Subexponential Time Complexity of CSP with Global Constraints. - Ronald de Haan; Iyad A. Kanj; Stefan Szeider (CP, 2014)

Small Unsatisfiable Subsets in Constraint Satisfaction. - Ronald de Haan; Iyad A. Kanj; Stefan Szeider (ICTAI, 2014)

Flip Distance is in FPT time $O(n+ k cdot c^k)$. - Iyad A. Kanj; Ge Xia (CoRR, 2014)

On certain geometric properties of the Yao-Yao graphs. - Iyad A. Kanj; Ge Xia (J. Comb. Optim., 2014)

Flip Distance Is in FPT Time O(n+ k * c^k). - Iyad A. Kanj; Ge Xia (STACS, 2015)

Well-Formed Separator Sequences, with an Application to Hypergraph Drawing. - René van Bevern; Iyad A. Kanj; Christian Komusiewicz; Rolf Niedermeier; Manuel Sorge (CoRR, 2015)

There are Plane Spanners of Degree 4 and Moderate Stretch Factor. - Nicolas Bonichon; Iyad A. Kanj; Ljubomir Perkovic; Ge Xia (Discret. Comput. Geom., 2015)

3-Hitting set on bounded degree hypergraphs: Upper and lower bounds on the kernel size. - Iyad A. Kanj; Fenghui Zhang (Discret. Math. Algorithms Appl., 2015)

On the Subexponential-Time Complexity of CSP. - Ronald de Haan; Iyad A. Kanj; Stefan Szeider (J. Artif. Intell. Res., 2015)

Improved parameterized and exact algorithms for cut problems on trees. - Iyad A. Kanj; Guohui Lin; Tian Liu 001; Weitian Tong; Ge Xia; Jinhui Xu 001; Boting Yang; Fenghui Zhang; Peng Zhang 008; Binhai Zhu (Theor. Comput. Sci., 2015)

Parameterized and subexponential-time complexity of satisfiability problems and applications. - Iyad A. Kanj; Stefan Szeider (Theor. Comput. Sci., 2015)

Twins in Subdivision Drawings of Hypergraphs. - René van Bevern; Iyad A. Kanj; Christian Komusiewicz; Rolf Niedermeier; Manuel Sorge (GD, 2016)

On the Ordered List Subgraph Embedding Problems. - Olawale Hassan; Iyad A. Kanj; Daniel Lokshtanov; Ljubomir Perkovic (Algorithmica, 2016)

Guest Editorial: Special Issue on Parameterized and Exact Computation. - Thore Husfeldt; Iyad A. Kanj (Algorithmica, 2017)

Computing the Flip Distance Between Triangulations. - Iyad A. Kanj; Eric Sedgwick; Ge Xia (Discret. Comput. Geom., 2017)

On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability. - Iyad A. Kanj; Dimitrios M. Thilikos; Ge Xia (Inf. Comput., 2017)

Finding Points in General Position. - Vincent Froese; Iyad A. Kanj; André Nichterlein; Rolf Niedermeier (Int. J. Comput. Geom. Appl., 2017)

Degree four plane spanners: Simpler and better. - Iyad A. Kanj; Ljubomir Perkovic; Duru Türkoglu (J. Comput. Geom., 2017)

On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances. - Ronald de Haan; Iyad A. Kanj; Stefan Szeider (ACM Trans. Comput. Log., 2017)

Improved Results for Minimum Constraint Removal. - Eduard Eiben; Jonathan Gemmell; Iyad A. Kanj; Andrew Youngdahl (AAAI, 2018)

How to Navigate Through Obstacles?. - Eduard Eiben; Iyad A. Kanj (ICALP, 2018)

Parameterized Algorithms for the Matrix Completion Problem. - Robert Ganian; Iyad A. Kanj; Sebastian Ordyniak; Stefan Szeider (ICML, 2018)

Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs. - Iyad A. Kanj; Christian Komusiewicz; Manuel Sorge; Erik Jan van Leeuwen (J. Comput. Syst. Sci., 2018)

The Parameterized Complexity of Cascading Portfolio Scheduling. - Eduard Eiben; Robert Ganian; Iyad Kanj; Stefan Szeider (NeurIPS, 2019)

Near-optimal Smooth Path Planning for Multisection Continuum Arms. - Jiahao Deng; Brandon H. Meng; Iyad Kanj; Isuru S. Godage (RoboSoft, 2019)

On Clustering Incomplete Data. - Eduard Eiben; Robert Ganian; Iyad Kanj; Sebastian Ordyniak; Stefan Szeider (CoRR, 2019)

On the Problem of Covering a 3-D Terrain. - Eduard Eiben; Isuru S. Godage; Iyad Kanj; Ge Xia (AAAI, 2020)

On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank. - Robert Ganian; Iyad Kanj; Sebastian Ordyniak; Stefan Szeider (AAAI, 2020)

The Complexity of Tree Partitioning. - Zhao An; Qilong Feng; Iyad Kanj; Ge Xia (Algorithmica, 2020)

Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. - Iyad Kanj; Christian Komusiewicz; Manuel Sorge; Erik Jan van Leeuwen (SIAM J. Discret. Math., 2020)

A Colored Path Problem and Its Applications. - Eduard Eiben; Iyad Kanj (ACM Trans. Algorithms, 2020)

On Existential MSO and Its Relation to ETH. - Robert Ganian; Ronald de Haan; Iyad Kanj; Stefan Szeider (ACM Trans. Comput. Theory, 2020)

The Parameterized Complexity of Clustering Incomplete Data. - Eduard Eiben; Robert Ganian; Iyad Kanj; Sebastian Ordyniak; Stefan Szeider (AAAI, 2021)

Anticipatory Path Planning for Continuum Arms in Dynamic Environments. - Brandon H. Meng; Dimuthu D. K. Arachchige; Jiahao Deng; Isuru S. Godage; Iyad Kanj (ICRA, 2021)

Smooth Path Planning for Continuum Arms. - Brandon H. Meng; Isuru S. Godage; Iyad Kanj (ICRA, 2021)

Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time. - Jianer Chen; Qin Huang 008; Iyad Kanj; Qian Li 012; Ge Xia (ISAAC, 2021)

Optimal Streaming Algorithms for Graph Matching. - Jianer Chen; Qin Huang 008; Iyad Kanj; Ge Xia (CoRR, 2021)

Finding a Cluster in Incomplete Data. - Eduard Eiben; Robert Ganian; Iyad Kanj; Sebastian Ordyniak; Stefan Szeider (ESA, 2022)

Provenance-based Workflow Diagnostics Using Program Specification. - Yuta Nakamura; Tanu Malik; Iyad Kanj; Ashish Gehani (HIPC, 2022)

Near-Optimal Algorithms for Point-Line Covering Problems. - Jianer Chen; Qin Huang 008; Iyad Kanj; Ge Xia (STACS, 2022)

Near-optimal algorithms for point-line fitting problems. - Jianer Chen; Qin Huang 008; Iyad Kanj; Ge Xia (J. Comput. Geom., 2022)

RRT*-Based Path Planning for Continuum Arms. - Brandon H. Meng; Isuru S. Godage; Iyad Kanj (IEEE Robotics Autom. Lett., 2022)

On Covering Segments with Unit Intervals. - Dan Bergren; Eduard Eiben; Robert Ganian; Iyad Kanj (SIAM J. Discret. Math., 2022)

Study on Soft Robotic Pinniped Locomotion. - Dimuthu D. K. Arachchige; Tanmay Varshney; Umer Huzaifa; Iyad Kanj; Thrishantha Nanayakkara; Yue Chen; Hunter B. Gilbert; Isuru S. Godage (AIM, 2023)

Efficient Differencing of System-level Provenance Graphs. - Yuta Nakamura; Iyad Kanj; Tanu Malik (CIKM, 2023)

The Parameterized Complexity of Coordinated Motion Planning. - Eduard Eiben; Robert Ganian; Iyad Kanj (SoCG, 2023)

The Computational Complexity of Concise Hypersphere Classification. - Eduard Eiben; Robert Ganian; Iyad A. Kanj; Sebastian Ordyniak; Stefan Szeider (ICML, 2023)

From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem. - Eduard Eiben; Robert Ganian; Iyad Kanj; Sebastian Ordyniak; Stefan Szeider (IPEC, 2023)

Wheelless Soft Robotic Snake Locomotion: Study on Sidewinding and Helical Rolling Gaits. - Dimuthu D. K. Arachchige; Dulanjana M. Perera; Sanjaya Mallikarachchi; Iyad Kanj; Yue Chen; Isuru S. Godage (RoboSoft, 2023)

Teleoperation of Soft Modular Robots: Study on Real-time Stability and Gait Control. - Dulanjana M. Perera; Dimuthu D. K. Arachchige; Sanjaya Mallikarachchi; Talal Ghafoor; Iyad Kanj; Yue Chen; Isuru S. Godage (RoboSoft, 2023)

Soft Steps: Exploring Quadrupedal Locomotion With Modular Soft Robots. - Dimuthu D. K. Arachchige; Dulanjana M. Perera; Sanjaya Mallikarachchi; Umer Huzaifa; Iyad Kanj; Isuru S. Godage (IEEE Access, 2023)

Dynamic Modeling and Validation of Soft Robotic Snake Locomotion. - Dimuthu D. K. Arachchige; Dulanjana M. Perera; Sanjaya Mallikarachchi; Iyad Kanj; Yue Chen; Hunter B. Gilbert; Isuru S. Godage (CoRR, 2023)

On the parameterized complexity of clustering problems for incomplete data. - Eduard Eiben; Robert Ganian; Iyad Kanj; Sebastian Ordyniak; Stefan Szeider (J. Comput. Syst. Sci., 2023)

On the Parameterized Complexity of Motion Planning for Rectangular Robots. - Iyad Kanj; Salman Parsa (SoCG, 2024)

Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy. - Argyrios Deligkas; Eduard Eiben; Robert Ganian; Iyad Kanj; M. S. Ramanujan 001 (ICALP, 2024)

Path Planning for Continuum Arms in Dynamic Environments. - Brandon H. Meng; Dimuthu D. K. Arachchige; Isuru S. Godage; Iyad Kanj (RoboSoft, 2024)

The role of twins in computing planar supports of hypergraphs. - René van Bevern; Iyad Kanj; Christian Komusiewicz; Rolf Niedermeier; Manuel Sorge (J. Graph Algorithms Appl., 2024)

Tumbling Locomotion of Tetrahedral Soft-Limbed Robots. - Dimuthu D. K. Arachchige; Dulanjana M. Perera; Umer Huzaifa; Iyad Kanj; Isuru S. Godage (IEEE Robotics Autom. Lett., 2024)

Nearly Time-Optimal Kernelization Algorithms for the Line-Cover Problem with Big Data. - Jianer Chen; Qin Huang 008; Iyad Kanj; Ge Xia (Algorithmica, 2024)

A Minor-Testing Approach for Coordinated Motion Planning with Sliding Robots. - Eduard Eiben; Robert Ganian; Iyad Kanj; M. S. Ramanujan 001 (SoCG, 2025)

Parameterized Algorithms for Multiagent Pathfinding on Trees. - Argyrios Deligkas; Eduard Eiben; Robert Ganian; Iyad Kanj; M. S. Ramanujan 001 (AAMAS, 2025)

Routing Few Robots in a Crowded Network. - Argyrios Deligkas; Eduard Eiben; Robert Ganian; Iyad Kanj; Dominik Leko; M. S. Ramanujan 001 (WADS, 2025)

Efficient Trotting of Soft Robotic Quadrupeds. - Dimuthu D. K. Arachchige; Tim Sheehan; Dulanjana M. Perera; Sanjaya Mallikarachchi; Umer Huzaifa; Iyad Kanj; Isuru S. Godage (IEEE Trans Autom. Sci. Eng., 2025)