Janos Pach

Citata da

	Tutte	Dal 2018
Citazioni	15102	3804
Indice H	58	29
i10-index	226	103

860

430

215

645

19881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202340 52 51 86 68 139 127 162 126 217 194 201 223 219 268 299 418 530 364 466 532 608 555 566 671 858 726 741 670 775 732 681 757 662 710 259

Accesso pubblico

Visualizza tutto

106 articoli

2 articoli

Disponibili

Non disponibili

In base ai mandati di finanziamento

Coautori

Géza TóthRenyi Institute and Technical University, BudapestEmail verificata su renyi.mta.hu
Micha SharirTel Aviv UniversityEmail verificata su tauex.tau.ac.il
Jacob FoxStanford UniversityEmail verificata su stanford.edu
Paul ErdősMathematics
Peter BrassProfessor of Computer Science, City College of New YorkEmail verificata su cs.ccny.cuny.edu
rom pinchasiTechnionEmail verificata su tx.technion.ac.il
Pankaj K. AgarwalDuke UniversityEmail verificata su cs.duke.edu
Adrian Dumitrescualgoresearch.orgEmail verificata su adriandumitrescu.org
Imre BaranyProfessor of Mathematics, Renyi Institute, HungaryEmail verificata su renyi.hu
Rados RadoicicProfessor of Mathematics, Baruch College, City University of New YorkEmail verificata su baruch.cuny.edu
jozsef solymosiUniversity of British ColumbiaEmail verificata su math.ubc.ca
Dömötör PálvölgyiEötvös Loránd University (ELTE)Email verificata su cs.elte.hu
Peter FranklHungarian Academy of SciencesEmail verificata su renyi.mta.hu
Csaba D. TothCalifornia State University NorthridgeEmail verificata su csun.edu
Balázs KeszeghResearcher, Alfréd Rényi Institute of Mathematics, BudapestEmail verificata su renyi.hu
Gerhard WoegingerProfessor of Computer Science, RWTH AachenEmail verificata su cs.rwth-aachen.de
Noga AlonPrinceton University and Tel Aviv UniversityEmail verificata su tau.ac.il
Péter KomjáthEötvös Loránd University, Budapest, HungaryEmail verificata su cs.elte.hu

Segui

Janos Pach

Ecole Polytechnique Federale de Lausanne and Renyi Institute Budapest

Email verificata su renyi.hu - Home page

Discrete & Computational Geometry Combinatorics Graph Drawing


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
Research problems in discrete geometry P Brass, WOJ Moser, J Pach Springer, 2005	1129	2005
Combinatorial geometry J Pach, PK Agarwal John Wiley & Sons, 2011	1055	2011
How to draw a planar graph on a grid H De Fraysseix, J Pach, R Pollack Combinatorica 10, 41-51, 1990	822	1990
On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles K Kedem, R Livne, J Pach, M Sharir Discrete & Computational Geometry 1, 59-71, 1986	449	1986
Graphs drawn with few crossings per edge J Pach, G Tóth Combinatorica 17 (3), 427-439, 1997	379	1997
The hippocampus as a cognitive graph. RU Muller, M Stead, J Pach The Journal of general physiology 107 (6), 663-694, 1996	359	1996
Small sets supporting Fary embeddings of planar graphs H de Fraysseix, J Pach, R Pollack Proceedings of the twentieth annual ACM symposium on Theory of computing …, 1988	263	1988
Which crossing number is it anyway? J Pach, G Tóth Journal of Combinatorial Theory, Series B 80 (2), 225-246, 2000	179	2000
On the number of incidences between points and curves J Pach, M Sharir Combinatorics, Probability and Computing 7 (1), 121-127, 1998	178	1998
Almost tight bounds forɛ-Nets J Komlós, J Pach, G Woeginger Discrete & Computational Geometry 7, 163-173, 1992	178	1992
Applications of the crossing number J Pach, F Shahrokhi, M Szegedy Proceedings of the tenth annual symposium on Computational geometry, 198-202, 1994	176	1994
Embedding a planar triangulation with vertices at specified points J Pach, P Gritzmann, B Mohar, R Pollack American Mathematical Monthly 98 (ARTICLE), 165-166, 1991	167	1991
Embedding planar graphs at fixed vertex locations J Pach, R Wenger Graphs and Combinatorics 17, 717-728, 2001	153	2001
Quasi-planar graphs have a linear number of edges PK Agarwal, B Aronov, J Pach, R Pollack, M Sharir Combinatorica 17 (1), 1-9, 1997	151	1997
Improving the crossing lemma by finding more crossings in sparse graphs J Pach, R Radoicić, G Tardos, G Tóth Proceedings of the twentieth annual symposium on Computational geometry, 68-75, 2004	150	2004
Fat triangles determine linearly many holes J Matoušek, J Pach, M Sharir, S Sifrony, E Welzl SIAM Journal on Computing 23 (1), 154-169, 1994	138	1994
Radius, diameter, and minimum degree P Erdős, J Pach, R Pollack, Z Tuza Journal of Combinatorial Theory, Series B 47 (1), 73-79, 1989	138	1989
Arrangements of curves in the plane—topology, combinatorics, and algorithms H Edelsbrunner, L Guibas, J Pach, R Pollack, R Seidel, M Sharir Theoretical Computer Science 92 (2), 319-336, 1992	127	1992
Representation of planar graphs by segments J Pach, H de Fraysseix, P de Mendez Intuitive Geometry, 109-117, 1994	126	1994
Repeated angles in the plane and related problems J Pach, M Sharir Journal of Combinatorial Theory, series A 59 (1), 12-22, 1992	115	1992

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Segui

Citata da

Coautori