Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDJános Pach
Person information
- affiliation: École Polytechnique Fédérale de Lausanne, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
[j185]János Pach, Bruce A. Reed, Yelena Yuditsky
:
Almost All String Graphs are Intersection Graphs of Plane Convex Sets. Discret. Comput. Geom. 63(4): 888-917 (2020)- [j184]János Pach, Géza Tóth:
A Crossing Lemma for Multigraphs. Discret. Comput. Geom. 63(4): 918-933 (2020) - [j183]János Pach:
A Farewell to Ricky Pollack. Discret. Comput. Geom. 64(3): 571-574 (2020) - [j182]János Pach, István Tomon:
On the chromatic number of disjointness graphs of curves. J. Comb. Theory, Ser. B 144: 167-190 (2020) - [j181]Gergely Kiss, János Pach, Gábor Somlai:
Minimum Area Isosceles Containers. J. Inf. Process. 28: 759-765 (2020) - [j180]Dániel Korándi, János Pach, István Tomon:
Large Homogeneous Submatrices. SIAM J. Discret. Math. 34(4): 2532-2552 (2020) - [c113]Jacob Fox, János Pach, Andrew Suk:
Bounded VC-Dimension Implies the Schur-Erdős Conjecture. Symposium on Computational Geometry 2020: 46:1-46:8 - [c112]János Pach, Gábor Tardos, Géza Tóth:
Crossings Between Non-homotopic Edges. Graph Drawing 2020: 359-371
2010 – 2019
- 2019
- [j179]Andrey Kupavskii, János Pach, István Tomon:
On the Size of K-Cross-Free Families. Comb. 39(1): 153-164 (2019) - [j178]Akitoshi Kawamura, Sonoko Moriyama, Yota Otachi, János Pach:
A lower bound on opaque sets. Comput. Geom. 80: 13-22 (2019) - [j177]Jacob Fox, János Pach, Andrew Suk:
Approximating the rectilinear crossing number. Comput. Geom. 81: 45-53 (2019) - [j176]Radoslav Fulek, János Pach:
Thrackles: An improved upper bound. Discret. Appl. Math. 259: 226-231 (2019) - [j175]Jacob Fox, János Pach, Andrew Suk:
Erdős-Hajnal Conjecture for Graphs with Bounded VC-Dimension. Discret. Comput. Geom. 61(4): 809-829 (2019) - [j174]János Pach, István Tomon:
Ordered graphs and large bi-cliques in intersection graphs of curves. Eur. J. Comb. 82 (2019) - [j173]János Pach, Géza Tóth:
Many touchings force many crossings. J. Comb. Theory, Ser. B 137: 104-111 (2019) - [c111]Jacob Fox, János Pach, Andrew Suk:
Semi-Algebraic Colorings of Complete Graphs. Symposium on Computational Geometry 2019: 36:1-36:12 - [c110]János Pach, István Tomon:
On the Chromatic Number of Disjointness Graphs of Curves. Symposium on Computational Geometry 2019: 54:1-54:17 - [c109]János Pach, István Tomon:
Coloring Hasse Diagrams and Disjointness Graphs of Curves. Graph Drawing 2019: 244-250 - [c108]János Pach, Natan Rubin, Gábor Tardos:
Planar point sets determine many pairwise crossing segments. STOC 2019: 1158-1166 - [i30]János Pach, Natan Rubin, Gábor Tardos:
Planar Point Sets Determine Many Pairwise Crossing Segments. CoRR abs/1904.08845 (2019) - [i29]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): 123-156 (2019) - 2018
- [j172]Jacob Fox, János Pach, Andrew Suk:
More Distinct Distances Under Local Conditions. Comb. 38(2): 501-509 (2018) - [j171]Jacob Fox, János Pach, Andrew Suk:
Ramsey-Turán Numbers for Semi-Algebraic Graphs. Electron. J. Comb. 25(4): P4.61 (2018) - [j170]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: 2-6 (2018) - [j169]Andrey Kupavskii, János Pach, Gábor Tardos:
Tilings with noncongruent triangles. Eur. J. Comb. 73: 72-80 (2018) - [j168]János Pach, Peter Frankl:
A stability theorem on cube tessellations. J. Comput. Geom. 9(1): 387-390 (2018) - [c107]János Pach, Géza Tóth:
A Crossing Lemma for Multigraphs. Symposium on Computational Geometry 2018: 65:1-65:13 - [c106]János Pach, Bruce A. Reed, Yelena Yuditsky:
Almost All String Graphs are Intersection Graphs of Plane Convex Sets. Symposium on Computational Geometry 2018: 68:1-68:14 - [c105]Michael Kaufmann, János Pach, Géza Tóth, Torsten Ueckerdt:
The Number of Crossings in Multigraphs with No Empty Lens. Graph Drawing 2018: 242-254 - [i28]János Pach, Bruce A. Reed, Yelena Yuditsky:
Almost all string graphs are intersection graphs of plane convex sets. CoRR abs/1803.06710 (2018) - [i27]Michael Kaufmann, János Pach, Géza Tóth, Torsten Ueckerdt:
The number of crossings in multigraphs with no empty lens. CoRR abs/1808.10480 (2018) - 2017
- [j167]János Pach, Frank de Zeeuw:
Distinct Distances on Algebraic Curves in the Plane. Comb. Probab. Comput. 26(1): 99-117 (2017) - [c104]Jacob Fox, János Pach, Andrew Suk:
Erdös-Hajnal Conjecture for Graphs with Bounded VC-Dimension. Symposium on Computational Geometry 2017: 43:1-43:15 - [c103]János Pach, Gábor Tardos, Géza Tóth:
Disjointness Graphs of Segments. Symposium on Computational Geometry 2017: 59:1-59:15 - [c102]János Pach, Géza Tóth:
Many Touchings Force Many Crossings. Graph Drawing 2017: 153-159 - [c101]Radoslav Fulek, János Pach:
Thrackles: An Improved Upper Bound. Graph Drawing 2017: 160-166 - [i26]Andrey Kupavskii, János Pach, Gábor Tardos:
Controlling Lipschitz functions. CoRR abs/1704.03062 (2017) - [i25]János Pach, Natan Rubin, Gábor Tardos:
A Crossing Lemma for Jordan Curves. CoRR abs/1708.02077 (2017) - [i24]Andrey Kupavskii, János Pach, Gábor Tardos:
Tilings with noncongruent triangles. CoRR abs/1711.04504 (2017) - [i23]Andrey Kupavskii, János Pach, Gábor Tardos:
Tilings of the plane with unit area triangles of bounded diameter. CoRR abs/1712.03118 (2017) - 2016
- [j166]János Pach, Bartosz Walczak:
Decomposition of Multiple Packings with Subquadratic Union Complexity. Comb. Probab. Comput. 25(1): 145-153 (2016) - [j165]János Pach, Natan Rubin, Gábor Tardos:
On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves. Comb. Probab. Comput. 25(6): 941-958 (2016) - [j164]Kenneth L. Clarkson, János Pach, Günter M. Ziegler:
Thirtieth Anniversary Note from the Editors in Chief. Discret. Comput. Geom. 55(4): 745-747 (2016) - [j163]Lars Arge, János Pach:
Guest Editors' Foreword. Discret. Comput. Geom. 56(4): 833-835 (2016) - [j162]Nabil H. Mustafa, János Pach:
On the Zarankiewicz problem for intersection hypergraphs. J. Comb. Theory, Ser. A 141: 1-7 (2016) - [j161]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: 292-305 (2016) - [j160]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): 2199-2223 (2016) - [c100]Akitoshi Kawamura, Sonoko Moriyama, Yota Otachi, János Pach:
A Lower Bound on Opaque Sets. Symposium on Computational Geometry 2016: 46:1-46:10 - [c99]Andrey Kupavskii, Nabil H. Mustafa, János Pach:
New Lower Bounds for epsilon-Nets. Symposium on Computational Geometry 2016: 54:1-54:16 - [c98]Jacob Fox, János Pach, Andrew Suk:
Approximating the Rectilinear Crossing Number. Graph Drawing 2016: 413-426 - [c97]János Pach, Natan Rubin, Gábor Tardos:
Beyond the Richter-Thomassen Conjecture. SODA 2016: 957-968 - [i22]Jacob Fox, János Pach, Andrew Suk:
Approximating the rectilinear crossing number. CoRR abs/1606.03753 (2016) - [i21]Seok-Hee Hong, Michael Kaufmann, Stephen G. Kobourov, János Pach:
Beyond-Planar Graphs: Algorithmics and Combinatorics (Dagstuhl Seminar 16452). Dagstuhl Reports 6(11): 35-62 (2016) - 2015
- [j159]Jan Kyncl, János Pach, Rados Radoicic, Géza Tóth:
Saturated simple and k-simple topological graphs. Comput. Geom. 48(4): 295-310 (2015) - [j158]Filip Moric, János Pach:
Remarks on Schur's conjecture. Comput. Geom. 48(7): 520-527 (2015) - [j157]János Pach, Gábor Tardos:
Cross-Intersecting Families of Vectors. Graphs Comb. 31(2): 477-495 (2015) - [j156]Jacob Fox, Andrey Grinshpun, János Pach:
The Erdős-Hajnal conjecture for rainbow triangles. J. Comb. Theory, Ser. B 111: 75-125 (2015) - [j155]János Pach:
Every graph admits an unambiguous bold drawing. J. Graph Algorithms Appl. 19(1): 299-312 (2015) - [j154]Ross J. Kang, János Pach, Viresh Patel, Guus Regts:
A Precise Threshold for Quasi-Ramsey Numbers. SIAM J. Discret. Math. 29(3): 1670-1682 (2015) - [c96]Nabil H. Mustafa, János Pach:
On the Zarankiewicz Problem for Intersection Hypergraphs. Graph Drawing 2015: 207-216 - [c95]Andrei Kupavskii, János Pach:
Simultaneous Approximation of Polynomials. JCDCGG 2015: 193-203 - [c94]János Pach, Natan Rubin, Gábor Tardos:
On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves. SODA 2015: 1506-1516 - [c93]Jacob Fox, János Pach, Andrew Suk:
Density and regularity theorems for semi-algebraic hypergraphs. SODA 2015: 1517-1530 - [c92]János Pach, Dömötör Pálvölgyi:
Unsplittable Coverings in the Plane. WG 2015: 281-296 - [e2]Lars Arge, János Pach:
31st International Symposium on Computational Geometry, SoCG 2015, June 22-25, 2015, Eindhoven, The Netherlands. LIPIcs 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2015, ISBN 978-3-939897-83-5 [contents] - [i20]Jacob Fox, János Pach, Andrew Suk:
A polynomial regularity lemma for semi-algebraic hypergraphs and its applications in geometry and property testing. CoRR abs/1502.01730 (2015) - [i19]János Pach, Natan Rubin, Gábor Tardos:
Beyond the Richter-Thomassen Conjecture. CoRR abs/1504.08250 (2015) - [i18]Jacob Fox, János Pach, Andrew Suk:
Semi-algebraic colorings of complete graphs. CoRR abs/1505.07429 (2015) - [i17]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 abs/1511.04123 (2015) - [i16]Andrey B. Kupavskii, János Pach:
From Tarski's plank problem to simultaneous approximation. CoRR abs/1511.08111 (2015) - 2014
- [j153]Adrian Dumitrescu, Minghui Jiang, János Pach:
Opaque Sets. Algorithmica 69(2): 315-334 (2014) - [j152]Eyal Ackerman, János Pach, Rom Pinchasi, Rados Radoicic, Géza Tóth:
A Note on Coloring Line Arrangements. Electron. J. Comb. 21(2): P2.23 (2014) - [j151]Gabriel Nivasch, János Pach, Gábor Tardos:
The visible perimeter of an arrangement of disks. Comput. Geom. 47(1): 42-51 (2014) - [j150]Eyal Ackerman, Jacob Fox, János Pach, Andrew Suk:
On grids in topological graphs. Comput. Geom. 47(7): 710-723 (2014) - [j149]Jacob Fox, János Pach:
Applications of a New Separator Theorem for String Graphs. Comb. Probab. Comput. 23(1): 66-74 (2014) - [j148]Imre Bárány, János Pach:
Homogeneous selections from hyperplanes. J. Comb. Theory, Ser. B 104: 81-87 (2014) - [j147]Fabrizio Frati, Michael Kaufmann, János Pach, Csaba D. Tóth, David R. Wood:
On the Upward Planarity of Mixed Plane Graphs. J. Graph Algorithms Appl. 18(2): 253-279 (2014) - [c91]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. Symposium on Computational Geometry 2014: 436 - [c90]János Pach, Frank de Zeeuw:
Distinct distances on algebraic curves in the plane. Symposium on Computational Geometry 2014: 549 - [i15]Akitoshi Kawamura, Sonoko Moriyama, Yota Otachi, János Pach:
A lower bound on opaque sets. CoRR abs/1403.3894 (2014) - [i14]János Pach, Natan Rubin, Gábor Tardos:
On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves. CoRR abs/1412.6676 (2014) - 2013
- [j146]János Pach, Gábor Tardos:
The Range of a Random Walk on a Comb. Electron. J. Comb. 20(3): P59 (2013) - [j145]János Pach, Géza Tóth:
Monochromatic empty triangles in two-colored point sets. Discret. Appl. Math. 161(9): 1259-1261 (2013) - [j144]Filip Moric, János Pach:
On Schur's conjecture. Electron. Notes Discret. Math. 44: 213-218 (2013) - [j143]Gabriel Nivasch, János Pach, Rom Pinchasi, Shira Zerbib:
The number of distinct distances from a vertex of a convex polygon. J. Comput. Geom. 4(1): 1-12 (2013) - [j142]Giuseppe Di Battista, Fabrizio Frati, János Pach:
On the Queue Number of Planar Graphs. SIAM J. Comput. 42(6): 2243-2285 (2013) - [j141]Jacob Fox, János Pach, Andrew Suk:
The Number of Edges in k-Quasi-planar Graphs. SIAM J. Discret. Math. 27(1): 550-561 (2013) - [j140]Balázs Keszegh, János Pach, Dömötör Pálvölgyi:
Drawing Planar Graphs of Bounded Degree with Few Slopes. SIAM J. Discret. Math. 27(2): 1171-1183 (2013) - [c89]David Conlon, Jacob Fox, János Pach, Benny Sudakov, Andrew Suk:
Ramsey-type results for semi-algebraic relations. Symposium on Computational Geometry 2013: 309-318 - [c88]Fabrizio Frati, Michael Kaufmann, János Pach, Csaba D. Tóth, David R. Wood:
On the Upward Planarity of Mixed Plane Graphs. Graph Drawing 2013: 1-12 - [c87]János Pach, Gábor Tardos:
Cross-Intersecting Families of Vectors. JCDCGG 2013: 122-137 - [p1]János Pach:
A Remark on Transversal Numbers. The Mathematics of Paul Erdős I 2013: 541-549 - [i13]Jacob Fox, János Pach:
Applications of a new separator theorem for string graphs. CoRR abs/1302.7228 (2013) - [i12]János Pach, Bartosz Walczak:
Decomposition of multiple packings with subquadratic union complexity. CoRR abs/1312.3215 (2013) - 2012
- [j139]János Pach, Gábor Tardos, József Solymosi:
Remarks on a Ramsey theory for trees. Comb. 32(4): 473-482 (2012) - [j138]Adrian Dumitrescu, János Pach, Géza Tóth:
Drawing Hamiltonian Cycles with no Large Angles. Electron. J. Comb. 19(2): P31 (2012) - [j137]Padmini Mukkamala, János Pach, Dömötör Pálvölgyi:
Lower Bounds on the Obstacle Number of Graphs. Electron. J. Comb. 19(2): P32 (2012) - [j136]János Pach, Andrew Suk, Miroslav Treml:
Tangencies between families of disjoint regions in the plane. Comput. Geom. 45(3): 131-138 (2012) - [j135]Jacob Fox, János Pach:
Coloring Kk-free intersection graphs of geometric objects in the plane. Eur. J. Comb. 33(5): 853-866 (2012) - [j134]János Pach, Gábor Tardos:
Piercing quasi-rectangles - On a problem of Danzer and Rogers. J. Comb. Theory, Ser. A 119(7): 1391-1397 (2012) - [c86]Jacob Fox, János Pach:
String graphs and incomparability graphs. Symposium on Computational Geometry 2012: 405-414 - [c85]Gabriel Nivasch, János Pach, Gábor Tardos:
The Visible Perimeter of an Arrangement of Disks. Graph Drawing 2012: 364-375 - [c84]Marc J. van Kreveld, Maarten Löffler, János Pach:
How Many Potatoes Are in a Mesh? ISAAC 2012: 166-176 - [c83]Filip Moric, János Pach:
Remarks on Schur's Conjecture. TJJCCGG 2012: 120-131 - [i11]Gabriel Nivasch, János Pach, Gábor Tardos:
The visible perimeter of an arrangement of disks. CoRR abs/1206.1422 (2012) - [i10]Gabriel Nivasch, János Pach, Rom Pinchasi, Shira Zerbib:
The number of distinct distances from a vertex of a convex polygon. CoRR abs/1207.1266 (2012) - [i9]Marc J. van Kreveld, Maarten Löffler, János Pach:
How Many Potatoes are in a Mesh? CoRR abs/1209.3954 (2012) - 2011
- [j133]Michael O. Albertson, János Pach, Michael E. Young:
Disjoint homometric sets in graphs. Ars Math. Contemp. 4(1): 1-4 (2011) - [j132]Radoslav Fulek, János Pach:
A computational approach to Conway's thrackle conjecture. Comput. Geom. 44(6-7): 345-355 (2011) - [j131]Herbert Edelsbrunner, János Pach, Günter M. Ziegler:
Letter from the New Editors-in-Chief. Discret. Comput. Geom. 45(1): 1-2 (2011) - [j130]Adrian Dumitrescu, János Pach:
Minimum Clique Partition in Unit Disk Graphs. Graphs Comb. 27(3): 399-411 (2011) - [j129]János Pach, Deniz Sariöz:
On the Structure of Graphs with Low Obstacle Number. Graphs Comb. 27(3): 465-473 (2011) - [j128]Jacob Fox, János Pach, Csaba D. Tóth:
Intersection patterns of curves. J. Lond. Math. Soc. 83(2): 389-406 (2011) - [j127]János Pach, Ethan Sterling:
Conway's Conjecture for Monotone Thrackles. Am. Math. Mon. 118(6): 544-548 (2011) - [c82]Adrian Dumitrescu, Minghui Jiang, János Pach:
Opaque Sets. APPROX-RANDOM 2011: 194-205 - [c81]János Pach, Gábor Tardos:
Tight lower bounds for the size of epsilon-nets. Symposium on Computational Geometry 2011: 458-463 - [c80]János Pach, Géza Tóth:
Monotone Crossing Number. Graph Drawing 2011: 278-289 - [c79]János Pach:
Every Graph Admits an Unambiguous Bold Drawing. Graph Drawing 2011: 332-342 - [c78]János Pach, Rados Radoicic, Géza Tóth:
Tangled Thrackles. EGC 2011: 45-53 - [c77]Jacob Fox, János Pach:
Computing the Independence Number of Intersection Graphs. SODA 2011: 1161-1165 - [c76]Jacob Fox, Mikhail Gromov, Vincent Lafforgue, Assaf Naor, János Pach:
Overlap properties of geometric expanders. SODA 2011: 1188-1197 - [c75]János Pach, Gábor Tardos:
Piercing Quasi-Rectangles: On a Problem of Danzer and Rogers. WADS 2011: 654 - [i8]Padmini Mukkamala, János Pach, Dömötör Pálvölgyi:
Lower bounds on the obstacle number of graphs. CoRR abs/1103.2724 (2011) - [i7]Jacob Fox, János Pach, Andrew Suk:
The number of edges in k-quasi-planar graphs. CoRR abs/1112.2361 (2011) - 2010
- [j126]Christian Blanvillain, János Pach:
"square trisection". dissection of a square in three congruent partitions. Bull. dInformatique Approfondie et Appl. 86: 7-18 (2010) - [j125]Jacob Fox, János Pach:
A Separator Theorem for String Graphs and its Applications. Comb. Probab. Comput. 19(3): 371-390 (2010) - [j124]Jacob Fox, János Pach, Csaba D. Tóth:
A bipartite strengthening of the Crossing Lemma. J. Comb. Theory, Ser. B 100(1): 23-35 (2010) - [j123]János Pach, Gábor Tardos:
Coloring axis-parallel rectangles. J. Comb. Theory, Ser. A 117(6): 776-782 (2010) - [j122]Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth:
Cubic graphs have bounded slope parameter. J. Graph Algorithms Appl. 14(1): 5-17 (2010) - [j121]János Pach, József Solymosi, Gábor Tardos:
Crossing numbers of imbalanced graphs. J. Graph Theory 64(1): 12-21 (2010) - [c74]János Pach, Andrew Suk, Miroslav Treml:
Tangencies between families of disjoint regions in the plane. Symposium on Computational Geometry 2010: 423-428 - [c73]Giuseppe Di Battista, Fabrizio Frati, János Pach:
On the Queue Number of Planar Graphs. FOCS 2010: 365-374 - [c72]Radoslav Fulek, János Pach:
A Computational Approach to Conway's Thrackle Conjecture. Graph Drawing 2010: 226-237 - [c71]