Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Alon, Noga
and
Kleitman, Daniel J.
1992.
Piercing convex sets.
Bulletin of the American Mathematical Society,
Vol. 27,
Issue. 2,
p.
252.
Lo, Chi-Yuan
Matoušek, J.
and
Steiger, W.
1994.
Algorithms for ham-sandwich cuts.
Discrete & Computational Geometry,
Vol. 11,
Issue. 4,
p.
433.
Dey, T. K.
and
Edelsbrunner, H.
1994.
Counting triangle crossings and halving planes.
Discrete & Computational Geometry,
Vol. 12,
Issue. 3,
p.
281.
Chazelle, Bernard
1994.
System Modelling and Optimization.
Vol. 197,
Issue. ,
p.
42.
Agarwal, P. K.
and
Matoušek, J.
1995.
Dynamic half-space range reporting and its applications.
Algorithmica,
Vol. 13,
Issue. 4,
p.
325.
1995.
Combinatorial Geometry.
p.
319.
Alon, N.
and
Kalai, G.
1995.
Bounding the piercing number.
Discrete & Computational Geometry,
Vol. 13,
Issue. 3-4,
p.
245.
Chazelle, B.
Edelsbrunner, H.
Grigni, M.
Guibas, L.
Sharir, M.
and
Welzl, E.
1995.
Improved bounds on weak ε-nets for convex sets.
Discrete & Computational Geometry,
Vol. 13,
Issue. 1,
p.
1.
Bárány, Imre
and
Onn, Shmuel
1996.
Integer Programming and Combinatorial Optimization.
Vol. 1084,
Issue. ,
p.
1.
Dey, T.K.
1997.
Improved bounds on planar k-sets and k-levels.
p.
156.
Agarwal, Pankaj K.
de Berg, Mark
Matousek, Jirí
and
Schwarzkopf, Otfried
1998.
Constructing Levels in Arrangements and Higher Order Voronoi Diagrams.
SIAM Journal on Computing,
Vol. 27,
Issue. 3,
p.
654.
MatouŠek, Jiří
1998.
European Congress of Mathematics.
Vol. 169,
Issue. ,
p.
1.
Pach, János
1998.
A Tverberg-type result on multicolored simplices.
Computational Geometry,
Vol. 10,
Issue. 2,
p.
71.
Andrzejak, Artur
and
Fukuda, Komei
1999.
Algorithms and Data Structures.
Vol. 1663,
Issue. ,
p.
1.
Agarwal, Pankaj K.
and
Sharir, Micha
2000.
Handbook of Computational Geometry.
p.
49.
Alon, Noga
Kalai, Gil
Matoušek, Jiřı́
and
Meshulam, Roy
2002.
Transversal numbers for hypergraphs arising in geometry.
Advances in Applied Mathematics,
Vol. 29,
Issue. 1,
p.
79.
Eckhoff, Jürgen
2003.
Discrete and Computational Geometry.
Vol. 25,
Issue. ,
p.
347.
Matouaek, Jivri
2003.
New constructions of weak epsilon-nets.
p.
129.
Kalai, Gil
and
Meshulam, Roy
2005.
A topological colorful Helly theorem.
Advances in Mathematics,
Vol. 191,
Issue. 2,
p.
305.
Fukuda, Komei
and
Rosta, Vera
2005.
Graph Theory and Combinatorial Optimization.
p.
37.