Items where Author is "Pach, János"
Group by: Item Type | No Grouping Number of items: 104. ArticlePach, János and Tardos, Gábor and Tóth, Géza (2024) Disjointness graphs of short polygonal chains. JOURNAL OF COMBINATORIAL THEORY SERIES B, 164. pp. 29-43. ISSN 0095-8956 Frankl, Péter and Pach, János and Pálvölgyi, Dömötör (2024) Odd-sunflowers. JOURNAL OF COMBINATORIAL THEORY SERIES A, 206. ISSN 0097-3165 Fox, J. and Pach, János and Suk, A. (2024) Quasiplanar graphs, string graphs, and the Erdős–Gallai problem. EUROPEAN JOURNAL OF COMBINATORICS. ISSN 0195-6698 Alon, N. and Elboim, D. and Pach, János and Tardos, Gábor (2024) Random Necklaces Require Fewer Cuts. SIAM JOURNAL ON DISCRETE MATHEMATICS, 38 (2). pp. 1381-1408. ISSN 0895-4801 Pach, János and Tardos, Gábor (2024) Where Have All the Grasshoppers Gone? AMERICAN MATHEMATICAL MONTHLY, 131 (3). pp. 204-212. ISSN 0002-9890 Fox, Jacob and Pach, János and Suk, Andrew (2023) On the number of edges of separated multigraphs. JOURNAL OF GRAPH THEORY. ISSN 0364-9024 Ambrus, Áron and Csikós, Mónika and Kiss, Gergely and Pach, János and Somlai, Gábor (2023) Optimal embedded and enclosing isosceles triangles. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE. ISSN 0129-0541 Fang, L. and Huang, H. and Pach, János and Tardos, Gábor and Zuo, J. (2023) Successive vertex orderings of fully regular graphs. JOURNAL OF COMBINATORIAL THEORY SERIES A, 199. ISSN 0097-3165 Fox, Jacob and Pach, János and Suk, Andrew (2023) Sunflowers in set systems of bounded dimension. COMBINATORICA. ISSN 0209-9683 Pach, János and Tardos, Gábor and Tóth, Géza (2022) Crossings between non-homotopic edges. JOURNAL OF COMBINATORIAL THEORY SERIES B, 156. pp. 389-404. ISSN 0095-8956 Barba, L. and Cheong, O. and Dobbins, M.G. and Fleischer, R. and Kawamura, A. and Pach, János (2022) Weight Balancing on Boundaries. JOURNAL OF COMPUTATIONAL GEOMETRY, 13 (1). pp. 1-12. ISSN 1920-180X Frankl, Péter and Pach, János and Pálvölgyi, Dömötör (2021) Exchange Properties of Finite Set-Systems. TRENDS IN MATHEMATICS, 14. pp. 617-624. ISSN 2297-0215 Pach, János and Rubin, Natan and Tardos, Gábor (2021) Planar Point Sets Determine Many Pairwise Crossing Segments. ADVANCES IN MATHEMATICS. pp. 1-17. ISSN 0001-8708 (print); 1090-2082 (online) Korandi, József and Pach, János and Tomon, I. (2020) Large homogeneous submatrices. SIAM JOURNAL ON DISCRETE MATHEMATICS, 34 (4). pp. 2532-2552. ISSN 0895-4801 Kiss, Gergely and Pach, János and Somlai, Gábor (2020) Minimum area isosceles containers. JOURNAL OF INFORMATION PROCESSING, 28. pp. 759-765. ISSN 0387-5806 Pach, János and Tomon, István (2020) On the chromatic number of disjointness graphs of curves. JOURNAL OF COMBINATORIAL THEORY SERIES B, 144. pp. 167-190. ISSN 0095-8956 Frankl, Péter and Pach, János (2020) Shattered matchings in intersecting hypergraphs. MOSCOW JOURNAL OF COMBINATORICS AND NUMBER THEORY. ISSN 2220-5438 Holmsen, Andreas F. and Nassajian, Mojarrad Hossein and Pach, János and Tardos, Gábor (2020) Two extensions of the Erdős-Szekeres problem. JOURNAL OF THE EUROPEAN MATHEMATICAL SOCIETY. ISSN 1435-9855 Fox, Jacob and Pach, János and Suk, Andrew (2019) Approximating the rectilinear crossing number. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 81. pp. 45-53. ISSN 0925-7721 Fox, Jacob and Pach, János and Suk, Andrew (2019) Erdős-Hajnal Conjecture for Graphs with Bounded VC-Dimension. DISCRETE AND COMPUTATIONAL GEOMETRY, 61 (4). pp. 809-829. ISSN 0179-5376 Pach, János and Toth, Geza (2019) Many touchings force many crossings. JOURNAL OF COMBINATORIAL THEORY SERIES B, 137. pp. 104-111. ISSN 0095-8956 Pach, János and Tomon, I. (2019) Ordered graphs and large bi-cliques in intersection graphs of curves. EUROPEAN JOURNAL OF COMBINATORICS, 82. ISSN 0195-6698 Fulek, Radoslav and Pach, János (2019) Thrackles: An improved upper bound. DISCRETE APPLIED MATHEMATICS, 259. pp. 226-231. ISSN 0166-218X Pach, János and Tardos, Gábor (2019) Tiling the plane with equilateral triangles. GEOMBINATORICS, 28 (4). pp. 201-209. ISSN 1065-7371 Kawamura, Akitoshi and Moriyama, Sonoko and Otachi, Yota and Pach, János (2019) A lower bound on opaque sets. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 80. pp. 13-22. ISSN 0925-7721 Kupavskii, Andrey and Pach, János and Tardos, Gábor (2018) Controlling Lipschitz functions. MATHEMATIKA, 64 (3). pp. 898-910. ISSN 0025-5793 Pach, János and Rubin, Natan and Tardos, Gábor (2018) A Crossing Lemma for Jordan curves. ADVANCES IN MATHEMATICS, 331. pp. 908-940. ISSN 0001-8708 Pach, János and Tóth, Géza (2018) Many touchings force many crossings. LECTURE NOTES IN COMPUTER SCIENCE, 10692. pp. 153-159. ISSN 0302-9743 Fox, Jacob and Pach, János and Suk, Andrew (2018) More distinct distances under local conditions. COMBINATORICA, 38 (2). pp. 501-509. ISSN 0209-9683 Pach, János and Székely, László A. and Tóth, Csaba D. and Tóth, Géza (2018) Note on k-planar crossing numbers. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 68. pp. 2-6. ISSN 0925-7721 Kupavskii, A. and Pach, János and Tomon, István (2018) On the Size of K-Cross-Free Families. COMBINATORICA. ISSN 0209-9683 Fox, Jacob and Pach, János and Suk, Andrew (2018) Ramsey-Turan numbers for semi-algebraic graphs. ELECTRONIC JOURNAL OF COMBINATORICS, 25 (4). ISSN 1097-1440 Frankl, Peter and Pach, János (2018) A STABILITY THEOREM ON CUBE TESSELLATIONS. JOURNAL OF COMPUTATIONAL GEOMETRY, 9 (1). pp. 387-390. ISSN 1920-180X Fulek, R. and Pach, János (2018) Thrackles: An improved upper bound. LECTURE NOTES IN COMPUTER SCIENCE, 10692. pp. 160-166. ISSN 0302-9743 Kupavskii, A. and Pach, János and Tardos, Gábor (2018) Tilings of the plane with unit area triangles of bounded diameter. ACTA MATHEMATICA HUNGARICA, 155 (1). pp. 175-183. ISSN 0236-5294 Kupavskii, A. and Pach, János and Tardos, Gábor (2018) Tilings with noncongruent triangles. EUROPEAN JOURNAL OF COMBINATORICS, 73. pp. 72-80. ISSN 0195-6698 Naszódi, Márton and Pach, János and Swanepoel, K. (2017) ARRANGEMENTS OF HOMOTHETS OF A CONVEX BODY. MATHEMATIKA, 63 (2). pp. 696-710. ISSN 0025-5793 Kupavskii, A. and Pach, János (2017) From Tarski's plank problem to simultaneous approximation. AMERICAN MATHEMATICAL MONTHLY, 124 (6). pp. 494-505. ISSN 0002-9890 Fox, Jacob and Pach, János and Sheffer, Ádám and Suk, Andrew and Zahl, Joshua (2017) A semi-algebraic version of Zarankiewicz's problem. JOURNAL OF THE EUROPEAN MATHEMATICAL SOCIETY, 19 (6). pp. 1785-1810. ISSN 1435-9855 Pach, János and Walczak, B. (2016) Decomposition of Multiple Packings with Subquadratic Union Complexity. COMBINATORICS PROBABILITY & COMPUTING, 25 (1). pp. 145-153. ISSN 0963-5483 Pach, János and Zeeuw, Frank de (2016) Distinct Distances on Algebraic Curves in the Plane. COMBINATORICS PROBABILITY & COMPUTING. pp. 1-19. ISSN 0963-5483 (In Press) Pach, János (2016) Graphs with no grid obstacle representation. GEOMBINATORICS, XXVI (2). pp. 80-83. ISSN 1065-7371 Arge, L. and Pach, János (2016) Guest Editors’ Foreword. DISCRETE AND COMPUTATIONAL GEOMETRY. pp. 1-3. ISSN 0179-5376 Pach, János (2016) Körösényi A. (szerk.): A magyar politikai rendszer – negyedszázad után (Osiris Kiadó, Budapest, 2015. 428 o.). TÉR ÉS TÁRSADALOM, 30 (3). pp. 125-140. ISSN 0237-7683 Pach, János and Rubin, Natan and Tardos, Gábor (2016) On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves. COMBINATORICS PROBABILITY & COMPUTING, 25 (6). pp. 941-958. ISSN 0963-5483 Mustafa, Nabil H. and Pach, János (2016) On the Zarankiewicz problem for intersection hypergraphs. JOURNAL OF COMBINATORIAL THEORY SERIES A, 141. pp. 1-7. ISSN 0097-3165 Pach, János and Pálvölgyi, Dömötör (2016) Unsplittable coverings in the plane. ADVANCES IN MATHEMATICS, 302. pp. 433-457. ISSN 0001-8708 Fox, Jacob and Pach, János and Suk, Andrew (2016) A polynomial regularity lemma for semi-algebraic hypergraphs and its applications in geometry and property testing. SIAM JOURNAL ON COMPUTING, 45 (6). pp. 2199-2223. ISSN 0097-5397 Lángi, Zsolt and Naszódi, Márton and Pach, János and Tardos, Gábor and Tóth, Géza (2015) Separation with restricted families of sets. JOURNAL OF COMBINATORIAL THEORY SERIES A. ISSN 0097-3165 (Submitted) Pach, János and Tardos, Gábor (2015) Cross-Intersecting Families of Vectors. GRAPHS AND COMBINATORICS, 31 (2). pp. 477-495. ISSN 0911-0119 Pach, János and Swanepoel, K. J. (2015) Double-normal pairs in space. MATHEMATIKA, 61 (1). pp. 259-272. ISSN 0025-5793 Pach, János and Swanepoel, Konrad J. (2015) Double-normal pairs in the plane and on the sphere. BEITRÄGE ZUR ALGEBRA UND GEOMETRIE, 56 (2). pp. 423-4348. ISSN 0138-4821 Fox, Jacob and Grinshpun, A. and Pach, János (2015) The Erdos-Hajnal conjecture for rainbow triangles. JOURNAL OF COMBINATORIAL THEORY SERIES B, 111. pp. 75-125. ISSN 0095-8956 Pach, János (2015) Every graph admits an unambiguous bold drawing. JOURNAL OF GRAPH ALGORITHMS AND APPLICATIONS, 19 (1). pp. 299-312. ISSN 1526-1719 Kang, Ross J. and Pach, János and Patel, Viresh and Regts, Guus (2015) A Precise Threshold for Quasi-Ramsey Numbers. SIAM JOURNAL ON DISCRETE MATHEMATICS, 29 (3). pp. 1670-1682. ISSN 0895-4801 Moric, Filip and Pach, János (2015) Remarks on Schur's conjecture. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2015 (7). pp. 520-527. ISSN 0925-7721 Kynčl, Jan and Pach, János and Radoš, Radoičić and Tóth, Géza (2015) Saturated simple and k-simple topological graphs. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 48 (4). pp. 295-310. ISSN 0925-7721 Bárány, Imre and Pach, János (2014) Homogeneous selections from hyperplanes. JOURNAL OF COMBINATORIAL THEORY SERIES B, 104. pp. 81-87. ISSN 0095-8956 Dumitrescu, Adrian and Jiang, Minghui and Pach, János (2014) Opaque Sets. ALGORITHMICA, 69 (2). pp. 315-334. ISSN 0178-4617 Di Battista, Giuseppe and Frati, Fabrizio and Pach, János (2013) On the queue number of planar graphs. SIAM JOURNAL ON COMPUTING, 42 (6). pp. 2243-2285. ISSN 0097-5397 (print); 1095-7111 (online) Pach, János and Tardos, Gábor (2013) The Range of a Random Walk on a Comb. ELECTRONIC JOURNAL OF COMBINATORICS, 20 (3). ISSN 1077-8926 Pach, János and Tardos, Gábor (2013) TIGHT LOWER BOUNDS FOR THE SIZE OF EPSILON-NETS. JOURNAL OF THE AMERICAN MATHEMATICAL SOCIETY, 26 (3). pp. 645-658. ISSN 0894-0347 Fox, J. and Pach, János and Suk, A. (2013) The number of edges in k-quasi-planar graphs. SIAM JOURNAL ON DISCRETE MATHEMATICS, 27 (1). pp. 550-561. ISSN 0895-4801 Nivasch, G. and Pach, János and Tardos, Gábor (2013) The visible perimeter of an arrangement of disks. LECTURE NOTES IN COMPUTER SCIENCE, 7704 L. pp. 364-375. ISSN 0302-9743 Fox, Jacob and Pach, János (2012) Coloring Kk-free intersection graphs of geometric objects in the plane. EUROPEAN JOURNAL OF COMBINATORICS, 33 (5). pp. 853-866. ISSN 0195-6698 Fox, Jacob and Gromov, Mikhail and Lafforgue, Vincent and Naor, Assaf and Pach, János (2012) Overlap properties of geometric expanders. JOURNAL FUR DIE REINE UND ANGEWANDTE MATHEMATIK (671). pp. 49-83. ISSN 1435-5345 (print); 0075-4102 (online) Fox, Jacob and Pach, János (2012) String graphs and incomparability graphs. ADVANCES IN MATHEMATICS, 230 (3). pp. 1381-1401. ISSN 0001-8708 Bárány, Imre and Harcos, Gergely and Pach, János and Tardos, Gábor (2002) Covering lattice points by subspaces. Periodica Mathematica Hungarica, 43 (1-2). pp. 93-103. ISSN 0031-5303 (print), 1588-2829 (online) Erdős, Paul and Harcos, Gergely and Pach, János (1999) Popular distances in 3-space. Discrete Mathematics, 200 (1-3). pp. 95-99. ISSN 0012-365X Katona, Gyula and Kostochka, A. and Stechkin, B. and Pach, János (1989) On locally Hamiltonian graphs. MATEMATICHESKIE ZAMETKI, 45. pp. 36-42. ISSN 0025-567X Bárány, Imre and Füredi, Zoltán and Pach, János (1984) Discrete convex functions and proof of the six circle conjecture of Fejes Tóth. Canadian Journal of Mathematics, 36 (3). pp. 569-576. ISSN 0008-414X Book SectionFox, J. and Pach, János and Suk, A. (2024) Enumeration of Intersection Graphs of x-Monotone Curves. In: Leibniz International Proceedings in Informatics, LIPIcs. Leibniz International Proceedings in Informatics, LIPIcs (320). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 4. ISBN 9783959773430 Edelsbrunner, H. and Pach, János (2024) Maximum Betti Numbers of Čech Complexes. In: 40th International Symposium on Computational Geometry (SoCG 2024). Leibniz International Proceedings in Informatics, LIPIcs (293). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Wadern, p. 53. ISBN 9783959773164 Dumitrescu, A. and Pach, János (2024) Partitioning Complete Geometric Graphs on Dense Point Sets into Plane Subgraphs. In: Leibniz International Proceedings in Informatics, LIPIcs. Leibniz International Proceedings in Informatics, LIPIcs (320). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 9. ISBN 9783959773430 Fox, J. and Pach, János and Suk, A. (2024) A Structure Theorem for Pseudo-Segments and Its Applications. In: 40th International Symposium on Computational Geometry (SoCG 2024). Leibniz International Proceedings in Informatics, LIPIcs (293). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Wadern, p. 59. ISBN 9783959773164 Pach, János and Saghafian, M. and Schnider, P. (2023) Decomposition of Geometric Graphs into Star-Forests. In: 31st International Symposium on Graph Drawing and Network Visualization, GD 2023. Lecture Notes in Computer Science (14465). Springer Science and Business Media B.V., pp. 339-346. ISBN 9783031492716 Damásdi, Gábor and Frankl, Nóra and Pach, János and Pálvölgyi, Dömötör (2023) Monochromatic Configurations on a Circle. In: Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications. Masaryk University, Brno, pp. 320-327. ISBN 978-80-280-0344-9 Frankl, Péter and Pach, János and Pálvölgyi, Dömötör (2023) Odd-Sunflowers. In: Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications. Masaryk University, Brno, pp. 441-449. ISBN 978-80-280-0344-9 Fox, Jacob and Pach, János and Suk, Andrew (2023) Quasiplanar Graphs, String Graphs, and the Erdős-Gallai Problem. In: Graph Drawing and Network Visualization. Springer, Cham, pp. 219-231. ISBN 9783031222023; 9783031222030 Pach, János and Tardos, Gábor and Tóth, Géza (2022) Disjointness Graphs of Short Polygonal Chains. In: 38th International Symposium on Computational Geometry (SoCG 2022). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 56. ISBN 9783959772273 Fox, Jacob and Pach, János and Suk, Andrew (2021) On the Number of Edges of Separated Multigraphs. In: International Symposium on Graph Drawing and Network Visualization. Lecture Notes in Computer Science (12868). Springer Science and Business Media B.V., pp. 223-227. ISBN 9783030929305 Fox, Jacob and Pach, János and Suk, Andrew (2021) Sunflowers in set systems of bounded dimension. In: 37th International Symposium on Computational Geometry, SoCG 2021. Leibniz-Zentrum für Informatik, Wadern, pp. 571-583. ISBN 9783959771849 Pach, János and Tomon, I. (2019) On the chromatic number of disjointness graphs of curves. In: 35th International Symposium on Computational Geometry, SoCG 2019. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Dagstuhl. ISBN 9783959771047 Pach, János and Rubin, Natan and Tardos, Gábor (2019) Planar point sets determine many pairwise crossing segments. In: STOC 2019 Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery (ACM), New York, pp. 1158-1166. ISBN 9781450367059 Fox, J. and Pach, János and Suk, A. (2019) Semi-algebraic colorings of complete graphs. In: 35th International Symposium on Computational Geometry, SoCG 2019. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Dagstuhl. ISBN 9783959771047 Pach, János and Reed, B. and Yuditsky, Y. (2018) Almost all string graphs are intersection graphs of plane convex sets. In: 34th International Symposium on Computational Geometry, SoCG 2018. Leibniz International Proceedings in Informatics, LIPIcs (99). Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 681-6814. ISBN 9783959770668 Frankl, Péter and Pach, János and Reiher, Christian and Rödl, Vojtěch (2018) Borsuk and Ramsey type questions in Euclidean space. In: Connections in Discrete Mathematics: A Celebration of the Work of Ron Graham. Cambridge University Press, pp. 259-277. ISBN 978-1107153981 Kaufmann, Michael and Pach, János and Tóth, Géza and Ueckerdt, Torsten (2018) The Number of Crossings in Multigraphs with No Empty Lens. In: Graph Drawing and Network Visualization. Springer International Publishing, Berlin, pp. 242-254. ISBN 9783030044145; 9783030044138 Naszódi, Márton and Pach, János and Swanepoel, Konrad J. (2018) Sphere-of-Influence Graphs in Normed Spaces. In: International Conference on Discrete Geometry and Symmetry, GeoSym 2015. Springer Proceedings in Mathematics & Statistics (234). Springer International Publishing, Cham, pp. 293-296. ISBN 978-3-319-78433-5 Pach, János and Tóth, Géza (2018) A crossing Lemma for multigraphs. In: 34th International Symposium on Computational Geometry, SoCG 2018. Leibniz International Proceedings in Informatics, LIPIcs (99). Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 651-6513. ISBN 9783959770668 Pach, János and Tardos, Gábor and Tóth, Géza (2017) Disjointness graphs of segments. In: 33rd International Symposium on Computational Geometry, SoCG 2017. Leibniz International Proceedings in Informatics, LIPIcs (77). Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 591-5915. ISBN 9783959770385 Fox, Jacob and Pach, János and Suk, Andrew (2017) Erdos-hajnal conjecture for graphs with bounded VC-Dimension. In: 33rd International Symposium on Computational Geometry, SoCG 2017. Leibniz International Proceedings in Informatics, LIPIcs (77). Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 1-19. ISBN 9783959770385 Pach, János and Rubin, Natan and Tardos, Gábor (2016) Beyond the Richter-Thomassen conjecture. In: 27th Annual ACM-SIAM Symposium on Discrete Algorithms. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (3). Association for Computing Machinery, Red Hook NY, pp. 957-968. ISBN 978-1-5108-1967-2 Kupavskii, A. and Mustafa, N.H. and Pach, János (2016) New lower bounds for ε-nets. In: Coloring Points with Respect to Squares. Leibniz International Proceedings in Informatics (LIPIcs) . Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, 54.1-54.16. ISBN 978-3-95977-009-5 Kawamura, A. and Moriyama, S. and Otachi, Y. and Pach, János (2016) A lower bound on opaque sets. In: Coloring Points with Respect to Squares. Leibniz International Proceedings in Informatics (LIPIcs) . Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, 46.1-46.10. ISBN 978-3-95977-009-5 Mustafa, Nabil H. and Pach, János (2015) On the Zarankiewicz Problem for Intersection Hypergraphs. In: Graph Drawing and Network Visualization. Lecture Notes in Computer Science (9411). Springer, Berlin, pp. 207-216. ISBN 978-3-319-27260-3 Pach, János and Pálvölgyi, Dömötör and Tóth, Géza (2014) Survey on Decomposition of Multiple Coverings. In: Geometry - Intuitive, Discrete, and Convex. Bolyai Society Mathematical Studies (24). Springer, pp. 219-257. MonographMakai, Endre and Bezdek, András and Böröczky, Károly and Fodor, Ferenc and Fejes Tóth, Gábor and Heppes, Aladár and Pach, János and Talata, István and Tóth, Géza and Uhrin, Béla (2011) DISZKRÉT GEOMETRIA = DISCRETE GEOMETRY. Project Report. OTKA. Bárány, Imre and Füredi, Zoltán and Kincses, János and Pach, János and Pór, Attila and Solymosi, Jozsef and Tóth, Géza (2011) Kombinatorikus módszerek a diszkrét geometriában = Combinatorial methods in discrete geometry. Project Report. OTKA. Makai, Endre and Bezdek, András and Böröczky, Károly and Fejes Tóth, Gábor and Katona, Gyula and Pach, János and Pór, Attila and Uhrin, Béla (2008) Diszkrét és konvex geometria = Discrete and convex geometry. Project Report. OTKA. Bárány, Imre and Füredi, Zoltán and Kincses, János and Pach, János and Pór, Attila and Solymosi, Jozsef and Tóth, Géza (2007) Diszkrét geometria és kombinatorikus konvexitás = Discrete geometry and combinatorial convexity. Project Report. OTKA. Conference or Workshop ItemFox, Jacob and Pach, János and Suk, Andrew (2015) Density and regularity theorems for semi-algebraic hypergraphs. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2015.01.04-2015.01.06, San Diego. Pach, János and Rubin, N. and Tardos, Gábor (2015) On the Richter-Thomassen conjecture about pairwise intersecting closed curves. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2015.01.04-2015.01.06, San Diego. Pach, János (2014) Geometric intersection patterns and the theory of topological graphs. In: International Congress of Mathematicians (ICM 2014), 2014.08.13-2014.08.21, Seoul. |