János Pach | Academic Influence

János Pach's AcademicInfluence.com Rankings

János Pach

Mathematics

#1077

World Rank

#1836

Historical Rank

Combinatorics

#27

World Rank

#31

Historical Rank

Measure Theory

#1029

World Rank

#1326

Historical Rank

mathematics Degrees

Download Badge

Mathematics

János Pach's Degrees

PhD Mathematics Eötvös Loránd University

Why Is János Pach Influential?

(Suggest an Edit or Addition)

According to Wikipedia, János Pach is a mathematician and computer scientist working in the fields of combinatorics and discrete and computational geometry. Biography Pach was born and grew up in Hungary. He comes from a noted academic family: his father, was a well-known historian, and his mother Klára was a university mathematics teacher; his maternal aunt Vera T. Sós and her husband Pál Turán are two of the best-known Hungarian mathematicians.

(See a Problem?)

János Pach's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Research problems in discrete geometry (2005) (854)
How to draw a planar graph on a grid (1990) (647)
Combinatorial geometry (1995) (407)
On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles (1986) (379)
Graphs drawn with few crossings per edge (1996) (319)
Towards a Theory of Geometric Graphs (2004) (243)
Wiley‐Interscience Series in Discrete Mathematics and Optimization (2011) (206)
Combinatorial Geometry: Pach/Combinatorial (1995) (205)
Small sets supporting fary embeddings of planar graphs (1988) (195)
Embedding Planar Graphs at Fixed Vertex Locations (1998) (170)
On the Number of Incidences Between Points and Curves (1998) (165)
Fat Triangles Determine Linearly Many Holes (1994) (149)
Embedding a planar triangulation with vertices at specified points (1991) (139)
Quasi-planar graphs have a linear number of edges (1995) (137)
Improving the Crossing Lemma by Finding More Crossings in Sparse Graphs (2006) (128)
Almost tight bounds forɛ-Nets (1992) (126)
Overlap properties of geometric expanders (2010) (118)
Applications of the crossing number (1994) (118)
Repeated Angles in the Plane and Related Problems (1992) (115)
Ramsey-type Theorems with Forbidden Subgraphs (2001) (114)
Arrangements of Curves in the Plane - Topology, Combinatorics and Algorithms (2018) (111)
Radius, diameter, and minimum degree (1989) (109)
Crossing patterns of semi-algebraic sets (2005) (102)
A semi-algebraic version of Zarankiewicz's problem (2014) (101)
A turán-type theorem on chords of a convex polygon (1992) (99)
Conflict-Free Colourings of Graphs and Hypergraphs (2009) (97)
On Conway's Thrackle Conjecture (1995) (92)
Online conflict-free coloring for intervals (2005) (88)
Tight lower bounds for the size of epsilon-nets (2010) (87)
Almost tight bounds for $\epsilon$-nets (1992) (80)
Representation of planar graphs by segments (1994) (78)
How to make a graph bipartite (1987) (78)
Forbidden paths and cycles in ordered graphs and matrices (2006) (74)
Thirteen problems on crossing numbers (2000) (74)
A Separator Theorem for String Graphs and its Applications (2009) (73)
An upper bound on the number of planar k-sets (1989) (72)
Geometric Graph Theory (2004) (69)
Lenses in arrangements of pseudo-circles and their applications (2004) (67)
The Number of Edges in k-Quasi-planar Graphs (2011) (66)
Thirty essays on geometric graph theory (2013) (66)
Conflict-free colorings (2003) (65)
Surveys on discrete and computational geometry : twenty years later : AMS-IMS-SIAM Joint Summer Research Conference, June 18-22, 2006, Snowbird, Utah (2008) (64)
Applications of a New Separator Theorem for String Graphs (2013) (64)
Erdős–Szekeres‐type theorems for monotone paths and convex bodies (2011) (63)
Common Tangents to Four Unit Balls in R3 (2001) (63)
Three-dimensional Grid Drawings of Graphs (1997) (63)
The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: Combinatorial analysis (2011) (63)
Combinatorial and Computational Geometry (2011) (62)
A Ramsey-type result for convex sets (1994) (61)
Crossing families (1991) (61)
Covering the plane with convex polygons (1986) (60)
Decomposition of multiple packing and covering (1980) (60)
Combinatorial Geometry and Its Algorithmic Applications (2008) (60)
Extremal Problems for Geometric Hypergraphs (1996) (59)
Ramsey-Type Results for Geometric Graphs, I (1997) (58)
Indecomposable Coverings (2005) (57)
Pushing Squares Around (2004) (57)
Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles (2008) (56)
Quantitative Helly-type theorems (1982) (56)
Ramsey-type results for geometric graphs (1996) (55)
Reconfigurations in Graphs and Grids (2006) (55)
Monotone drawings of planar graphs (2002) (54)
Bounded-Degree Graphs can have Arbitrarily Large Slope Numbers (2006) (54)
Coloring kk-free intersection graphs of geometric objects in the plane (2008) (54)
Drawing Planar Graphs of Bounded Degree with Few Slopes (2010) (54)
A left-first search algorithm for planar graphs (1995) (54)
Relaxing Planarity for Topological Graphs (2002) (53)
Separator theorems and Turán-type results for planar intersection graphs (2008) (52)
Recognizing String Graphs Is Decidable (2001) (50)
On the maximal number of certain subgraphs inKr-free graphs (1991) (50)
Unavoidable Configurations in Complete Topological Graphs (2000) (50)
A Ramsey-type theorem for bipartite graphs (2000) (50)
Decomposition of multiple coverings into many parts (2007) (49)
A Tverberg-type result on multicolored simplices (1996) (49)
New Trends in Discrete and Computational Geometry (2013) (49)
Erdős-Hajnal-type Results on Intersection Patterns of Geometric Objects (2008) (49)
Computing the independence number of intersection graphs (2011) (48)
A problem of Leo Moser about repeated distances on the sphere (1989) (48)
The Erdős-Hajnal conjecture for rainbow triangles (2015) (47)
State of the Union (of geometric objects) (2008) (47)
On the Queue Number of Planar Graphs (2010) (46)
State of the Union ( of Geometric Objects ) : A Review ∗ (2007) (46)
Some new bounds for Epsilon-nets (1990) (45)
On the Number of Sets in a Null t-Design (1983) (45)
Some geometric applications of Dilworth’s theorem (1994) (44)
Distinct distances on algebraic curves in the plane (2013) (43)
Points surrounding the origin (2008) (42)
On the Number of Convex Lattice Polygons (1992) (41)
Some geometric applications of Dilworth's theorem (1993) (41)
New Bounds on Crossing Numbers (1999) (40)
Some universal graphs (1988) (40)
Traces of finite sets: extremal problems and geometric applications (1994) (39)
On the mean distance between points of a graph (1988) (38)
How Many Ways Can One Draw A Graph? (2003) (37)
On disjointly representable sets (1984) (37)
Cutting a graph into two dissimilar halves (1988) (36)
A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing (2015) (36)
On Vertical Visibility in Arrangements of Segments and the Queue Size in the Bentley-Ottmann Line Sweeping Algorithm (1991) (35)
Ramsey-type results for semi-algebraic relations (2013) (35)
Which Crossing Number Is It Anyway? (1998) (35)
On the boundary complexity of the union of fat triangles (2000) (34)
Decomposition problems for multiple coverings with unit balls, manuscript. (1988) (33)
String graphs and incomparability graphs (2012) (33)
Coloring axis-parallel rectangles (2007) (33)
Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms (1988) (33)
Survey on Decomposition of Multiple Coverings (2013) (33)
On Schur's conjecture (2013) (33)
How hard is half-space range searching? (1993) (32)
An upper bound on the number of planarK-sets (1992) (32)
Long alternating paths in bicolored point sets (2004) (32)
A computational approach to Conway's thrackle conjecture (2010) (32)
Ramsey-Type Results for Geometric Graphs, II (1997) (31)
Helly"s theorem with volumes (1984) (31)
Disjoint Edges in Topological Graphs (2003) (30)
Crossing Patterns of Segments (2001) (30)
Universal graphs without large bipartite subgraphs (1984) (30)
On the Boundary of the Union of Planar Convex Sets (1999) (30)
Topological Graphs with No Large Grids (2005) (30)
Universal elements and the complexity of certain classes of infinite graphs (1991) (29)
Intersection patterns of curves (2011) (29)
Untangling a Polygon (2001) (29)
Notes on Geometric Graph Theory (1990) (29)
Isosceles Triangles Determined by a Planar Point Set (2002) (29)
A Generalization of the Erdos - Szekeres Theorem to Disjoint Convex Sets (1997) (29)
A modular version of the Erdõs-Szekeres theorem (2001) (28)
Recent Developments in Combinatorial Geometry (1993) (28)
Drawing cubic graphs with at most five slopes (2006) (27)
The union of congruent cubes in three dimensions (2001) (27)
On the Perimeter of a Point Set in the Plane (1990) (27)
On arrangements of Jordan arcs with three intersections per pair (2018) (27)
On grids in topological graphs (2009) (27)
Graphs whose every independent set has a common neighbour (1981) (27)
Layout of Rooted Trees (1991) (26)
Partitioning Colored Point Sets into Monochromatic Parts (2001) (25)
Cell decomposition of polytopes by bending (2017) (25)
Variations on the theme of repeated distances (1990) (25)
Distinct distances in three and higher dimensions (2003) (24)
Unsplittable Coverings in the Plane (2013) (24)
Discrete Convex Functions and Proof of the Six Circle Conjecture of Fejes Tóth (1984) (24)
Solution of Scott's Problem on the Number of Directions Determined by a Point Set in 3-Space (2004) (23)
New Bounds on Crossing Numbers (2000) (23)
Minimum Clique Partition in Unit Disk Graphs (2009) (23)
Planar Crossing Numbers of Graphs Embeddable in Another Surface (2006) (22)
Erdős–Hajnal Conjecture for Graphs with Bounded VC-Dimension (2017) (22)
The Maximum Number of Times the Same Distance Can Occur among the Vertices of a Convex n-gon Is O(n log n) (2001) (22)
Geometric graphs with no self-intersecting path of length three (2002) (22)
Cutting Glass (2000) (21)
Erdős–Szekeres-Type Theorems for Segments and Noncrossing Convex Sets (2000) (21)
Conway's Conjecture for Monotone Thrackles (2011) (21)
Weaving patterns of lines and line segments in space (1993) (20)
Turán-type results for partial orders and intersection graphs of convex sets (2010) (20)
Sliding Disks in the Plane (2004) (20)
Halving lines and perfect cross-matchings (1999) (20)
Maximal volume enclosed by plates and proof of the chessboard conjecture (1986) (19)
Canonical Theorems for Convex Sets (1998) (19)
On circumscribing polygons for line segments (1998) (19)
Convexly Independent Subsets of the Minkowski Sum of Planar Point Sets (2008) (19)
On the number of directions determined by a three-dimensional points set (2004) (18)
On the Structure of Graphs with Low Obstacle Number (2011) (18)
Sphere-of-influence graphs in higher dimensions (1994) (18)
Crossing Number of Toroidal Graphs (2005) (18)
Bounding one-way differences (1987) (18)
Monochromatic empty triangles in two-colored point sets (2013) (18)
Lower Bounds on the Obstacle Number of Graphs (2011) (17)
How Many Unit Equilateral Triangles Can Be Generated by N Points in Convex Position? (2003) (17)
Repeated distances in space (1988) (17)
A Problem of Ulam on Planar Graphs (1981) (17)
Drawing Hamiltonian Cycles with no Large Angles (2009) (17)
A bipartite analogue of Dilworth's theorem for multiple partial orders (2009) (17)
Bichromatic Lines with Few Points (2000) (17)
Two extensions of the Erdős–Szekeres problem (2017) (16)
Intersecting Convex Sets by Rays (2008) (16)
Monotone Crossing Number (2011) (16)
On the Number of Balanced Lines (2001) (16)
A bipartite strengthening of the Crossing Lemma (2007) (16)
On the Chromatic Number of Disjointness Graphs of Curves (2018) (16)
New Lower Bounds for epsilon-Nets (2016) (16)
Lenses in arrangements of pseudo-circles and their applications (2002) (16)
Remarks on Schur's conjecture (2012) (16)
Graphs with Large Obstacle Numbers (2010) (15)
Midpoints of segments induced by a point set (2003) (15)
Crossing Numbers (1998) (15)
Mountain Climbing, Ladder Moving, and the Ring-width of a Polygon (2015) (15)
Disjoint homometric sets in graphs (2010) (15)
A note on blocking visibility between points (2009) (14)
Comment on Fox news (2006) (14)
Note on k-planar crossing numbers (2016) (14)
On the independence number of coin graphs (1996) (14)
Distinct Distances Determined By Subsets of a Point Set in Space (1991) (14)
Beyond-Planar Graphs: Algorithmics and Combinatorics (Dagstuhl Seminar 16452) (2016) (14)
Covering lattice points by subspaces (2001) (14)
Fat triangles determine linearly many holes (computational geometry) (1991) (14)
Isomorphic subgraphs in a graph (1988) (14)
Piercing quasi-rectangles - On a problem of Danzer and Rogers (2012) (13)
Explicit codes with low covering radius (1988) (13)
Degenerate Crossing Numbers (2006) (13)
More Distinct Distances Under Local Conditions (2018) (13)
Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles (2009) (13)
Gaps in Difference Sets, and the Graph of Nearly Equal Distances (1990) (13)
Approximating the Rectilinear Crossing Number (2016) (12)
On a Quasi-Ramsey problem (1983) (12)
Disjointness Graphs of Segments (2017) (12)
Homogeneous selections from hyperplanes (2014) (12)
Graphs of diameter 2 and linear programming (1978) (12)
Forbidden patterns and unit distances (2005) (12)
Density and regularity theorems for semi-algebraic hypergraphs (2015) (12)
On a metric generalization of ramsey’s theorem (1995) (12)
Arrangements of homothets of a convex body (2016) (12)
Controlling function classes and covering Euclidean space (1983) (12)
Geometry : intuitive, discrete, and convex : a tribute to László Fejes Tóth (2013) (11)
Finite Point Configurations (2004) (11)
Tangencies between families of disjoint regions in the plane (2010) (11)
On the Zarankiewicz problem for intersection hypergraphs (2015) (11)
On the lower envelope of bivariate functions and its applications (1987) (11)
Planar point sets determine many pairwise crossing segments (2019) (11)
Beyond the Richter-Thomassen Conjecture (2015) (10)
Saturated simple and k-simple topological graphs (2013) (10)
Nearly Equal Distances in the Plane (1993) (10)
Remarks on a Ramsey theory for trees (2011) (10)
Surveys in Combinatorics, 1999: Geometric Graph Theory (1999) (10)
Problems and Results on Geometric Patterns (2005) (10)
Double-Normal Pairs In Space (2014) (9)
Graph Drawing, 12th International Symposium, GD 2004, New York, NY, USA, September 29 - October 2, 2004, Revised Selected Papers (2004) (9)
Geometry — Intuitive, Discrete, and Convex (2013) (9)
Tilings with noncongruent triangles (2017) (9)
Weaving Patterns of Lines and Segments in Space (1990) (9)
The Beginnings of Geometric Graph Theory (2013) (9)
On planar intersection graphs with forbidden subgraphs (2008) (9)
Crossings between Curves with Many Tangencies (2010) (9)
On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves (2014) (9)
A Crossing Lemma for Multigraphs (2018) (8)
Improving the crossing lemma by finding more crossings in sparse graphs: [extended abstract] (2004) (8)
The grid revisted (1993) (8)
On the Upward Planarity of Mixed Plane Graphs (2013) (8)
Monochromatic paths in infinite coloured graphs (1984) (8)
A point set everywhere dense in the plane (1985) (8)
Weight Balancing on Boundaries and Skeletons (2014) (8)
Large simplices determined by finite point sets (2013) (8)
On the Complexity of the Union of Geometric Objects (2000) (8)
Tilings of the plane with unit area triangles of bounded diameter (2017) (8)
Erdős–Hajnal Conjecture for Graphs with Bounded VC-Dimension (2018) (8)
Cross-Intersecting Families of Vectors (2013) (8)
The Union of Congruent Cubes in Three Dimensions (2003) (8)
Ordered graphs and large bi-cliques in intersection graphs of curves (2019) (7)
A Precise Threshold for Quasi-Ramsey Numbers (2014) (7)
Remarks on stars and independent sets (1984) (7)
Large Homogeneous Submatrices (2019) (7)
Cubic graphs have bounded slope parameter (2009) (7)
A tight bound for the number of different directions in three dimensions (2003) (7)
The number of crossings in multigraphs with no empty lens (2018) (7)
A Remark on Transversal Numbers (2013) (7)
A Note on Coloring Line Arrangements (2012) (7)
On a problem of L. Fejes Tóth (1980) (6)
How Many Potatoes Are in a Mesh? (2012) (6)
Families of convex sets not representable by points (2008) (6)
Double-normal pairs in the plane and on the sphere (2014) (6)
Opposite-Quadrant Depth in the Plane (2007) (6)
The number of distinct distances from a vertex of a convex polygon (2012) (6)
Graph Distance and Euclidean Distance on the Grid (1990) (6)
New Results on the Distribution of Distances Determined By Separated Point Sets (2001) (6)
The number of simplices embracing the origin (2003) (6)
A lower bound on opaque sets (2014) (6)
Common Tangents and Common Transversals (2018) (6)
On metric properties of countable graphs (1977) (6)
Directions in combinatorial geometry (2005) (6)
Nearly equal distances and Szemerédi's regularity lemma (2006) (6)
Thrackles: An Improved Upper Bound (2017) (5)
Every graph admits an unambiguous bold drawing (2011) (5)
Partly Convex Peano Curves (1983) (5)
An algorithm for finding many disjoint monochromatic edges in a complete 2-colored geometric graph (1996) (5)
Structure Theorems for Systems of Segments (2000) (5)
On an isoperimetric problem (1978) (5)
An extremal problem on Kr-free graphs (1988) (5)
The combinatorial complexity of hyperplane transversals (1990) (5)
Tangled Thrackles (2011) (5)
Separating convex sets by straight lines (2001) (5)
Near-Optimal Lower Bounds for -nets for Half-spaces and Low Complexity Set Systems (2017) (5)
Folding and turning along geodesics in a convex surface (1997) (4)
On the diameter of separated point sets with many nearly equal distances (2006) (4)
Erdős-Hajnal-type results for ordered paths (2020) (4)
The complexity of a class of infinite graphs (1994) (4)
Combinatorial and computational problems about points in the plane (2009) (4)
Tiling the plane with equilateral triangles (2018) (4)
Almost All String Graphs are Intersection Graphs of Plane Convex Sets (2018) (4)
Graphs with no grid obstacle representation (2016) (4)
Rich cells in an arrangement of hyperplanes (1995) (4)
Bounded VC-Dimension Implies the Schur-Erdős Conjecture (2019) (4)
Small (2,s)-colorable graphs without 1-obstacle representations (2010) (4)
On Simplices Embracing a Point (2008) (4)
On Regular Vertices of the Union of Planar Convex Objects (2009) (4)
A generalization of quasi-planarity (2004) (4)
On regular vertices on the union of planar objects (2007) (4)
Separating bi-chromatic points by parallel lines (1990) (4)
Touching Convex Sets in the Plane (1994) (4)
Simultaneous Approximation of Polynomials (2015) (3)
Near-Optimal Lower Bounds for Epsilon-nets for Half-spaces and Low Complexity Set Systems (2017) (3)
The Schur-Erdős problem for semi-algebraic colorings (2020) (3)
On the permeability problem (1977) (3)
A Crossing Lemma for Jordan Curves (2017) (3)
On graphs of diameter 2 (1981) (3)
Borsuk and Ramsey type questions in Euclidean space (2017) (3)
Disjointness graphs of segments in the space (2020) (3)
From Tarski's Plank Problem to Simultaneous Approximation (2015) (3)
Geometric Intersection Patterns and the Theory of Topological Graphs 3 Using similar ideas (2014) (3)
Crossings Between Non-homotopic Edges (2020) (3)
Topological graph theory and crossing numbers (2006) (3)
New lower bounds for ε-nets (2016) (2)
On the Game of Misery (1992) (2)
An upper bound for families of linearly related plane convex sets (1988) (2)
Two nearly equal distances in $R^d$. (2019) (2)
A Long Noncrossing Path Among Disjoint Segments in the Plane (2007) (2)
Crossing numbers of imbalanced graphs (2010) (2)
On the Richter–Thomassen Conjecture about Pairwise Intersecting Closed Curves † (2016) (2)
Erdős-Hajnal-type results for monotone paths (2021) (2)
The visible perimeter of an arrangement of disks (2012) (2)
How to build a barricade (1984) (2)
Decomposition of a Cube into Nearly Equal Smaller Cubes (2015) (2)
Radial Points in the Plane (2001) (2)
Semi-algebraic colorings of complete graphs (2015) (2)
Decomposition of Multiple Packings with Subquadratic Union Complexity (2013) (2)
On the Size of K-Cross-Free Families (2017) (2)
Exchange Properties of Finite Set-Systems (2021) (2)
Random necklaces require fewer cuts (2021) (2)
Overlap properties of geometric expanders: extended abstract (2011) (1)
Minimum Area Isosceles Containers (2020) (1)
Cellular telephone networks and random maps in hypergraphs (2000) (1)
On super-universal graphs (1977) (1)
Ramsey-Turán Numbers for Semi-Algebraic Graphs (2018) (1)
Why Are String Graphs So Beautiful? (2009) (1)
An invariant property of balls in arrangements of hyperplanes (1993) (1)
The maximum number of empty congruent triangles determined by a point set (2005) (1)
Beyond-Planar Graphs: Combinatorics, Models and Algorithms (Dagstuhl Seminar 19092) (2019) (1)
Large discs in convex unions (1988) (1)
Sunflowers in Set Systems of Bounded Dimension (2021) (1)
Crossroads in flatland (1999) (1)
The Range of a Random Walk on a Comb (2013) (1)
On Well-Connected Sets of Strings (2021) (1)
On the Average Volume of Subsets in Euclidean d-Space (1991) (1)
A Crossing Lemma for Multigraphs (2018) (1)
2-super-universal graphs (1985) (1)
Almost All String Graphs are Intersection Graphs of Plane Convex Sets (2020) (1)
Erd\H{o}s-Hajnal-type results for ordered paths (2020) (1)
On Arrangement of Jordan Arcs with Three Intersection per Pair (1989) (1)
Contemporary Mathematics State of the Union ( of Geometric Objects ) (2007) (1)
Mixed volume and the van der Waerden conjecture (1981) (1)
Separation with restricted families of sets (2015) (1)
Chapter 2 PROBLEMS AND RESULTS ON GEOMETRIC PATTERNS (2005) (1)
Coloring Hasse Diagrams and Disjointness Graphs of Curves (2019) (1)
Ramsey-type results for semi-algebraic relations Citation (2013) (1)
Sphere-of-influence graphs in normed spaces (2015) (1)
Uniformly Distributed Distances – a Geometric Application of Janson's Inequality (1996) (1)
Two places at once: A remembrance of Paul Erdös (1997) (1)
Popular distances in 3-space (1999) (1)
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. (2010) (1)
Discrete and Computational Geometry (Mathematical Sciences Research Institute Publications) (2005) (1)
Nearly equal distances in the plane, II (2021) (1)
A note on distinct distances (2016) (1)
Elementary Problems: E3337-E3342 (1989) (1)
The Happy End Problem - The Beginning of combinatorial geometry (2002) (1)
Sylvester-Gallai problem: The beginnings of combinatorial geometry (2008) (1)
Correction to: New Trends in Intuitive Geometry (2018) (1)
A stability theorem on cube tessellations (2018) (0)
Geometry of Numbers (2011) (0)
HABILITATION THESIS Topological drawings of graphs (2021) (0)
Davenport-Schinzel sequences: The inverse Ackermann function in geometry (2008) (0)
Guest editors' foreword (1995) (0)
Efficient Random Arrangements (2011) (0)
On the Zarankiewicz Problem for Intersection (2015) (0)
Problem on convex polygons (1988) (0)
On the number of edges of separated multigraphs (2021) (0)
New results on the distribution of distances determined by a point set (2002) (0)
1 FINITE POINT CONFIGURATIONS (2017) (0)
On the Size of K-Cross-Free Families (2018) (0)
Every graph admits an unambiguous bold drawing 1 (2015) (0)
Diszkrét geometria = Discrete Geometry (2007) (0)
Thirtieth Anniversary Note from the Editors in Chief (2016) (0)
The Erd\H{o}s-Hajnal conjecture for rainbow triangles (2013) (0)
Circle Packings and Planar Graphs (2011) (0)
Applications of the Bounds on Incidences (2011) (0)
Guest Editors’ Foreword (2008) (0)
Workshop: Discrete Geometry Table of Contents (2006) (0)
C O ] 5 D ec 2 01 8 Semi-algebraic colorings of complete graphs (2018) (0)
Crossing numbers of graphs: Graph drawing and its applications (2008) (0)
Graph Drawing (1996) (0)
C O ] 3 0 A ug 2 01 7 Many Touchings Force Many Crossings (0)
More on Repeated Distances (2011) (0)
Extremal Problems in Combinatorial Geometry ( 18 w 5058 ) (2018) (0)
The Method of Cell Decomposition (2011) (0)
Epsilon Nets and Transversals of Hypergraphs (2011) (0)
Are there many distances that occur few times (1997) (0)
Note on vertex-partitions of infinite graphs (1990) (0)
Lattice Packing and Lattice Covering (2011) (0)
Linear orderings of the edges of a graph (2022) (0)
On the number of crossings between curves (2015) (0)
Extremal problems in graph drawings (abstract) (1993) (0)
Methods of Blichfeldt and Rogers (2011) (0)
"square Trisection". Dissection of a Square in Three Congruent Partitions (2010) (0)
Guest Editors' Foreword (2006) (0)
The discrete charm of geometry - In Memoriam László Fejes Tóth (2005) (0)
Packing and Covering with Congruent Convex Discs (2011) (0)
Chapter XI. Recent Developments in Combinatorial Geometry (1993) (0)
Green-Wins Solitaire Revisited — Simultaneous Flips that Affect Many Edges∗ (2019) (0)
Lecture Notes Geometric Graph Theory (2015) (0)
Arrangement of Lines (2011) (0)
Review of "L. Lovász: Combinatorial Problems and Exercises" (1980) (0)
Foreword (2008) (0)
The Mathematician of the Enlightenment (1984) (0)
Disjointness Graphs of Short Polygonal Chains (2021) (0)
The Analysis Incarnate - Leonhard Euler (1984) (0)
Remarks on a Ramsey theory for trees (2012) (0)
Saturated simple topological graphs (2013) (0)
Controlling Lipschitz functions (2017) (0)
New Lower Bounds for (cid:15) -nets (2015) (0)
Extremal Graph Theory (2011) (0)
Weight balancing on boundaries (2015) (0)
C O ] 1 4 Ju l 2 01 5 A precise threshold for quasi-Ramsey numbers (2015) (0)
Piercing Quasi-Rectangles: On a Problem of Danzer and Rogers (2011) (0)
Incidence results on the plane and distinct distances (2013) (0)
Proceedings of the 12th international conference on Graph Drawing (2004) (0)
Letter from the New Editors-in-Chief (2011) (0)
Extremal combinatorics: Repeated patterns and pattern recognition (2008) (0)
Shattered matchings in intersecting hypergraphs (2020) (0)
Front Matter, Table of Contents, Preface, Conference Organization (2015) (0)
On the big unsolved problems in elementary geometry (1986) (0)
Guest Editors’ Foreword (2016) (0)
A Farewell to Ricky Pollack (2020) (0)
C O ] 2 2 A ug 2 01 5 SEPARATION WITH RESTRICTED FAMILIES OF SETS (2015) (0)
Diszkrét és konvex geometria = Discrete and convex geometry (2008) (0)
Beyond-Planar Graphs : Combinatorics , Models and Algorithms (2019) (0)
Cross-Intersecting Families of Vectors (2015) (0)
Incidences and their relatives: From Szemerédi and Trotter to cutting lenses (2008) (0)
Translative covering of space with slabs (2015) (0)
Double-normal pairs in the plane and on the sphere (2014) (0)
Mathematical time bomb (1981) (0)
Large simplices determined by finite point sets (2012) (0)
Note on a problem of Erdõs and Katona (1980) (0)
Discrete And Computational Geometry (1999) (0)
Approximation of a Convex Set by Polygons (2011) (0)
Successive vertex orderings of fully regular graphs (2022) (0)
Special issue dedicated to discrete and computational geometry (1990) (0)
Special Issue: 31st Annual Symposium on Computational Geometry Foreword (2016) (0)
Geometric Graphs and geometric hypergraphs (1996) (0)
Arrangements of surfaces: Evolution of the basic theory (2008) (0)
Towards a new geometry (1980) (0)
Many Touchings Force Many Crossings (2017) (0)
UvA-DARE (Digital Academic Repository) A Precise Threshold for Quasi-Ramsey Numbers A PRECISE THRESHOLD FOR QUASI-RAMSEY NUMBERS (2015) (0)
Two Dissimilar Halves Paul Erdós (1988) (0)
On the combinatorial complexity of the space of hyperplane transversals (1990) (0)
Guest Editor's Forword. (1995) (0)
Geometric coloring problems: Sphere packings and frequency allocation (2008) (0)
Tilings of the plane with unit area triangles of bounded diameter (2018) (0)
Quasiplanar graphs, string graphs, and the Erdős-Gallai problem (2021) (0)
Two and a half billion years of distance research (2013) (0)
From Sam Loyd and László Fejes Tóth: The 15 puzzle and motion planning (2008) (0)
Thirtieth Anniversary Note from the Editors in Chief (2016) (0)
Hints for the exercises (2011) (0)
Lines in space: From ray shooting to geometric transversals (2008) (0)
Advanced Problem No. 6421 (1983) (0)
Eindrapport pilot: evenwicht in West (2008) (0)
On the structure of a system of stars in graphs (1988) (0)
Index of Symbols (2011) (0)
C O ] 3 0 M ay 2 01 4 Saturated simple and k-simple topological graphs (2014) (0)
Which crossing number is it, anyway? [computational geometry] (1998) (0)
Two extensions of the Erd\H{o}s-Szekeres problem (2017) (0)
C O ] 1 3 Ju l 2 01 8 A stability theorem on cube tessellations (2018) (0)
Where have all the grasshoppers gone? (2022) (0)
Combinatorics, Geometry and Probability: Nearly Equal Distances in the Plane (1997) (0)
Foreword (2007) (0)
10 GEOMETRIC GRAPH THEORY (2017) (0)
Special issue dedicated to the memory of Laszlo Fejes Toth - Foreword (2007) (0)
Optimal embedded and enclosing isosceles triangles (2022) (0)

This paper list is powered by the following services:

Other Resources About János Pach

en.wikipedia.org

What Schools Are Affiliated With János Pach?

János Pach is affiliated with the following schools:

Image Attributions

Image Source for János Pach