János Pach

发表

The visible perimeter of an arrangement of disks pdf

Gabriel Nivasch, János Pach, Gábor Tardos, 2014, Comput. Geom..

Review of "L. Lovász: Combinatorial Problems and Exercises"

János Pach, 1980 .

Partitioning Colored Point Sets into Monochromatic Parts

János Pach, Adrian Dumitrescu, J. Pach, 2002, Int. J. Comput. Geom. Appl..

Graphs with Large Obstacle Numbers

János Pach, Padmini Mukkamala, Deniz Sariöz, 2010, WG.

Drawing cubic graphs with at most five slopes

Balázs Keszegh, János Pach, Géza Tóth, 2008, Comput. Geom..

Separation with restricted families of sets

János Pach, Gábor Tardos, Zsolt Lángi, 2016, J. Comb. Theory, Ser. A.

Covering lattice points by subspaces

János Pach, Gábor Tardos, Imre Bárány, 2002, Period. Math. Hung..

Ramsey-type results for geometric graphs

János Pach, Géza Tóth, Gyula Károlyi, 1996, SCG '96.

Tangencies between families of disjoint regions in the plane

János Pach, Andrew Suk, Miroslav Treml, 2012, Comput. Geom..

Guest Editors' Foreword

Zoltán Füredi, János Pach, Attila Sali, 2008, Discret. Math..

On the Perimeter of a Point Set in the Plane

János Pach, Vasilis Capoyleas, 1990, Discrete and Computational Geometry.

Graph Drawing, 12th International Symposium, GD 2004, New York, NY, USA, September 29 - October 2, 2004, Revised Selected Papers

János Pach, 2004, Graph Drawing.

Drawing Planar Graphs of Bounded Degree with Few Slopes

Balázs Keszegh, János Pach, Dömötör Pálvölgyi, 2013, SIAM J. Discret. Math..

Coloring kk-free intersection graphs of geometric objects in the plane

János Pach, Jacob Fox, 2008, SCG '08.

Crossing numbers of imbalanced graphs

János Pach, Gábor Tardos, József Solymosi, 2010, J. Graph Theory.

Planar point sets determine many pairwise crossing segments

János Pach, Gábor Tardos, Natan Rubin, 2019, STOC.

A lower bound on opaque sets

Yota Otachi, János Pach, Akitoshi Kawamura, 2016, Symposium on Computational Geometry.

Coloring kk-free intersection graphs of geometric objects in the plane

János Pach, Jacob Fox, J. Pach, 2008, SCG '08.

A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing pdf

János Pach, Andrew Suk, Jacob Fox, 2015, SIAM J. Comput..

Almost All String Graphs are Intersection Graphs of Plane Convex Sets

Bruce A. Reed, János Pach, Yelena Yuditsky, 2018, Discrete & Computational Geometry.

A Separator Theorem for String Graphs and its Applications

János Pach, Jacob Fox, J. Pach, 2009, Combinatorics, Probability and Computing.

On the Number of Sets in a Null t-Design

János Pach, Peter Frankl, 1983, Eur. J. Comb..

Thirtieth Anniversary Note from the Editors in Chief

Kenneth L. Clarkson, János Pach, Günter M. Ziegler, 2016, Discret. Comput. Geom..

Isosceles Triangles Determined by a Planar Point Set

János Pach, Gábor Tardos, J. Pach, 2002, Graphs Comb..

Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles

János Pach, Gábor Tardos, Xiaomin Chen, 2008, SODA '08.

Monotone Crossing Number

János Pach, Géza Tóth, J. Pach, 2011, GD.

On the Complexity of the Union of Geometric Objects

János Pach, J. Pach, 2000, JCDCG.

Points surrounding the origin

János Pach, Andreas Holmsen, Helge Tverberg, 2008, Comb..

New Trends in Discrete and Computational Geometry

János Pach, 2013 .

Guest Editors’ Foreword

János Pach, Lars Arge, J. Pach, 2008, Discret. Math..

Guest Editor's Foreword

János Pach, Emden R. Gansner, Emden R. Gansner, 2005, J. Graph Algorithms Appl..

Discrete and Computational Geometry (Mathematical Sciences Research Institute Publications)

János Pach, Silvio Levy, Emo Welzl, 2005 .

On grids in topological graphs

János Pach, Andrew Suk, Eyal Ackerman, 2014, Comput. Geom..

The Number of Edges in k-Quasi-planar Graphs

János Pach, Andrew Suk, Jacob Fox, 2011, SIAM J. Discret. Math..

Structure Theorems for Systems of Segments

János Pach, József Solymosi, J. Pach, 2000, JCDCG.

Embedding Planar Graphs at Fixed Vertex Locations

János Pach, Rephael Wenger, J. Pach, 1998, GD.

On the Structure of Graphs with Low Obstacle Number

János Pach, Deniz Sariöz, J. Pach, 2011, Graphs Comb..

A stability theorem on cube tessellations

János Pach, Peter Frankl, 2018, J. Comput. Geom..

Special issue dedicated to discrete and computational geometry

János Pach, Gábor Fejes Tóth, 1990, Comb..

How to draw a planar graph on a grid

János Pach, Hubert de Fraysseix, Richard Pollack, 1990, Comb..

A Precise Threshold for Quasi-Ramsey Numbers

János Pach, Ross J. Kang, Viresh Patel, 2015, SIAM J. Discret. Math..

Beyond the Richter-Thomassen Conjecture pdf

János Pach, Gábor Tardos, Natan Rubin, 2016, SODA.

