Janos Pach
Janos Pach
Ecole Polytechnique Federale de Lausanne and Renyi Institute Budapest
Подтвержден адрес электронной почты в домене renyi.hu - Главная страница
Handbook of discrete and computational geometry
CD Toth, J O'Rourke, JE Goodman
Chapman and Hall/CRC, 2017
Combinatorial geometry
J Pach, PK Agarwal
John Wiley & Sons, 2011
Research problems in discrete geometry
P Brass, WOJ Moser, J Pach
Springer Science & Business Media, 2006
How to draw a planar graph on a grid
H De Fraysseix, J Pach, R Pollack
Combinatorica 10 (1), 41-51, 1990
Handbook of discrete and combinatorial mathematics
KH Rosen
Chapman and Hall/CRC, 2017
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 (1), 59-71, 1986
Graphs drawn with few crossings per edge
J Pach, G Tóth
Combinatorica 17 (3), 427-439, 1997
The hippocampus as a cognitive graph.
RU Muller, M Stead, J Pach
The Journal of general physiology 107 (6), 663-694, 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
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
Which crossing number is it anyway?
J Pach, G Tóth
Journal of Combinatorial Theory, Series B 80 (2), 225-246, 2000
Applications of the crossing number
J Pach, F Shahrokhi, M Szegedy
Proceedings of the tenth annual symposium on Computational geometry, 198-202, 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
Almost tight bounds forɛ-Nets
J Komlós, J Pach, G Woeginger
Discrete & Computational Geometry 7 (2), 163-173, 1992
On the number of incidences between points and curves
J Pach, M Sharir
Combinatorics, Probability and Computing 7 (1), 121-127, 1998
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
Embedding planar graphs at fixed vertex locations
J Pach, R Wenger
Graphs and Combinatorics 17 (4), 717-728, 2001
Improving the crossing lemma by finding more crossings in sparse graphs
J Pach, R Radoicic, G Tardos, G Tóth
Discrete & Computational Geometry 36 (4), 527-552, 2006
Representation of planar graphs by segments
J Pach, H de Fraysseix, P de Mendez
North-Holland, 1994
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
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20