19 citations · 44 across the 21 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.RO2018
Near-optimal Smooth Path Planning for Multisection Continuum Arms
Jiahao Deng, Brandon H. Meng, Iyad Kanj +1
We study the path planning problem for continuum-arm robots, in which we are given a starting and an end point, and we need to compute a path for the tip of the continuum arm betwe…
cs.CC2018
Solving Partition Problems Almost Always Requires Pushing Many Vertices Around
Iyad Kanj, Christian Komusiewicz, Manuel Sorge +1
A fundamental graph problem is to recognize whether the vertex set of a graph can be bipartitioned into sets and such that and satisfy properties an…
cs.DS2018★ 10 cited
Parameterized Algorithms for the Matrix Completion Problem
Robert Ganian, Iyad Kanj, Sebastian Ordyniak +1
We consider two matrix completion problems, in which we are given a matrix with missing entries and the task is to complete the matrix in a way that (1) minimizes the rank, or (2)…