Janos Pach
Affiliations: | New York University, New York, NY, United States |
Area:
MathematicsGoogle:
"Janos Pach"Children
Sign in to add traineeDan Ismailescu | grad student | 2001 | NYU |
Raghavan S. Dhandapani | grad student | 2010 | NYU |
Alfredo Hubard | grad student | 2011 | NYU |
Andrew Suk | grad student | 2011 | NYU |
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Pach J, Tomon I. (2020) On the chromatic number of disjointness graphs of curves Journal of Combinatorial Theory, Series B. 144: 167-190 |
Fox J, Pach J, Suk A. (2020) The Schur-Erdős problem for semi-algebraic colorings Israel Journal of Mathematics. 1-19 |
Pach J, Tomon I. (2020) Colorings with only rainbow arithmetic progressions Acta Mathematica Hungarica. 161: 507-515 |
Pach J, Reed BA, Yuditsky Y. (2020) Almost all string graphs are intersection graphs of plane convex sets Discrete and Computational Geometry. 63: 888-917 |
Pach J, Tóth G. (2019) Many touchings force many crossings Journal of Combinatorial Theory, Series B. 137: 104-111 |
Pach J, Tomon I. (2019) Ordered graphs and large bi-cliques in intersection graphs of curves European Journal of Combinatorics. 82: 102994 |
Fulek R, Pach J. (2019) Thrackles: An improved upper bound Discrete Applied Mathematics. 259: 226-231 |
Fox J, Pach J, Suk A. (2019) Approximating the rectilinear crossing number Computational Geometry: Theory and Applications. 81: 45-53 |
Kawamura A, Moriyama S, Otachi Y, et al. (2019) A lower bound on opaque sets Computational Geometry: Theory and Applications. 80: 13-22 |
Kupavskii A, Pach J, Tomon I. (2019) On the Size of K -Cross-Free Families Combinatorica. 39: 153-164 |