Janos Pach

Citado por

	Todos	Desde 2020
Citações	16725	3788
Índice h	64	29
Índice i10	235	104

960

480

240

720

1988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202545 52 57 79 71 137 142 149 123 227 203 225 234 216 253 317 458 469 377 466 525 644 595 615 698 849 733 739 655 814 723 676 729 638 584 710 960 166

Acesso público

Ver todos

119 artigos

1 artigo

disponível

não disponível

Com base nas autorizações de financiamento

Coautores

Géza TóthRenyi Institute and Technical University, BudapestE-mail confirmado em renyi.mta.hu
Micha SharirTel Aviv UniversityE-mail confirmado em tauex.tau.ac.il
Jacob FoxStanford UniversityE-mail confirmado em stanford.edu
Paul ErdősMathematics
Peter BrassProfessor of Computer Science, City College of New YorkE-mail confirmado em cs.ccny.cuny.edu
rom pinchasiTechnionE-mail confirmado em tx.technion.ac.il
Adrian Dumitrescualgoresearch.orgE-mail confirmado em adriandumitrescu.org
Pankaj K. AgarwalDuke UniversityE-mail confirmado em cs.duke.edu
Imre BaranyProfessor of Mathematics, Renyi Institute, HungaryE-mail confirmado em renyi.hu
Rados RadoicicProfessor of Mathematics, Baruch College, City University of New YorkE-mail confirmado em baruch.cuny.edu
Dömötör PálvölgyiEötvös Loránd University (ELTE)E-mail confirmado em cs.elte.hu
jozsef solymosiUniversity of British ColumbiaE-mail confirmado em math.ubc.ca
Peter FranklHungarian Academy of SciencesE-mail confirmado em renyi.mta.hu
Boris AronovProfessor of Computer Science, Tandon School of Engineering, New York UniversityE-mail confirmado em nyu.edu
Csaba D. TothCalifornia State University NorthridgeE-mail confirmado em csun.edu
Zoltan FurediE-mail confirmado em illinois.edu
Herbert EdelsbrunnerProfessor of Mathematics, IST AustriaE-mail confirmado em ist.ac.at
Balázs KeszeghResearcher, Alfréd Rényi Institute of Mathematics, BudapestE-mail confirmado em renyi.hu
Noga AlonPrinceton University and Tel Aviv UniversityE-mail confirmado em tau.ac.il
Mario SzegedyProfessor of Computer Science, Rutgers UniversityE-mail confirmado em cs.rutgers.edu

Seguir

Janos Pach

Ecole Polytechnique Federale de Lausanne and Renyi Institute Budapest

E-mail confirmado em renyi.hu - Página inicial

Discrete Geometry Computational Geometry Combinatorics Graph Drawing


Título Ordenar por citações Ordenar por ano Ordenar por título	Citado por Citado por	Ano
Research problems in discrete geometry P Brass, WOJ Moser, J Pach Springer, 2005	1224	2005
Combinatorial geometry J Pach, PK Agarwal John Wiley & Sons, 2011	1095	2011
How to draw a planar graph on a grid H De Fraysseix, J Pach, R Pollack Combinatorica 10, 41-51, 1990	889	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	468	1986
Graphs drawn with few crossings per edge J Pach, G Tóth Combinatorica 17 (3), 427-439, 1997	445	1997
The hippocampus as a cognitive graph. RU Muller, M Stead, J Pach The Journal of general physiology 107 (6), 663-694, 1996	396	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	279	1988
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	200	1994
On the number of incidences between points and curves J Pach, M Sharir Combinatorics, Probability and Computing 7 (1), 121-127, 1998	193	1998
Applications of the crossing number J Pach, F Shahrokhi, M Szegedy Proceedings of the tenth annual symposium on Computational geometry, 198-202, 1994	193	1994
Which crossing number is it anyway? J Pach, G Tóth Journal of Combinatorial Theory, Series B 80 (2), 225-246, 2000	190	2000
Almost tight bounds forɛ-Nets J Komlós, J Pach, G Woeginger Discrete & Computational Geometry 7, 163-173, 1992	186	1992
Embedding a planar triangulation with vertices at specified points J Pach, P Gritzmann, B Mohar, R Pollack	183	1991
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	175	2004
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	174	1997
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	169	1989
Embedding planar graphs at fixed vertex locations J Pach, R Wenger Graphs and Combinatorics 17, 717-728, 2001	160	2001
Ramsey-type theorems with forbidden subgraphs N Alon, J Pach, J Solymosi Combinatorica 21 (2), 155-170, 2001	143	2001
Crossing patterns of semi-algebraic sets N Alon, J Pach, R Pinchasi, R Radoičić, M Sharir Journal of Combinatorial Theory, Series A 111 (2), 310-326, 2005	134	2005
Overlap properties of geometric expanders J Fox, M Gromov, V Lafforgue, A Naor, J Pach Journal für die reine und angewandte Mathematik (Crelles Journal) 2012 (671 …, 2012	131	2012

O sistema não pode executar a operação agora. Tente novamente mais tarde.

Artigos 1–20

Citações por ano

Citações duplicadas

Citações mescladas

Adicionar coautoresCoautores

Seguir

Citado por

Coautores