János Pach
- Computer Graphics and Computer-Aided Design top 1%
- Computational Theory and Mathematics top 5%
- Computer Vision and Pattern Recognition top 10%
- Discrete Mathematics and Combinatorics top 10%
- Geometry and Topology top 10%
- Co-authors
- Micha SharirGerhard J. WoegingerJános KomlósJacob E. GoodmanLeonidas GuibasMichael KaufmannSeok-Hee HongPéter Frankl
- Topics
- Computational Geometry and Mesh Generation (8 papers)Advanced Graph Theory Research (6 papers)Graph Labeling and Dimension Problems (3 papers)
- Cited by
- Computer Graphics and Computer-Aided DesignDiscrete Mathematics and CombinatoricsComputational Theory and Mathematics
- Journals
- Discrete & Computational GeometryThe Electronic Journal of CombinatoricsMathematical surveys and monographs
- Partner nations
- HungaryUnited StatesSwitzerland
In The Last Decade
János Pach
14 papers receiving 351 citations
Peers
Comparison fields: 5 of 57
- Computer Graphics and Computer-Aided Design 197
- Computational Theory and Mathematics 180
- Computer Vision and Pattern Recognition 91
- Discrete Mathematics and Combinatorics 54
- Geometry and Topology 49
Countries citing papers authored by János Pach
This map shows the geographic impact of János Pach's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by János Pach with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites János Pach more than expected).
Fields of papers citing papers by János Pach
This network shows the impact of papers produced by János Pach. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by János Pach. The network helps show where János Pach may publish in the future.
Co-authorship network of co-authors of János Pach
This figure shows the co-authorship network connecting the top 25 collaborators of János Pach. A scholar is included among the top collaborators of János Pach based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with János Pach. János Pach is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 2 | |
| 2 | 1 | |
| 3 | 1 | |
| 4 | 4 | |
| 5 | 66 | |
| 6 | 18 | |
| 7 | 2 | |
| 8 | 152 | |
| 9 | 74 | |
| 10 | 4 | |
| 11 | 7 | |
| 12 | Almost tight bounds for $\epsilon$-nets | 30 |
| 13 | Separating bi-chromatic points by parallel lines | 2 |
| 14 | 2-super-universal graphs | 0 |
| 15 | On metric properties of countable graphs | 2 |
About János Pach
János Pach is a scholar working on Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics and Geometry and Topology, having authored 15 papers that have together received 365 indexed citations. Recurring topics across this work include Computational Geometry and Mesh Generation (8 papers), Advanced Graph Theory Research (6 papers) and Graph Labeling and Dimension Problems (3 papers). The work is most often cited by research in Computer Graphics and Computer-Aided Design (197 citations), Discrete Mathematics and Combinatorics (54 citations) and Computational Theory and Mathematics (180 citations). János Pach has collaborated with scholars based in Hungary, United States and Switzerland. Frequent co-authors include Micha Sharir, Gerhard J. Woeginger, János Komlós, Jacob E. Goodman, Leonidas Guibas, Michael Kaufmann, Seok-Hee Hong, Péter Frankl, Stephen Kobourov and Richard Pollack. Their work appears in journals such as Discrete & Computational Geometry, The Electronic Journal of Combinatorics and Mathematical surveys and monographs.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.