19 citations · 44 across the 21 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
cs.DS2014
Computing the flip distance between triangulations
Iyad Kanj, Eric Sedgwick, Ge Xia
Let be a triangulation of a set of points in the plane, and let be an edge shared by two triangles in such that the quadrilateral forme…
cs.CG2014★ 1 cited
There are Plane Spanners of Maximum Degree 4
Nicolas Bonichon, Iyad Kanj, Ljubomir Perković +1
Let E be the complete Euclidean graph on a set of points embedded in the plane. Given a constant t >= 1, a spanning subgraph G of E is said to be a t-spanner, or simply a spanner,…
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…