Representing a Planar Straight-Line Graph Using Few Obstacles. | 1 | 0.38 | 2014 |
More is more: The benefits of denser sensor deployment | 4 | 0.45 | 2012 |
Convex obstacle numbers of outerplanar graphs and bipartite permutation graphs | 4 | 0.45 | 2011 |
On the Structure of Graphs with Low Obstacle Number | 8 | 0.87 | 2011 |
Computing the obstacle number of a plane graph | 3 | 0.63 | 2011 |
Approximating the Obstacle Number for a Graph Drawing Efficiently. | 3 | 0.59 | 2011 |
Graphs with large obstacle numbers | 4 | 0.48 | 2010 |
Generalized Delaunay Graphs with respect to any Convex Set are Plane Graphs | 1 | 0.36 | 2010 |
Small (2,s)-colorable graphs without 1-obstacle representations | 3 | 0.59 | 2010 |
History trees as descriptors of macromolecular structures | 3 | 0.43 | 2006 |