Подписаться
Janos Pach
Janos Pach
Ecole Polytechnique Federale de Lausanne and Renyi Institute Budapest
Подтвержден адрес электронной почты в домене renyi.hu - Главная страница
Название
Процитировано
Процитировано
Год
Research problems in discrete geometry
P Brass, WOJ Moser, J Pach
Springer, 2005
11532005
Combinatorial geometry
J Pach, PK Agarwal
John Wiley & Sons, 2011
10682011
How to draw a planar graph on a grid
H De Fraysseix, J Pach, R Pollack
Combinatorica 10, 41-51, 1990
8461990
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
4531986
Graphs drawn with few crossings per edge
J Pach, G Tóth
Combinatorica 17 (3), 427-439, 1997
3911997
The hippocampus as a cognitive graph.
RU Muller, M Stead, J Pach
The Journal of general physiology 107 (6), 663-694, 1996
3731996
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
2701988
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
1941994
Which crossing number is it anyway?
J Pach, G Tóth
Journal of Combinatorial Theory, Series B 80 (2), 225-246, 2000
1862000
Applications of the crossing number
J Pach, F Shahrokhi, M Szegedy
Proceedings of the tenth annual symposium on Computational geometry, 198-202, 1994
1851994
Almost tight bounds forɛ-Nets
J Komlós, J Pach, G Woeginger
Discrete & Computational Geometry 7, 163-173, 1992
1831992
On the number of incidences between points and curves
J Pach, M Sharir
Combinatorics, Probability and Computing 7 (1), 121-127, 1998
1811998
E3341
P Gritzmann, B Mohar, J Pach, R Pollack
The American Mathematical Monthly 98 (2), 165, 1991
1721991
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
1581997
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
1542004
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
1501989
Embedding planar graphs at fixed vertex locations
J Pach, R Wenger
Graphs and Combinatorics 17, 717-728, 2001
1482001
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
1291992
Ramsey-type theorems with forbidden subgraphs
N Alon, J Pach, J Solymosi
Combinatorica 21 (2), 155-170, 2001
1272001
Representation of planar graphs by segments
J Pach, H de Fraysseix, P de Mendez
Intuitive Geometry, 109-117, 1994
1271994
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20