 |
|
Professor
Computer Science,Electrical Engineering
| Office Location: |
North Academic Center R - 8/211 A |
| Phone: |
(212) 650-6123 |
| Fax: |
(212) 650-6248 |
| E-mail: |
pach@cs.ccny.cuny.edu |
| |
|
Education:
M.S. (Math.), Eötvös University, Hungary, 1977
Ph.D. (Math.), Eötvös University, Hungary, 1981
Doctorate, The Hungarian Academy of Sciences, 1995
Grunwald Medal, Bolyai Mathematical Society, 1982
Ford Award, Mathematical Association of America, 1990
Renyi Award, Hungarian Academy of Sciences, 1993
Academy Award, Hungarian Academy of Sciences, 1998
|
|
Areas of Expertise:
Discrete and Computational Geometry, Graph Theory, and Combinatorics.
|
|
Current Research Interests:
Professor Pach's most recent publication will be on problems and results on geometric patterns in: Graph Theory and Combinatorial Optimization.
|
|
Selected Recent Publications:
How many ways can one draw a graph? (with G. Tóth), in: Graph Drawing, Lecture Notes in Computer Science, Springer-Verlag, Berlin, accepted. Also in: Combinatorica, accepted.
A tight bound for the number of different directions in three dimensions (with R. Pinchasi and M. Sharir), 19th ACM Symposium on Computational Geometry, ACM Press, New York, 2003, 106-113.
Geometric Incidences (with M. Sharir), in: Towards a Theory of Geometric Graphs (J. Pach, ed.), Contemporary Mathematics, AMS, Providence, RI, to appear. Also in: Proceedings of Second Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics and Algorithms (June 17-20, 2002), accepted.
Problem 19 (with G. Fejes Tóth and G. Tóth), in: Discrete Geometry (K. Bezdek. ed.), Marcel Dekker, Inc., New York, 2003, 454--455. Problem 365, Intersection graphs of convex sets, Discrete Mathematics 257 (2003), 602--603. Problem 367 (with G. Tóth), What is the true crossing number, Discrete Mathematics 257 (2003), 604--605.
Midpoints of segments induced by a point set, Geombinatorics 13 (2003), 98--105.
A generalization of quasi-planarity (with R. Radoičić and G. Tóth), in: Towards a Theory of Geometric Graphs (J. Pach, ed.), Contemporary Mathematics, AMS, Providence, RI, 2004, accepted.
Disjoint edges in topological graphs (with G. Tóth), Lecture Notes in Computer Science, submitted.
Pushing squares around (with A. Dumitrescu), 20th ACM Symposium on Computational Geometry, ACM Press, New York, 2004, accepted.
Improving the Crossing Lemma by finding more crossings in sparse graphs (with R. Radoičić, G. Tardos, and G. Tóth), 20th ACM Symposium on Computational Geometry, ACM Press, New York, 2004, accepted. Also in: Discrete and Computational Geometry, to appear.
Solution of Scott's problem on the number of directions determined by a point set in 3-space (with R. Pinchasi and M. Sharir), 20th ACM Symposium on Computational Geometry, ACM Press, New York, 2004, accepted.
Problems and results on geometric patterns (with P. Brass), in: Graph Theory and Combinatorial Optimization, (D. Avis et al., eds.), Kluwer Academic Publishers, 2005, to appear.
|
|
|
|
|