The union of congruent cubes in three dimensions

Micha Sharir, János Pach, Ido Safruti, 2001, SCG '01.

Many Touchings Force Many Crossings

János Pach, Géza Tóth, 2017, Graph Drawing.

Partitioning Colored Point Sets into Monochromatic Parts

János Pach, Adrian Dumitrescu, 2001, WADS.

Lenses in arrangements of pseudo-circles and their applications

Micha Sharir, János Pach, Pankaj K. Agarwal, 2004, JACM.

Repeated distances in space

Paul Erdös, János Pach, David Avis, 1988, Graphs Comb..

On circumscribing polygons for line segments

János Pach, Eduardo Rivera-Campo, 1998, Comput. Geom..

The Mathematician of the Enlightenment

János Pach, 1984 .

Monochromatic empty triangles in two-colored point sets

János Pach, Géza Tóth, 2013, Discret. Appl. Math..

Repeated Angles in the Plane and Related Problems

Micha Sharir, János Pach, M. Sharir, 1992, J. Comb. Theory, Ser. A.

Crossing Number of Toroidal Graphs

János Pach, Géza Tóth, 2005, Graph Drawing.

On the Upward Planarity of Mixed Plane Graphs

Csaba D. Tóth, Michael Kaufmann, David R. Wood, 2014, J. Graph Algorithms Appl..

Long Alternating Paths in Bicolored Point Sets

János Pach, Géza Tóth, Jan Kyncl, 2004, Graph Drawing.

Erdős–Hajnal Conjecture for Graphs with Bounded VC-Dimension

János Pach, Andrew Suk, Jacob Fox, 2017, Discrete & Computational Geometry.

A Crossing Lemma for Jordan Curves pdf

János Pach, Gábor Tardos, Natan Rubin, 2017, Advances in Mathematics.

境界上の重みの釣合せ (計算理論とアルゴリズムの新潮流) ; Weight Balancing on Boundaries and Skeletons (New Streams of Computation Theory and Algorithms) ; キョウカイジョウノオモミノツリアワセケイサンリロントアルゴリズムノシンチョウリュウ

Rudolf Fleischer, János Pach, Jean-Lou De Carufel, 2014 .

Popular distances in 3-space

Paul Erdös, János Pach, Gergely Harcos, 1999, Discret. Math..

Every Graph Admits an Unambiguous Bold Drawing

János Pach, 2011, Graph Drawing.

On the Average Volume of Subsets in Euclidean d-Space

János Pach, N. Sauer, 1991, Eur. J. Comb..

Piercing quasi-rectangles - On a problem of Danzer and Rogers

János Pach, Gábor Tardos, J. Pach, 2012, J. Comb. Theory A.

Embedding Planar Graphs at Fixed Vertex Locations

János Pach, Rephael Wenger, 1998, Graph Drawing.

Cross-Intersecting Families of Vectors

János Pach, Gábor Tardos, 2015, Graphs Comb..

The number of distinct distances from a vertex of a convex polygon pdf

Gabriel Nivasch, János Pach, Rom Pinchasi, 2013, J. Comput. Geom..

Drawing Planar Graphs of Bounded Degree with Few Slopes

Balázs Keszegh, János Pach, Dömötör Pálvölgyi, 2010, Graph Drawing.

Relaxing Planarity for Topological Graphs

János Pach, Géza Tóth, Rados Radoicic, 2002, JCDCG.

How Many Unit Equilateral Triangles Can Be Generated by N Points in Convex Position?

János Pach, Rom Pinchasi, 2003, Am. Math. Mon..

On the Zarankiewicz problem for intersection hypergraphs

Nabil H. Mustafa, János Pach, J. Pach, 2015, J. Comb. Theory A.

Convexly Independent Subsets of the Minkowski Sum of Planar Point Sets

Friedrich Eisenbrand, János Pach, Thomas Rothvoß, 2008, Electron. J. Comb..

An extremal problem on Kr-free graphs

János Pach, Peter Frankl, 1988, J. Graph Theory.

Nearly Equal Distances in the Plane

Paul Erdös, János Pach, Endre Makai, 1993, Comb. Probab. Comput..

On arrangements of Jordan arcs with three intersections per pair

Leonidas J. Guibas, Micha Sharir, Raimund Seidel, 2018, SCG '88.

Sliding Disks in the Plane

Sergey Bereg, János Pach, Adrian Dumitrescu, 2008, Int. J. Comput. Geom. Appl..

Intersecting Convex Sets by Rays

János Pach, Andreas Holmsen, Radoslav Fulek, 2009, Discret. Comput. Geom..

Arrangements of Curves in the Plane - Topology, Combinatorics and Algorithms

Leonidas J. Guibas, Micha Sharir, Raimund Seidel, 2018, Theor. Comput. Sci..

A bipartite strengthening of the Crossing Lemma

Csaba D. Tóth, János Pach, Jacob Fox, 2007, J. Comb. Theory, Ser. B.

A tight bound for the number of different directions in three dimensions

Micha Sharir, János Pach, Rom Pinchasi, 2003, SCG '03.

Computing the independence number of intersection graphs

János Pach, Jacob Fox, J. Pach, 2011, SODA '11.

Ramsey-type Theorems with Forbidden Subgraphs

Noga Alon, János Pach, József Solymosi, 2001, Comb..

Intersection patterns of curves

Csaba D. Tóth, János Pach, Jacob Fox, 2011, J. Lond. Math. Soc..

Online conflict-free coloring for intervals

