Minimum partitioning simple rectilinear polygons in O(n log log n) - time
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Journal of Experimental Algorithmics (JEA)
Covering rectilinear polygons with axis-parallel rectangles
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Pushdown-reduce: an algorithm for connectivity augmentation and poset covering problems
Discrete Applied Mathematics
Primal-dual approach for directed vertex connectivity augmentation and generalizations
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Primal-dual approach for directed vertex connectivity augmentation and generalizations
ACM Transactions on Algorithms (TALG)
An algorithm for the difference between set covers
Discrete Applied Mathematics
Jump number of two-directional orthogonal ray graphs
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
| Hi-index | 0.00 |