19 citations · 20 across the 5 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2014
On the Ordered List Subgraph Embedding Problems
Olawale Hassan, Iyad Kanj, Daniel Lokshtanov +1
In the (parameterized) Ordered List Subgraph Embedding problem (p-OLSE) we are given two graphs and , each with a linear order defined on its vertices, a function that a…
cs.DS2008★ 19 cited
On Geometric Spanners of Euclidean and Unit Disk Graphs
Iyad A. Kanj, Ljubomir Perkovic
We consider the problem of constructing bounded-degree planar geometric spanners of Euclidean and unit-disk graphs. It is well known that the Delaunay subgraph is a planar geometri…