Amos Fiat, Micha Sharir, Elchanan Mossel, 2005, SODA '05.

Homogeneous selections from hyperplanes

János Pach, Imre Bárány, 2014, J. Comb. Theory, Ser. B.

Separating bi-chromatic points by parallel lines

Subhash Suri, János Pach, Tetsuo Asano, 1990 .

Saturated simple and k-simple topological graphs

János Pach, Géza Tóth, Jan Kyncl, 2015, Comput. Geom..

Applications of the crossing number

Farhad Shahrokhi, János Pach, Mario Szegedy, 1994, SCG '94.

Thrackles: An improved upper bound

János Pach, Radoslav Fulek, 2019, Discret. Appl. Math..

Fat Triangles Determine Linearly Many Holes

Micha Sharir, Jirí Matousek, János Pach, 1994, SIAM J. Comput..

On Vertical Visibility in Arrangements of Segments and the Queue Size in the Bentley-Ottmann Line Sweeping Algorithm

Micha Sharir, János Pach, M. Sharir, 1991, SIAM J. Comput..

Degenerate crossing numbers

János Pach, Géza Tóth, 2006, SCG '06.

A Crossing Lemma for Multigraphs

János Pach, Géza Tóth, 2018, Symposium on Computational Geometry.

The Visible Perimeter of an Arrangement of Disks

Gabriel Nivasch, János Pach, Gábor Tardos, 2012, Graph Drawing.

How hard is half-space range searching?

Bernard Chazelle, János Pach, Hervé Brönnimann, 1993, Discret. Comput. Geom..

Coloring axis-parallel rectangles

János Pach, Gábor Tardos, 2010, J. Comb. Theory, Ser. A.

Remarks on Schur's conjecture

János Pach, Filip Moric, J. Pach, 2012, Comput. Geom..

How Many Ways Can One Draw A Graph?

János Pach, Géza Tóth, 2006, Comb..

Tilings of the plane with unit area triangles of bounded diameter

János Pach, Gábor Tardos, Andrey Kupavskii, 2017, ArXiv.

On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves pdf

János Pach, Gábor Tardos, Natan Rubin, 2014, SODA.

Cross-Intersecting Families of Vectors

János Pach, Gábor Tardos, 2013, JCDCGG.

Three-dimensional Grid Drawings of Graphs

János Pach, Géza Tóth, Torsten Thiele, 1997, GD.

Degenerate Crossing Numbers

János Pach, Géza Tóth, 2009, Discret. Comput. Geom..

Improving the Crossing Lemma by Finding More Crossings in Sparse Graphs

János Pach, Gábor Tardos, Géza Tóth, 2006, Discret. Comput. Geom..

Small sets supporting fary embeddings of planar graphs

János Pach, Hubert de Fraysseix, Richard Pollack, 1988, STOC '88.

Layout of Rooted Trees

János Pach, Jenö Töröcsik, J. Pach, 1991, Planar Graphs.

Indecomposable Coverings

János Pach, Gábor Tardos, Géza Tóth, 2005, Canadian Mathematical Bulletin.

Controlling Lipschitz functions pdf

János Pach, Gábor Tardos, Andrey Kupavskii, 2017, ArXiv.

Semi-algebraic colorings of complete graphs

János Pach, Andrew Suk, Jacob Fox, 2015, SoCG.

Forbidden patterns and unit distances

János Pach, Gábor Tardos, 2005, Symposium on Computational Geometry.

Crossings between Curves with Many Tangencies

János Pach, Rom Pinchasi, Fabrizio Frati, 2010, WALCOM.

On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles

Micha Sharir, János Pach, Ron Livne, 1986, Discret. Comput. Geom..

Conway's Conjecture for Monotone Thrackles

János Pach, Ethan Sterling, 2011, Am. Math. Mon..

Fat triangles determine linearly many holes (computational geometry)

Micha Sharir, Jirí Matousek, János Pach, 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

Crossing Patterns of Segments

János Pach, József Solymosi, J. Pach, 2001, J. Comb. Theory, Ser. A.

Extremal Problems for Geometric Hypergraphs

János Pach, Tamal K. Dey, 1996, ISAAC.

Geometric graphs with no self-intersecting path of length three

János Pach, Gábor Tardos, Rom Pinchasi, 2004, Eur. J. Comb..

Disjoint homometric sets in graphs

János Pach, Michael O. Albertson, Michael E. Young, 2011, Ars Math. Contemp..

Uniformly Distributed Distances – a Geometric Application of Janson's Inequality

Joel H. Spencer, János Pach, 1999, Comb..

2 Two Important Bounds and Their Applications

János Pach, J. Pach, 1994 .

New Bounds on Crossing Numbers

Joel H. Spencer, János Pach, Géza Tóth, 2000, Discret. Comput. Geom..

Cutting Glass

János Pach, Gábor Tardos, 2000, Discret. Comput. Geom..

Combinatorial Geometry

János Pach, Pankaj K. Agarwal, J. Pach, 2012 .

On regular vertices on the union of planar objects

Micha Sharir, János Pach, Esther Ezra, 2007, SCG '07.

On the Boundary of the Union of Planar Convex Sets

Micha Sharir, János Pach, 1999, Discret. Comput. Geom..

Every graph admits an unambiguous bold drawing

János Pach, 2015, J. Graph Algorithms Appl..

Correction to: New Trends in Intuitive Geometry

János Pach, Imre Bárány, Gábor Fejes Tóth, 2018 .

On the Size of K-Cross-Free Families

