Spanning trees crossing few barriers
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Mining optimized gain rules for numeric attributes
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
On approximating rectangle tiling and packing
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Slice and dice: a simple, improved approximate tiling recipe
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Binary space partitions for axis-paralles line segments: size-height tradeoffs
Information Processing Letters
Mining Optimized Gain Rules for Numeric Attributes
IEEE Transactions on Knowledge and Data Engineering
On Rectangular Partitionings in Two Dimensions: Algorithms, Complexity, and Applications
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Angle counts for isothetic polygons and polyhedra
Pattern Recognition Letters
Optimal BSPs and rectilinear cartograms
GIS '06 Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems
Drawing slicing graphs with face areas
Theoretical Computer Science
Orthogonal drawings for plane graphs with specified face areas
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
On communication protocols that compute almost privately
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
On rectilinear duals for vertex-weighted plane graphs
GD'05 Proceedings of the 13th international conference on Graph Drawing
On communication protocols that compute almost privately
Theoretical Computer Science
| Hi-index | 0.90 |