Pach János (Hungarian Wikipedia)

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

refsWebsite

Global rank Hungarian rank

9doi.org

2^nd place

8^th place

3ams.org

451^st place

1,456^th place

3web.archive.org

1^st place

2acm.org

1,185^th place

2,600^th place

2epfl.ch

4,521^st place

3,257^th place

1ematlap.hu

low place

1blog.hu

4,962^nd place

19^th place

1mathgenealogy.org

4,501^st place

low place

1renyi.hu

low place

2,750^th place

1nyu.edu

1,174^th place

2,057^th place

1mathunion.org

9,965^th place

low place

1mta.hu

low place

110^th place

1oakland.edu

low place

8,898^th place

1jointmathematicsmeetings.org

low place

1scholar.google.com

1,697^th place

2,276^th place

1archive.today

14^th place

47^th place

1math-inst.hu

low place

1sfu.ca

3,413^th place

5,043^rd place

1ae-info.org

low place

4,958^th place

acm.org

https://www.acm.org/binaries/content/assets/press-releases/2011/december/acm-fellows-2011c.pdf, 2024. június 24.
ACM Names Fellows for Computing Advances that Are Driving Innovation Archiválva 2011. december 9-i dátummal a Wayback Machine-ben, Association for Computing Machinery, December 8, 2011.

ae-info.org

Academia Europaea-List of Members, <http://www.ae-info.org/ae/Acad_Main/List_of_Members/ListMembersByAlphabet>. Hozzáférés ideje: 2018-04-06.

ams.org

http://www.ams.org/fellows_by_year.cgi?year=2016, 2022. november 24.
http://www.ams.org/news?news_id=2847, 2022. november 24.
2016 Class of the Fellows of the AMS, American Mathematical Society, <http://www.ams.org/profession/ams-fellows/new-fellows>. Hozzáférés ideje: 2015-11-16.

archive.today

Rényi-díj. Alfred Rényi Institute of Mathematics. [2012. szeptember 4-i dátummal az eredetiből archiválva]. (Hozzáférés: 2010. március 8.)

blog.hu

csanna.blog.hu

Interjú Pach Jánossal (2013)

doi.org

dx.doi.org

Pach, János (1981), "A problem of Ulam on planar graphs", European J. Combin. 2: 357–361, DOI 10.1016/s0195-6698(81)80043-1
Kedem, Klara; Livne, Ron & Pach, János et al. (1986), "On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles", Discrete and 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 and 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.
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.
Pach, János & Wenger, Rephael (2001), "Embedding planar graphs at fixed vertex locations", Graphs and Combinatorics 17 (4): 717–728, DOI 10.1007/PL00007258.
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", J. Amer. Math. Soc. 26: 645–658, DOI 10.1090/s0894-0347-2012-00759-0.