19 citations · 44 across the 21 of their papers we have counts for
29 papers
From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem
Eduard Eiben, Robert Ganian, Iyad Kanj +2
Several works have recently investigated the parameterized complexity of data completion problems, motivated by their applications in machine learning, and clustering in particular…
The Parameterized Complexity of Coordinated Motion Planning
Eduard Eiben, Robert Ganian, Iyad Kanj
In Coordinated Motion Planning (CMP), we are given a rectangular-grid on which robots occupy distinct starting gridpoints and need to reach distinct destination gridpoi…
Finding a Cluster in Incomplete Data
Eduard Eiben, Robert Ganian, Iyad Kanj +2
We study two variants of the fundamental problem of finding a cluster in incomplete data. In the problems under consideration, we are given a multiset of incomplete -dimensional…
The Computational Complexity of Concise Hypersphere Classification
Eduard Eiben, Robert Ganian, Iyad Kanj +2
Hypersphere classification is a classical and foundational method that can provide easy-to-process explanations for the classification of real-valued and binary data. However, obta…
Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time
Jianer Chen, Qin Huang, Iyad Kanj +2
We present streaming algorithms for the graph -matching problem in both the insert-only and dynamic models. Our algorithms, with space complexity matching the best upper bounds,…
Study on Soft Robotic Pinniped Locomotion
Dimuthu D. K. Arachchige, Tanmay Varshney, Umer Huzaifa +5
Legged locomotion is a highly promising but under-researched subfield within the field of soft robotics. The compliant limbs of soft-limbed robots offer numerous benefits, includin…