Maximum k-chains in planar point sets: combinatorial structure and algorithms
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
ACM Computing Surveys (CSUR)
A bipartite analogue of Dilworth's theorem for multiple partial orders
European Journal of Combinatorics
A fast algorithm for computing a longest common increasing subsequence
Information Processing Letters
Weak visibility of two objects in planar polygonal scenes
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I
Higher-order Erdös: Szekeres theorems
Proceedings of the twenty-eighth annual symposium on Computational geometry
Ramsey-type results for semi-algebraic relations
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |