János Pach - RankMe

386 papers A* 35A 35B 10Journal 254Unranked 46

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Maximum Betti Numbers of Čech Complexes. Discret. Comput. Geom. Herbert Edelsbrunner, János Pach
2026	J	`jnl`	Partitioning Complete Geometric Graphs on Dense Point Sets into Plane Subgraphs. Graphs Comb. Adrian Dumitrescu, János Pach
2025	J	`jnl`	A Purely Geometric Variant of the Gale-Berlekamp Switching Game. CoRR Adrian Dumitrescu, János Pach
2025	J	`jnl`	A structure theorem for pseudosegments and its applications. J. Comb. Theory B Jacob Fox, János Pach, Andrew Suk
2025	J	`jnl`	Coloring Geometric Hypergraphs: A Survey. CoRR Gábor Damásdi, Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth
2025	J	`jnl`	Covering Complete Geometric Graphs by Monotone Paths. CoRR Adrian Dumitrescu, János Pach, Morteza Saghafian
2025	J	`jnl`	Decomposition of geometric graphs into star-forests. Comput. Geom. János Pach, Morteza Saghafian, Patrick Schnider
2025	A	`conf`	From Local Pair-Crossing Number to Local Crossing Number. GD Jacob Fox, János Pach, Andrew Suk
2025	A*	`conf`	Immersions and Albertson's Conjecture. SoCG Jacob Fox, János Pach, Andrew Suk
2025	J	`jnl`	Non-dissective coverings by planks. CoRR Andrey Kupavskii, János Pach
2025	J	`jnl`	Note on the Number of Almost Ordinary Triangles. CoRR Adrian Dumitrescu, János Pach
2025	J	`jnl`	On the number of edges of separated multigraphs. J. Graph Theory Jacob Fox, János Pach, Andrew Suk
2025	J	`jnl`	Ruzsa's Problem on Bi-Sidon Sets. Comb. János Pach, Dmitrii Zakharov
2025	J	`jnl`	Two Trees Are Better than One. SIAM J. Discret. Math. Adrian Dumitrescu, János Pach, Géza Tóth
2024	J	`jnl`	A Farewell to Eli Goodman. Discret. Comput. Geom. János Pach
2024	A*	`conf`	A Structure Theorem for Pseudo-Segments and Its Applications. SoCG Jacob Fox, János Pach, Andrew Suk
2024	J	`jnl`	Beyond-Planar Graphs: Models, Structures and Geometric Representations (Dagstuhl Seminar 24062). Dagstuhl Reports Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, János Pach, Henry Förster
2024	J	`jnl`	Disjointness graphs of short polygonal chains. J. Comb. Theory B János Pach, Gábor Tardos, Géza Tóth
2024	A	`conf`	Enumeration of Intersection Graphs of x-Monotone Curves. GD Jacob Fox, János Pach, Andrew Suk
2024	J	`jnl`	Foreword. Discret. Comput. Geom. Kenneth L. Clarkson, János Pach, Csaba D. Tóth
2024	A*	`conf`	Maximum Betti Numbers of Čech Complexes. SoCG Herbert Edelsbrunner, János Pach
2024	J	`jnl`	Odd-sunflowers. J. Comb. Theory, Ser. A Peter Frankl, János Pach, Dömötör Pálvölgyi
2024	A	`conf`	Partitioning Complete Geometric Graphs on Dense Point Sets into Plane Subgraphs. GD Adrian Dumitrescu, János Pach
2024	J	`jnl`	Partitioning complete geometric graphs into plane subgraphs. CoRR Adrian Dumitrescu, János Pach
2024	J	`jnl`	Quasiplanar graphs, string graphs, and the Erdős-Gallai problem. Eur. J. Comb. Jacob Fox, János Pach, Andrew Suk
2024	J	`jnl`	Random Necklaces Require Fewer Cuts. SIAM J. Discret. Math. Noga Alon, Dor Elboim, János Pach, Gábor Tardos
2024	J	`jnl`	Where Have All the Grasshoppers Gone? Am. Math. Mon. János Pach, Gábor Tardos
2023	J	`jnl`	A structure theorem for pseudo-segments and its applications. CoRR Jacob Fox, János Pach, Andrew Suk
2023	J	`jnl`	Decomposition of Geometric Graphs into Star Forests. CoRR János Pach, Morteza Saghafian, Patrick Schnider
2023	—	`conf`	Decomposition of Geometric Graphs into Star-Forests. GD (1) János Pach, Morteza Saghafian, Patrick Schnider
2023	J	`jnl`	Optimal Embedded and Enclosing Isosceles Triangles. Int. J. Found. Comput. Sci. Áron Ambrus, Mónika Csikós, Gergely Kiss, János Pach, Gábor Somlai
2023	J	`jnl`	Successive vertex orderings of fully regular graphs. J. Comb. Theory A Lixing Fang, Hao Huang, János Pach, Gábor Tardos, Junchi Zuo
2023	J	`jnl`	Sunflowers in Set Systems of Bounded Dimension. Comb. Jacob Fox, János Pach, Andrew Suk
2023	J	`jnl`	Two trees are better than one. CoRR Adrian Dumitrescu, János Pach, Géza Tóth
2022	J	`jnl`	Crossings between non-homotopic edges. J. Comb. Theory B János Pach, Gábor Tardos, Géza Tóth
2022	A*	`conf`	Disjointness Graphs of Short Polygonal Chains. SoCG János Pach, Gábor Tardos, Géza Tóth
2022	J	`jnl`	Exchange Properties of Finite Set-Systems. SIAM J. Discret. Math. Peter Frankl, János Pach, Dömötör Pálvölgyi
2022	J	`jnl`	On Well-Connected Sets of Strings. Electron. J. Comb. Peter Frankl, János Pach
2022	A	`conf`	Quasiplanar Graphs, String Graphs, and the Erdős-Gallai Problem. GD Jacob Fox, János Pach, Andrew Suk
2022	J	`jnl`	Weight balancing on boundaries. J. Comput. Geom. Luis Barba, Otfried Cheong, Michael Gene Dobbins, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, János Pach, Yuan Tang, Takeshi Tokuyama, Sander Verdonschot
2021	J	`jnl`	Bounded VC-Dimension Implies the Schur-Erdős Conjecture. Comb. Jacob Fox, János Pach, Andrew Suk
2021	J	`jnl`	Disjointness graphs of segments in the space. Comb. Probab. Comput. János Pach, Gábor Tardos, Géza Tóth
2021	J	`jnl`	Erdős-Hajnal-type results for monotone paths. J. Comb. Theory B János Pach, István Tomon
2021	A	`conf`	On the Number of Edges of Separated Multigraphs. GD Jacob Fox, János Pach, Andrew Suk
2021	J	`jnl`	On the number of edges of separated multigraphs. CoRR Jacob Fox, János Pach, Andrew Suk
2021	J	`jnl`	Quasiplanar graphs, string graphs, and the Erdős-Gallai problem. CoRR Jacob Fox, János Pach, Andrew Suk
2021	A*	`conf`	Sunflowers in Set Systems of Bounded Dimension. SoCG Jacob Fox, János Pach, Andrew Suk
2021	J	`jnl`	The number of crossings in multigraphs with no empty lens. J. Graph Algorithms Appl. Michael Kaufmann, János Pach, Géza Tóth, Torsten Ueckerdt
2020	J	`jnl`	A Crossing Lemma for Multigraphs. Discret. Comput. Geom. János Pach, Géza Tóth
2020	J	`jnl`	A Farewell to Ricky Pollack. Discret. Comput. Geom. János Pach
2020	J	`jnl`	Almost All String Graphs are Intersection Graphs of Plane Convex Sets. Discret. Comput. Geom. János Pach, Bruce A. Reed, Yelena Yuditsky
2020	A*	`conf`	Bounded VC-Dimension Implies the Schur-Erdős Conjecture. SoCG Jacob Fox, János Pach, Andrew Suk
2020	A	`conf`	Crossings Between Non-homotopic Edges. GD János Pach, Gábor Tardos, Géza Tóth
2020	J	`jnl`	Large Homogeneous Submatrices. SIAM J. Discret. Math. Dániel Korándi, János Pach, István Tomon
2020	J	`jnl`	Minimum Area Isosceles Containers. J. Inf. Process. Gergely Kiss, János Pach, Gábor Somlai
2020	J	`jnl`	On the chromatic number of disjointness graphs of curves. J. Comb. Theory B János Pach, István Tomon
2019	J	`jnl`	A lower bound on opaque sets. Comput. Geom. Akitoshi Kawamura, Sonoko Moriyama, Yota Otachi, János Pach
2019	J	`jnl`	Approximating the rectilinear crossing number. Comput. Geom. Jacob Fox, János Pach, Andrew Suk
2019	J	`jnl`	Beyond-Planar Graphs: Combinatorics, Models and Algorithms (Dagstuhl Seminar 19092). Dagstuhl Reports Seok-Hee Hong, Michael Kaufmann, János Pach, Csaba D. Tóth
2019	A	`conf`	Coloring Hasse Diagrams and Disjointness Graphs of Curves. GD János Pach, István Tomon
2019	J	`jnl`	Erdős-Hajnal Conjecture for Graphs with Bounded VC-Dimension. Discret. Comput. Geom. Jacob Fox, János Pach, Andrew Suk
2019	J	`jnl`	Many touchings force many crossings. J. Comb. Theory B János Pach, Géza Tóth
2019	A*	`conf`	On the Chromatic Number of Disjointness Graphs of Curves. SoCG János Pach, István Tomon
2019	J	`jnl`	On the Size of K-Cross-Free Families. Comb. Andrey Kupavskii, János Pach, István Tomon
2019	J	`jnl`	Ordered graphs and large bi-cliques in intersection graphs of curves. Eur. J. Comb. János Pach, István Tomon
2019	J	`jnl`	Planar Point Sets Determine Many Pairwise Crossing Segments. CoRR János Pach, Natan Rubin, Gábor Tardos
2019	A*	`conf`	Planar point sets determine many pairwise crossing segments. STOC János Pach, Natan Rubin, Gábor Tardos
2019	A*	`conf`	Semi-Algebraic Colorings of Complete Graphs. SoCG Jacob Fox, János Pach, Andrew Suk
2019	J	`jnl`	Thrackles: An improved upper bound. Discret. Appl. Math. Radoslav Fulek, János Pach
2018	A*	`conf`	A Crossing Lemma for Multigraphs. SoCG János Pach, Géza Tóth
2018	J	`jnl`	A stability theorem on cube tessellations. J. Comput. Geom. János Pach, Peter Frankl
2018	A*	`conf`	Almost All String Graphs are Intersection Graphs of Plane Convex Sets. SoCG János Pach, Bruce A. Reed, Yelena Yuditsky
2018	J	`jnl`	Almost all string graphs are intersection graphs of plane convex sets. CoRR János Pach, Bruce A. Reed, Yelena Yuditsky
2018	J	`jnl`	More Distinct Distances Under Local Conditions. Comb. Jacob Fox, János Pach, Andrew Suk
2018	J	`jnl`	Note on k-planar crossing numbers. Comput. Geom. János Pach, László A. Székely, Csaba D. Tóth, Géza Tóth
2018	J	`jnl`	Ramsey-Turán Numbers for Semi-Algebraic Graphs. Electron. J. Comb. Jacob Fox, János Pach, Andrew Suk
2018	A	`conf`	The Number of Crossings in Multigraphs with No Empty Lens. GD Michael Kaufmann, János Pach, Géza Tóth, Torsten Ueckerdt
2018	J	`jnl`	The number of crossings in multigraphs with no empty lens. CoRR Michael Kaufmann, János Pach, Géza Tóth, Torsten Ueckerdt
2018	J	`jnl`	Tilings with noncongruent triangles. Eur. J. Comb. Andrey Kupavskii, János Pach, Gábor Tardos
2017	J	`jnl`	A Crossing Lemma for Jordan Curves. CoRR János Pach, Natan Rubin, Gábor Tardos
2017	J	`jnl`	Controlling Lipschitz functions. CoRR Andrey Kupavskii, János Pach, Gábor Tardos
2017	J	`jnl`	Decomposition of a Cube into Nearly Equal Smaller Cubes. Am. Math. Mon. Peter Frankl, Amram Meir, János Pach
2017	A*	`conf`	Disjointness Graphs of Segments. SoCG János Pach, Gábor Tardos, Géza Tóth
2017	J	`jnl`	Distinct Distances on Algebraic Curves in the Plane. Comb. Probab. Comput. János Pach, Frank de Zeeuw
2017	A*	`conf`	Erdös-Hajnal Conjecture for Graphs with Bounded VC-Dimension. SoCG Jacob Fox, János Pach, Andrew Suk
2017	J	`jnl`	From Tarski's Plank Problem to Simultaneous Approximation. Am. Math. Mon. Andrey Kupavskii, János Pach
2017	A	`conf`	Many Touchings Force Many Crossings. GD János Pach, Géza Tóth
2017	A	`conf`	Thrackles: An Improved Upper Bound. GD Radoslav Fulek, János Pach
2017	J	`jnl`	Tilings of the plane with unit area triangles of bounded diameter. CoRR Andrey Kupavskii, János Pach, Gábor Tardos
2017	J	`jnl`	Tilings with noncongruent triangles. CoRR Andrey Kupavskii, János Pach, Gábor Tardos
2016	A*	`conf`	A Lower Bound on Opaque Sets. SoCG Akitoshi Kawamura, Sonoko Moriyama, Yota Otachi, János Pach
2016	J	`jnl`	A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing. SIAM J. Comput. Jacob Fox, János Pach, Andrew Suk
2016	A	`conf`	Approximating the Rectilinear Crossing Number. GD Jacob Fox, János Pach, Andrew Suk
2016	J	`jnl`	Approximating the rectilinear crossing number. CoRR Jacob Fox, János Pach, Andrew Suk
2016	A*	`conf`	Beyond the Richter-Thomassen Conjecture. SODA János Pach, Natan Rubin, Gábor Tardos
2016	J	`jnl`	Beyond-Planar Graphs: Algorithmics and Combinatorics (Dagstuhl Seminar 16452). Dagstuhl Reports Seok-Hee Hong, Michael Kaufmann, Stephen G. Kobourov, János Pach
2016	J	`jnl`	Decomposition of Multiple Packings with Subquadratic Union Complexity. Comb. Probab. Comput. János Pach, Bartosz Walczak
2016	J	`jnl`	Guest Editors' Foreword. Discret. Comput. Geom. Lars Arge, János Pach
2016	A*	`conf`	New Lower Bounds for epsilon-Nets. SoCG Andrey Kupavskii, Nabil H. Mustafa, János Pach
2016	J	`jnl`	On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves. Comb. Probab. Comput. János Pach, Natan Rubin, Gábor Tardos
2016	J	`jnl`	On the Zarankiewicz problem for intersection hypergraphs. J. Comb. Theory A Nabil H. Mustafa, János Pach
2016	J	`jnl`	Separation with restricted families of sets. J. Comb. Theory A Zsolt Lángi, Márton Naszódi, János Pach, Gábor Tardos, Géza Tóth
2016	J	`jnl`	Thirtieth Anniversary Note from the Editors in Chief. Discret. Comput. Geom. Kenneth L. Clarkson, János Pach, Günter M. Ziegler
2015	A*	`ed.`	31st International Symposium on Computational Geometry, SoCG 2015, Eindhoven, The Netherlands, June 22-25, 2015 SoCG Lars Arge, János Pach
2015	J	`jnl`	A Precise Threshold for Quasi-Ramsey Numbers. SIAM J. Discret. Math. Ross J. Kang, János Pach, Viresh Patel, Guus Regts
2015	J	`jnl`	A polynomial regularity lemma for semi-algebraic hypergraphs and its applications in geometry and property testing. CoRR Jacob Fox, János Pach, Andrew Suk
2015	J	`jnl`	Beyond the Richter-Thomassen Conjecture. CoRR János Pach, Natan Rubin, Gábor Tardos
2015	J	`jnl`	Cross-Intersecting Families of Vectors. Graphs Comb. János Pach, Gábor Tardos
2015	A*	`conf`	Density and regularity theorems for semi-algebraic hypergraphs. SODA Jacob Fox, János Pach, Andrew Suk
2015	J	`jnl`	Every graph admits an unambiguous bold drawing. J. Graph Algorithms Appl. János Pach
2015	J	`jnl`	From Tarski's plank problem to simultaneous approximation. CoRR Andrey B. Kupavskii, János Pach
2015	A*	`conf`	On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves. SODA János Pach, Natan Rubin, Gábor Tardos
2015	A	`conf`	On the Zarankiewicz Problem for Intersection Hypergraphs. GD Nabil H. Mustafa, János Pach
2015	J	`jnl`	Remarks on Schur's conjecture. Comput. Geom. Filip Moric, János Pach
2015	J	`jnl`	Saturated simple and k-simple topological graphs. Comput. Geom. Jan Kyncl, János Pach, Rados Radoicic, Géza Tóth
2015	J	`jnl`	Semi-algebraic colorings of complete graphs. CoRR Jacob Fox, János Pach, Andrew Suk
2015	—	`conf`	Simultaneous Approximation of Polynomials. JCDCGG Andrei Kupavskii, János Pach
2015	J	`jnl`	The Erdős-Hajnal conjecture for rainbow triangles. J. Comb. Theory B Jacob Fox, Andrey Grinshpun, János Pach
2015	B	`conf`	Unsplittable Coverings in the Plane. WG János Pach, Dömötör Pálvölgyi
2015	J	`jnl`	Weight Balancing on Boundaries and Skeletons. CoRR Luis Barba, Otfried Cheong, Jean-Lou De Carufel, Michael Gene Dobbins, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, János Pach, Yuan Tang, Takeshi Tokuyama, Sander Verdonschot, Tianhao Wang
2014	J	`jnl`	A Note on Coloring Line Arrangements. Electron. J. Comb. Eyal Ackerman, János Pach, Rom Pinchasi, Rados Radoicic, Géza Tóth
2014	J	`jnl`	A lower bound on opaque sets. CoRR Akitoshi Kawamura, Sonoko Moriyama, Yota Otachi, János Pach
2014	J	`jnl`	Applications of a New Separator Theorem for String Graphs. Comb. Probab. Comput. Jacob Fox, János Pach
2014	A*	`conf`	Distinct distances on algebraic curves in the plane. SoCG János Pach, Frank de Zeeuw
2014	J	`jnl`	Homogeneous selections from hyperplanes. J. Comb. Theory B Imre Bárány, János Pach
2014	J	`jnl`	On grids in topological graphs. Comput. Geom. Eyal Ackerman, Jacob Fox, János Pach, Andrew Suk
2014	J	`jnl`	On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves. CoRR János Pach, Natan Rubin, Gábor Tardos
2014	J	`jnl`	On the Upward Planarity of Mixed Plane Graphs. J. Graph Algorithms Appl. Fabrizio Frati, Michael Kaufmann, János Pach, Csaba D. Tóth, David R. Wood
2014	J	`jnl`	Opaque Sets. Algorithmica Adrian Dumitrescu, Minghui Jiang, János Pach
2014	J	`jnl`	The visible perimeter of an arrangement of disks. Comput. Geom. Gabriel Nivasch, János Pach, Gábor Tardos
2014	A*	`conf`	Weight Balancing on Boundaries and Skeletons. SoCG Luis Barba, Otfried Cheong, Jean-Lou De Carufel, Michael Gene Dobbins, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, János Pach, Yuan Tang, Takeshi Tokuyama, Sander Verdonschot, Tianhao Wang
2013	—	`ch.`	A Remark on Transversal Numbers. The Mathematics of Paul Erdős I János Pach
2013	J	`jnl`	Applications of a new separator theorem for string graphs CoRR Jacob Fox, János Pach
2013	—	`conf`	Cross-Intersecting Families of Vectors. JCDCGG János Pach, Gábor Tardos
2013	J	`jnl`	Decomposition of multiple packings with subquadratic union complexity. CoRR János Pach, Bartosz Walczak
2013	J	`jnl`	Drawing Planar Graphs of Bounded Degree with Few Slopes. SIAM J. Discret. Math. Balázs Keszegh, János Pach, Dömötör Pálvölgyi
2013	J	`jnl`	Monochromatic empty triangles in two-colored point sets. Discret. Appl. Math. János Pach, Géza Tóth
2013	J	`jnl`	On Schur's conjecture. Electron. Notes Discret. Math. Filip Moric, János Pach
2013	J	`jnl`	On the Queue Number of Planar Graphs. SIAM J. Comput. Giuseppe Di Battista, Fabrizio Frati, János Pach
2013	A	`conf`	On the Upward Planarity of Mixed Plane Graphs. GD Fabrizio Frati, Michael Kaufmann, János Pach, Csaba D. Tóth, David R. Wood
2013	A*	`conf`	Ramsey-type results for semi-algebraic relations. SoCG David Conlon, Jacob Fox, János Pach, Benny Sudakov, Andrew Suk
2013	J	`jnl`	The Number of Edges in k-Quasi-planar Graphs. SIAM J. Discret. Math. Jacob Fox, János Pach, Andrew Suk
2013	J	`jnl`	The Range of a Random Walk on a Comb. Electron. J. Comb. János Pach, Gábor Tardos
2013	J	`jnl`	The number of distinct distances from a vertex of a convex polygon. J. Comput. Geom. Gabriel Nivasch, János Pach, Rom Pinchasi, Shira Zerbib
2012	J	`jnl`	Coloring K Eur. J. Comb. Jacob Fox, János Pach
2012	J	`jnl`	Drawing Hamiltonian Cycles with no Large Angles. Electron. J. Comb. Adrian Dumitrescu, János Pach, Géza Tóth
2012	B	`conf`	How Many Potatoes Are in a Mesh? ISAAC Marc J. van Kreveld, Maarten Löffler, János Pach
2012	J	`jnl`	How Many Potatoes are in a Mesh? CoRR Marc J. van Kreveld, Maarten Löffler, János Pach
2012	J	`jnl`	Lower Bounds on the Obstacle Number of Graphs. Electron. J. Comb. Padmini Mukkamala, János Pach, Dömötör Pálvölgyi
2012	J	`jnl`	Piercing quasi-rectangles - On a problem of Danzer and Rogers. J. Comb. Theory A János Pach, Gábor Tardos
2012	—	`conf`	Remarks on Schur's Conjecture. TJJCCGG Filip Moric, János Pach
2012	J	`jnl`	Remarks on a Ramsey theory for trees. Comb. János Pach, Gábor Tardos, József Solymosi
2012	—	`conf`	String graphs and incomparability graphs. SCG Jacob Fox, János Pach
2012	J	`jnl`	Tangencies between families of disjoint regions in the plane. Comput. Geom. János Pach, Andrew Suk, Miroslav Treml
2012	A	`conf`	The Visible Perimeter of an Arrangement of Disks. GD Gabriel Nivasch, János Pach, Gábor Tardos
2012	J	`jnl`	The number of distinct distances from a vertex of a convex polygon CoRR Gabriel Nivasch, János Pach, Rom Pinchasi, Shira Zerbib
2012	J	`jnl`	The visible perimeter of an arrangement of disks CoRR Gabriel Nivasch, János Pach, Gábor Tardos
2011	J	`jnl`	A computational approach to Conway's thrackle conjecture. Comput. Geom. Radoslav Fulek, János Pach
2011	A*	`conf`	Computing the Independence Number of Intersection Graphs. SODA Jacob Fox, János Pach
2011	J	`jnl`	Conway's Conjecture for Monotone Thrackles. Am. Math. Mon. János Pach, Ethan Sterling
2011	J	`jnl`	Disjoint homometric sets in graphs. Ars Math. Contemp. Michael O. Albertson, János Pach, Michael E. Young
2011	A	`conf`	Every Graph Admits an Unambiguous Bold Drawing. GD János Pach
2011	J	`jnl`	Intersection patterns of curves. J. Lond. Math. Soc. Jacob Fox, János Pach, Csaba D. Tóth
2011	J	`jnl`	Letter from the New Editors-in-Chief. Discret. Comput. Geom. Herbert Edelsbrunner, János Pach, Günter M. Ziegler
2011	J	`jnl`	Lower bounds on the obstacle number of graphs CoRR Padmini Mukkamala, János Pach, Dömötör Pálvölgyi
2011	J	`jnl`	Minimum Clique Partition in Unit Disk Graphs. Graphs Comb. Adrian Dumitrescu, János Pach
2011	A	`conf`	Monotone Crossing Number. GD János Pach, Géza Tóth
2011	J	`jnl`	On the Structure of Graphs with Low Obstacle Number. Graphs Comb. János Pach, Deniz Sariöz
2011	—	`conf`	Opaque Sets. APPROX-RANDOM Adrian Dumitrescu, Minghui Jiang, János Pach
2011	A*	`conf`	Overlap properties of geometric expanders. SODA Jacob Fox, Mikhail Gromov, Vincent Lafforgue, Assaf Naor, János Pach
2011	B	`conf`	Piercing Quasi-Rectangles: On a Problem of Danzer and Rogers. WADS János Pach, Gábor Tardos
2011	—	`conf`	Tangled Thrackles. EGC János Pach, Rados Radoicic, Géza Tóth
2011	J	`jnl`	The number of edges in k-quasi-planar graphs CoRR Jacob Fox, János Pach, Andrew Suk
2011	—	`conf`	Tight lower bounds for the size of epsilon-nets. SCG János Pach, Gábor Tardos
2010	J	`jnl`	"square trisection". dissection of a square in three congruent partitions. Bull. dInformatique Approfondie et Appl. Christian Blanvillain, János Pach
2010	A	`conf`	A Computational Approach to Conway's Thrackle Conjecture. GD Radoslav Fulek, János Pach
2010	J	`jnl`	A Separator Theorem for String Graphs and its Applications. Comb. Probab. Comput. Jacob Fox, János Pach
2010	J	`jnl`	A bipartite strengthening of the Crossing Lemma. J. Comb. Theory B Jacob Fox, János Pach, Csaba D. Tóth
2010	J	`jnl`	Coloring axis-parallel rectangles. J. Comb. Theory A János Pach, Gábor Tardos
2010	J	`jnl`	Crossing numbers of imbalanced graphs. J. Graph Theory János Pach, József Solymosi, Gábor Tardos
2010	B	`conf`	Crossings between Curves with Many Tangencies. WALCOM Jacob Fox, Fabrizio Frati, János Pach, Rom Pinchasi
2010	J	`jnl`	Cubic graphs have bounded slope parameter. J. Graph Algorithms Appl. Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth
2010	A	`conf`	Drawing Planar Graphs of Bounded Degree with Few Slopes. GD Balázs Keszegh, János Pach, Dömötör Pálvölgyi
2010	J	`jnl`	Drawing planar graphs of bounded degree with few slopes CoRR Balázs Keszegh, János Pach, Dömötör Pálvölgyi
2010	B	`conf`	Graphs with Large Obstacle Numbers. WG Padmini Mukkamala, János Pach, Deniz Sariöz
2010	A*	`conf`	On the Queue Number of Planar Graphs. FOCS Giuseppe Di Battista, Fabrizio Frati, János Pach
2010	J	`jnl`	Opaque sets CoRR Adrian Dumitrescu, János Pach
2010	J	`jnl`	Overlap properties of geometric expanders CoRR Jacob Fox, Mikhail Gromov, Vincent Lafforgue, Assaf Naor, János Pach
2010	J	`jnl`	Small (2,s)-colorable graphs without 1-obstacle representations CoRR János Pach, Deniz Sariöz
2010	—	`conf`	Tangencies between families of disjoint regions in the plane. SCG János Pach, Andrew Suk, Miroslav Treml
2010	J	`jnl`	Tight lower bounds for the size of epsilon-nets CoRR János Pach, Gábor Tardos
2009	B	`conf`	A Separator Theorem for String Graphs and Its Applications. WALCOM Jacob Fox, János Pach
2009	J	`jnl`	A bipartite analogue of Dilworth's theorem for multiple partial orders. Eur. J. Comb. Jacob Fox, János Pach
2009	J	`jnl`	Conflict-Free Colourings of Graphs and Hypergraphs. Comb. Probab. Comput. János Pach, Gábor Tardos
2009	J	`jnl`	Decomposition of multiple coverings into many parts. Comput. Geom. János Pach, Géza Tóth
2009	J	`jnl`	Degenerate Crossing Numbers. Discret. Comput. Geom. János Pach, Géza Tóth
2009	J	`jnl`	Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles. Random Struct. Algorithms Xiaomin Chen, János Pach, Mario Szegedy, Gábor Tardos
2009	A	`conf`	Drawing Hamiltonian Cycles with No Large Angles. GD Adrian Dumitrescu, János Pach, Géza Tóth
2009	J	`jnl`	Intersecting Convex Sets by Rays. Discret. Comput. Geom. Radoslav Fulek, Andreas F. Holmsen, János Pach
2009	J	`jnl`	Minimum clique partition in unit disk graphs CoRR Adrian Dumitrescu, János Pach
2009	J	`jnl`	On Regular Vertices of the Union of Planar Convex Objects. Discret. Comput. Geom. Esther Ezra, János Pach, Micha Sharir
2009	—	`conf`	On grids in topological graphs. SCG Eyal Ackerman, Jacob Fox, János Pach, Andrew Suk
2009	A	`conf`	Why Are String Graphs So Beautiful? GD János Pach
2008	—	`conf`	Coloring SCG Jacob Fox, János Pach
2008	J	`jnl`	Convexly Independent Subsets of the Minkowski Sum of Planar Point Sets. Electron. J. Comb. Friedrich Eisenbrand, János Pach, Thomas Rothvoß, Nir B. Sopher
2008	A	`conf`	Cubic Graphs Have Bounded Slope Parameter. GD Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth
2008	A*	`conf`	Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles. SODA Xiaomin Chen, János Pach, Mario Szegedy, Gábor Tardos
2008	J	`jnl`	Drawing cubic graphs with at most five slopes. Comput. Geom. Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth
2008	J	`jnl`	Foreword. Discret. Comput. Geom. Jacob E. Goodman, János Pach, Richard Pollack
2008	J	`jnl`	Guest Editors' Foreword. Discret. Math. Zoltán Füredi, Ervin Györi, János Pach, Attila Sali
2008	—	`conf`	Intersecting convex sets by rays. SCG Radoslav Fulek, Andreas F. Holmsen, János Pach
2008	J	`jnl`	Long alternating paths in bicolored point sets. Discret. Math. Jan Kyncl, János Pach, Géza Tóth
2008	J	`jnl`	On Simplices Embracing a Point. Electron. Notes Discret. Math. János Pach
2008	J	`jnl`	On planar intersection graphs with forbidden subgraphs. J. Graph Theory János Pach, Micha Sharir
2008	J	`jnl`	Points surrounding the origin. Comb. Andreas F. Holmsen, János Pach, Helge Tverberg
2008	J	`jnl`	Reconfigurations in Graphs and Grids. SIAM J. Discret. Math. Gruia Calinescu, Adrian Dumitrescu, János Pach
2008	J	`jnl`	Sliding Disks in the Plane. Int. J. Comput. Geom. Appl. Sergey Bereg, Adrian Dumitrescu, János Pach
2007	A	`conf`	A Bipartite Strengthening of the Crossing Lemma. GD Jacob Fox, János Pach, Csaba D. Tóth
2007	—	`conf`	Coloring Axis-Parallel Rectangles. KyotoCGGT János Pach, Gábor Tardos
2007	—	`conf`	Decomposition of multiple coverings into many parts. SCG János Pach, Géza Tóth
2007	J	`jnl`	Foreword. Discret. Comput. Geom. Imre Bárány, János Pach
2007	J	`jnl`	Guest Editors' Foreword. Algorithmica János Pach, Farhad Shahrokhi
2007	—	`conf`	On regular vertices on the union of planar objects. SCG Esther Ezra, János Pach, Micha Sharir
2007	J	`jnl`	Online Conflict-Free Coloring for Intervals. SIAM J. Comput. Ke Chen, Amos Fiat, Haim Kaplan, Meital Levy, Jirí Matousek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl
2007	J	`jnl`	Opposite-Quadrant Depth in the Plane. Graphs Comb. Hervé Brönnimann, Jonathan Lenchner, János Pach
2007	J	`jnl`	Solution of Scott's Problem on the Number of Directions Determined by a Point Set in 3-Space. Discret. Comput. Geom. János Pach, Rom Pinchasi, Micha Sharir
2006	J	`jnl`	Bounded-Degree Graphs can have Arbitrarily Large Slope Numbers. Electron. J. Comb. János Pach, Dömötör Pálvölgyi
2006	—	`conf`	Degenerate crossing numbers. SCG János Pach, Géza Tóth
2006	A	`conf`	Drawing Cubic Graphs with at Most Five Slopes. GD Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth
2006	J	`jnl`	How Many Ways Can One Draw A Graph? Comb. János Pach, Géza Tóth
2006	J	`jnl`	Improving the Crossing Lemma by Finding More Crossings in Sparse Graphs. Discret. Comput. Geom. János Pach, Rados Radoicic, Gábor Tardos, Géza Tóth
2006	J	`jnl`	Nearly equal distances and Szemerédi's regularity lemma. Comput. Geom. János Pach, Rados Radoicic, Jan Vondrák
2006	J	`jnl`	On the diameter of separated point sets with many nearly equal distances. Eur. J. Comb. János Pach, Rados Radoicic, Jan Vondrák
2006	J	`jnl`	Planar Crossing Numbers of Graphs Embeddable in Another Surface. Int. J. Found. Comput. Sci. Károly J. Böröczky, János Pach, Géza Tóth
2006	J	`jnl`	Pushing Squares Around. Graphs Comb. Adrian Dumitrescu, János Pach
2006	B	`conf`	Reconfigurations in Graphs and Grids. LATIN Gruia Calinescu, Adrian Dumitrescu, János Pach
2005	A	`conf`	Crossing Number of Toroidal Graphs. GD János Pach, Géza Tóth
2005	J	`jnl`	Crossing patterns of semi-algebraic sets. J. Comb. Theory A Noga Alon, János Pach, Rom Pinchasi, Rados Radoicic, Micha Sharir
2005	—	`conf`	Forbidden patterns and unit distances. SCG János Pach, Gábor Tardos
2005	J	`jnl`	Guest Editor's Foreword. J. Graph Algorithms Appl. Emden R. Gansner, János Pach
2005	—	`conf`	Indecomposable Coverings. CJCDGCGT János Pach, Gábor Tardos, Géza Tóth
2005	A*	`conf`	Online conflict-free coloring for intervals. SODA Amos Fiat, Meital Levy, Jirí Matousek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl
2005	—	`book`	Research problems in discrete geometry. Peter Brass, William O. J. Moser, János Pach
2005	J	`jnl`	Topological Graphs with No Large Grids. Graphs Comb. János Pach, Rom Pinchasi, Micha Sharir, Géza Tóth
2004	J	`jnl`	Distinct Distances in Three and Higher Dimensions. Comb. Probab. Comput. Boris Aronov, János Pach, Micha Sharir, Gábor Tardos
2004	—	`ch.`	Finite Point Configurations. Handbook of Discrete and Computational Geometry, 2nd Ed. János Pach
2004	—	`ch.`	Geometric Graph Theory. Handbook of Discrete and Computational Geometry, 2nd Ed. János Pach
2004	J	`jnl`	Geometric graphs with no self-intersecting path of length three. Eur. J. Comb. János Pach, Rom Pinchasi, Gábor Tardos, Géza Tóth
2004	A	`ed.`	Graph Drawing, 12th International Symposium, GD 2004, New York, NY, USA, September 29 - October 2, 2004, Revised Selected Papers GD János Pach
2004	—	`conf`	Improving the crossing lemma by finding more crossings in sparse graphs: [extended abstract]. SCG János Pach, Rados Radoicic, Gábor Tardos, Géza Tóth
2004	J	`jnl`	Lenses in arrangements of pseudo-circles and their applications. J. ACM Pankaj K. Agarwal, Eran Nevo, János Pach, Rom Pinchasi, Micha Sharir, Shakhar Smorodinsky
2004	A	`conf`	Long Alternating Paths in Bicolored Point Sets. GD Jan Kyncl, János Pach, Géza Tóth
2004	J	`jnl`	Monotone drawings of planar graphs. J. Graph Theory János Pach, Géza Tóth
2004	J	`jnl`	On the number of directions determined by a three-dimensional points set. J. Comb. Theory A János Pach, Rom Pinchasi, Micha Sharir
2004	—	`conf`	Pushing squares around. SCG Adrian Dumitrescu, János Pach
2004	—	`conf`	Sliding Disks in the Plane. JCDCG Sergey Bereg, Adrian Dumitrescu, János Pach
2004	—	`conf`	Solution of Scott's problem on the number of directions determined by a point set in 3-space. SCG János Pach, Rom Pinchasi, Micha Sharir
2003	—	`conf`	A tight bound for the number of different directions in three dimensions. SCG János Pach, Rom Pinchasi, Micha Sharir
2003	—	`conf`	Disjoint Edges in Topological Graphs. IJCCGGT János Pach, Géza Tóth
2003	A*	`conf`	Distinct distances in three and higher dimensions. STOC Boris Aronov, János Pach, Micha Sharir, Gábor Tardos
2003	J	`jnl`	How Many Unit Equilateral Triangles Can Be Generated by N Points in Convex Position? Am. Math. Mon. János Pach, Rom Pinchasi
2003	A	`conf`	How Many Ways Can One Draw a Graph? GD János Pach, Géza Tóth
2003	J	`jnl`	The Union of Congruent Cubes in Three Dimensions. Discret. Comput. Geom. János Pach, Ido Safruti, Micha Sharir
2003	J	`jnl`	Unavoidable Configurations in Complete Topological Graphs. Discret. Comput. Geom. János Pach, József Solymosi, Géza Tóth
2002	J	`jnl`	Covering lattice points by subspaces. Period. Math. Hung. Imre Bárány, Gergely Harcos, János Pach, Gábor Tardos
2002	A	`conf`	Geometric Graphs with No Self-intersecting Path of Length Three. GD János Pach, Rom Pinchasi, Gábor Tardos, Géza Tóth
2002	J	`jnl`	Isosceles Triangles Determined by a Planar Point Set. Graphs Comb. János Pach, Gábor Tardos
2002	—	`conf`	Lenses in arrangements of pseudo-circles and their applications. SCG Eran Nevo, János Pach, Rom Pinchasi, Micha Sharir, Shakhar Smorodinsky
2002	B	`conf`	Monotone Drawings of Planar Graphs. ISAAC János Pach, Géza Tóth
2002	J	`jnl`	On the Boundary Complexity of the Union of Fat Triangles. SIAM J. Comput. János Pach, Gábor Tardos
2002	J	`jnl`	Partitioning Colored Point Sets into Monochromatic Parts. Int. J. Comput. Geom. Appl. Adrian Dumitrescu, János Pach
2002	J	`jnl`	Recognizing String Graphs Is Decidable. Discret. Comput. Geom. János Pach, Géza Tóth
2002	—	`conf`	Relaxing Planarity for Topological Graphs. JCDCG János Pach, Rados Radoicic, Géza Tóth
2002	J	`jnl`	Untangling a Polygon. Discret. Comput. Geom. János Pach, Gábor Tardos
2001	J	`jnl`	Common Tangents to Four Unit Balls in Discret. Comput. Geom. I. G. MacDonald, János Pach, Thorsten Theobald
2001	J	`jnl`	Crossing Patterns of Segments. J. Comb. Theory A János Pach, József Solymosi
2001	J	`jnl`	Embedding Planar Graphs at Fixed Vertex Locations. Graphs Comb. János Pach, Rephael Wenger
2001	J	`jnl`	On the Number of Balanced Lines. Discret. Comput. Geom. János Pach, Rom Pinchasi
2001	B	`conf`	Partitioning Colored Point Sets into Monochromatic Parts. WADS Adrian Dumitrescu, János Pach
2001	J	`jnl`	Radial Points in the Plane. Eur. J. Comb. János Pach, Micha Sharir
2001	J	`jnl`	Ramsey-type Theorems with Forbidden Subgraphs. Comb. Noga Alon, János Pach, József Solymosi
2001	A	`conf`	Recognizing String Graphs Is Decidable. GD János Pach, Géza Tóth
2001	J	`jnl`	Separating convex sets by straight lines. Discret. Math. János Pach, Gábor Tardos
2001	J	`jnl`	The Maximum Number of Times the Same Distance Can Occur among the Vertices of a Convex n-gon Is O(n log n). J. Comb. Theory A Peter Braß, János Pach
2001	—	`conf`	The union of congruent cubes in three dimensions. SCG János Pach, Ido Safruti, Micha Sharir
2001	A	`conf`	Untangling a Polygon. GD János Pach, Gábor Tardos
2000	J	`jnl`	Bichromatic Lines with Few Points. J. Comb. Theory A János Pach, Rom Pinchasi
2000	J	`jnl`	Cellular telephone networks and random maps in hypergraphs. Discret. Appl. Math. Ariel Halpert, Flórián Lengyel, János Pach
2000	J	`jnl`	Cutting Glass. Discret. Comput. Geom. János Pach, Gábor Tardos
2000	—	`conf`	Cutting glass. SCG János Pach, Gábor Tardos
2000	J	`jnl`	New Bounds on Crossing Numbers. Discret. Comput. Geom. János Pach, Joel Spencer, Géza Tóth
2000	—	`conf`	On the Complexity of the Union of Geometric Objects. JCDCG János Pach
2000	A*	`conf`	On the boundary complexity of the union of fat triangles. FOCS János Pach, Gábor Tardos
2000	—	`conf`	Structure Theorems for Systems of Segments. JCDCG János Pach, József Solymosi
2000	A	`conf`	Unavoidable Configurations in Complete Topological Graphs. GD János Pach, Géza Tóth
2000	J	`jnl`	Which Crossing Number Is It Anyway? J. Comb. Theory B János Pach, Géza Tóth
1999	—	`ch.`	Discrete And Computational Geometry. Handbook of Discrete and Combinatorial Mathematics Ileana Streinu, Károly Bezdek, János Pach, Tamal K. Dey, Jianer Chen, Dina Kravets, Nancy M. Amato, W. Randolph Franklin
1999	—	`conf`	New Bounds on Crossing Numbers. SCG János Pach, Joel Spencer, Géza Tóth
1999	J	`jnl`	On the Boundary of the Union of Planar Convex Sets. Discret. Comput. Geom. János Pach, Micha Sharir
1999	J	`jnl`	Popular distances in 3-space. Discret. Math. Paul Erdös, Gergely Harcos, János Pach
1999	J	`jnl`	Uniformly Distributed Distances - a Geometric Application of Janson's Inequality. Comb. János Pach, Joel Spencer
1998	J	`jnl`	A Generalization of the Erdos - Szekeres Theorem to Disjoint Convex Sets. Discret. Comput. Geom. János Pach, Géza Tóth
1998	J	`jnl`	A Tverberg-type result on multicolored simplices. Comput. Geom. János Pach
1998	J	`jnl`	Canonical Theorems for Convex Sets. Discret. Comput. Geom. János Pach, József Solymosi
1998	—	`conf`	Crossing Numbers. JCDCG János Pach
1998	A	`conf`	Embedding Planar Graphs at Fixed Vertex Locations. GD János Pach, Rephael Wenger
1998	J	`jnl`	Extremal Problems for Geometric Hypergraphs. Discret. Comput. Geom. Tamal K. Dey, János Pach
1998	J	`jnl`	Guest Editor's Foreword. Discret. Comput. Geom. János Pach
1998	J	`jnl`	On circumscribing polygons for line segments. Comput. Geom. János Pach, Eduardo Rivera-Campo
1998	J	`jnl`	On the Number of Incidences Between Points and Curves. Comb. Probab. Comput. János Pach, Micha Sharir
1998	J	`jnl`	Ramsey-Type Results for Geometric Graphs, II. Discret. Comput. Geom. Gyula Károlyi, János Pach, Géza Tóth, Pavel Valtr
1998	A*	`conf`	Which Crossing Number is it, Anyway? FOCS János Pach, Géza Tóth
1997	J	`jnl`	Graphs Drawn with Few Crossings per Edge. Comb. János Pach, Géza Tóth
1997	J	`jnl`	On Conway's Thrackle Conjecture. Discret. Comput. Geom. László Lovász, János Pach, Mario Szegedy
1997	J	`jnl`	Quasi-Planar Graphs Have a Linear Number of Edges. Comb. Pankaj K. Agarwal, Boris Aronov, János Pach, Richard Pollack, Micha Sharir
1997	—	`conf`	Ramsey-Type Results for Geometric Graphs II. SCG Gyula Károlyi, János Pach, Géza Tóth, Pavel Valtr
1997	J	`jnl`	Ramsey-Type Results for Geometric Graphs, I. Discret. Comput. Geom. Gyula Károlyi, János Pach, Géza Tóth
1997	A	`conf`	Three-dimensional Grid Drawings of Graphs. GD János Pach, Torsten Thiele, Géza Tóth
1996	J	`jnl`	Applications of the Crossing Number. Algorithmica János Pach, Farhad Shahrokhi, Mario Szegedy
1996	B	`conf`	Extremal Problems for Geometric Hypergraphs. ISAAC Tamal K. Dey, János Pach
1996	A	`conf`	Graphs Drawn with Few Crossings Per Edge. GD János Pach, Géza Tóth
1996	—	`conf`	Ramsey-Type Results for Geometric Graphs. SCG Gyula Károlyi, János Pach, Géza Tóth
1995	J	`jnl`	A Left-First Search Algorithm for Planar Graphs. Discret. Comput. Geom. Hubert de Fraysseix, Patrice Ossona de Mendez, János Pach
1995	—	`book`	Combinatorial geometry. János Pach, Pankaj K. Agarwal
1995	J	`jnl`	Guest Editor's Forword. Discret. Comput. Geom. Imre Bárány, János Pach
1995	—	`conf`	On Conway's Thrackle Conjecture. SCG László Lovász, János Pach, Mario Szegedy
1995	A	`conf`	Quasi-Planar Graphs Have a Linear Number of Edges. GD Pankaj K. Agarwal, Boris Aronov, János Pach, Richard Pollack, Micha Sharir
1994	—	`conf`	Applications of the Crossing Number. SCG János Pach, Farhad Shahrokhi, Mario Szegedy
1994	J	`jnl`	Crossing Families. Comb. Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman
1994	J	`jnl`	Fat Triangles Determine Linearly Many Holes. SIAM J. Comput. Jirí Matousek, János Pach, Micha Sharir, Shmuel Sifrony, Emo Welzl
1994	J	`jnl`	Some Geometric Applications of Dilworth's Theorem. Discret. Comput. Geom. János Pach, Jenö Töröcsik
1994	J	`jnl`	The Complexity of a Class of Infinite Graphs. Comb. Péter Komjáth, János Pach
1993	J	`jnl`	An Invariant Property of Balls in Arrangements of Hyperplanes. Discret. Comput. Geom. Boris Aronov, Daniel Q. Naiman, János Pach, Micha Sharir
1993	J	`jnl`	Extremal problems in graph drawings (abstract). SIGACT News János Pach
1993	J	`jnl`	How Hard Is Half-Space Range Searching. Discret. Comput. Geom. Hervé Brönnimann, Bernard Chazelle, János Pach
1993	J	`jnl`	Nearly Equal Distances in the Plane. Comb. Probab. Comput. Paul Erdös, Endre Makai, János Pach
1993	—	`conf`	Some Geometric Applications of Dilworth's Theorem. SCG János Pach, Jenö Töröcsik
1993	J	`jnl`	The grid revisted. Discret. Math. Paul Erdös, Zoltán Füredi, János Pach, Imre Z. Ruzsa
1993	J	`jnl`	Weaving Patterns of Lines and Line Segments in Space. Algorithmica János Pach, Richard Pollack, Emo Welzl
1992	J	`jnl`	A turán-type theorem on chords of a convex polygon. J. Comb. Theory B Vasilis Capoyleas, János Pach
1992	J	`jnl`	Almost Tight Bounds for epsilon-Nets. Discret. Comput. Geom. János Komlós, János Pach, Gerhard J. Woeginger
1992	J	`jnl`	An Upper Bound on the Number of Planar K-Sets. Discret. Comput. Geom. János Pach, William L. Steiger, Endre Szemerédi
1992	J	`jnl`	Arrangements of Curves in the Plane - Topology, Combinatorics and Algorithms. Theor. Comput. Sci. Herbert Edelsbrunner, Leonidas J. Guibas, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir
1992	J	`jnl`	On the Number of Convex Lattice Polygons. Comb. Probab. Comput. Imre Bárány, János Pach
1992	J	`jnl`	Repeated Angles in the Plane and Related Problems. J. Comb. Theory A János Pach, Micha Sharir
1991	—	`conf`	Crossing Families. SCG Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman
1991	J	`jnl`	Distinct Distances Determined By Subsets of a Point Set in Space. Comput. Geom. David Avis, Paul Erdös, János Pach
1991	A*	`conf`	Fat Triangles Determine Linearly Many Holes FOCS Jirí Matousek, Nathaly Miller, János Pach, Micha Sharir, Shmuel Sifrony, Emo Welzl
1991	—	`conf`	Layout of Rooted Trees. Planar Graphs János Pach, Jenö Töröcsik
1991	J	`jnl`	On Vertical Visibility in Arrangements of Segments and the Queue Size in the Bentley-Ottmann Line Sweeping Algorithm. SIAM J. Comput. János Pach, Micha Sharir
1991	J	`jnl`	On the Average Volume of Subsets in Euclidean d-Space. Eur. J. Comb. János Pach, Norbert Sauer
1991	J	`jnl`	On the maximal number of certain subgraphs in Graphs Comb. Ervin Györi, János Pach, Miklós Simonovits
1991	J	`jnl`	Universal elements and the complexity of certain classes of infinite graphs. Discret. Math. Péter Komjáth, János Pach
1990	—	`conf`	Gaps in Difference Sets, and the Graph of Nearly Equal Distances. Applied Geometry And Discrete Mathematics Paul Erdös, Endre Makai, János Pach, Joel H. Spencer
1990	J	`jnl`	How to draw a planar graph on a grid. Comb. Hubert de Fraysseix, János Pach, Richard Pollack
1990	J	`jnl`	Note on vertex-partitions of infinite graphs. Discret. Math. János Pach, Joel H. Spencer
1990	—	`conf`	Notes on Geometric Graph Theory. Discrete and Computational Geometry János Pach
1990	—	`conf`	On the Perimeter of a Point Set in the Plane. Discrete and Computational Geometry Vasilis Capoyleas, János Pach
1990	—	`conf`	Some New Bounds for Epsilon-Nets. SCG János Pach, Gerhard J. Woeginger
1990	J	`jnl`	Special issue dedicated to discrete and computational geometry. Comb. Gábor Fejes Tóth, János Pach
1990	—	`conf`	The Combinatorial Complexity of Hyperplane Transversals. SCG Sylvain E. Cappell, Jacob E. Goodman, János Pach, Richard Pollack, Micha Sharir, Rephael Wenger
1990	J	`jnl`	Variation on the theme of repeated distances. Comb. Paul Erdös, János Pach
1990	—	`conf`	Weaving Patterns of Lines and Segments in Space. SIGAL International Symposium on Algorithms János Pach, Richard Pollack, Emo Welzl
1989	A*	`conf`	An Upper Bound on the Number of Planar k-Sets FOCS János Pach, William L. Steiger, Endre Szemerédi
1989	J	`jnl`	On Arrangement of Jordan Arcs with Three Intersection per Pair. Discret. Comput. Geom. Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink
1989	J	`jnl`	Radius, diameter, and minimum degree. J. Comb. Theory B Paul Erdös, János Pach, Richard Pollack, Zsolt Tuza
1989	J	`jnl`	The Upper Envelope of Piecewise Linear Functions and the Boundary of a Region Enclosed by Convex Plates: Combinatorial Analysis. Discret. Comput. Geom. János Pach, Micha Sharir
1988	J	`jnl`	An extremal problem on J. Graph Theory Peter Frankl, János Pach
1988	A*	`conf`	Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms. ICALP Herbert Edelsbrunner, Leonidas J. Guibas, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir
1988	J	`jnl`	Cutting a graph into two dissimilar halves. J. Graph Theory Paul Erdös, Mark Goldberg, János Pach, Joel Spencer
1988	J	`jnl`	Explicit codes with low covering radius. IEEE Trans. Inf. Theory János Pach, Joel Spencer
1988	J	`jnl`	How to make a graph bipartite. J. Comb. Theory B Paul Erdös, Ralph J. Faudree, János Pach, Joel H. Spencer
1988	—	`conf`	On Arrangements of Jordan Arcs with Three Intersections per Pair. SCG Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink
1988	J	`jnl`	Repeated distances in space. Graphs Comb. David Avis, Paul Erdös, János Pach
1988	A*	`conf`	Small Sets Supporting Fáry Embeddings of Planar Graphs STOC Hubert de Fraysseix, János Pach, Richard Pollack
1987	J	`jnl`	Bounding one-way differences. Graphs Comb. Peter Frankl, Zoltán Füredi, János Pach
1987	A*	`conf`	On the Lower Envelope of Bivariate Functions and its Applications FOCS Herbert Edelsbrunner, János Pach, Jacob T. Schwartz, Micha Sharir
1986	J	`jnl`	Covering the Plane with Convex Polygons. Discret. Comput. Geom. János Pach
1986	J	`jnl`	Maximal volume enclosed by plates and proof of the chessboard conjecture. Discret. Math. Károly J. Böröczky, Imre Bárány, Endre Makai, János Pach
1986	J	`jnl`	On the Union of Jordan Regions and Collision-Free Translational Motion Amidst Polygonal Obstacles. Discret. Comput. Geom. Klara Kedem, Ron Livne, János Pach, Micha Sharir
1984	J	`jnl`	On disjointly representable sets. Comb. Peter Frankl, János Pach
1983	J	`jnl`	On a Quasi-Ramsey problem. J. Graph Theory Paul Erdös, János Pach
1983	J	`jnl`	On the Number of Sets in a Null t-Design. Eur. J. Comb. Peter Frankl, János Pach
1981	J	`jnl`	A Problem of Ulam on Planar Graphs. Eur. J. Comb. János Pach
1981	J	`jnl`	Graphs whose every independent set has a common neighbour. Discret. Math. János Pach
1980	J	`jnl`	On a problem of L. Fejes Tóth. Discret. Math. Paul Erdös, János Pach