János Pach, Andrey Kupavskii, István Tomon, 2019, Comb..

How Many Ways Can One Draw A Graph?

János Pach, Géza Tóth, J. Pach, 2003, Comb..

Opposite-Quadrant Depth in the Plane

János Pach, Hervé Brönnimann, Jonathan Lenchner, 2007, Graphs Comb..

Weight Balancing on Boundaries and Skeletons

Rudolf Fleischer, Yoshio Okamoto, Otfried Cheong, 2014, SoCG.

On grids in topological graphs

János Pach, Andrew Suk, Eyal Ackerman, 2009, SCG '09.

Unavoidable Configurations in Complete Topological Graphs

János Pach, Géza Tóth, 2000, Graph Drawing.

On a Quasi-Ramsey problem

Paul Erdös, János Pach, 1983, J. Graph Theory.

Improving the crossing lemma by finding more crossings in sparse graphs: [extended abstract]

János Pach, Gábor Tardos, Géza Tóth, 2004, SCG '04.

Coloring Axis-Parallel Rectangles

János Pach, Gábor Tardos, 2007, KyotoCGGT.

A Remark on Transversal Numbers

János Pach, J. Pach, 2013, The Mathematics of Paul Erdős I.

An invariant property of balls in arrangements of hyperplanes

Micha Sharir, Boris Aronov, János Pach, 1993, Discret. Comput. Geom..

On arrangements of Jordan arcs with three intersections per pair

Leonidas J. Guibas, Micha Sharir, Raimund Seidel, 1989, Discret. Comput. Geom..

Reconfigurations in Graphs and Grids

János Pach, Gruia Calinescu, Adrian Dumitrescu, 2006, SIAM J. Discret. Math..

Graphs drawn with few crossings per edge

János Pach, Géza Tóth, J. Pach, 1997, Comb..

Crossing families

Wayne Goddard, Paul Erdös, Boris Aronov, 1991, SCG '91.

Monotone Drawings of Planar Graphs

János Pach, Géza Tóth, 2002, ISAAC.

Long alternating paths in bicolored point sets

János Pach, Géza Tóth, Jan Kyncl, 2008, Discret. Math..

Beyond-Planar Graphs: Algorithmics and Combinatorics (Dagstuhl Seminar 16452)

Michael Kaufmann, János Pach, Stephen G. Kobourov, 2016, Dagstuhl Reports.

Unsplittable Coverings in the Plane

János Pach, Dömötör Pálvölgyi, J. Pach, 2013, WG.

Ramsey-Type Results for Geometric Graphs II

János Pach, Géza Tóth, Pavel Valtr, 1997, Symposium on Computational Geometry.

Combinatorics, Probability and Computing on the Number of Convex Lattice Polygons on the Number of Convex Lattice Polygons

János Pach, Imre Bárány, J. Pach, 2022 .

Letter from the New Editors-in-Chief

János Pach, Herbert Edelsbrunner, Günter M. Ziegler, 2011, Discret. Comput. Geom..

Lower Bounds on the Obstacle Number of Graphs

János Pach, Dömötör Pálvölgyi, Padmini Mukkamala, 2012, Electron. J. Comb..

"square Trisection". Dissection of a Square in Three Congruent Partitions

János Pach, Christian Blanvillain, 2010, Bull. dInformatique Approfondie et Appl..

Geometry — Intuitive, Discrete, and Convex

János Pach, Imre Bárány, Gábor Fejes Tóth, 2013 .

Approximating the Rectilinear Crossing Number pdf

János Pach, Andrew Suk, Jacob Fox, 2016, GD.

Recognizing String Graphs Is Decidable

János Pach, Géza Tóth, 2001, Graph Drawing.

Distinct Distances on Algebraic Curves in the Plane

János Pach, Frank de Zeeuw, 2017, Comb. Probab. Comput..

On the Zarankiewicz Problem for Intersection Hypergraphs

Nabil H. Mustafa, János Pach, 2015, Graph Drawing.

Some new bounds for Epsilon-nets

Gerhard J. Woeginger, János Pach, 1990, SCG '90.

Distinct distances on algebraic curves in the plane

János Pach, Frank de Zeeuw, J. Pach, 2013, Combinatorics, Probability and Computing.

Extremal Problems for Geometric Hypergraphs

János Pach, Tamal K. Dey, 1998, Discret. Comput. Geom..

Abstract.

Micha Sharir, János Pach, Rom Pinchasi, 2013, Virologie.

Note on vertex-partitions of infinite graphs

Joel H. Spencer, János Pach, 1990, Discret. Math..

Decomposition of multiple coverings into many parts

János Pach, Géza Tóth, J. Pach, 2007, SCG '07.

On the Number of Incidences Between Points and Curves

Micha Sharir, János Pach, M. Sharir, 1998, Combinatorics, Probability and Computing.

Untangling a Polygon

János Pach, Gábor Tardos, 2002, Discret. Comput. Geom..

A Problem of Ulam on Planar Graphs

János Pach, 1981, Eur. J. Comb..

A Generalization of the Erdos - Szekeres Theorem to Disjoint Convex Sets

János Pach, Géza Tóth, 1998, Discret. Comput. Geom..

Distinct Distances in Three and Higher Dimensions

Micha Sharir, Boris Aronov, János Pach, 2004, Comb. Probab. Comput..

A Bipartite Strengthening of the Crossing Lemma

Csaba D. Tóth, János Pach, Jacob Fox, 2007, Graph Drawing.

The number of crossings in multigraphs with no empty lens pdf

