Sign In

Login

Password

Forgot Password ? Sign Up

János Pach (Uzbek Wikipedia)

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

refsWebsite
Global rank Uzbek rank
9doi.org
2nd place
3rd place
3semanticscholar.org
11th place
82nd place
2math-inst.hu
low place
low place
2web.archive.org
1st place
1st place
2epfl.ch
4,521st place
8,940th place
1ematlap.hu
low place
low place
1blog.hu
4,962nd place
low place
1nyu.edu
1,174th place
2,282nd place
1mathunion.org
9,965th place
6,317th place
18ecm.si
low place
low place
1oakland.edu
low place
low place
1jointmathematicsmeetings.org
low place
low place
1scholar.google.com
1,697th place
2,777th place
1umn.edu
1,266th place
756th place
1arxiv.org
69th place
186th place
1archive.today
14th place
37th place
1ae-info.org
low place
low place
1ams.org
451st place
996th place
1mta.hu
low place
low place

8ecm.si

ae-info.org

ams.org

archive.today

  • Rényi-díj, Alfred Rényi Institute of Mathematics, 4 September 2012da asl nusxadan arxivlandi, qaraldi: 8 March 2010

arxiv.org

blog.hu

csanna.blog.hu

doi.org

  • Pach, János (1981), „A problem of Ulam on planar graphs“, European Journal of Combinatorics, 2-jild, № 4, 357–361-bet, 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-jild, № 1, 59–71-bet, 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-jild, № 1, 109–123-bet, doi:10.1007/BF02187829.
  • Pach, János; Tóth, Géza (1997), „Graphs drawn with few crossings per edge“, Combinatorica, 17-jild, № 3, 427–439-bet, 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-jild, № 2, 225–246-bet, 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, 426–433-bet, doi:10.1145/62212.62254, S2CID 15230919.
  • Pach, János; Wenger, Rephael (2001), „Embedding planar graphs at fixed vertex locations“, Graphs and Combinatorics, 17-jild, № 4, 717–728-bet, 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-jild, № 2, 163–173-bet, 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-jild, № 3, 645–658-bet, arXiv:1012.1240, doi:10.1090/s0894-0347-2012-00759-0.

ematlap.hu

epfl.ch

actualites.epfl.ch

archiveweb.epfl.ch

jointmathematicsmeetings.org

math-inst.hu

mathunion.org

mta.hu

nyu.edu

math.nyu.edu

oakland.edu

scholar.google.com

semanticscholar.org

api.semanticscholar.org

umn.edu

purl.umn.edu

web.archive.org