31:
1411:
1406:
383:"for contributions to discrete and combinatorial geometry and to convexity and combinatorics." In 2022 he was elected corresponding member of the Hungarian Academy of Sciences.
1391:
133:
1416:
1184:
196:
1356:
1346:
1361:
1351:
1231:
1401:
1116:
303:
Some of Pach's most-cited research work concerns the combinatorial complexity of families of curves in the plane and their applications to
143:(1919–2001) was a well-known historian, and his mother Klára (née Sós, 1925–2020) was a university mathematics teacher; his maternal aunt
177:
170:
676:
1386:
336:
250:
203:
36:
1396:
1371:
1366:
612:
593:
570:
540:
512:
493:
474:
451:
429:
402:
1081:
908:
838:
224:
332:
1239:
364:
340:
212:
207:
1005:
de
Fraysseix, Hubert; Pach, János; Pollack, Richard (1988), "Small sets supporting Fáry embeddings of planar graphs",
883:
778:
320:
254:
69:
976:
356:
312:
265:
Pach has authored several books and over 300 research papers. He was one of the most frequent collaborators of
1155:
805:
1381:
1258:
836:(1986), "On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles",
708:
562:
466:
380:
348:
159:
74:
1181:
628:
486:
Graph
Drawing: 12th International Symposium, GD 2004, New York, NY, USA, September 29-October 2, 2004
1376:
234:
185:
1228:
344:
742:
138:
1341:
368:
117:
530:
424:, Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons,
155:
1336:
1076:
867:
816:
690:
1040:
Pach, János; Wenger, Rephael (2001), "Embedding planar graphs at fixed vertex locations",
163:
8:
1317:
1252:
181:
1125:
1057:
1022:
956:
871:
554:
418:
899:
792:
112:(born May 3, 1954) is a mathematician and computer scientist working in the fields of
608:
589:
566:
536:
508:
489:
470:
447:
425:
413:
398:
372:
297:
281:
1205:
1140:
1061:
1026:
960:
352:
1135:
1090:
1049:
1012:
985:
946:
917:
847:
787:
550:
522:
308:
878:, "Arrangements of curves in the plane: topology, combinatorics, and algorithms",
664:
195:
Between 2008 and 2019, he was
Professor of the Chair of Combinatorial Geometry at
1235:
1188:
753:
304:
289:
1111:
270:
1321:
285:
148:
144:
1330:
277:
218:
189:
113:
937:
Pach, János; Tóth, Géza (1997), "Graphs drawn with few crossings per edge",
704:
586:
Combinatorial
Geometry and Its Algorithmic Applications: The Alcalá Lectures
266:
216:, and he serves on the editorial boards of several other journals including
990:
875:
833:
719:
581:
439:
316:
293:
1307:
731:
1161:
829:
1017:
974:
Pach, János; Tóth, Géza (2000), "Which crossing number is it, anyway?",
1095:
1053:
951:
922:
852:
764:
588:, Mathematical Surveys and Monographs, American Mathematical Society,
488:, Lecture Notes in Computer Science, vol. 3383, Springer-Verlag,
526:
1312:
1229:
ACM Names
Fellows for Computing Advances that Are Driving Innovation
1199:
1197:
444:
Discrete and
Computational Geometry: The Goodman–Pollack Festschrift
1130:
649:
559:
Surveys on
Discrete and Computational Geometry: Twenty Years Later
30:
1302:
1194:
129:
535:, MSRI Publications, vol. 52, Cambridge University Press,
446:, Algorithms and Combinatorics, vol. 25, Springer-Verlag,
397:, Algorithms and Combinatorics, vol. 10, Springer-Verlag,
376:
360:
1412:
249:
184:(since 1986), Distinguished Professor of Computer Science at
101:
1278:
296:, he initiated the systematic study of extremal problems on
1114:(2013), "Tight lower bounds for the size of epsilon-nets",
1006:
1280:
Corresponding members of the
Hungarian Academy of Sciences
776:
Pach, János (1981), "A problem of Ulam on planar graphs",
866:
503:
Brass, Peter; Moser, W. O. J.; Pach, János, eds. (2005),
442:; Basu, Saugata; Pach, János; et al., eds. (2003),
1407:
2011 fellows of the Association for Computing Machinery
1160:, Alfred Rényi Institute of Mathematics, archived from
1004:
665:
János Pach appointed as a full professor of mathematics
880:
15th Int. Colloq. Automata, Languages and Programming
132:. He comes from a noted academic family: his father,
897:
828:
438:
269:, authoring over 20 papers with him and thus has an
151:
are two of the best-known Hungarian mathematicians.
1074:
1392:Courant Institute of Mathematical Sciences faculty
886:, vol. 317, Springer-Verlag, pp. 214–229
874:; Pach, János; Pollack, Richard; Seidel, Raimund;
549:
417:
253:, in Seoul, 2014. He was a plenary speaker at the
72:, Hungary, (M.S., Math., 1977; Ph.D., Math., 1981)
395:New Trends in Discrete and Computational Geometry
244:Moscow Journal of Combinatorics and Number Theory
210:in 2015. He is co-editor-in-chief of the journal
1328:
902:(1992), "An upper bound on the number of planar
319:onto fixed sets of points, and lower bounds for
521:
502:
677:Pach Zsigmond Pálné (Sós Klára) (1925−2020),
1417:Fellows of the American Mathematical Society
1117:Journal of the American Mathematical Society
169:Since 1977, he has been affiliated with the
1079:(1992), "Almost tight bounds for ε-nets.",
561:, Contemporary Mathematics, vol. 453,
465:, Contemporary Mathematics, vol. 342,
411:
276:Pach's research is focused in the areas of
1203:
1109:
1039:
579:
178:Courant Institute of Mathematical Sciences
29:
1139:
1129:
1094:
1016:
989:
950:
921:
851:
791:
645:
643:
1008:Proc. 20th ACM Symp. Theory of Computing
973:
936:
532:Combinatorial and Computational Geometry
371:. In 2014 he was elected as a member of
331:Pach received the Grünwald Medal of the
251:International Congress of Mathematicians
204:International Symposium on Graph Drawing
197:École Polytechnique Fédérale de Lausanne
93:combinatorics and computational geometry
1313:János Pach in the EPFL people directory
747:
605:Thirty essays on geometric graph theory
288:problem, showing that there exists no
240:Central European Journal of Mathematics
1329:
660:
658:
640:
505:Research Problems in Discrete Geometry
188:(1992-2011), and Neilson Professor at
173:of the Hungarian Academy of Sciences.
1357:21st-century Hungarian mathematicians
1347:20th-century Hungarian mathematicians
1308:Chair of Combinatorial Geometry, EPFL
1082:Discrete & Computational Geometry
1068:
909:Discrete & Computational Geometry
839:Discrete & Computational Geometry
799:
732:Chair of Combinatorial Geometry, EPFL
359:in 2005. In 2011 he was listed as a
171:Alfréd Rényi Institute of Mathematics
1362:21st-century American mathematicians
1352:20th-century American mathematicians
1254:2016 Class of the Fellows of the AMS
1103:
775:
736:
713:
602:
483:
463:Towards a Theory of Geometric Graphs
460:
392:
326:
225:SIAM Journal on Discrete Mathematics
77:, (Candidate, 1983; Doctorate, 1995)
1402:Researchers in geometric algorithms
1240:Association for Computing Machinery
769:
655:
365:Association for Computing Machinery
341:Mathematical Association of America
213:Discrete and Computational Geometry
208:Symposium on Computational Geometry
118:discrete and computational geometry
13:
691:Interview with János Pach (2013),
311:that a planar point set may have,
14:
1428:
1296:
1204:Hasani, Ilire; Hoffmann, Robert.
884:Lecture Notes in Computer Science
779:European Journal of Combinatorics
333:János Bolyai Mathematical Society
292:. In the early 90s together with
202:He was the program chair for the
176:He was Research Professor at the
162:, in 1983, where his advisor was
1387:City College of New York faculty
754:List of Plenary Speakers at ECM.
298:topological and geometric graphs
255:European Congress of Mathematics
1271:
1245:
1222:
1206:"Academy of Europe: Pach János"
1175:
1148:
1141:10.1090/s0894-0347-2012-00759-0
1033:
998:
977:Journal of Combinatorial Theory
967:
930:
898:Pach, János; Steiger, William;
891:
860:
822:
810:
758:
307:problems the maximum number of
1303:Personal website of János Pach
725:
698:
684:
670:
650:Personal website of János Pach
357:Hebrew University of Jerusalem
102:Rényi Institute of Mathematics
1:
1397:Hungarian Academy of Sciences
1372:Hungarian computer scientists
1259:American Mathematical Society
1191:, from SFU Computing Science.
819:, retrieved October 23, 2008.
793:10.1016/s0195-6698(81)80043-1
709:Mathematics Genealogy Project
634:
563:American Mathematical Society
467:American Mathematical Society
381:American Mathematical Society
349:Hungarian Academy of Sciences
160:Hungarian Academy of Sciences
128:Pach was born and grew up in
75:Hungarian Academy of Sciences
1367:American computer scientists
1075:Komlós, János; Pach, János;
123:
7:
832:; Livne, Ron; Pach, János;
765:Computing Your Erdös Number
622:
260:
85:professor and mathematician
10:
1433:
667:, EPFL, December 12, 2007.
313:crossing numbers of graphs
629:Mountain climbing problem
603:Pach, János, ed. (2013),
484:Pach, János, ed. (2004),
461:Pach, János, ed. (2004),
393:Pach, János, ed. (1993),
97:
89:
81:
65:
43:
28:
21:
1320:publications indexed by
1042:Graphs and Combinatorics
743:List of Speakers at ICM.
386:
309:k-sets and halving lines
235:Graphs and Combinatorics
186:City College of New York
70:Eötvös Loránd University
16:Hungarian mathematician
991:10.1006/jctb.2000.1978
420:Combinatorial Geometry
369:computational geometry
290:universal planar graph
230:Computational Geometry
868:Edelsbrunner, Herbert
652:, New York University
284:. In 1981, he solved
1382:Graph drawing people
1011:, pp. 426–433,
367:for his research in
337:Lester R. Ford Award
1242:, December 8, 2011.
1164:on 4 September 2012
1018:10.1145/62212.62254
872:Guibas, Leonidas J.
507:, Springer-Verlag,
375:, and in 2015 as a
182:New York University
1234:2011-12-09 at the
1187:2008-06-24 at the
1096:10.1007/bf02187833
1077:Woeginger, Gerhard
1054:10.1007/PL00007258
952:10.1007/BF01215922
923:10.1007/BF02187829
853:10.1007/BF02187683
414:Agarwal, Pankaj K.
351:(1992). He was an
345:Alfréd Rényi Prize
257:(Portorož), 2021.
154:Pach received his
37:Graph Drawing 2009
1210:Academy of Europe
722:, Rényi Institute
614:978-1-4614-0110-0
595:978-0-8218-4691-9
572:978-0-8218-4239-3
551:Goodman, Jacob E.
542:978-0-521-84862-6
523:Goodman, Jacob E.
514:978-0-387-23815-9
495:978-3-540-24528-5
476:978-0-8218-3484-8
453:978-3-540-00371-7
431:978-0-471-58890-0
404:978-3-540-55713-5
373:Academia Europaea
327:Awards and honors
282:discrete geometry
164:Miklós Simonovits
134:Zsigmond Pál Pach
107:
106:
1424:
1291:
1289:
1288:
1287:
1275:
1269:
1267:
1266:
1265:
1249:
1243:
1226:
1220:
1219:
1217:
1216:
1201:
1192:
1179:
1173:
1172:
1171:
1169:
1152:
1146:
1144:
1143:
1133:
1107:
1101:
1099:
1098:
1072:
1066:
1064:
1037:
1031:
1029:
1020:
1002:
996:
994:
993:
971:
965:
963:
954:
934:
928:
926:
925:
900:Szemerédi, Endre
895:
889:
887:
864:
858:
856:
855:
826:
820:
814:
808:
803:
797:
796:
795:
773:
767:
762:
756:
751:
745:
740:
734:
729:
723:
720:Research Fellows
717:
711:
702:
696:
688:
682:
674:
668:
662:
653:
647:
617:
598:
575:
555:Pollack, Richard
545:
517:
498:
479:
456:
434:
423:
407:
343:(1990), and the
158:degree from the
147:and her husband
142:
57:
53:
51:
33:
19:
18:
1432:
1431:
1427:
1426:
1425:
1423:
1422:
1421:
1377:Graph theorists
1327:
1326:
1299:
1294:
1285:
1283:
1277:
1276:
1272:
1263:
1261:
1251:
1250:
1246:
1236:Wayback Machine
1227:
1223:
1214:
1212:
1202:
1195:
1189:Wayback Machine
1182:Short biography
1180:
1176:
1167:
1165:
1154:
1153:
1149:
1108:
1104:
1073:
1069:
1038:
1034:
1003:
999:
972:
968:
935:
931:
896:
892:
865:
861:
827:
823:
815:
811:
804:
800:
774:
770:
763:
759:
752:
748:
741:
737:
730:
726:
718:
714:
703:
699:
689:
685:
675:
671:
663:
656:
648:
641:
637:
625:
615:
596:
573:
557:, eds. (2008),
553:; Pach, János;
543:
529:, eds. (2005),
525:; Pach, János;
515:
496:
477:
454:
432:
405:
389:
329:
315:, embedding of
305:motion planning
263:
136:
126:
73:
66:Alma mater
61:
58:
55:
49:
47:
39:
24:
17:
12:
11:
5:
1430:
1420:
1419:
1414:
1409:
1404:
1399:
1394:
1389:
1384:
1379:
1374:
1369:
1364:
1359:
1354:
1349:
1344:
1339:
1325:
1324:
1322:Google Scholar
1315:
1310:
1305:
1298:
1297:External links
1295:
1293:
1292:
1270:
1244:
1221:
1193:
1174:
1147:
1124:(3): 645–658,
1102:
1089:(2): 163–173,
1067:
1048:(4): 717–728,
1032:
997:
984:(2): 225–246,
966:
945:(3): 427–439,
929:
916:(1): 109–123,
890:
859:
821:
817:Google scholar
809:
798:
786:(4): 357–361,
768:
757:
746:
735:
724:
712:
697:
683:
669:
654:
638:
636:
633:
632:
631:
624:
621:
620:
619:
613:
600:
594:
577:
571:
547:
541:
519:
513:
500:
494:
481:
475:
458:
452:
436:
430:
409:
403:
388:
385:
353:Erdős Lecturer
328:
325:
262:
259:
125:
122:
105:
104:
99:
95:
94:
91:
90:Known for
87:
86:
83:
79:
78:
67:
63:
62:
59:
45:
41:
40:
35:János Pach at
34:
26:
25:
22:
15:
9:
6:
4:
3:
2:
1429:
1418:
1415:
1413:
1410:
1408:
1405:
1403:
1400:
1398:
1395:
1393:
1390:
1388:
1385:
1383:
1380:
1378:
1375:
1373:
1370:
1368:
1365:
1363:
1360:
1358:
1355:
1353:
1350:
1348:
1345:
1343:
1342:Living people
1340:
1338:
1335:
1334:
1332:
1323:
1319:
1316:
1314:
1311:
1309:
1306:
1304:
1301:
1300:
1282:
1281:
1274:
1260:
1256:
1255:
1248:
1241:
1237:
1233:
1230:
1225:
1211:
1207:
1200:
1198:
1190:
1186:
1183:
1178:
1163:
1159:
1158:
1151:
1142:
1137:
1132:
1127:
1123:
1119:
1118:
1113:
1112:Tardos, Gábor
1110:Pach, János;
1106:
1097:
1092:
1088:
1084:
1083:
1078:
1071:
1063:
1059:
1055:
1051:
1047:
1043:
1036:
1028:
1024:
1019:
1014:
1010:
1009:
1001:
992:
987:
983:
979:
978:
970:
962:
958:
953:
948:
944:
940:
939:Combinatorica
933:
924:
919:
915:
911:
910:
905:
901:
894:
885:
881:
877:
876:Sharir, Micha
873:
869:
863:
854:
849:
845:
841:
840:
835:
834:Sharir, Micha
831:
825:
818:
813:
807:
802:
794:
789:
785:
781:
780:
772:
766:
761:
755:
750:
744:
739:
733:
728:
721:
716:
710:
706:
701:
695:
694:
687:
681:
680:
673:
666:
661:
659:
651:
646:
644:
639:
630:
627:
626:
616:
610:
606:
601:
597:
591:
587:
583:
582:Sharir, Micha
580:Pach, János;
578:
574:
568:
564:
560:
556:
552:
548:
544:
538:
534:
533:
528:
524:
520:
516:
510:
506:
501:
497:
491:
487:
482:
478:
472:
468:
464:
459:
455:
449:
445:
441:
440:Aronov, Boris
437:
433:
427:
422:
421:
415:
412:Pach, János;
410:
406:
400:
396:
391:
390:
384:
382:
378:
374:
370:
366:
362:
358:
354:
350:
346:
342:
338:
334:
324:
322:
318:
317:planar graphs
314:
310:
306:
301:
299:
295:
291:
287:
283:
279:
278:combinatorics
274:
272:
268:
258:
256:
252:
247:
245:
241:
237:
236:
231:
227:
226:
221:
220:
219:Combinatorica
215:
214:
209:
205:
200:
198:
193:
192:(2008-2009).
191:
190:Smith College
187:
183:
179:
174:
172:
167:
165:
161:
157:
152:
150:
146:
140:
135:
131:
121:
119:
115:
114:combinatorics
111:
103:
100:
96:
92:
88:
84:
82:Occupation(s)
80:
76:
71:
68:
64:
56:(age 70)
46:
42:
38:
32:
27:
20:
1284:, retrieved
1279:
1273:
1262:, retrieved
1253:
1247:
1224:
1213:. Retrieved
1209:
1177:
1166:, retrieved
1162:the original
1156:
1150:
1121:
1115:
1105:
1086:
1080:
1070:
1045:
1041:
1035:
1007:
1000:
981:
980:, Series B,
975:
969:
942:
938:
932:
913:
907:
903:
893:
879:
862:
846:(1): 59–71,
843:
837:
830:Kedem, Klara
824:
812:
801:
783:
777:
771:
760:
749:
738:
727:
715:
700:
693:in Hungarian
692:
686:
679:in Hungarian
678:
672:
607:, Springer,
604:
585:
558:
531:
504:
485:
462:
443:
419:
394:
335:(1982), the
330:
321:epsilon-nets
302:
294:Micha Perles
275:
271:Erdős number
264:
248:
243:
239:
233:
229:
223:
217:
211:
206:in 2004 and
201:
194:
175:
168:
153:
127:
109:
108:
1337:1954 births
806:AMS Meeting
145:Vera T. Sós
137: [
54:May 3, 1954
1331:Categories
1318:János Pach
1286:2022-05-21
1264:2015-11-16
1215:2022-12-19
705:János Pach
635:References
527:Emo, Welzl
267:Paul Erdős
110:János Pach
50:1954-05-03
23:János Pach
1157:Rényi-díj
1131:1012.1240
347:from the
339:from the
156:Candidate
149:Pál Turán
124:Biography
1232:Archived
1185:Archived
1062:36270095
1027:15230919
961:20480170
906:-sets",
623:See also
584:(2009),
416:(1995),
273:of one.
261:Research
1168:8 March
707:at the
379:of the
363:of the
130:Hungary
98:Website
60:Hungary
1060:
1025:
959:
611:
592:
569:
539:
511:
492:
473:
450:
428:
401:
377:fellow
361:fellow
286:Ulam's
242:, and
1126:arXiv
1058:S2CID
1023:S2CID
957:S2CID
387:Books
141:]
1170:2010
609:ISBN
590:ISBN
567:ISBN
537:ISBN
509:ISBN
490:ISBN
471:ISBN
448:ISBN
426:ISBN
399:ISBN
280:and
116:and
44:Born
1136:doi
1091:doi
1050:doi
1013:doi
986:doi
947:doi
918:doi
848:doi
788:doi
355:at
180:at
1333::
1257:,
1238:,
1208:.
1196:^
1134:,
1122:26
1120:,
1085:,
1056:,
1046:17
1044:,
1021:,
982:80
955:,
943:17
941:,
912:,
882:,
870:;
842:,
782:,
657:^
642:^
565:,
469:,
323:.
300:.
246:.
238:,
232:,
228:,
222:,
199:.
166:.
139:hu
120:.
52:)
1290:.
1268:.
1218:.
1145:.
1138::
1128::
1100:.
1093::
1087:7
1065:.
1052::
1030:.
1015::
995:.
988::
964:.
949::
927:.
920::
914:7
904:K
888:.
857:.
850::
844:1
790::
784:2
618:.
599:.
576:.
546:.
518:.
499:.
480:.
457:.
435:.
408:.
48:(
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
