Cooperative mobile guards in grids
Computational Geometry: Theory and Applications
Drawings of planar graphs with few slopes and segments
Computational Geometry: Theory and Applications
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Every planar graph is the intersection graph of segments in the plane: extended abstract
Proceedings of the forty-first annual ACM symposium on Theory of computing
Weakly cooperative guards in grids
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and its Applications - Volume Part I
An efficient algorithm for mobile guarded guards in simple grids
ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
Fault tolerant guarding of grids
ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
Contact and intersection representations
GD'04 Proceedings of the 12th international conference on Graph Drawing
| Hi-index | 0.89 |