Author:
Ding Guo-Li,Seymour Paul,Winkler Peter
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference8 articles.
1. D. Bienstock, andN. Dean: Some obstructions to small face covers in planar graphs,J. Combinatorial Theory, (B), to appear.
2. A. Blumer, A. Ehrenfeucht, D. Haussler, andM. K. Warmuth: Learnability and the Vapnik-?hervonenkis dimension,J. Assoc. Comp. Mach. 36 (1989), 929?965.
3. J. Folkman: Notes on the Ramsey numberN (3,3,3,3),J. Combinatorial Theory, (A),16 (1974), 371?379.
4. D. Haussler, andE. Welzl: ?-nets and simplex range queries,Discrete Comput. Geom. 2 (1987), 127?151.
5. J. Komlós, J. Pach, andG. Woeginger: Almost tight bounds for epsilon-nets,Disc. and Comput. Geom.,7 (1992), 163?173.
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献