Michael Kaufmann, János Pach, Géza Tóth, 2018, Graph Drawing.

Cutting glass

János Pach, Gábor Tardos, 2000, SCG '00.

Canonical Theorems for Convex Sets

János Pach, József Solymosi, 1998, Discret. Comput. Geom..

Many touchings force many crossings

János Pach, Géza Tóth, 2019, J. Comb. Theory, Ser. B.

Remarks on a Ramsey theory for trees

János Pach, Gábor Tardos, József Solymosi, 2011, Comb..

The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: Combinatorial analysis

Micha Sharir, János Pach, M. Sharir, 2011, Discret. Comput. Geom..

A computational approach to Conway's thrackle conjecture

János Pach, Radoslav Fulek, 2011, Comput. Geom..

Bounded-Degree Graphs can have Arbitrarily Large Slope Numbers

János Pach, Dömötör Pálvölgyi, 2006, Electron. J. Comb..

On disjointly representable sets

János Pach, Peter Frankl, 1984, Comb..

Crossings between curves with many tangencies in: Proc. WALCOM: Workshop on Algorithms and Computation, Lecture Notes in Computer Science 5942, Springer-Verlag, 2010, 1--8.

János Pach, Rom Pinchasi, Fabrizio Frati, 2010 .

Tilings with noncongruent triangles pdf

János Pach, Gábor Tardos, Andrey Kupavskii, 2018, Eur. J. Comb..

More Distinct Distances Under Local Conditions

János Pach, Andrew Suk, Jacob Fox, 2018, Comb..

The Union of Congruent Cubes in Three Dimensions

Micha Sharir, János Pach, Ido Safruti, 2003, Discret. Comput. Geom..

Explicit codes with low covering radius

Joel H. Spencer, János Pach, 1988, IEEE Trans. Inf. Theory.

Notes on Geometric Graph Theory

János Pach, 1990, Discrete and Computational Geometry.

Gaps in Difference Sets, and the Graph of Nearly Equal Distances

Paul Erdös, Joel H. Spencer, János Pach, 1990, Applied Geometry And Discrete Mathematics.

String graphs and incomparability graphs

János Pach, Jacob Fox, J. Pach, 2012, SoCG '12.

Erdős–Hajnal Conjecture for Graphs with Bounded VC-Dimension

János Pach, Andrew Suk, Jacob Fox, 2019, Discret. Comput. Geom..

Front Matter, Table of Contents, Preface, Conference Organization

János Pach, Lars Arge, J. Pach, 2015, International Symposium on Computational Geometry.

A Computational Approach to Conway's Thrackle Conjecture

János Pach, Radoslav Fulek, 2010, Graph Drawing.

Why Are String Graphs So Beautiful?

János Pach, 2009, Graph Drawing.

Drawing Hamiltonian Cycles with no Large Angles

János Pach, Géza Tóth, Adrian Dumitrescu, 2009, Electron. J. Comb..

Reconfigurations in Graphs and Grids

János Pach, Gruia Calinescu, Adrian Dumitrescu, 2008, SIAM J. Discret. Math..

Maximal Volume Enclosed by Plates and Proof of the Chessboard Conjecture Dedicated to Professor L. Fejes T&h on His 70th Birthday

János Pach, Károly Böröczky, Imre Bárány, 2022 .

Intersecting convex sets by rays

János Pach, Andreas Holmsen, Radoslav Fulek, 2008, SCG '08.

New Bounds on Crossing Numbers

Joel H. Spencer, János Pach, Géza Tóth, 1999, SCG '99.

Applications of a New Separator Theorem for String Graphs pdf

János Pach, Jacob Fox, J. Pach, 2013, Combinatorics, Probability and Computing.

Crossing patterns of semi-algebraic sets

Noga Alon, Micha Sharir, János Pach, 2005, J. Comb. Theory, Ser. A.

On the Upward Planarity of Mixed Plane Graphs

Csaba D. Tóth, Michael Kaufmann, David R. Wood, 2013, Graph Drawing.

Solution of Scott's problem on the number of directions determined by a point set in 3-space

Micha Sharir, János Pach, Rom Pinchasi, 2004, SCG '04.

Opaque Sets

János Pach, Adrian Dumitrescu, Minghui Jiang, 2010, Algorithmica.

Tangled Thrackles

János Pach, Géza Tóth, Rados Radoicic, 2011, EGC.

Recognizing String Graphs Is Decidable

János Pach, Géza Tóth, J. Pach, 2001, GD.

On the Richter–Thomassen Conjecture about Pairwise Intersecting Closed Curves †

János Pach, Gábor Tardos, Natan Rubin, 2016, Combinatorics, Probability and Computing.

Crossing numbers of graphs: Graph drawing and its applications

Micha Sharir, János Pach, M. Sharir, 2008 .

Beyond-Planar Graphs: Combinatorics, Models and Algorithms (Dagstuhl Seminar 19092)

Csaba D. Tóth, Michael Kaufmann, János Pach, 2019, Dagstuhl Reports.

Small (2,s)-colorable graphs without 1-obstacle representations pdf

János Pach, Deniz Sariöz, 2010, ArXiv.

Sliding Disks in the Plane

Sergey Bereg, János Pach, Adrian Dumitrescu, 2004, JCDCG.

Quasi-planar graphs have a linear number of edges

Micha Sharir, Boris Aronov, János Pach, 1995, GD.

Monotone drawings of planar graphs

János Pach, Géza Tóth, J. Pach, 2002, J. Graph Theory.

On Schur's conjecture

