Learnability and the Vapnik-Chervonenkis dimension
Journal of the ACM (JACM)
Separation and approximation of polyhedral objects
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Circular separability of polygon
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Efficient algorithms for bichromatic separability
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Separating point sets in polygonal environments
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Separability by two lines and by nearly straight polygonal chains
Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
Counterexample-guided predicate abstraction of hybrid systems
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2003)
Efficient algorithms for bichromatic separability
ACM Transactions on Algorithms (TALG)
Separability by two lines and by nearly straight polygonal chains
Discrete Applied Mathematics
Red-blue separability problems in 3D
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
Counter-example guided predicate abstraction of hybrid systems
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
| Hi-index | 0.00 |