default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJános Pach
Person information
- affiliation: Renyi Institute Budapest, Hungary
- affiliation (former): É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
Books and Theses
- 2005
[b2]Peter Brass, William O. J. Moser, János Pach:
Research problems in discrete geometry. Springer 2005, pp. I-XII, 1-499- 1995
- [b1]János Pach, Pankaj K. Agarwal:
Combinatorial geometry. Wiley-Interscience series in discrete mathematics and optimization, Wiley 1995, ISBN 978-0-471-58890-0, pp. I-XIII, 1-354
Journal Articles
- 2024
- [j205]Kenneth L. Clarkson, János Pach, Csaba D. Tóth:
Foreword. Discret. Comput. Geom. 72(2): 403-404 (2024) - [j204]János Pach:
A Farewell to Eli Goodman. Discret. Comput. Geom. 72(2): 405-406 (2024) - [j203]Jacob Fox, János Pach, Andrew Suk:
Quasiplanar graphs, string graphs, and the Erdős-Gallai problem. Eur. J. Comb. 119: 103811 (2024) - [j202]Peter Frankl, János Pach, Dömötör Pálvölgyi
:
Odd-sunflowers. J. Comb. Theory, Ser. A 206: 105889 (2024) - [j201]János Pach, Gábor Tardos, Géza Tóth:
Disjointness graphs of short polygonal chains. J. Comb. Theory B 164: 29-43 (2024) - [j200]Noga Alon, Dor Elboim, János Pach, Gábor Tardos:
Random Necklaces Require Fewer Cuts. SIAM J. Discret. Math. 38(2): 1381-1408 (2024) - [j199]János Pach, Gábor Tardos:
Where Have All the Grasshoppers Gone? Am. Math. Mon. 131(3): 204-212 (2024) - 2023
- [j198]Jacob Fox, János Pach, Andrew Suk:
Sunflowers in Set Systems of Bounded Dimension. Comb. 43(1): 187-202 (2023) - [j197]Á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): 737-760 (2023) - [j196]Lixing Fang, Hao Huang, János Pach, Gábor Tardos, Junchi Zuo:
Successive vertex orderings of fully regular graphs. J. Comb. Theory A 199: 105776 (2023) - 2022
- [j195]Peter Frankl, János Pach:
On Well-Connected Sets of Strings. Electron. J. Comb. 29(1) (2022) - [j194]János Pach, Gábor Tardos, Géza Tóth:
Crossings between non-homotopic edges. J. Comb. Theory B 156: 389-404 (2022) - [j193]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): 1-12 (2022) - [j192]Peter Frankl, János Pach, Dömötör Pálvölgyi:
Exchange Properties of Finite Set-Systems. SIAM J. Discret. Math. 36(3): 2073-2081 (2022) - 2021
- [j191]Jacob Fox, János Pach, Andrew Suk:
Bounded VC-Dimension Implies the Schur-Erdős Conjecture. Comb. 41(6): 803-813 (2021) - [j190]János Pach, Gábor Tardos, Géza Tóth:
Disjointness graphs of segments in the space. Comb. Probab. Comput. 30(4): 498-512 (2021) - [j189]János Pach, István Tomon:
Erdős-Hajnal-type results for monotone paths. J. Comb. Theory B 151: 21-37 (2021) - [j188]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): 383-396 (2021) - 2020
- [j187]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) - [j186]János Pach, Géza Tóth:
A Crossing Lemma for Multigraphs. Discret. Comput. Geom. 63(4): 918-933 (2020) - [j185]János Pach:
A Farewell to Ricky Pollack. Discret. Comput. Geom. 64(3): 571-574 (2020) - [j184]János Pach, István Tomon:
On the chromatic number of disjointness graphs of curves. J. Comb. Theory B 144: 167-190 (2020) - [j183]Gergely Kiss, János Pach, Gábor Somlai:
Minimum Area Isosceles Containers. J. Inf. Process. 28: 759-765 (2020) - [j182]Dániel Korándi, János Pach, István Tomon:
Large Homogeneous Submatrices. SIAM J. Discret. Math. 34(4): 2532-2552 (2020) - 2019
- [j181]Andrey Kupavskii, János Pach, István Tomon:
On the Size of K-Cross-Free Families. Comb. 39(1): 153-164 (2019) - [j180]Akitoshi Kawamura, Sonoko Moriyama, Yota Otachi, János Pach:
A lower bound on opaque sets. Comput. Geom. 80: 13-22 (2019) - [j179]Jacob Fox, János Pach, Andrew Suk:
Approximating the rectilinear crossing number. Comput. Geom. 81: 45-53 (2019) - [j178]Radoslav Fulek, János Pach:
Thrackles: An improved upper bound. Discret. Appl. Math. 259: 226-231 (2019) - [j177]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) - [j176]János Pach, István Tomon:
Ordered graphs and large bi-cliques in intersection graphs of curves. Eur. J. Comb. 82 (2019) - [j175]János Pach, Géza Tóth:
Many touchings force many crossings. J. Comb. Theory B 137: 104-111 (2019) - 2018
- [j174]Jacob Fox, János Pach, Andrew Suk:
More Distinct Distances Under Local Conditions. Comb. 38(2): 501-509 (2018) - [j173]Jacob Fox, János Pach, Andrew Suk:
Ramsey-Turán Numbers for Semi-Algebraic Graphs. Electron. J. Comb. 25(4): 4 (2018) - [j172]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) - [j171]Andrey Kupavskii, János Pach, Gábor Tardos:
Tilings with noncongruent triangles. Eur. J. Comb. 73: 72-80 (2018) - [j170]János Pach, Peter Frankl:
A stability theorem on cube tessellations. J. Comput. Geom. 9(1): 387-390 (2018) - 2017
- [j169]János Pach, Frank de Zeeuw:
Distinct Distances on Algebraic Curves in the Plane. Comb. Probab. Comput. 26(1): 99-117 (2017) - [j168]Andrey Kupavskii, János Pach:
From Tarski's Plank Problem to Simultaneous Approximation. Am. Math. Mon. 124(6): 494-505 (2017) - [j167]Peter Frankl, Amram Meir, János Pach:
Decomposition of a Cube into Nearly Equal Smaller Cubes. Am. Math. Mon. 124(10): 895-904 (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 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 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) - 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 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) - 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): 2 (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 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) - 2013
- [j146]János Pach, Gábor Tardos:
The Range of a Random Walk on a Comb. Electron. J. Comb. 20(3): 59 (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) - 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): 31 (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): 32 (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 A 119(7): 1391-1397 (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) - 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 B 100(1): 23-35 (2010) - [j123]János Pach, Gábor Tardos:
Coloring axis-parallel rectangles. J. Comb. Theory 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) - 2009
- [j120]János Pach, Géza Tóth:
Decomposition of multiple coverings into many parts. Comput. Geom. 42(2): 127-133 (2009) - [j119]János Pach, Gábor Tardos:
Conflict-Free Colourings of Graphs and Hypergraphs. Comb. Probab. Comput. 18(5): 819-834 (2009) - [j118]Esther Ezra, János Pach, Micha Sharir:
On Regular Vertices of the Union of Planar Convex Objects. Discret. Comput. Geom. 41(2): 216-231 (2009) - [j117]János Pach, Géza Tóth:
Degenerate Crossing Numbers. Discret. Comput. Geom. 41(3): 376-384 (2009) - [j116]Radoslav Fulek, Andreas F. Holmsen, János Pach:
Intersecting Convex Sets by Rays. Discret. Comput. Geom. 42(3): 343-358 (2009) - [j115]Jacob Fox, János Pach:
A bipartite analogue of Dilworth's theorem for multiple partial orders. Eur. J. Comb. 30(8): 1846-1853 (2009) - [j114]Xiaomin Chen, János Pach, Mario Szegedy, Gábor Tardos:
Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles. Random Struct. Algorithms 34(1): 11-23 (2009) - 2008
- [j113]Andreas F. Holmsen, János Pach, Helge Tverberg:
Points surrounding the origin. Comb. 28(6): 633-644 (2008) - [j112]Friedrich Eisenbrand, János Pach, Thomas Rothvoß, Nir B. Sopher:
Convexly Independent Subsets of the Minkowski Sum of Planar Point Sets. Electron. J. Comb. 15(1) (2008) - [j111]Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth:
Drawing cubic graphs with at most five slopes. Comput. Geom. 40(2): 138-147 (2008) - [j110]Jacob E. Goodman, János Pach, Richard Pollack:
Foreword. Discret. Comput. Geom. 39(1-3): 1-2 (2008) - [j109]Zoltán Füredi, Ervin Györi, János Pach, Attila Sali:
Guest Editors' Foreword. Discret. Math. 308(19): 4305 (2008) - [j108]Jan Kyncl, János Pach, Géza Tóth:
Long alternating paths in bicolored point sets. Discret. Math. 308(19): 4315-4321 (2008) - [j107]János Pach:
On Simplices Embracing a Point. Electron. Notes Discret. Math. 31: 97 (2008) - [j106]Sergey Bereg, Adrian Dumitrescu, János Pach:
Sliding Disks in the Plane. Int. J. Comput. Geom. Appl. 18(5): 373-387 (2008) - [j105]János Pach, Micha Sharir:
On planar intersection graphs with forbidden subgraphs. J. Graph Theory 59(3): 205-214 (2008) - [j104]Gruia Calinescu, Adrian Dumitrescu, János Pach:
Reconfigurations in Graphs and Grids. SIAM J. Discret. Math. 22(1): 124-138 (2008) - 2007
- [j103]János Pach, Farhad Shahrokhi:
Guest Editors' Foreword. Algorithmica 47(4): 365 (2007) - [j102]Imre Bárány, János Pach:
Foreword. Discret. Comput. Geom. 38(2): 175-176 (2007) - [j101]János Pach, Rom Pinchasi, Micha Sharir:
Solution of Scott's Problem on the Number of Directions Determined by a Point Set in 3-Space. Discret. Comput. Geom. 38(2): 399-441 (2007) - [j100]Hervé Brönnimann, Jonathan Lenchner, János Pach:
Opposite-Quadrant Depth in the Plane. Graphs Comb. 23(Supplement-1): 145-152 (2007) - [j99]Ke Chen, Amos Fiat, Haim Kaplan, Meital Levy, Jirí Matousek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl:
Online Conflict-Free Coloring for Intervals. SIAM J. Comput. 36(5): 1342-1359 (2007) - 2006
- [j98]János Pach, Géza Tóth:
How Many Ways Can One Draw A Graph? Comb. 26(5): 559-576 (2006) - [j97]János Pach, Dömötör Pálvölgyi:
Bounded-Degree Graphs can have Arbitrarily Large Slope Numbers. Electron. J. Comb. 13(1) (2006) - [j96]János Pach, Rados Radoicic, Jan Vondrák:
Nearly equal distances and Szemerédi's regularity lemma. Comput. Geom. 34(1): 11-19 (2006) - [j95]János Pach, Rados Radoicic, Gábor Tardos, Géza Tóth:
Improving the Crossing Lemma by Finding More Crossings in Sparse Graphs. Discret. Comput. Geom. 36(4): 527-552 (2006) - [j94]János Pach, Rados Radoicic, Jan Vondrák:
On the diameter of separated point sets with many nearly equal distances. Eur. J. Comb. 27(8): 1321-1332 (2006) - [j93]Adrian Dumitrescu, János Pach:
Pushing Squares Around. Graphs Comb. 22(1): 37-50 (2006) - [j92]Károly J. Böröczky, János Pach, Géza Tóth:
Planar Crossing Numbers of Graphs Embeddable in Another Surface. Int. J. Found. Comput. Sci. 17(5): 1005-1016 (2006) - 2005
- [j91]János Pach, Rom Pinchasi, Micha Sharir, Géza Tóth:
Topological Graphs with No Large Grids. Graphs Comb. 21(3): 355-364 (2005) - [j90]Noga Alon, János Pach, Rom Pinchasi, Rados Radoicic, Micha Sharir:
Crossing patterns of semi-algebraic sets. J. Comb. Theory A 111(2): 310-326 (2005) - [j89]Emden R. Gansner, János Pach:
Guest Editor's Foreword. J. Graph Algorithms Appl. 9(3): 301-304 (2005) - 2004
- [j88]Boris Aronov, János Pach, Micha Sharir, Gábor Tardos:
Distinct Distances in Three and Higher Dimensions. Comb. Probab. Comput. 13(3): 283-293 (2004) - [j87]János Pach, Rom Pinchasi, Gábor Tardos, Géza Tóth:
Geometric graphs with no self-intersecting path of length three. Eur. J. Comb. 25(6): 793-811 (2004) - [j86]Pankaj K. Agarwal, Eran Nevo, János Pach, Rom Pinchasi, Micha Sharir, Shakhar Smorodinsky:
Lenses in arrangements of pseudo-circles and their applications. J. ACM 51(2): 139-186 (2004) - [j85]János Pach, Rom Pinchasi, Micha Sharir:
On the number of directions determined by a three-dimensional points set. J. Comb. Theory A 108(1): 1-16 (2004) - [j84]János Pach, Géza Tóth:
Monotone drawings of planar graphs. J. Graph Theory 46(1): 39-47 (2004) - 2003
- [j83]János Pach, Ido Safruti, Micha Sharir:
The Union of Congruent Cubes in Three Dimensions. Discret. Comput. Geom. 30(1): 133-160 (2003) - [j82]János Pach, József Solymosi, Géza Tóth:
Unavoidable Configurations in Complete Topological Graphs. Discret. Comput. Geom. 30(2): 311-320 (2003) - [j81]János Pach, Rom Pinchasi:
How Many Unit Equilateral Triangles Can Be Generated by N Points in Convex Position? Am. Math. Mon. 110(5): 400-406 (2003) - 2002
- [j80]János Pach, Gábor Tardos:
Untangling a Polygon. Discret. Comput. Geom. 28(4): 585-592 (2002) - [j79]János Pach, Géza Tóth:
Recognizing String Graphs Is Decidable. Discret. Comput. Geom. 28(4): 593-606 (2002) - [j78]János Pach, Gábor Tardos:
Isosceles Triangles Determined by a Planar Point Set. Graphs Comb. 18(4): 769-779 (2002) - [j77]Adrian Dumitrescu, János Pach:
Partitioning Colored Point Sets into Monochromatic Parts. Int. J. Comput. Geom. Appl. 12(5): 401-412 (2002) - [j76]Imre Bárány, Gergely Harcos, János Pach, Gábor Tardos:
Covering lattice points by subspaces. Period. Math. Hung. 43(1-2): 93-103 (2002) - [j75]János Pach, Gábor Tardos:
On the Boundary Complexity of the Union of Fat Triangles. SIAM J. Comput. 31(6): 1745-1760 (2002) - 2001
- [j74]Noga Alon, János Pach, József Solymosi:
Ramsey-type Theorems with Forbidden Subgraphs. Comb. 21(2): 155-170 (2001) - [j73]János Pach, Rom Pinchasi:
On the Number of Balanced Lines. Discret. Comput. Geom. 25(4): 611-628 (2001) - [j72]I. G. MacDonald, János Pach, Thorsten Theobald:
Common Tangents to Four Unit Balls in R3. Discret. Comput. Geom. 26(1): 1-17 (2001) - [j71]János Pach, Gábor Tardos:
Separating convex sets by straight lines. Discret. Math. 241(1-3): 427-433 (2001) - [j70]János Pach, Micha Sharir:
Radial Points in the Plane. Eur. J. Comb. 22(6): 855-863 (2001) - [j69]János Pach, Rephael Wenger:
Embedding Planar Graphs at Fixed Vertex Locations. Graphs Comb. 17(4): 717-728 (2001) - [j68]Peter Braß, János Pach:
The Maximum Number of Times the Same Distance Can Occur among the Vertices of a Convex n-gon Is O(n log n). J. Comb. Theory A 94(1): 178-179 (2001) - [j67]János Pach, József Solymosi:
Crossing Patterns of Segments. J. Comb. Theory A 96(2): 316-325 (2001) - 2000
- [j66]Ariel Halpert, Flórián Lengyel, János Pach:
Cellular telephone networks and random maps in hypergraphs. Discret. Appl. Math. 103(1-3): 111-126 (2000) - [j65]János Pach, Gábor Tardos:
Cutting Glass. Discret. Comput. Geom. 24(2-3): 481-496 (2000) - [j64]János Pach, Joel Spencer, Géza Tóth:
New Bounds on Crossing Numbers. Discret. Comput. Geom. 24(4): 623-644 (2000) - [j63]János Pach, Géza Tóth:
Which Crossing Number Is It Anyway? J. Comb. Theory B 80(2): 225-246 (2000) - [j62]János Pach, Rom Pinchasi:
Bichromatic Lines with Few Points. J. Comb. Theory A 90(2): 326-335 (2000) - 1999
- [j61]János Pach, Joel Spencer:
Uniformly Distributed Distances - a Geometric Application of Janson's Inequality. Comb. 19(1): 111-124 (1999) - [j60]János Pach, Micha Sharir:
On the Boundary of the Union of Planar Convex Sets. Discret. Comput. Geom. 21(3): 321-328 (1999) - [j59]Paul Erdös, Gergely Harcos, János Pach:
Popular distances in 3-space. Discret. Math. 200(1-3): 95-99 (1999) - 1998
- [j58]János Pach:
A Tverberg-type result on multicolored simplices. Comput. Geom. 10(2): 71-76 (1998) - [j57]János Pach, Eduardo Rivera-Campo:
On circumscribing polygons for line segments. Comput. Geom. 10(2): 121-124 (1998) - [j56]János Pach, Micha Sharir:
On the Number of Incidences Between Points and Curves. Comb. Probab. Comput. 7(1): 121-127 (1998) - [j55]János Pach:
Guest Editor's Foreword. Discret. Comput. Geom. 19(3): 311-313 (1998) - [j54]János Pach, József Solymosi:
Canonical Theorems for Convex Sets. Discret. Comput. Geom. 19(3): 427-435 (1998) - [j53]János Pach, Géza Tóth:
A Generalization of the Erdos - Szekeres Theorem to Disjoint Convex Sets. Discret. Comput. Geom. 19(3): 437-445 (1998) - [j52]Tamal K. Dey, János Pach:
Extremal Problems for Geometric Hypergraphs. Discret. Comput. Geom. 19(4): 473-484 (1998) - [j51]Gyula Károlyi, János Pach, Géza Tóth, Pavel Valtr:
Ramsey-Type Results for Geometric Graphs, II. Discret. Comput. Geom. 20(3): 375-388 (1998) - 1997
- [j50]Pankaj K. Agarwal, Boris Aronov, János Pach, Richard Pollack, Micha Sharir:
Quasi-Planar Graphs Have a Linear Number of Edges. Comb. 17(1): 1-9 (1997) - [j49]János Pach, Géza Tóth:
Graphs Drawn with Few Crossings per Edge. Comb. 17(3): 427-439 (1997) - [j48]Gyula Károlyi, János Pach, Géza Tóth:
Ramsey-Type Results for Geometric Graphs, I. Discret. Comput. Geom. 18(3): 247-255 (1997) - [j47]László Lovász, János Pach, Mario Szegedy:
On Conway's Thrackle Conjecture. Discret. Comput. Geom. 18(4): 369-376 (1997) - 1996
- [j46]János Pach, Farhad Shahrokhi, Mario Szegedy:
Applications of the Crossing Number. Algorithmica 16(1): 111-117 (1996) - 1995
- [j45]Imre Bárány, János Pach:
Guest Editor's Forword. Discret. Comput. Geom. 13: 243-244 (1995) - [j44]Hubert de Fraysseix, Patrice Ossona de Mendez, János Pach:
A Left-First Search Algorithm for Planar Graphs. Discret. Comput. Geom. 13: 459-468 (1995) - 1994
- [j43]Péter Komjáth, János Pach:
The Complexity of a Class of Infinite Graphs. Comb. 14(1): 121-125 (1994) - [j42]Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman:
Crossing Families. Comb. 14(2): 127-134 (1994) - [j41]János Pach, Jenö Töröcsik:
Some Geometric Applications of Dilworth's Theorem. Discret. Comput. Geom. 12: 1-7 (1994) - [j40]Jirí Matousek, János Pach, Micha Sharir, Shmuel Sifrony, Emo Welzl:
Fat Triangles Determine Linearly Many Holes. SIAM J. Comput. 23(1): 154-169 (1994) - 1993
- [j39]János Pach, Richard Pollack, Emo Welzl:
Weaving Patterns of Lines and Line Segments in Space. Algorithmica 9(6): 561-571 (1993) - [j38]Paul Erdös, Endre Makai, János Pach:
Nearly Equal Distances in the Plane. Comb. Probab. Comput. 2: 401-408 (1993) - [j37]Hervé Brönnimann, Bernard Chazelle, János Pach:
How Hard Is Half-Space Range Searching. Discret. Comput. Geom. 10: 143-155 (1993) - [j36]Boris Aronov, Daniel Q. Naiman, János Pach, Micha Sharir:
An Invariant Property of Balls in Arrangements of Hyperplanes. Discret. Comput. Geom. 10: 421-425 (1993) - [j35]Paul Erdös, Zoltán Füredi, János Pach, Imre Z. Ruzsa:
The grid revisted. Discret. Math. 111(1-3): 189-196 (1993) - [j34]János Pach:
Extremal problems in graph drawings (abstract). SIGACT News 24(1): 57 (1993) - 1992
- [j33]Imre Bárány, János Pach:
On the Number of Convex Lattice Polygons. Comb. Probab. Comput. 1: 295-302 (1992) - [j32]János Pach, William L. Steiger, Endre Szemerédi:
An Upper Bound on the Number of Planar K-Sets. Discret. Comput. Geom. 7: 109-123 (1992) - [j31]János Komlós, János Pach, Gerhard J. Woeginger:
Almost Tight Bounds for epsilon-Nets. Discret. Comput. Geom. 7: 163-173 (1992) - [j30]Vasilis Capoyleas, János Pach:
A turán-type theorem on chords of a convex polygon. J. Comb. Theory B 56(1): 9-15 (1992) - [j29]János Pach, Micha Sharir:
Repeated Angles in the Plane and Related Problems. J. Comb. Theory A 59(1): 12-22 (1992) - [j28]Herbert Edelsbrunner, Leonidas J. Guibas, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir:
Arrangements of Curves in the Plane - Topology, Combinatorics and Algorithms. Theor. Comput. Sci. 92(2): 319-336 (1992) - 1991
- [j27]David Avis, Paul Erdös, János Pach:
Distinct Distances Determined By Subsets of a Point Set in Space. Comput. Geom. 1: 1-11 (1991) - [j26]Péter Komjáth, János Pach:
Universal elements and the complexity of certain classes of infinite graphs. Discret. Math. 95(1-3): 255-270 (1991) - [j25]János Pach, Norbert Sauer:
On the Average Volume of Subsets in Euclidean d-Space. Eur. J. Comb. 12(5): 417-421 (1991) - [j24]Ervin Györi, János Pach, Miklós Simonovits:
On the maximal number of certain subgraphs inKr-free graphs. Graphs Comb. 7(1): 31-37 (1991) - [j23]János Pach, Micha Sharir:
On Vertical Visibility in Arrangements of Segments and the Queue Size in the Bentley-Ottmann Line Sweeping Algorithm. SIAM J. Comput. 20(3): 460-470 (1991) - 1990
- [j22]Hubert de Fraysseix, János Pach, Richard Pollack:
How to draw a planar graph on a grid. Comb. 10(1): 41-51 (1990) - [j21]Gábor Fejes Tóth, János Pach:
Special issue dedicated to discrete and computational geometry. Comb. 10(2): 113-114 (1990) - [j20]Paul Erdös, János Pach:
Variation on the theme of repeated distances. Comb. 10(3): 261-269 (1990) - [j19]János Pach, Joel H. Spencer:
Note on vertex-partitions of infinite graphs. Discret. Math. 79(1): 107-108 (1990) - 1989
- [j18]János Pach, Micha Sharir:
The Upper Envelope of Piecewise Linear Functions and the Boundary of a Region Enclosed by Convex Plates: Combinatorial Analysis. Discret. Comput. Geom. 4: 291-309 (1989) - [j17]Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink:
On Arrangement of Jordan Arcs with Three Intersection per Pair. Discret. Comput. Geom. 4: 523-539 (1989) - [j16]Paul Erdös, János Pach, Richard Pollack, Zsolt Tuza:
Radius, diameter, and minimum degree. J. Comb. Theory B 47(1): 73-79 (1989) - 1988
- [j15]David Avis, Paul Erdös, János Pach:
Repeated distances in space. Graphs Comb. 4(1): 207-217 (1988) - [j14]Paul Erdös, Ralph J. Faudree, János Pach, Joel H. Spencer:
How to make a graph bipartite. J. Comb. Theory B 45(1): 86-98 (1988) - [j13]Paul Erdös, Mark Goldberg, János Pach, Joel Spencer:
Cutting a graph into two dissimilar halves. J. Graph Theory 12(1): 121-131 (1988) - [j12]Peter Frankl, János Pach:
An extremal problem on Kr-free graphs. J. Graph Theory 12(4): 519-523 (1988) - [j11]János Pach, Joel Spencer:
Explicit codes with low covering radius. IEEE Trans. Inf. Theory 34(5): 1281-1285 (1988) - 1987
- [j10]Peter Frankl, Zoltán Füredi, János Pach:
Bounding one-way differences. Graphs Comb. 3(1): 341-347 (1987) - 1986
- [j9]Klara Kedem, Ron Livne, János Pach, Micha Sharir:
On the Union of Jordan Regions and Collision-Free Translational Motion Amidst Polygonal Obstacles. Discret. Comput. Geom. 1: 59-70 (1986) - [j8]János Pach:
Covering the Plane with Convex Polygons. Discret. Comput. Geom. 1: 73-81 (1986) - [j7]Károly J. Böröczky, Imre Bárány, Endre Makai, János Pach:
Maximal volume enclosed by plates and proof of the chessboard conjecture. Discret. Math. 60: 101-120 (1986) - 1984
- [j6]Peter Frankl, János Pach:
On disjointly representable sets. Comb. 4(1): 39-45 (1984) - 1983
- [j5]Peter Frankl, János Pach:
On the Number of Sets in a Null t-Design. Eur. J. Comb. 4(1): 21-23 (1983) - [j4]Paul Erdös, János Pach:
On a Quasi-Ramsey problem. J. Graph Theory 7(1): 137-147 (1983) - 1981
- [j3]János Pach:
Graphs whose every independent set has a common neighbour. Discret. Math. 37(2-3): 217-228 (1981) - [j2]János Pach:
A Problem of Ulam on Planar Graphs. Eur. J. Comb. 2(4): 357-361 (1981) - 1980
- [j1]Paul Erdös, János Pach:
On a problem of L. Fejes Tóth. Discret. Math. 30(2): 103-109 (1980)
Conference and Workshop Papers
- 2024
- [c122]Herbert Edelsbrunner, János Pach:
Maximum Betti Numbers of Čech Complexes. SoCG 2024: 53:1-53:14 - [c121]Jacob Fox, János Pach, Andrew Suk:
A Structure Theorem for Pseudo-Segments and Its Applications. SoCG 2024: 59:1-59:14 - [c120]Jacob Fox, János Pach, Andrew Suk:
Enumeration of Intersection Graphs of x-Monotone Curves. GD 2024: 4:1-4:12 - [c119]Adrian Dumitrescu, János Pach:
Partitioning Complete Geometric Graphs on Dense Point Sets into Plane Subgraphs. GD 2024: 9:1-9:10 - 2023
- [c118]János Pach, Morteza Saghafian, Patrick Schnider:
Decomposition of Geometric Graphs into Star-Forests. GD (1) 2023: 339-346 - 2022
- [c117]János Pach, Gábor Tardos, Géza Tóth:
Disjointness Graphs of Short Polygonal Chains. SoCG 2022: 56:1-56:12 - [c116]Jacob Fox, János Pach, Andrew Suk:
Quasiplanar Graphs, String Graphs, and the Erdős-Gallai Problem. GD 2022: 219-231 - 2021
- [c115]Jacob Fox, János Pach, Andrew Suk:
Sunflowers in Set Systems of Bounded Dimension. SoCG 2021: 37:1-37:13 - [c114]Jacob Fox, János Pach, Andrew Suk:
On the Number of Edges of Separated Multigraphs. GD 2021: 223-227 - 2020
- [c113]Jacob Fox, János Pach, Andrew Suk:
Bounded VC-Dimension Implies the Schur-Erdős Conjecture. SoCG 2020: 46:1-46:8 - [c112]János Pach, Gábor Tardos, Géza Tóth:
Crossings Between Non-homotopic Edges. GD 2020: 359-371 - 2019
- [c111]Jacob Fox, János Pach, Andrew Suk:
Semi-Algebraic Colorings of Complete Graphs. SoCG 2019: 36:1-36:12 - [c110]János Pach, István Tomon:
On the Chromatic Number of Disjointness Graphs of Curves. SoCG 2019: 54:1-54:17 - [c109]János Pach, István Tomon:
Coloring Hasse Diagrams and Disjointness Graphs of Curves. GD 2019: 244-250 - [c108]János Pach, Natan Rubin, Gábor Tardos:
Planar point sets determine many pairwise crossing segments. STOC 2019: 1158-1166 - 2018
- [c107]János Pach, Géza Tóth:
A Crossing Lemma for Multigraphs. SoCG 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. SoCG 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. GD 2018: 242-254 - 2017
- [c104]Jacob Fox, János Pach, Andrew Suk:
Erdös-Hajnal Conjecture for Graphs with Bounded VC-Dimension. SoCG 2017: 43:1-43:15 - [c103]János Pach, Gábor Tardos, Géza Tóth:
Disjointness Graphs of Segments. SoCG 2017: 59:1-59:15 - [c102]János Pach, Géza Tóth:
Many Touchings Force Many Crossings. GD 2017: 153-159 - [c101]Radoslav Fulek, János Pach:
Thrackles: An Improved Upper Bound. GD 2017: 160-166 - 2016
- [c100]Akitoshi Kawamura, Sonoko Moriyama, Yota Otachi, János Pach:
A Lower Bound on Opaque Sets. SoCG 2016: 46:1-46:10 - [c99]Andrey Kupavskii, Nabil H. Mustafa, János Pach:
New Lower Bounds for epsilon-Nets. SoCG 2016: 54:1-54:16 - [c98]Jacob Fox, János Pach, Andrew Suk:
Approximating the Rectilinear Crossing Number. GD 2016: 413-426 - [c97]János Pach, Natan Rubin, Gábor Tardos:
Beyond the Richter-Thomassen Conjecture. SODA 2016: 957-968 - 2015
- [c96]Nabil H. Mustafa, János Pach:
On the Zarankiewicz Problem for Intersection Hypergraphs. GD 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 - 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. SoCG 2014: 436 - [c90]János Pach, Frank de Zeeuw:
Distinct distances on algebraic curves in the plane. SoCG 2014: 549 - 2013
- [c89]David Conlon, Jacob Fox, János Pach, Benny Sudakov, Andrew Suk:
Ramsey-type results for semi-algebraic relations. SoCG 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. GD 2013: 1-12 - [c87]János Pach, Gábor Tardos:
Cross-Intersecting Families of Vectors. JCDCGG 2013: 122-137 - 2012
- [c86]Jacob Fox, János Pach:
String graphs and incomparability graphs. SCG 2012: 405-414 - [c85]Gabriel Nivasch, János Pach, Gábor Tardos:
The Visible Perimeter of an Arrangement of Disks. GD 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 - 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. SCG 2011: 458-463 - [c80]János Pach, Géza Tóth:
Monotone Crossing Number. GD 2011: 278-289 - [c79]János Pach:
Every Graph Admits an Unambiguous Bold Drawing. GD 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 - 2010
- [c74]János Pach, Andrew Suk, Miroslav Treml:
Tangencies between families of disjoint regions in the plane. SCG 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. GD 2010: 226-237 - [c71]Balázs Keszegh, János Pach, Dömötör Pálvölgyi:
Drawing Planar Graphs of Bounded Degree with Few Slopes. GD 2010: 293-304 - [c70]Jacob Fox, Fabrizio Frati, János Pach, Rom Pinchasi:
Crossings between Curves with Many Tangencies. WALCOM 2010: 1-8 - [c69]Padmini Mukkamala, János Pach, Deniz Sariöz:
Graphs with Large Obstacle Numbers. WG 2010: 292-303 - 2009
- [c68]Eyal Ackerman, Jacob Fox, János Pach, Andrew Suk:
On grids in topological graphs. SCG 2009: 403-412 - [c67]János Pach:
Why Are String Graphs So Beautiful? GD 2009: 1 - [c66]Adrian Dumitrescu, János Pach, Géza Tóth:
Drawing Hamiltonian Cycles with No Large Angles. GD 2009: 3-14 - [c65]Jacob Fox, János Pach:
A Separator Theorem for String Graphs and Its Applications. WALCOM 2009: 1-14 - 2008
- [c64]Jacob Fox, János Pach:
Coloring kk-free intersection graphs of geometric objects in the plane. SCG 2008: 346-354 - [c63]Radoslav Fulek, Andreas F. Holmsen, János Pach:
Intersecting convex sets by rays. SCG 2008: 385-391 - [c62]Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth:
Cubic Graphs Have Bounded Slope Parameter. GD 2008: 50-60 - [c61]Xiaomin Chen, János Pach, Mario Szegedy, Gábor Tardos:
Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles. SODA 2008: 94-101 - 2007
- [c60]János Pach, Géza Tóth:
Decomposition of multiple coverings into many parts. SCG 2007: 133-137 - [c59]Esther Ezra, János Pach, Micha Sharir:
On regular vertices on the union of planar objects. SCG 2007: 220-226 - [c58]Jacob Fox, János Pach, Csaba D. Tóth:
A Bipartite Strengthening of the Crossing Lemma. GD 2007: 13-24 - [c57]János Pach, Gábor Tardos:
Coloring Axis-Parallel Rectangles. KyotoCGGT 2007: 178-185 - 2006
- [c56]János Pach, Géza Tóth:
Degenerate crossing numbers. SCG 2006: 255-258 - [c55]Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth:
Drawing Cubic Graphs with at Most Five Slopes. GD 2006: 114-125 - [c54]Gruia Calinescu, Adrian Dumitrescu, János Pach:
Reconfigurations in Graphs and Grids. LATIN 2006: 262-273 - 2005
- [c53]János Pach, Gábor Tardos, Géza Tóth:
Indecomposable Coverings. CJCDGCGT 2005: 135-148 - [c52]János Pach, Gábor Tardos:
Forbidden patterns and unit distances. SCG 2005: 1-9 - [c51]János Pach, Géza Tóth:
Crossing Number of Toroidal Graphs. GD 2005: 334-342 - [c50]Amos Fiat, Meital Levy, Jirí Matousek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl:
Online conflict-free coloring for intervals. SODA 2005: 545-554 - 2004
- [c49]János Pach, Rados Radoicic, Gábor Tardos, Géza Tóth:
Improving the crossing lemma by finding more crossings in sparse graphs: [extended abstract]. SCG 2004: 68-75 - [c48]János Pach, Rom Pinchasi, Micha Sharir:
Solution of Scott's problem on the number of directions determined by a point set in 3-space. SCG 2004: 76-85 - [c47]Adrian Dumitrescu, János Pach:
Pushing squares around. SCG 2004: 116-123 - [c46]Jan Kyncl, János Pach, Géza Tóth:
Long Alternating Paths in Bicolored Point Sets. GD 2004: 340-348 - [c45]Sergey Bereg, Adrian Dumitrescu, János Pach:
Sliding Disks in the Plane. JCDCG 2004: 37-47 - 2003
- [c44]János Pach, Rom Pinchasi, Micha Sharir:
A tight bound for the number of different directions in three dimensions. SCG 2003: 106-113 - [c43]János Pach, Géza Tóth:
How Many Ways Can One Draw a Graph? GD 2003: 47-58 - [c42]János Pach, Géza Tóth:
Disjoint Edges in Topological Graphs. IJCCGGT 2003: 133-140 - [c41]Boris Aronov, János Pach, Micha Sharir, Gábor Tardos:
Distinct distances in three and higher dimensions. STOC 2003: 541-546 - 2002
- [c40]Eran Nevo, János Pach, Rom Pinchasi, Micha Sharir, Shakhar Smorodinsky:
Lenses in arrangements of pseudo-circles and their applications. SCG 2002: 123-132 - [c39]János Pach, Rom Pinchasi, Gábor Tardos, Géza Tóth:
Geometric Graphs with No Self-intersecting Path of Length Three. GD 2002: 295-311 - [c38]János Pach, Géza Tóth:
Monotone Drawings of Planar Graphs. ISAAC 2002: 647-654 - [c37]János Pach, Rados Radoicic, Géza Tóth:
Relaxing Planarity for Topological Graphs. JCDCG 2002: 221-232 - 2001
- [c36]János Pach, Ido Safruti, Micha Sharir:
The union of congruent cubes in three dimensions. SCG 2001: 19-28 - [c35]János Pach, Gábor Tardos:
Untangling a Polygon. GD 2001: 154-161 - [c34]János Pach, Géza Tóth:
Recognizing String Graphs Is Decidable. GD 2001: 247-260 - [c33]Adrian Dumitrescu, János Pach:
Partitioning Colored Point Sets into Monochromatic Parts. WADS 2001: 264-275 - 2000
- [c32]János Pach, Gábor Tardos:
Cutting glass. SCG 2000: 360-369 - [c31]János Pach, Gábor Tardos:
On the boundary complexity of the union of fat triangles. FOCS 2000: 423-431 - [c30]János Pach, Géza Tóth:
Unavoidable Configurations in Complete Topological Graphs. GD 2000: 328-337 - [c29]János Pach:
On the Complexity of the Union of Geometric Objects. JCDCG 2000: 292-307 - [c28]János Pach, József Solymosi:
Structure Theorems for Systems of Segments. JCDCG 2000: 308-317 - 1999
- [c27]János Pach, Joel Spencer, Géza Tóth:
New Bounds on Crossing Numbers. SCG 1999: 124-133 - 1998
- [c26]János Pach, Géza Tóth:
Which Crossing Number is it, Anyway? FOCS 1998: 617-627 - [c25]János Pach, Rephael Wenger:
Embedding Planar Graphs at Fixed Vertex Locations. GD 1998: 263-274 - [c24]János Pach:
Crossing Numbers. JCDCG 1998: 267-273 - 1997
- [c23]Gyula Károlyi, János Pach, Géza Tóth, Pavel Valtr:
Ramsey-Type Results for Geometric Graphs II. SCG 1997: 94-103 - [c22]János Pach, Torsten Thiele, Géza Tóth:
Three-dimensional Grid Drawings of Graphs. GD 1997: 47-51 - 1996
- [c21]Gyula Károlyi, János Pach, Géza Tóth:
Ramsey-Type Results for Geometric Graphs. SCG 1996: 359-365 - [c20]János Pach, Géza Tóth:
Graphs Drawn with Few Crossings Per Edge. GD 1996: 345-354 - [c19]Tamal K. Dey, János Pach:
Extremal Problems for Geometric Hypergraphs. ISAAC 1996: 105-114 - 1995
- [c18]László Lovász, János Pach, Mario Szegedy:
On Conway's Thrackle Conjecture. SCG 1995: 147-151 - [c17]Pankaj K. Agarwal, Boris Aronov, János Pach, Richard Pollack, Micha Sharir:
Quasi-Planar Graphs Have a Linear Number of Edges. GD 1995: 1-7 - 1994
- [c16]János Pach, Farhad Shahrokhi, Mario Szegedy:
Applications of the Crossing Number. SCG 1994: 198-202 - 1993
- [c15]János Pach, Jenö Töröcsik:
Some Geometric Applications of Dilworth's Theorem. SCG 1993: 264-269 - 1991
- [c14]Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman:
Crossing Families. SCG 1991: 351-356 - [c13]János Pach, Jenö Töröcsik:
Layout of Rooted Trees. Planar Graphs 1991: 131-137 - [c12]Jirí Matousek, Nathaly Miller, János Pach, Micha Sharir, Shmuel Sifrony, Emo Welzl:
Fat Triangles Determine Linearly Many Holes. FOCS 1991: 49-58 - 1990
- [c11]János Pach, Gerhard J. Woeginger:
Some New Bounds for Epsilon-Nets. SCG 1990: 10-15 - [c10]Sylvain E. Cappell, Jacob E. Goodman, János Pach, Richard Pollack, Micha Sharir, Rephael Wenger:
The Combinatorial Complexity of Hyperplane Transversals. SCG 1990: 83-91 - [c9]Vasilis Capoyleas, János Pach:
On the Perimeter of a Point Set in the Plane. Discrete and Computational Geometry 1990: 67-76 - [c8]Paul Erdös, Endre Makai, János Pach, Joel H. Spencer:
Gaps in Difference Sets, and the Graph of Nearly Equal Distances. Applied Geometry And Discrete Mathematics 1990: 265-274 - [c7]János Pach:
Notes on Geometric Graph Theory. Discrete and Computational Geometry 1990: 273-286 - [c6]János Pach, Richard Pollack, Emo Welzl:
Weaving Patterns of Lines and Segments in Space. SIGAL International Symposium on Algorithms 1990: 439-446 - 1989
- [c5]János Pach, William L. Steiger, Endre Szemerédi:
An Upper Bound on the Number of Planar k-Sets. FOCS 1989: 72-79 - 1988
- [c4]Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink:
On Arrangements of Jordan Arcs with Three Intersections per Pair. SCG 1988: 258-265 - [c3]Herbert Edelsbrunner, Leonidas J. Guibas, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir:
Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms. ICALP 1988: 214-229 - [c2]Hubert de Fraysseix, János Pach, Richard Pollack:
Small Sets Supporting Fáry Embeddings of Planar Graphs. STOC 1988: 426-433 - 1987
- [c1]Herbert Edelsbrunner, János Pach, Jacob T. Schwartz, Micha Sharir:
On the Lower Envelope of Bivariate Functions and its Applications. FOCS 1987: 27-37
Parts in Books or Collections
- 2013
- [p1]János Pach:
A Remark on Transversal Numbers. The Mathematics of Paul Erdős I 2013: 541-549
Editorship
- 2015
- [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] - 2004
- [e1]János Pach:
Graph Drawing, 12th International Symposium, GD 2004, New York, NY, USA, September 29 - October 2, 2004, Revised Selected Papers. Lecture Notes in Computer Science 3383, Springer 2004, ISBN 3-540-24528-6 [contents]
Reference Works
- 2004
- [r3]János Pach:
Finite Point Configurations. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 3-24 - [r2]János Pach:
Geometric Graph Theory. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 219-238 - 1999
- [r1]Ileana Streinu, Károly Bezdek, János Pach, Tamal K. Dey, Jianer Chen, Dina Kravets, Nancy M. Amato, W. Randolph Franklin:
Discrete And Computational Geometry. Handbook of Discrete and Combinatorial Mathematics 1999
Informal and Other Publications
- 2024
- [i37]Adrian Dumitrescu, János Pach:
Partitioning complete geometric graphs into plane subgraphs. CoRR abs/2405.17172 (2024) - [i36]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): 71-94 (2024) - 2023
- [i35]János Pach, Morteza Saghafian, Patrick Schnider:
Decomposition of Geometric Graphs into Star Forests. CoRR abs/2306.13201 (2023) - [i34]Jacob Fox, János Pach, Andrew Suk:
A structure theorem for pseudo-segments and its applications. CoRR abs/2312.01028 (2023) - [i33]Adrian Dumitrescu, János Pach, Géza Tóth:
Two trees are better than one. CoRR abs/2312.09916 (2023) - 2021
- [i32]Jacob Fox, János Pach, Andrew Suk:
On the number of edges of separated multigraphs. CoRR abs/2108.11290 (2021) - [i31]Jacob Fox, János Pach, Andrew Suk:
Quasiplanar graphs, string graphs, and the Erdős-Gallai problem. CoRR abs/2112.02378 (2021) - 2019
- [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
- [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
- [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
- [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
- [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
- [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
- [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
- [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
- [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
- [i6]Jacob Fox, Mikhail Gromov, Vincent Lafforgue, Assaf Naor, János Pach:
Overlap properties of geometric expanders. CoRR abs/1005.1392 (2010) - [i5]Adrian Dumitrescu, János Pach:
Opaque sets. CoRR abs/1005.2218 (2010) - [i4]Balázs Keszegh, János Pach, Dömötör Pálvölgyi:
Drawing planar graphs of bounded degree with few slopes. CoRR abs/1009.1315 (2010) - [i3]János Pach, Gábor Tardos:
Tight lower bounds for the size of epsilon-nets. CoRR abs/1012.1240 (2010) - [i2]János Pach, Deniz Sariöz:
Small (2,s)-colorable graphs without 1-obstacle representations. CoRR abs/1012.5907 (2010) - 2009
- [i1]Adrian Dumitrescu, János Pach:
Minimum clique partition in unit disk graphs. CoRR abs/0909.1552 (2009)
Coauthor Index
Ricky Pollack
aka: Richard Pollack
aka: Richard Pollack
[j201] [j200] [j199] [j196] [j194] [j190] [j171] [j165] [j161] [j157] [j151] [j146] [j139] [j134] [j123] [j121] [j119] [j114] [j95] [j88] [j87] [j80] [j78] [j76] [j75] [j71] [j65] [c117] [c112] [c108] [c103] [c97] [c94] [c87] [c85] [c81] [c75] [c61] [c57] [c53] [c52] [c49] [c41] [c39] [c35] [c32] [c31] [i30] [i26] [i25] [i24] [i23] [i19] [i14] [i11] [i3]
[j201] [j194] [j190] [j188] [j186] [j175] [j172] [j161] [j159] [j152] [j145] [j138] [j122] [j120] [j117] [j111] [j108] [j98] [j95] [j92] [j91] [j87] [j84] [j82] [j79] [j64] [j63] [j53] [j51] [j49] [j48] [c117] [c112] [c107] [c105] [c103] [c102] [c80] [c78] [c66] [c62] [c60] [c56] [c55] [c53] [c51] [c49] [c46] [c43] [c42] [c39] [c38] [c37] [c34] [c30] [c27] [c26] [c23] [c22] [c21] [c20] [i33] [i27]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 21:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
