Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Watson, Donald
1969.
On partitions of N points.
Proceedings of the Edinburgh Mathematical Society,
Vol. 16,
Issue. 3,
p.
263.
Grünbaum, Branko
1973.
Polygons in Arrangements Generated by n Points.
Mathematics Magazine,
Vol. 46,
Issue. 3,
p.
113.
Wenocur, R.S.
and
Dudley, R.M.
1981.
Some special vapnik-chervonenkis classes.
Discrete Mathematics,
Vol. 33,
Issue. 3,
p.
313.
Miles, R. E.
1982.
A generalization of a formula of Steiner.
Zeitschrift f�r Wahrscheinlichkeitstheorie und Verwandte Gebiete,
Vol. 61,
Issue. 3,
p.
375.
Goodman, Jacob E.
and
Pollack, Richard
1983.
Multidimensional Sorting.
SIAM Journal on Computing,
Vol. 12,
Issue. 3,
p.
484.
Alon, N.
Frankl, P.
and
Rodl, V.
1985.
Geometrical realization of set systems and probabilistic communication complexity.
p.
277.
Ambartzumian, R. V.
1987.
Stochastic and Integral Geometry.
p.
3.
Ambartzumian, R. V.
1987.
Combinatorial integral geometry, metrics, and zonoids.
Acta Applicandae Mathematicae,
Vol. 9,
Issue. 1-2,
p.
3.
Alon, Noga
Dewdney, A. K.
and
Ott, Teunis J.
1991.
Efficient simulation of finite automata by neural nets.
Journal of the ACM,
Vol. 38,
Issue. 2,
p.
495.
ECKHOFF, Jürgen
1993.
Handbook of Convex Geometry.
p.
389.
Lin, Jianhua
and
Storer, James A.
1994.
Design and performance of tree-structured vector quantizers.
Information Processing & Management,
Vol. 30,
Issue. 6,
p.
851.
Diep, T.A.
1998.
Capacity of multilevel threshold devices.
IEEE Transactions on Information Theory,
Vol. 44,
Issue. 1,
p.
241.
Aviran, Sharon
Lev-Tov, Nissan
Onn, Shmuel
and
Rothblum, Uriel G.
2002.
Vertex characterization of partition polytopes of bipartitions and of planar point sets.
Discrete Applied Mathematics,
Vol. 124,
Issue. 1-3,
p.
1.
Onn, Shmuel
2003.
Convex Matroid Optimization.
SIAM Journal on Discrete Mathematics,
Vol. 17,
Issue. 2,
p.
249.
Queiroz, M.
Humes, C.
and
Júdice, J.
2004.
On finding global optima for the hinge fitting problem.
Computers & Operations Research,
Vol. 31,
Issue. 1,
p.
101.
Chang, F.H.
Guo, J.Y.
Hwang, F.K.
and
Lee, J.S.
2007.
Counting disjoint 2-partitions for points in the plane.
Discrete Applied Mathematics,
Vol. 155,
Issue. 16,
p.
2087.
Onn, Shmuel
and
Rothblum, Uriel G.
2007.
The use of edge-directions and linear programming to enumerate vertices.
Journal of Combinatorial Optimization,
Vol. 14,
Issue. 2-3,
p.
153.
Onn, Shmuel
2008.
Encyclopedia of Optimization.
p.
513.
Dudley, R. M.
2010.
Selected Works of R.M. Dudley.
p.
253.
TODA, Takahisa
2011.
On Partitioning Colored Points.
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences,
Vol. E94-A,
Issue. 6,
p.
1242.