János Pach, Filip Moric, J. Pach, 2013, Electron. Notes Discret. Math..

On planar intersection graphs with forbidden subgraphs

Micha Sharir, János Pach, M. Sharir, 2008, J. Graph Theory.

A left-first search algorithm for planar graphs

Patrice Ossona de Mendez, János Pach, Hubert de Fraysseix, 1995, Discret. Comput. Geom..

On the diameter of separated point sets with many nearly equal distances

János Pach, Jan Vondrák, Rados Radoicic, 2006, Eur. J. Comb..

New Lower Bounds for epsilon-Nets

Nabil H. Mustafa, János Pach, Andrey Kupavskii, 2016, SoCG.

The Erdős-Hajnal conjecture for rainbow triangles

János Pach, Jacob Fox, Andrey Grinshpun, 2015, J. Comb. Theory, Ser. B.

Note on k-planar crossing numbers

Csaba D. Tóth, János Pach, Géza Tóth, 2016, Comput. Geom..

On the Queue Number of Planar Graphs

János Pach, Giuseppe Di Battista, Fabrizio Frati, 2013, SIAM J. Comput..

Cellular telephone networks and random maps in hypergraphs

János Pach, Flórián Lengyel, Ariel Halpert, 2000, Discret. Appl. Math..

Remarks on Schur's Conjecture

János Pach, Filip Moric, 2012, TJJCCGG.

The grid revisted

Zoltán Füredi, Paul Erdös, János Pach, 1993, Discret. Math..

Guest Editors' Foreword

Farhad Shahrokhi, János Pach, 2006, Algorithmica.

Almost tight bounds forɛ-Nets

János Komlós, Gerhard J. Woeginger, János Pach, 1992, Discret. Comput. Geom..

Simultaneous Approximation of Polynomials

János Pach, Andrei Kupavskii, 2015, JCDCGG.

Minimum Clique Partition in Unit Disk Graphs

János Pach, Adrian Dumitrescu, J. Pach, 2009, Graphs Comb..

Disjointness Graphs of Segments

János Pach, Gábor Tardos, Géza Tóth, 2017, SoCG.

Nearly equal distances and Szemerédi's regularity lemma

János Pach, Jan Vondrák, Rados Radoicic, 2006, Comput. Geom..

Density and regularity theorems for semi-algebraic hypergraphs

János Pach, Andrew Suk, Jacob Fox, 2015, SODA.

Common Tangents to Four Unit Balls in R3

János Pach, Thorsten Theobald, I. G. MacDonald, 2001, Discret. Comput. Geom..

Radial Points in the Plane

Micha Sharir, János Pach, 2001, Eur. J. Comb..

From Tarski's Plank Problem to Simultaneous Approximation

János Pach, Andrey B. Kupavskii, 2015, ArXiv.

On the maximal number of certain subgraphs inKr-free graphs

Miklós Simonovits, János Pach, Ervin Györi, 1991, Graphs Comb..

On the boundary complexity of the union of fat triangles

János Pach, Gábor Tardos, J. Pach, 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

Graphs drawn with few crossings per edge

János Pach, Géza Tóth, J. Pach, 1996, GD.

Decomposition of Multiple Packings with Subquadratic Union Complexity

János Pach, Bartosz Walczak, J. Pach, 2013, Combinatorics, Probability and Computing.

Cubic Graphs Have Bounded Slope Parameter

Balázs Keszegh, János Pach, Géza Tóth, 2008, Graph Drawing.

On the Queue Number of Planar Graphs

János Pach, Giuseppe Di Battista, Fabrizio Frati, 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

Decomposition of multiple coverings into many parts

János Pach, Géza Tóth, 2009, Comput. Geom..

Cutting a graph into two dissimilar halves

Paul Erdös, Joel H. Spencer, János Pach, 1988, J. Graph Theory.

Pushing squares around

János Pach, Adrian Dumitrescu, 2004, SCG '04.

Graphs whose every independent set has a common neighbour

János Pach, 1981, Discret. Math..

A bipartite analogue of Dilworth's theorem for multiple partial orders

János Pach, Jacob Fox, 2009, Eur. J. Comb..

The combinatorial complexity of hyperplane transversals

Micha Sharir, János Pach, Rephael Wenger, 1990, SCG '90.

On the Number of Balanced Lines

János Pach, Rom Pinchasi, 2001, Discret. Comput. Geom..

On the lower envelope of bivariate functions and its applications

Micha Sharir, János Pach, Herbert Edelsbrunner, 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

Ramsey-type results for semi-algebraic relations

János Pach, David Conlon, Benny Sudakov, 2013, SoCG '13.

Weaving patterns of lines and line segments in space

János Pach, Emo Welzl, Richard Pollack, 1993, Algorithmica.

How Many Potatoes Are in a Mesh? pdf

Maarten Löffler, János Pach, Marc J. van Kreveld, 2012, ISAAC.

Some geometric applications of Dilworth's theorem

János Pach, Jenö Töröcsik, J. Pach, 1993, SCG '93.

Untangling a Polygon

János Pach, Gábor Tardos, 2001, Graph Drawing.

Thrackles: An Improved Upper Bound

János Pach, Radoslav Fulek, 2017, Graph Drawing.

Radius, diameter, and minimum degree

Zsolt Tuza, Paul Erdös, János Pach, 1989, J. Comb. Theory, Ser. B.

How to make a graph bipartite

Paul Erdös, Joel H. Spencer, János Pach, 1987, J. Comb. Theory, Ser. B.

Covering the plane with convex polygons

