János Pach

ORCID

Publication Activity (10 Years)

Years Active: 1980-2024
Publications (10 Years): 85

Top Venues

CoRR

SoCG

Graph Drawing

J. Comb. Theory, Ser. B

Publications

János Pach, Gábor Tardos
Where Have All the Grasshoppers Gone? Am. Math. Mon. 131 (3) (2024)
János Pach, Gábor Tardos, Géza Tóth
Disjointness graphs of short polygonal chains. J. Comb. Theory, Ser. B 164 (2024)
Jacob Fox, János Pach, Andrew Suk
Quasiplanar graphs, string graphs, and the Erdős-Gallai problem. Eur. J. Comb. 119 (2024)
Peter Frankl, János Pach, Dömötör Pálvölgyi
Odd-sunflowers. J. Comb. Theory, Ser. A 206 (2024)
Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, János Pach, Henry Förster
Beyond-Planar Graphs: Models, Structures and Geometric Representations (Dagstuhl Seminar 24062). Dagstuhl Reports 14 (2) (2024)
Adrian Dumitrescu, János Pach
Partitioning complete geometric graphs into plane subgraphs. CoRR (2024)
Noga Alon, Dor Elboim, János Pach, Gábor Tardos
Random Necklaces Require Fewer Cuts. SIAM J. Discret. Math. 38 (2) (2024)
Herbert Edelsbrunner, János Pach
Maximum Betti Numbers of Čech Complexes. SoCG (2024)
Jacob Fox, János Pach, Andrew Suk
A Structure Theorem for Pseudo-Segments and Its Applications. SoCG (2024)
János Pach, Morteza Saghafian, Patrick Schnider
Decomposition of Geometric Graphs into Star Forests. CoRR (2023)
János Pach, Morteza Saghafian, Patrick Schnider
Decomposition of Geometric Graphs into Star-Forests. GD (1) (2023)
Adrian Dumitrescu, János Pach, Géza Tóth
Two trees are better than one. CoRR (2023)
Jacob Fox, János Pach, Andrew Suk
Sunflowers in Set Systems of Bounded Dimension. Comb. 43 (1) (2023)
Jacob Fox, János Pach, Andrew Suk
A structure theorem for pseudo-segments and its applications. CoRR (2023)
Áron Ambrus, Mónika Csikós, Gergely Kiss, János Pach, Gábor Somlai
Optimal Embedded and Enclosing Isosceles Triangles. Int. J. Found. Comput. Sci. 34 (7) (2023)
Lixing Fang, Hao Huang, János Pach, Gábor Tardos, Junchi Zuo
Successive vertex orderings of fully regular graphs. J. Comb. Theory, Ser. A 199 (2023)
Peter Frankl, János Pach
On Well-Connected Sets of Strings. Electron. J. Comb. 29 (1) (2022)
János Pach, Gábor Tardos, Géza Tóth
Crossings between non-homotopic edges. J. Comb. Theory, Ser. B 156 (2022)
János Pach, Gábor Tardos, Géza Tóth
Disjointness Graphs of Short Polygonal Chains. SoCG (2022)
Peter Frankl, János Pach, Dömötör Pálvölgyi
Exchange Properties of Finite Set-Systems. SIAM J. Discret. Math. 36 (3) (2022)
Luis Barba, Otfried Cheong, Michael Gene Dobbins, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, János Pach, Yuan Tang, Takeshi Tokuyama, Sander Verdonschot
Weight balancing on boundaries. J. Comput. Geom. 13 (1) (2022)
Jacob Fox, János Pach, Andrew Suk
Quasiplanar Graphs, String Graphs, and the Erdős-Gallai Problem. GD (2022)
János Pach, Gábor Tardos, Géza Tóth
Disjointness graphs of segments in the space. Comb. Probab. Comput. 30 (4) (2021)
Jacob Fox, János Pach, Andrew Suk
Quasiplanar graphs, string graphs, and the Erdős-Gallai problem. CoRR (2021)
János Pach, István Tomon
Erdős-Hajnal-type results for monotone paths. J. Comb. Theory, Ser. B 151 (2021)
Michael Kaufmann, János Pach, Géza Tóth, Torsten Ueckerdt
The number of crossings in multigraphs with no empty lens. J. Graph Algorithms Appl. 25 (1) (2021)
Jacob Fox, János Pach, Andrew Suk
Sunflowers in Set Systems of Bounded Dimension. SoCG (2021)
Jacob Fox, János Pach, Andrew Suk
Bounded VC-Dimension Implies the Schur-Erdős Conjecture. Comb. 41 (6) (2021)
Jacob Fox, János Pach, Andrew Suk
On the Number of Edges of Separated Multigraphs. Graph Drawing (2021)
Jacob Fox, János Pach, Andrew Suk
On the number of edges of separated multigraphs. CoRR (2021)
János Pach, Bruce A. Reed, Yelena Yuditsky
Almost All String Graphs are Intersection Graphs of Plane Convex Sets. Discret. Comput. Geom. 63 (4) (2020)
Jacob Fox, János Pach, Andrew Suk
Bounded VC-Dimension Implies the Schur-Erdős Conjecture. SoCG (2020)
János Pach, István Tomon
On the chromatic number of disjointness graphs of curves. J. Comb. Theory, Ser. B 144 (2020)
János Pach, Géza Tóth
A Crossing Lemma for Multigraphs. Discret. Comput. Geom. 63 (4) (2020)
János Pach
A Farewell to Ricky Pollack. Discret. Comput. Geom. 64 (3) (2020)
Dániel Korándi, János Pach, István Tomon
Large Homogeneous Submatrices. SIAM J. Discret. Math. 34 (4) (2020)
János Pach, Gábor Tardos, Géza Tóth
Crossings Between Non-homotopic Edges. Graph Drawing (2020)
Gergely Kiss, János Pach, Gábor Somlai
Minimum Area Isosceles Containers. J. Inf. Process. 28 (2020)
János Pach, István Tomon
Ordered graphs and large bi-cliques in intersection graphs of curves. Eur. J. Comb. 82 (2019)
Jacob Fox, János Pach, Andrew Suk
Approximating the rectilinear crossing number. Comput. Geom. 81 (2019)
Jacob Fox, János Pach, Andrew Suk
Semi-Algebraic Colorings of Complete Graphs. SoCG (2019)
János Pach, István Tomon
Coloring Hasse Diagrams and Disjointness Graphs of Curves. Graph Drawing (2019)
János Pach, István Tomon
On the Chromatic Number of Disjointness Graphs of Curves. SoCG (2019)
János Pach, Géza Tóth
Many touchings force many crossings. J. Comb. Theory, Ser. B 137 (2019)
Seok-Hee Hong, Michael Kaufmann, János Pach, Csaba D. Tóth
Beyond-Planar Graphs: Combinatorics, Models and Algorithms (Dagstuhl Seminar 19092). Dagstuhl Reports 9 (2) (2019)
János Pach, Natan Rubin, Gábor Tardos
Planar Point Sets Determine Many Pairwise Crossing Segments. CoRR (2019)
János Pach, Natan Rubin, Gábor Tardos
Planar point sets determine many pairwise crossing segments. STOC (2019)
Radoslav Fulek, János Pach
Thrackles: An improved upper bound. Discret. Appl. Math. 259 (2019)
Akitoshi Kawamura, Sonoko Moriyama, Yota Otachi, János Pach
A lower bound on opaque sets. Comput. Geom. 80 (2019)
Andrey Kupavskii, János Pach, István Tomon
On the Size of K-Cross-Free Families. Comb. 39 (1) (2019)
Jacob Fox, János Pach, Andrew Suk
Erdős-Hajnal Conjecture for Graphs with Bounded VC-Dimension. Discret. Comput. Geom. 61 (4) (2019)
János Pach, Peter Frankl
A stability theorem on cube tessellations. J. Comput. Geom. 9 (1) (2018)
Andrey Kupavskii, János Pach, Gábor Tardos
Tilings with noncongruent triangles. Eur. J. Comb. 73 (2018)
Michael Kaufmann, János Pach, Géza Tóth, Torsten Ueckerdt
The number of crossings in multigraphs with no empty lens. CoRR (2018)
János Pach, László A. Székely, Csaba D. Tóth, Géza Tóth
Note on k-planar crossing numbers. Comput. Geom. 68 (2018)
János Pach, Géza Tóth
A Crossing Lemma for Multigraphs. SoCG (2018)
János Pach, Bruce A. Reed, Yelena Yuditsky
Almost all string graphs are intersection graphs of plane convex sets. CoRR (2018)
Jacob Fox, János Pach, Andrew Suk
Ramsey-Turán Numbers for Semi-Algebraic Graphs. Electron. J. Comb. 25 (4) (2018)
János Pach, Bruce A. Reed, Yelena Yuditsky
Almost All String Graphs are Intersection Graphs of Plane Convex Sets. SoCG (2018)
Jacob Fox, János Pach, Andrew Suk
More Distinct Distances Under Local Conditions. Comb. 38 (2) (2018)
Michael Kaufmann, János Pach, Géza Tóth, Torsten Ueckerdt
The Number of Crossings in Multigraphs with No Empty Lens. Graph Drawing (2018)
János Pach, Frank de Zeeuw
Distinct Distances on Algebraic Curves in the Plane. Comb. Probab. Comput. 26 (1) (2017)
Jacob Fox, János Pach, Andrew Suk
Erdös-Hajnal Conjecture for Graphs with Bounded VC-Dimension. SoCG (2017)
János Pach, Gábor Tardos, Géza Tóth
Disjointness Graphs of Segments. SoCG (2017)
Radoslav Fulek, János Pach
Thrackles: An Improved Upper Bound. Graph Drawing (2017)
János Pach, Natan Rubin, Gábor Tardos
A Crossing Lemma for Jordan Curves. CoRR (2017)
Andrey Kupavskii, János Pach
From Tarski's Plank Problem to Simultaneous Approximation. Am. Math. Mon. 124 (6) (2017)
Andrey Kupavskii, János Pach, Gábor Tardos
Tilings of the plane with unit area triangles of bounded diameter. CoRR (2017)
János Pach, Géza Tóth
Many Touchings Force Many Crossings. Graph Drawing (2017)
Peter Frankl, Amram Meir, János Pach
Decomposition of a Cube into Nearly Equal Smaller Cubes. Am. Math. Mon. 124 (10) (2017)
Andrey Kupavskii, János Pach, Gábor Tardos
Tilings with noncongruent triangles. CoRR (2017)
Andrey Kupavskii, János Pach, Gábor Tardos
Controlling Lipschitz functions. CoRR (2017)
Andrey Kupavskii, Nabil H. Mustafa, János Pach
New Lower Bounds for epsilon-Nets. SoCG (2016)
Jacob Fox, János Pach, Andrew Suk
A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing. SIAM J. Comput. 45 (6) (2016)
Zsolt Lángi, Márton Naszódi, János Pach, Gábor Tardos, Géza Tóth
Separation with restricted families of sets. J. Comb. Theory, Ser. A 144 (2016)
Kenneth L. Clarkson, János Pach, Günter M. Ziegler
Thirtieth Anniversary Note from the Editors in Chief. Discret. Comput. Geom. 55 (4) (2016)
Akitoshi Kawamura, Sonoko Moriyama, Yota Otachi, János Pach
A Lower Bound on Opaque Sets. SoCG (2016)
János Pach, Natan Rubin, Gábor Tardos
Beyond the Richter-Thomassen Conjecture. SODA (2016)
Jacob Fox, János Pach, Andrew Suk
Approximating the rectilinear crossing number. CoRR (2016)
János Pach, Bartosz Walczak
Decomposition of Multiple Packings with Subquadratic Union Complexity. Comb. Probab. Comput. 25 (1) (2016)
János Pach, Natan Rubin, Gábor Tardos
On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves. Comb. Probab. Comput. 25 (6) (2016)
Nabil H. Mustafa, János Pach
On the Zarankiewicz problem for intersection hypergraphs. J. Comb. Theory, Ser. A 141 (2016)
Lars Arge, János Pach
Guest Editors' Foreword. Discret. Comput. Geom. 56 (4) (2016)
Jacob Fox, János Pach, Andrew Suk
Approximating the Rectilinear Crossing Number. Graph Drawing (2016)
Seok-Hee Hong, Michael Kaufmann, Stephen G. Kobourov, János Pach
Beyond-Planar Graphs: Algorithmics and Combinatorics (Dagstuhl Seminar 16452). Dagstuhl Reports 6 (11) (2016)
Jacob Fox, János Pach, Andrew Suk
Density and regularity theorems for semi-algebraic hypergraphs. SODA (2015)
János Pach, Gábor Tardos
Cross-Intersecting Families of Vectors. Graphs Comb. 31 (2) (2015)
Andrei Kupavskii, János Pach
Simultaneous Approximation of Polynomials. JCDCGG (2015)
János Pach, Dömötör Pálvölgyi
Unsplittable Coverings in the Plane. WG (2015)
Luis Barba, Otfried Cheong, Jean-Lou De Carufel, Michael Gene Dobbins, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, János Pach, Yuan Tang, Takeshi Tokuyama, Sander Verdonschot, Tianhao Wang
Weight Balancing on Boundaries and Skeletons. CoRR (2015)
Jacob Fox, János Pach, Andrew Suk
Semi-algebraic colorings of complete graphs. CoRR (2015)
János Pach, Natan Rubin, Gábor Tardos
On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves. SODA (2015)
Ross J. Kang, János Pach, Viresh Patel, Guus Regts
A Precise Threshold for Quasi-Ramsey Numbers. SIAM J. Discret. Math. 29 (3) (2015)
János Pach, Natan Rubin, Gábor Tardos
Beyond the Richter-Thomassen Conjecture. CoRR (2015)
Nabil H. Mustafa, János Pach
On the Zarankiewicz Problem for Intersection Hypergraphs. Graph Drawing (2015)
Jan Kyncl, János Pach, Rados Radoicic, Géza Tóth
Saturated simple and k-simple topological graphs. Comput. Geom. 48 (4) (2015)
Andrey B. Kupavskii, János Pach
From Tarski's plank problem to simultaneous approximation. CoRR (2015)
János Pach
Every graph admits an unambiguous bold drawing. J. Graph Algorithms Appl. 19 (1) (2015)
Filip Moric, János Pach
Remarks on Schur's conjecture. Comput. Geom. 48 (7) (2015)
Jacob Fox, Andrey Grinshpun, János Pach
The Erdős-Hajnal conjecture for rainbow triangles. J. Comb. Theory, Ser. B 111 (2015)

János Pach.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

János Pach