Iyad Kanj

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 47

Top Topics

Incomplete Data

Dynamic Environments

Parameterized Complexity

Top Venues

IEEE Robotics Autom. Lett.

Publications

Dimuthu D. K. Arachchige, Dulanjana M. Perera, Umer Huzaifa, Iyad Kanj, Isuru S. Godage
Tumbling Locomotion of Tetrahedral Soft-Limbed Robots. IEEE Robotics Autom. Lett. 9 (5) (2024)
Iyad Kanj, Salman Parsa
On the Parameterized Complexity of Motion Planning for Rectangular Robots. CoRR (2024)
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan
Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy. ICALP (2024)
Iyad Kanj, Salman Parsa
On the Parameterized Complexity of Motion Planning for Rectangular Robots. SoCG (2024)
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan
Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy. CoRR (2024)
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem. CoRR (2024)
Brandon H. Meng, Dimuthu D. K. Arachchige, Isuru S. Godage, Iyad Kanj
Path Planning for Continuum Arms in Dynamic Environments. RoboSoft (2024)
Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia
Nearly Time-Optimal Kernelization Algorithms for the Line-Cover Problem with Big Data. Algorithmica 86 (8) (2024)
Eduard Eiben, Robert Ganian, Iyad Kanj
The Parameterized Complexity of Coordinated Motion Planning. SoCG (2023)
Jianer Chen, Qin Huang, Iyad Kanj, Qian Li, Ge Xia
Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time. CoRR (2023)
Dimuthu D. K. Arachchige, Dulanjana M. Perera, Sanjaya Mallikarachchi, Iyad Kanj, Yue Chen, Isuru S. Godage
Wheelless Soft Robotic Snake Locomotion: Study on Sidewinding and Helical Rolling Gaits. CoRR (2023)
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
On the parameterized complexity of clustering problems for incomplete data. J. Comput. Syst. Sci. 134 (2023)
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem. IPEC (2023)
Dimuthu D. K. Arachchige, Tanmay Varshney, Umer Huzaifa, Iyad Kanj, Thrishantha Nanayakkara, Yue Chen, Hunter B. Gilbert, Isuru S. Godage
Study on Soft Robotic Pinniped Locomotion. AIM (2023)
Yuta Nakamura, Iyad Kanj, Tanu Malik
Efficient Differencing of System-level Provenance Graphs. CIKM (2023)
Dulanjana M. Perera, Dimuthu D. K. Arachchige, Sanjaya Mallikarachchi, Talal Ghafoor, Iyad Kanj, Yue Chen, Isuru S. Godage
Teleoperation of Soft Modular Robots: Study on Real-time Stability and Gait Control. RoboSoft (2023)
Dimuthu D. K. Arachchige, Tanmay Varshney, Umer Huzaifa, Iyad Kanj, Thrishantha Nanayakkara, Yue Chen, Hunter B. Gilbert, Isuru S. Godage
Study on Soft Robotic Pinniped Locomotion. CoRR (2023)
Eduard Eiben, Robert Ganian, Iyad Kanj
The Parameterized Complexity of Coordinated Motion Planning. CoRR (2023)
Dimuthu D. K. Arachchige, Dulanjana M. Perera, Sanjaya Mallikarachchi, Umer Huzaifa, Iyad Kanj, Isuru S. Godage
Soft Steps: Exploring Quadrupedal Locomotion With Modular Soft Robots. IEEE Access 11 (2023)
Dimuthu D. K. Arachchige, Dulanjana M. Perera, Sanjaya Mallikarachchi, Iyad Kanj, Yue Chen, Isuru S. Godage
Wheelless Soft Robotic Snake Locomotion: Study on Sidewinding and Helical Rolling Gaits. RoboSoft (2023)
Dimuthu D. K. Arachchige, Dulanjana M. Perera, Sanjaya Mallikarachchi, Iyad Kanj, Yue Chen, Hunter B. Gilbert, Isuru S. Godage
Dynamic Modeling and Validation of Soft Robotic Snake Locomotion. CoRR (2023)
Dulanjana M. Perera, Dimuthu D. K. Arachchige, Sanjaya Mallikarachchi, Talal Ghafoor, Iyad Kanj, Yue Chen, Isuru S. Godage
Teleoperation of Soft Modular Robots: Study on Real-time Stability and Gait Control. CoRR (2023)
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
Finding a Cluster in Incomplete Data. CoRR (2023)
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
The Computational Complexity of Concise Hypersphere Classification. CoRR (2023)
Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia
Near-Optimal Algorithms for Point-Line Covering Problems. STACS (2022)
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
Finding a Cluster in Incomplete Data. ESA (2022)
Brandon H. Meng, Isuru S. Godage, Iyad Kanj
RRT*-Based Path Planning for Continuum Arms. IEEE Robotics Autom. Lett. 7 (3) (2022)
Dan Bergren, Eduard Eiben, Robert Ganian, Iyad Kanj
On Covering Segments with Unit Intervals. SIAM J. Discret. Math. 36 (2) (2022)
Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia
Near-optimal algorithms for point-line fitting problems. J. Comput. Geom. 13 (1) (2022)
Yuta Nakamura, Tanu Malik, Iyad Kanj, Ashish Gehani
Provenance-based Workflow Diagnostics Using Program Specification. HIPC (2022)
Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia
Optimal Streaming Algorithms for Graph Matching. CoRR (2021)
Jianer Chen, Qin Huang, Iyad Kanj, Qian Li, Ge Xia
Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time. ISAAC (2021)
Brandon H. Meng, Isuru S. Godage, Iyad Kanj
Smooth Path Planning for Continuum Arms. ICRA (2021)
Brandon H. Meng, Dimuthu D. K. Arachchige, Jiahao Deng, Isuru S. Godage, Iyad Kanj
Anticipatory Path Planning for Continuum Arms in Dynamic Environments. ICRA (2021)
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
The Parameterized Complexity of Clustering Incomplete Data. AAAI (2021)
Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia
Near-Optimal Algorithms for Point-Line Covering Problems. CoRR (2020)
Zhao An, Qilong Feng, Iyad Kanj, Ge Xia
The Complexity of Tree Partitioning. Algorithmica 82 (9) (2020)
Eduard Eiben, Iyad Kanj
A Colored Path Problem and Its Applications. ACM Trans. Algorithms 16 (4) (2020)
Dan Bergren, Eduard Eiben, Robert Ganian, Iyad Kanj
On Covering Segments with Unit Intervals. STACS (2020)
Eduard Eiben, Isuru S. Godage, Iyad Kanj, Ge Xia
On the Problem of Covering a 3-D Terrain. AAAI (2020)
Iyad Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. SIAM J. Discret. Math. 34 (1) (2020)
Robert Ganian, Ronald de Haan, Iyad Kanj, Stefan Szeider
On Existential MSO and Its Relation to ETH. ACM Trans. Comput. Theory 12 (4) (2020)
Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank. AAAI (2020)
Eduard Eiben, Robert Ganian, Iyad Kanj, Stefan Szeider
The Parameterized Complexity of Cascading Portfolio Scheduling. NeurIPS (2019)
Jiahao Deng, Brandon H. Meng, Iyad Kanj, Isuru S. Godage
Near-optimal Smooth Path Planning for Multisection Continuum Arms. RoboSoft (2019)
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
On Clustering Incomplete Data. CoRR (2019)
Jiahao Deng, Brandon H. Meng, Iyad Kanj, Isuru S. Godage
Near-optimal Smooth Path Planning for Multisection Continuum Arms. CoRR (2018)
Iyad Kanj
Geometric spanners: Recent results and open directions. ICCIT (2013)