János Pach, J. Pach, 1986, Discret. Comput. Geom..

The Range of a Random Walk on a Comb

János Pach, Gábor Tardos, J. Pach, 2013, Electron. J. Comb..

Quasi-Planar Graphs Have a Linear Number of Edges

Micha Sharir, Boris Aronov, János Pach, 1995, Graph Drawing.

Weaving Patterns of Lines and Segments in Space

János Pach, Emo Welzl, Richard Pollack, 1990, SIGAL International Symposium on Algorithms.

Solution of Scott's Problem on the Number of Directions Determined by a Point Set in 3-Space

Micha Sharir, János Pach, Rom Pinchasi, 2007, Discret. Comput. Geom..

Which Crossing Number Is It Anyway?

János Pach, Géza Tóth, J. Pach, 1998, J. Comb. Theory, Ser. B.

An upper bound on the number of planarK-sets

Endre Szemerédi, János Pach, William L. Steiger, 1992, Discret. Comput. Geom..

Planar Crossing Numbers of Graphs Embeddable in Another Surface

János Pach, Géza Tóth, Károly J. Börözky, 2006, Int. J. Found. Comput. Sci..

Unavoidable Configurations in Complete Topological Graphs

János Pach, József Solymosi, Géza Tóth, 2000, GD.

Piercing Quasi-Rectangles: On a Problem of Danzer and Rogers

János Pach, Gábor Tardos, 2011, WADS.

On Regular Vertices of the Union of Planar Convex Objects

Micha Sharir, János Pach, Esther Ezra, 2009, Discret. Comput. Geom..

Geometric graphs with no self-intersecting path of length three ∗

János Pach, Gábor Tardos, Rom Pinchasi, 2022 .

Some geometric applications of Dilworth’s theorem

János Pach, Jenö Töröcsik, J. Pach, 1994, Discret. Comput. Geom..

Research problems in discrete geometry

János Pach, Peter Braß, William O. J. Moser, 2005 .

Tight lower bounds for the size of epsilon-nets pdf

János Pach, Gábor Tardos, J. Pach, 2010, SoCG '11.

Pushing Squares Around

János Pach, Adrian Dumitrescu, 2006, Graphs Comb..

Mathematical time bomb

János Pach, 1981 .

Separating convex sets by straight lines

János Pach, Gábor Tardos, 2001, Discret. Math..

Applications of the crossing number

Farhad Shahrokhi, János Pach, Mario Szegedy, 2005, Algorithmica.

A Crossing Lemma for Multigraphs

János Pach, Géza Tóth, 2020, Discret. Comput. Geom..

Which crossing number is it, anyway? [computational geometry]

János Pach, Géza Tóth, J. Pach, 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

Topological Graphs with No Large Grids

Micha Sharir, János Pach, Rom Pinchasi, 2005, Graphs Comb..

On the Boundary Complexity of the Union of Fat Triangles

János Pach, Gábor Tardos, 2002, SIAM J. Comput..

On Conway's Thrackle Conjecture

László Lovász, János Pach, Mario Szegedy, 1995, SCG '95.

Conflict-Free Colourings of Graphs and Hypergraphs

János Pach, Gábor Tardos, J. Pach, 2009, Combinatorics, Probability and Computing.

Overlap properties of geometric expanders

János Pach, Assaf Naor, Jacob Fox, 2011, SODA '11.

Universal elements and the complexity of certain classes of infinite graphs

János Pach, Péter Komjáth, 1991, Discret. Math..

Tangencies between families of disjoint regions in the plane

János Pach, Andrew Suk, Miroslav Treml, 2010, SoCG '10.

Disjoint Edges in Topological Graphs

János Pach, Géza Tóth, J. Pach, 2003, IJCCGGT.

Distinct distances in three and higher dimensions

Micha Sharir, Boris Aronov, János Pach, 2003, STOC '03.

Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms

Leonidas J. Guibas, Micha Sharir, Raimund Seidel, 1988, ICALP.

Ramsey-Type Results for Geometric Graphs, II

János Pach, Géza Tóth, Pavel Valtr, 1998, Discret. Comput. Geom..

The Maximum Number of Times the Same Distance Can Occur among the Vertices of a Convex n-gon Is O(n log n)

János Pach, Peter Braß, 2001, J. Comb. Theory, Ser. A.

A Tverberg-type result on multicolored simplices

János Pach, 1998, Comput. Geom..

Distinct Distances Determined By Subsets of a Point Set in Space

Paul Erdös, János Pach, David Avis, 1991, Comput. Geom..

Discrete And Computational Geometry

Nancy M. Amato, Jianer Chen, János Pach, 1999, Handbook of Discrete and Combinatorial Mathematics.

A Separator Theorem for String Graphs and Its Applications

János Pach, Jacob Fox, 2009, WALCOM.

Drawing Cubic Graphs with at Most Five Slopes

Balázs Keszegh, János Pach, Géza Tóth, 2006, Graph Drawing.

Planar point sets determine many pairwise crossing segments

János Pach, Gábor Tardos, Natan Rubin, 2021 .

Disjointness graphs of segments in the space

János Pach, Gábor Tardos, Géza Tóth, 2020, Comb. Probab. Comput..

The number of crossings in multigraphs with no empty lens

Michael Kaufmann, János Pach, Géza Tóth, 2021, Journal of Graph Algorithms and Applications.

A Ramsey-type result for convex sets

János Pach, Jiří Matoušek, D. G. Larman, 1994 .

On graphs of diameter 2

