- Home
- Best Scientists - Mathematics
- János Pach

Discipline name
H-index
Citations
Publications
World Ranking
National Ranking

Mathematics
D-index
69
Citations
16,456
350
World Ranking
133
National Ranking
3

Engineering and Technology
D-index
65
Citations
13,345
320
World Ranking
422
National Ranking
3

2016 - Fellow of the American Mathematical Society For contributions to discrete and combinatorial geometry and to convexity and combinatorics.

2014 - Member of Academia Europaea

2011 - ACM Fellow For contributions to computational geometry.

- Combinatorics
- Geometry
- Discrete mathematics

His scientific interests lie mostly in Combinatorics, Discrete mathematics, Planar graph, Graph and Discrete geometry. His research in Combinatorics intersects with topics in Plane, Upper and lower bounds and Type. The concepts of his Planar graph study are interwoven with issues in Complement graph and Planar straight-line graph.

His Planar straight-line graph research is multidisciplinary, relying on both Linkless embedding, Embedding and Book embedding. His Graph research includes elements of Pairwise comparison and Lemma. His Discrete geometry research is multidisciplinary, incorporating perspectives in Minkowski space, Computational geometry, Series and Pure mathematics.

- Research Problems in Discrete Geometry (644 citations)
- How to draw a planar graph on a grid (618 citations)
- How to draw a planar graph on a grid (618 citations)

János Pach focuses on Combinatorics, Discrete mathematics, Plane, Graph and Conjecture. The Combinatorics study combines topics in areas such as Upper and lower bounds, Bounded function and Regular polygon. His Bounded function study combines topics in areas such as Hyperplane and Finite set.

His work in Topological graph, Complement graph, 1-planar graph, Multiple edges and Disjoint sets is related to Discrete mathematics. His Plane study deals with Point intersecting with Simple. The various areas that János Pach examines in his Planar graph study include Planar straight-line graph and Book embedding.

- Combinatorics (103.25%)
- Discrete mathematics (44.44%)
- Plane (23.93%)

- Combinatorics (103.25%)
- Conjecture (13.68%)
- Vertex (12.82%)

His primary areas of study are Combinatorics, Conjecture, Vertex, Graph and Plane. His Combinatorics research is multidisciplinary, relying on both Upper and lower bounds, Bounded function and Constant. His Conjecture study also includes fields such as

- Simple which is related to area like Arithmetic progression and Arithmetic,
- Lemma which intersects with area such as Discrete geometry.

His Vertex research is multidisciplinary, incorporating elements of Multiple edges, Multigraph and Ordered graph. He combines subjects such as Intersection, Point, Pairwise comparison and Perimeter with his study of Plane. His studies deal with areas such as Discrete mathematics, Riemann surface, Boundary, Simply connected space and Ackermann function as well as Jordan curve theorem.

- On Arrangements of Jordan Arcs With Three Intersections Per Pair (24 citations)
- On Arrangements of Jordan Arcs With Three Intersections Per Pair (24 citations)
- Note on k-planar crossing numbers (12 citations)

- Geometry
- Combinatorics
- Algebra

Combinatorics, Graph, Plane, Vertex and Bounded function are his primary areas of study. His Combinatorics study incorporates themes from Upper and lower bounds, Perimeter and Constant. Many of his research projects under Graph are closely connected to Difficult problem with Difficult problem, tying the diverse disciplines of science together.

His studies in Plane integrate themes in fields like Chromatic scale, Disjoint sets, Family of curves, Jordan curve theorem and Ackermann function. His Vertex research integrates issues from Binary logarithm, Monotone polygon and Complete bipartite graph. The study incorporates disciplines such as Discrete mathematics, Riemann surface, Boundary, Simply connected space and Function in addition to Bounded function.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Research Problems in Discrete Geometry

János Pach;Peter Brass;William Moser.

**(2005)**

1051 Citations

Combinatorial Geometry

Janos Pach;K P Agarwal.

**(1995)**

1017 Citations

How to draw a planar graph on a grid

H. De Fraysseix;J. Pach;J. Pach;R. Pollack.

Combinatorica **(1990)**

802 Citations

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

Klara Kedem;Ron Livne;János Pach;Micha Sharir.

Discrete and Computational Geometry **(1986)**

439 Citations

Graphs drawn with few crossings per edge

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

Combinatorica **(1997)**

343 Citations

The hippocampus as a cognitive graph.

Robert U. Muller;Matt Stead;Janos Pach.

The Journal of General Physiology **(1996)**

331 Citations

Combinatorial Geometry: Pach/Combinatorial

János Pach;Pankaj K. Agarwal.

**(1995)**

328 Citations

Small sets supporting fary embeddings of planar graphs

Hubert de Fraysseix;János Pach;Richard Pollack.

symposium on the theory of computing **(1988)**

256 Citations

Fat Triangles Determine Linearly Many Holes

Jiri Matousek;Janos Pach;Micha Sharir;Shmuel Sifrony.

SIAM Journal on Computing **(1994)**

180 Citations

Almost tight bounds for e-nets

János Komlós;János Pach;Gerhard Woeginger.

Discrete and Computational Geometry **(1992)**

173 Citations

Discrete and Computational Geometry

(Impact Factor: 0.639)

If you think any of the details on this page are incorrect, let us know.

Contact us

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Alfréd Rényi Institute of Mathematics

Tel Aviv University

Stanford University

New York University

Hungarian Academy of Sciences

Moscow Institute of Physics and Technology

University College London

ETH Zurich

University of the Basque Country

Rutgers, The State University of New Jersey

Something went wrong. Please try again later.