Sign In

Login

Password

Forgot Password ? Sign Up

János Pach (French Wikipedia)

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

refsWebsite
Global rank French rank
9doi.org
2nd place
3rd place
2math-inst.hu
low place
low place
2epfl.ch
4,521st place
1,512th place
1nodak.edu
5,218th place
2,467th place
1nyu.edu
1,174th place
2,375th place
1mathunion.org
9,965th place
low place
1uni-trier.de
7,690th place
5,883rd place
1oakland.edu
low place
low place
1jointmathematicsmeetings.org
low place
low place
1scholar.google.com
1,697th place
4,059th place
1arxiv.org
69th place
232nd place
1sfu.ca
3,413th place
3,006th place
1acm.org
1,185th place
1,318th place
1ae-info.org
low place
8,508th place
1ams.org
451st place
1,058th place
1renyi.hu
low place
low place

acm.org

ae-info.org

ams.org

arxiv.org

doi.org

dx.doi.org

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

epfl.ch

dcg.epfl.ch

actualites.epfl.ch

jointmathematicsmeetings.org

math-inst.hu

mathunion.org

nodak.edu

genealogy.math.ndsu.nodak.edu

nyu.edu

cs.nyu.edu

oakland.edu

renyi.hu

users.renyi.hu

scholar.google.com

sfu.ca

cs.sfu.ca

uni-trier.de

dblp.uni-trier.de