Minimal completely separating systems of k-sets
Journal of Combinatorial Theory Series A
On the Power of the Semi-Separated Pair Decomposition
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
New constructions of SSPDs and their applications
Proceedings of the twenty-sixth annual symposium on Computational geometry
The euclidean bottleneck steiner path problem
Proceedings of the twenty-seventh annual symposium on Computational geometry
New constructions of SSPDs and their applications
Computational Geometry: Theory and Applications
On the power of the semi-separated pair decomposition
Computational Geometry: Theory and Applications
Search when the lie depends on the target
Information Theory, Combinatorics, and Search Theory
| Hi-index | 0.00 |
We sharpen a result of Hansel on separating set systems. We also extend a theorem of Spencer on completely separating systems by proving an analogue of Hansel's result.