Iyad Kanj

57 papers A* 10A 5B 3Misc 1Journal 31Unranked 7
YearRankTypeTitle / Venue / Authors
2026 J jnl
From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem.
Algorithmica
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2026 J jnl
Routing few robots in a crowded network.
J. Comput. Syst. Sci.
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, Dominik Leko, M. S. Ramanujan
2025 A* conf
A Minor-Testing Approach for Coordinated Motion Planning with Sliding Robots.
SoCG
Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan
2025 J jnl
A Minor-Testing Approach for Coordinated Motion Planning with Sliding Robots.
CoRR
Eduard Eiben, Robert Ganian, Iyad Kanj, Ramanujan Maadapuzhi Sridharan
2025 J jnl
Efficient Trotting of Soft Robotic Quadrupeds.
IEEE Trans Autom. Sci. Eng.
Dimuthu D. K. Arachchige, Tim Sheehan, Dulanjana M. Perera, Sanjaya Mallikarachchi, Umer Huzaifa, Iyad Kanj, Isuru S. Godage
2025 — conf
Motion Planning of Disk and Rectangular Robots.
CCCG
Eduard Eiben, Iyad Kanj, Salman Parsa
2025 A conf
Parameterized Algorithms for Multiagent Pathfinding on Trees.
AAMAS
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan
2025 B conf
Routing Few Robots in a Crowded Network.
WADS
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, Dominik Leko, M. S. Ramanujan
2024 J jnl
From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem.
CoRR
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2024 J jnl
Nearly Time-Optimal Kernelization Algorithms for the Line-Cover Problem with Big Data.
Algorithmica
Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia
2024 A* conf
On the Parameterized Complexity of Motion Planning for Rectangular Robots.
SoCG
Iyad Kanj, Salman Parsa
2024 J jnl
On the Parameterized Complexity of Motion Planning for Rectangular Robots.
CoRR
Iyad Kanj, Salman Parsa
2024 A* conf
Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy.
ICALP
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan
2024 J jnl
Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy.
CoRR
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan
2024 — conf
Path Planning for Continuum Arms in Dynamic Environments.
RoboSoft
Brandon H. Meng, Dimuthu D. K. Arachchige, Isuru S. Godage, Iyad Kanj
2024 J jnl
The role of twins in computing planar supports of hypergraphs.
J. Graph Algorithms Appl.
René van Bevern, Iyad Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge
2024 J jnl
Tumbling Locomotion of Tetrahedral Soft-Limbed Robots.
IEEE Robotics Autom. Lett.
Dimuthu D. K. Arachchige, Dulanjana M. Perera, Umer Huzaifa, Iyad Kanj, Isuru S. Godage
2023 J jnl
Dynamic Modeling and Validation of Soft Robotic Snake Locomotion.
CoRR
Dimuthu D. K. Arachchige, Dulanjana M. Perera, Sanjaya Mallikarachchi, Iyad Kanj, Yue Chen, Hunter B. Gilbert, Isuru S. Godage
2023 A conf
Efficient Differencing of System-level Provenance Graphs.
CIKM
Yuta Nakamura, Iyad Kanj, Tanu Malik
2023 J jnl
Finding a Cluster in Incomplete Data.
CoRR
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2023 B conf
From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem.
IPEC
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2023 J jnl
On the parameterized complexity of clustering problems for incomplete data.
J. Comput. Syst. Sci.
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2023 J jnl
Soft Steps: Exploring Quadrupedal Locomotion With Modular Soft Robots.
IEEE Access
Dimuthu D. K. Arachchige, Dulanjana M. Perera, Sanjaya Mallikarachchi, Umer Huzaifa, Iyad Kanj, Isuru S. Godage
2023 J jnl
Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time.
CoRR
Jianer Chen, Qin Huang, Iyad Kanj, Qian Li, Ge Xia
2023 — conf
Study on Soft Robotic Pinniped Locomotion.
AIM
Dimuthu D. K. Arachchige, Tanmay Varshney, Umer Huzaifa, Iyad Kanj, Thrishantha Nanayakkara, Yue Chen, Hunter B. Gilbert, Isuru S. Godage
2023 J jnl
Study on Soft Robotic Pinniped Locomotion.
CoRR
Dimuthu D. K. Arachchige, Tanmay Varshney, Umer Huzaifa, Iyad Kanj, Thrishantha Nanayakkara, Yue Chen, Hunter B. Gilbert, Isuru S. Godage
2023 — conf
Teleoperation of Soft Modular Robots: Study on Real-time Stability and Gait Control.
RoboSoft
Dulanjana M. Perera, Dimuthu D. K. Arachchige, Sanjaya Mallikarachchi, Talal Ghafoor, Iyad Kanj, Yue Chen, Isuru S. Godage
2023 J jnl
Teleoperation of Soft Modular Robots: Study on Real-time Stability and Gait Control.
CoRR
Dulanjana M. Perera, Dimuthu D. K. Arachchige, Sanjaya Mallikarachchi, Talal Ghafoor, Iyad Kanj, Yue Chen, Isuru S. Godage
2023 J jnl
The Computational Complexity of Concise Hypersphere Classification.
CoRR
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2023 A* conf
The Parameterized Complexity of Coordinated Motion Planning.
SoCG
Eduard Eiben, Robert Ganian, Iyad Kanj
2023 J jnl
The Parameterized Complexity of Coordinated Motion Planning.
CoRR
Eduard Eiben, Robert Ganian, Iyad Kanj
2023 — conf
Wheelless Soft Robotic Snake Locomotion: Study on Sidewinding and Helical Rolling Gaits.
RoboSoft
Dimuthu D. K. Arachchige, Dulanjana M. Perera, Sanjaya Mallikarachchi, Iyad Kanj, Yue Chen, Isuru S. Godage
2023 J jnl
Wheelless Soft Robotic Snake Locomotion: Study on Sidewinding and Helical Rolling Gaits.
CoRR
Dimuthu D. K. Arachchige, Dulanjana M. Perera, Sanjaya Mallikarachchi, Iyad Kanj, Yue Chen, Isuru S. Godage
2022 A conf
Finding a Cluster in Incomplete Data.
ESA
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2022 A conf
Near-Optimal Algorithms for Point-Line Covering Problems.
STACS
Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia
2022 J jnl
Near-optimal algorithms for point-line fitting problems.
J. Comput. Geom.
Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia
2022 J jnl
On Covering Segments with Unit Intervals.
SIAM J. Discret. Math.
Dan Bergren, Eduard Eiben, Robert Ganian, Iyad Kanj
2022 Misc conf
Provenance-based Workflow Diagnostics Using Program Specification.
HIPC
Yuta Nakamura, Tanu Malik, Iyad Kanj, Ashish Gehani
2022 J jnl
RRT*-Based Path Planning for Continuum Arms.
IEEE Robotics Autom. Lett.
Brandon H. Meng, Isuru S. Godage, Iyad Kanj
2021 A* conf
Anticipatory Path Planning for Continuum Arms in Dynamic Environments.
ICRA
Brandon H. Meng, Dimuthu D. K. Arachchige, Jiahao Deng, Isuru S. Godage, Iyad Kanj
2021 J jnl
Optimal Streaming Algorithms for Graph Matching.
CoRR
Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia
2021 A* conf
Smooth Path Planning for Continuum Arms.
ICRA
Brandon H. Meng, Isuru S. Godage, Iyad Kanj
2021 B conf
Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time.
ISAAC
Jianer Chen, Qin Huang, Iyad Kanj, Qian Li, Ge Xia
2021 A* conf
The Parameterized Complexity of Clustering Incomplete Data.
AAAI
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2020 J jnl
A Colored Path Problem and Its Applications.
ACM Trans. Algorithms
Eduard Eiben, Iyad Kanj
2020 J jnl
Near-Optimal Algorithms for Point-Line Covering Problems.
CoRR
Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia
2020 A conf
On Covering Segments with Unit Intervals.
STACS
Dan Bergren, Eduard Eiben, Robert Ganian, Iyad Kanj
2020 J jnl
On Existential MSO and Its Relation to ETH.
ACM Trans. Comput. Theory
Robert Ganian, Ronald de Haan, Iyad Kanj, Stefan Szeider
2020 A* conf
On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank.
AAAI
Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2020 A* conf
On the Problem of Covering a 3-D Terrain.
AAAI
Eduard Eiben, Isuru S. Godage, Iyad Kanj, Ge Xia
2020 J jnl
Solving Partition Problems Almost Always Requires Pushing Many Vertices Around.
SIAM J. Discret. Math.
Iyad Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
2020 J jnl
The Complexity of Tree Partitioning.
Algorithmica
Zhao An, Qilong Feng, Iyad Kanj, Ge Xia
2019 — conf
Near-optimal Smooth Path Planning for Multisection Continuum Arms.
RoboSoft
Jiahao Deng, Brandon H. Meng, Iyad Kanj, Isuru S. Godage
2019 J jnl
On Clustering Incomplete Data.
CoRR
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2019 A* conf
The Parameterized Complexity of Cascading Portfolio Scheduling.
NeurIPS
Eduard Eiben, Robert Ganian, Iyad Kanj, Stefan Szeider
2018 J jnl
Near-optimal Smooth Path Planning for Multisection Continuum Arms.
CoRR
Jiahao Deng, Brandon H. Meng, Iyad Kanj, Isuru S. Godage
2013 — conf
Geometric spanners: Recent results and open directions.
ICCIT
Iyad Kanj