暂无分享,去创建一个
János Pach | Gábor Tardos | Natan Rubin | J. Pach | G. Tardos | Natan Rubin
[1] János Pach,et al. Crossings between Curves with Many Tangencies , 2010, WALCOM.
[2] Paul Erdös,et al. Ramsey-type theorems , 1989, Discret. Appl. Math..
[3] Larry Guth,et al. Algebraic methods in discrete analogs of the Kakeya problem , 2008, 0812.1043.
[4] Bernard Chazelle,et al. The discrepancy method - randomness and complexity , 2000 .
[5] Larry Guth,et al. Unexpected Applications of Polynomials in Combinatorics , 2013, The Mathematics of Paul Erdős I.
[6] David Haussler,et al. ɛ-nets and simplex range queries , 1987, Discret. Comput. Geom..
[7] W. Thurston,et al. Three-Dimensional Geometry and Topology, Volume 1 , 1997, The Mathematical Gazette.
[8] L. Guth. Polynomial partitioning for a set of varieties , 2014, Mathematical Proceedings of the Cambridge Philosophical Society.
[9] Endre Szemerédi,et al. A Combinatorial Distinction Between the Euclidean and Projective Planes , 1983, Eur. J. Comb..
[10] Micha Sharir,et al. Lenses in arrangements of pseudo-circles and their applications , 2004, JACM.
[11] Zeev Dvir,et al. Incidence Theorems and Their Applications , 2012, Found. Trends Theor. Comput. Sci..
[12] J. Pach,et al. Separator theorems and Turán-type results for planar intersection graphs , 2008 .
[13] Csaba D. Tóth,et al. Intersection patterns of curves , 2011, J. Lond. Math. Soc..
[14] P. Erdös. On Sets of Distances of n Points , 1946 .
[15] F. Thomas Leighton,et al. Complexity Issues in VLSI , 1983 .
[16] W. T. Tutte. Toward a theory of crossing numbers , 1970 .
[17] W. Thurston,et al. Three-Dimensional Geometry and Topology, Volume 1 , 1997, The Mathematical Gazette.
[18] Gábor Tardos,et al. Intersection reverse sequences and geometric applications , 2004, J. Comb. Theory, Ser. A.
[19] E. Szemerédi,et al. Crossing-Free Subgraphs , 1982 .
[20] János Pach,et al. On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves , 2014, SODA.
[21] L. Guth,et al. On the Erdős distinct distances problem in the plane , 2015 .
[22] Micha Sharir,et al. Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.
[23] János Pach,et al. Tangencies between families of disjoint regions in the plane , 2010, SoCG '10.
[24] Larry Guth,et al. Distinct Distance Estimates and Low Degree Polynomial Partitioning , 2014, Discret. Comput. Geom..
[25] Micha Sharir,et al. Cutting Circles into Pseudo-Segments and Improved Bounds for Incidences% and Complexity of Many Faces , 2002, Discret. Comput. Geom..
[26] János Pach,et al. String graphs and incomparability graphs , 2012, SoCG '12.
[27] Kenneth L. Clarkson,et al. Applications of random sampling in computational geometry, II , 1988, SCG '88.
[28] Micha Sharir,et al. On the Number of Incidences Between Points and Curves , 1998, Combinatorics, Probability and Computing.
[29] Joshua Zahl,et al. New bounds on curve tangencies and orthogonalities , 2015, ArXiv.
[30] Jirí Matousek,et al. Near-Optimal Separators in String Graphs , 2013, Combinatorics, Probability and Computing.
[31] Tamal K. Dey,et al. Improved Bounds for Planar k -Sets and Related Problems , 1998, Discret. Comput. Geom..
[32] Herbert Edelsbrunner,et al. Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.
[33] Hisao Tamaki,et al. How to Cut Pseudoparabolas into Segments , 1998, Discret. Comput. Geom..
[34] Leonidas J. Guibas,et al. Combinatorial complexity bounds for arrangements of curves and spheres , 1990, Discret. Comput. Geom..
[35] Dhruv Mubayi. Intersecting Curves in the Plane , 2002, Graphs Comb..
[36] Joshua Zahl,et al. Improved bounds for incidences between points and circles , 2012, SoCG '13.
[37] E. M. Andreev. ON CONVEX POLYHEDRA OF FINITE VOLUME IN LOBAČEVSKIĬ SPACE , 1970 .
[38] V. Sós,et al. On a problem of K. Zarankiewicz , 1954 .
[39] Carsten Thomassen,et al. Intersections of curve systems and the crossing number ofC5×C5 , 1995, Discret. Comput. Geom..
[40] János Pach,et al. Beyond the Richter-Thomassen Conjecture , 2016, SODA.
[41] Micha Sharir,et al. Pseudo-line arrangements: duality, algorithms, and applications , 2002, SODA '02.
[42] János Pach,et al. A Separator Theorem for String Graphs and its Applications , 2009, Combinatorics, Probability and Computing.
[43] Micha Sharir,et al. On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles , 1986, Discret. Comput. Geom..
[44] Endre Szemerédi,et al. Extremal problems in discrete geometry , 1983, Comb..
[45] Gelasio Salazar,et al. On the Intersections of Systems of Curves , 1999, J. Comb. Theory, Ser. B.
[46] Timothy M. Chan. On levels in arrangements of curves , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[47] Timothy M. Chan. On levels in arrangements of curves, iii: further improvements , 2008, SCG '08.
[48] Micha Sharir,et al. Combinatorial Geometry and Its Algorithmic Applications , 2008 .
[49] Timothy M. Chan. On Levels in Arrangements of Curves, II: A Simple Inequality and Its Consequences , 2005, Discret. Comput. Geom..