János Pach, J. Pach, L. Surányi, 1981 .

Families of convex sets not representable by points

János Pach, Géza Tóth, 2008 .

A Long Noncrossing Path Among Disjoint Segments in the Plane

János Pach, Rom Pinchasi, 2007 .

New lower bounds for ε-nets

Nabil H. Mustafa, János Pach, Andrey Kupavskii, 2016 .

Tight lower bounds for the size of epsilon-nets

János Pach, Gábor Tardos, 2012 .

C O ] 3 0 A ug 2 01 7 Many Touchings Force Many Crossings

János Pach, Géza Tóth, J. Pach, .

Comment on Fox news

János Pach, Géza Tóth, J. Pach, 2006 .

On the independence number of coin graphs

János Pach, Géza Tóth, 1996 .

Erdős–Szekeres-Type Theorems for Segments and Noncrossing Convex Sets

János Pach, Géza Tóth, 2000 .

Monotone drawings of planar graphs

János Pach, Géza Tóth, 2004 .

A problem of Leo Moser about repeated distances on the sphere

Paul Erdös, János Pach, P. Erdös, 1989 .

How to build a barricade

János Pach, Peter Frankl, Vojtvech Rödl, 1984 .

Graph Distance and Euclidean Distance on the Grid

János Pach, Joel Spencer, Richard Pollack, 1990 .

Cell decomposition of polytopes by bending

János Pach, Jacob E. Goodman, 1988 .

Rich cells in an arrangement of hyperplanes

János Pach, Imre Bárány, J. Pach, 1995 .

On metric properties of countable graphs

János Pach, 1977 .

The Happy End Problem - The Beginning of combinatorial geometry

János Pach, 2002 .

Combinatorial and Computational Geometry

János Pach, Emo Welzl, Jacob E. Goodman, 2011 .

Recent Developments in Combinatorial Geometry

János Pach, J. Pach, W. Moser, 1993 .

Geometry : intuitive, discrete, and convex : a tribute to László Fejes Tóth

János Pach, Imre Bárány, Károly J. Böröczky, 2013 .

A remark on transversal numbers

János Pach, 1997 .

The maximum number of empty congruent triangles determined by a point set

János Pach, Adrian Dumitrescu, Tóth Géza, 2005 .

Midpoints of segments induced by a point set

János Pach, J. Pach, 2003 .

Graphs with no grid obstacle representation

János Pach, J. Pach, 2016 .

Turán-type results for partial orders and intersection graphs of convex sets

Csaba D. Tóth, János Pach, Jacob Fox, 2010 .

Erdős-Hajnal-type results for ordered paths

János Pach, István Tomon, 2020 .

Problems and Results on Geometric Patterns

János Pach, Peter Brass, J. Pach, 2005 .

A note on blocking visibility between points

János Pach, Géza Tóth, Adrian Dumitrescu, 2009 .

A Ramsey-type theorem for bipartite graphs

Paul Erdös, János Pach, Andras Hajnal, 2000 .

A modular version of the Erdõs-Szekeres theorem

János Pach, Géza Tóth, Gyula Károlyi, 2001 .

Halving lines and perfect cross-matchings

János Pach, József Solymosi, 1999 .

On Conway's Thrackle Conjecture

László Lovász, János Pach, Mario Szegedy, 1997 .

Forbidden paths and cycles in ordered graphs and matrices

János Pach, Gábor Tardos, J. Pach, 2006 .

Large simplices determined by finite point sets

János Pach, Filip Morić, J. Pach, 2013 .

Isomorphic subgraphs in a graph

Paul Erdös, János Pach, L. Pyber, 1988 .

Monochromatic paths in infinite coloured graphs

János Pach, Andras Hajnal, 1984 .

Universal graphs without large bipartite subgraphs

János Pach, Péter Komjáth, 1984 .

New Results on the Distribution of Distances Determined By Separated Point Sets

János Pach, Joel Spencer, Endre Makai, 2001 .

On an isoperimetric problem

János Pach, 1978 .

Remarks on stars and independent sets

Paul Erdös, János Pach, 1984 .

Controlling function classes and covering Euclidean space

János Pach, Endre Makai, 1983 .

String graphs and incomparability graphs

János Pach, Jacob Fox, J. Pach, 2012 .

Ramsey-type results for semi-algebraic relations

János Pach, David Conlon, Benny Sudakov, 2014 .

An extremal problem on K r -free graphs.

János Pach, Peter Frankl, 1988 .

Two extensions of the Erdős–Szekeres problem

János Pach, Gábor Tardos, Andreas Holmsen, 2017 .

Graphs of diameter 2 and linear programming

János Pach, L. Surányi, 1978 .

Near-Optimal Lower Bounds for Epsilon-nets for Half-spaces and Low Complexity Set Systems

Nabil H. Mustafa, János Pach, Andrey Kupavskii, 2017 .

Crossroads in flatland

János Pach, 1999 .

Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles

János Pach, Gábor Tardos, Mario Szegedy, 2009 .

Traces of finite sets: extremal problems and geometric applications

Zoltán Füredi, János Pach, J. Pach, 1994 .

Unsplittable coverings in the plane

János Pach, Dömötör Pálvölgyi, 2016 .

Touching Convex Sets in the Plane

János Pach, Meir Katchalski, 1994, Canadian Mathematical Bulletin.

Some universal graphs

János Pach, Péter Komjáth, Alan H. Mekler, 1988 .

A generalization of quasi-planarity

János Pach, Géza Tóth, Rados Radoicic, 2004 .