Iyad A. Kanj

activity

20082024

most citedOn Geometric Spanners of Euclidean and Unit Disk Graphs

19 citations · 44 across the 21 of their papers we have counts for

collaborators

Showing 2017Show all

3 papers · 1 filter

cs.CG2017

How to navigate through obstacles?

Eduard Eiben, Iyad Kanj

Given a set of obstacles and two points, is there a path between the two points that does not cross more than $k$ different obstacles? This is a fundamental problem that has underg…

cs.CC2017★ 3 cited

The Complexity of Tree Partitioning

Zhao An, Qilong Feng, Iyad Kanj +1

Given a tree $T$ on $n$ vertices, and $k, b, s_{1}, \dots, s_{b} \in N$ , the Tree Partitioning problem asks if at most $k$ edges can be removed from $T$ so that the resulting componen…

cs.CC2017

Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs

Iyad Kanj, Christian Komusiewicz, Manuel Sorge +1

A graph $G$ is a $(Π_{A}, Π_{B})$ -graph if $V (G)$ can be bipartitioned into $A$ and $B$ such that $G [A]$ satisfies property $Π_{A}$ and $G [B]$ satisfies property $Π_{B}$ . The $(Π_{A},Π_{B})…