János Pach (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "János Pach" in English language version.

refsWebsite

Global rank English rank

9doi.org

2^nd place

3semanticscholar.org

11^th place

8^th place

2math-inst.hu

low place

2web.archive.org

1^st place

2epfl.ch

4,521^st place

4,877^th place

1nyu.edu

1,174^th place

773^rd place

1ematlap.hu

low place

1blog.hu

4,962^nd place

low place

1mathgenealogy.org

4,501^st place

3,002^nd place

1mathunion.org

9,965^th place

7,919^th place

18ecm.si

low place

1oakland.edu

low place

1jointmathematicsmeetings.org

low place

1scholar.google.com

1,697^th place

1,040^th place

1umn.edu

1,266^th place

860^th place

1arxiv.org

69^th place

59^th place

1archive.today

14^th place

1sfu.ca

3,413^th place

2,445^th place

1ae-info.org

low place

1acm.org

1,185^th place

840^th place

1ams.org

451^st place

277^th place

1mta.hu

low place

8ecm.si

List of Plenary Speakers at ECM.

acm.org

ACM Names Fellows for Computing Advances that Are Driving Innovation Archived 2011-12-09 at the Wayback Machine, Association for Computing Machinery, December 8, 2011.

ae-info.org

Hasani, Ilire; Hoffmann, Robert. "Academy of Europe: Pach János". Academy of Europe. Retrieved 2022-12-19.

ams.org

2016 Class of the Fellows of the AMS, American Mathematical Society, retrieved 2015-11-16.

archive.today

Rényi-díj, Alfred Rényi Institute of Mathematics, archived from the original on 4 September 2012, retrieved 8 March 2010

arxiv.org

Pach, János; Tardos, Gábor (2013), "Tight lower bounds for the size of epsilon-nets", Journal of the American Mathematical Society, 26 (3): 645–658, arXiv:1012.1240, doi:10.1090/s0894-0347-2012-00759-0.

blog.hu

csanna.blog.hu

Interview with János Pach (2013), in Hungarian

doi.org

Pach, János (1981), "A problem of Ulam on planar graphs", European Journal of Combinatorics, 2 (4): 357–361, doi:10.1016/s0195-6698(81)80043-1
Kedem, Klara; Livne, Ron; Pach, János; Sharir, Micha (1986), "On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles", Discrete & Computational Geometry, 1 (1): 59–71, doi:10.1007/BF02187683.
Pach, János; Steiger, William; Szemerédi, Endre (1992), "An upper bound on the number of planar K-sets", Discrete & Computational Geometry, 7 (1): 109–123, doi:10.1007/BF02187829.
Pach, János; Tóth, Géza (1997), "Graphs drawn with few crossings per edge", Combinatorica, 17 (3): 427–439, doi:10.1007/BF01215922, S2CID 20480170.
Pach, János; Tóth, Géza (2000), "Which crossing number is it, anyway?", Journal of Combinatorial Theory, Series B, 80 (2): 225–246, doi:10.1006/jctb.2000.1978.
de Fraysseix, Hubert; Pach, János; Pollack, Richard (1988), "Small sets supporting Fáry embeddings of planar graphs", Proc. 20th ACM Symp. Theory of Computing, pp. 426–433, doi:10.1145/62212.62254, S2CID 15230919.
Pach, János; Wenger, Rephael (2001), "Embedding planar graphs at fixed vertex locations", Graphs and Combinatorics, 17 (4): 717–728, doi:10.1007/PL00007258, S2CID 36270095.
Komlós, János; Pach, János; Woeginger, Gerhard (1992), "Almost tight bounds for ε-nets.", Discrete & Computational Geometry, 7 (2): 163–173, doi:10.1007/bf02187833.
Pach, János; Tardos, Gábor (2013), "Tight lower bounds for the size of epsilon-nets", Journal of the American Mathematical Society, 26 (3): 645–658, arXiv:1012.1240, doi:10.1090/s0894-0347-2012-00759-0.

ematlap.hu

Pach Zsigmond Pálné (Sós Klára) (1925−2020), in Hungarian

epfl.ch

actualites.epfl.ch

János Pach appointed as a full professor of mathematics, EPFL, December 12, 2007.

archiveweb.epfl.ch

Chair of Combinatorial Geometry, EPFL

jointmathematicsmeetings.org

AMS Meeting

math-inst.hu

Research Fellows, Rényi Institute
Rényi-díj, Alfred Rényi Institute of Mathematics, archived from the original on 4 September 2012, retrieved 8 March 2010

mathgenealogy.org

János Pach at the Mathematics Genealogy Project

mathunion.org

List of Speakers at ICM.

mta.hu

Corresponding members of the Hungarian Academy of Sciences, retrieved 2022-05-21.

nyu.edu

math.nyu.edu

Personal website of János Pach, New York University

oakland.edu

Computing Your Erdös Number

scholar.google.com

Google scholar, retrieved October 23, 2008.

semanticscholar.org

api.semanticscholar.org

Pach, János; Tóth, Géza (1997), "Graphs drawn with few crossings per edge", Combinatorica, 17 (3): 427–439, doi:10.1007/BF01215922, S2CID 20480170.
de Fraysseix, Hubert; Pach, János; Pollack, Richard (1988), "Small sets supporting Fáry embeddings of planar graphs", Proc. 20th ACM Symp. Theory of Computing, pp. 426–433, doi:10.1145/62212.62254, S2CID 15230919.
Pach, János; Wenger, Rephael (2001), "Embedding planar graphs at fixed vertex locations", Graphs and Combinatorics, 17 (4): 717–728, doi:10.1007/PL00007258, S2CID 36270095.

sfu.ca

cs.sfu.ca

Short biography Archived 2008-06-24 at the Wayback Machine, from SFU Computing Science.

umn.edu

purl.umn.edu

de Fraysseix, Hubert; Pach, János; Pollack, Richard (1988), "Small sets supporting Fáry embeddings of planar graphs", Proc. 20th ACM Symp. Theory of Computing, pp. 426–433, doi:10.1145/62212.62254, S2CID 15230919.

web.archive.org

Short biography Archived 2008-06-24 at the Wayback Machine, from SFU Computing Science.
ACM Names Fellows for Computing Advances that Are Driving Innovation Archived 2011-12-09 at the Wayback Machine, Association for Computing Machinery, December 8, 2011.