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)
Polygonal chain approximation: a query based approach
Computational Geometry: Theory and Applications
Proximity problems on line segments spanned by points
Computational Geometry: Theory and Applications
Efficient algorithms for bichromatic separability
ACM Transactions on Algorithms (TALG)
Planar bichromatic minimum spanning trees
Journal of Discrete Algorithms
Proximity problems on line segments spanned by points
Computational Geometry: Theory and Applications
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
Stabbers of line segments in the plane
Computational Geometry: Theory and Applications
Kinetic red-blue minimum separating circle
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Minimizing the error of linear separators on linearly inseparable data
Discrete Applied Mathematics
| Hi-index | 0.00 |