| 2026 | ESA | Rerouting Curves on Surfaces. | Timo Brand, Stefan Felsner, Henry Frster, Stephen G. Kobourov, Anna Lubiw, Yoshio Okamoto, Jnos Pach, Csaba D. Tth, Gza Tth, Torsten Ueckerdt, Pavel Valtr |
| 2025 | GD | From Local Pair-Crossing Number to Local Crossing Number. | Jacob Fox, Jnos Pach, Andrew Suk |
| 2024 | GD | Partitioning Complete Geometric Graphs on Dense Point Sets into Plane Subgraphs. | Adrian Dumitrescu, Jnos Pach |
| 2024 | GD | Enumeration of Intersection Graphs of x-Monotone Curves. | Jacob Fox, Jnos Pach, Andrew Suk |
| 2023 | GD | Decomposition of Geometric Graphs into Star-Forests. | Jnos Pach, Morteza Saghafian, Patrick Schnider |
| 2022 | GD | Quasiplanar Graphs, String Graphs, and the Erdős-Gallai Problem. | Jacob Fox, Jnos Pach, Andrew Suk |
| 2021 | GD | On the Number of Edges of Separated Multigraphs. | Jacob Fox, Jnos Pach, Andrew Suk |
| 2020 | GD | Crossings Between Non-homotopic Edges. | Jnos Pach, Gbor Tardos, Gza Tth |
| 2019 | GD | Coloring Hasse Diagrams and Disjointness Graphs of Curves. | Jnos Pach, Istvn Tomon |
| 2019 | STOC | Planar point sets determine many pairwise crossing segments. | Jnos Pach, Natan Rubin, Gbor Tardos |
| 2018 | GD | The Number of Crossings in Multigraphs with No Empty Lens. | Michael Kaufmann, Jnos Pach, Gza Tth, Torsten Ueckerdt |
| 2017 | GD | Thrackles: An Improved Upper Bound. | Radoslav Fulek, Jnos Pach |
| 2017 | GD | Many Touchings Force Many Crossings. | Jnos Pach, Gza Tth |
| 2016 | GD | Approximating the Rectilinear Crossing Number. | Jacob Fox, Jnos Pach, Andrew Suk |
| 2016 | SODA | Beyond the Richter-Thomassen Conjecture. | Jnos Pach, Natan Rubin, Gbor Tardos |
| 2015 | GD | On the Zarankiewicz Problem for Intersection Hypergraphs. | Nabil H. Mustafa, Jnos Pach |
| 2015 | SODA | Density and regularity theorems for semi-algebraic hypergraphs. | Jacob Fox, Jnos Pach, Andrew Suk |
| 2015 | SODA | On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves. | Jnos Pach, Natan Rubin, Gbor Tardos |
| 2015 | WG | Unsplittable Coverings in the Plane. | Jnos Pach, Dmtr Plvlgyi |
| 2013 | GD | On the Upward Planarity of Mixed Plane Graphs. | Fabrizio Frati, Michael Kaufmann, Jnos Pach, Csaba D. Tth, David R. Wood |
| 2012 | GD | The Visible Perimeter of an Arrangement of Disks. | Gabriel Nivasch, Jnos Pach, Gbor Tardos |
| 2012 | ISAAC | How Many Potatoes Are in a Mesh? | Marc J. van Kreveld, Maarten Lffler, Jnos Pach |
| 2011 | GD | Every Graph Admits an Unambiguous Bold Drawing. | Jnos Pach |
| 2011 | GD | Monotone Crossing Number. | Jnos Pach, Gza Tth |
| 2011 | SODA | Overlap properties of geometric expanders. | Jacob Fox, Mikhail Gromov, Vincent Lafforgue, Assaf Naor, Jnos Pach |
| 2011 | SODA | Computing the Independence Number of Intersection Graphs. | Jacob Fox, Jnos Pach |
| 2011 | WADS | Piercing Quasi-Rectangles: On a Problem of Danzer and Rogers. | Jnos Pach, Gbor Tardos |
| 2010 | FOCS | On the Queue Number of Planar Graphs. | Giuseppe Di Battista, Fabrizio Frati, Jnos Pach |
| 2010 | GD | A Computational Approach to Conway's Thrackle Conjecture. | Radoslav Fulek, Jnos Pach |
| 2010 | GD | Drawing Planar Graphs of Bounded Degree with Few Slopes. | Balzs Keszegh, Jnos Pach, Dmtr Plvlgyi |
| 2010 | WALCOM | Crossings between Curves with Many Tangencies. | Jacob Fox, Fabrizio Frati, Jnos Pach, Rom Pinchasi |
| 2010 | WG | Graphs with Large Obstacle Numbers. | Padmini Mukkamala, Jnos Pach, Deniz Sariz |
| 2009 | GD | Drawing Hamiltonian Cycles with No Large Angles. | Adrian Dumitrescu, Jnos Pach, Gza Tth |
| 2009 | GD | Why Are String Graphs So Beautiful? | Jnos Pach |
| 2009 | WALCOM | A Separator Theorem for String Graphs and Its Applications. | Jacob Fox, Jnos Pach |
| 2008 | GD | Cubic Graphs Have Bounded Slope Parameter. | Balzs Keszegh, Jnos Pach, Dmtr Plvlgyi, Gza Tth |
| 2008 | SODA | Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles. | Xiaomin Chen, Jnos Pach, Mario Szegedy, Gbor Tardos |
| 2007 | GD | A Bipartite Strengthening of the Crossing Lemma. | Jacob Fox, Jnos Pach, Csaba D. Tth |
| 2006 | GD | Drawing Cubic Graphs with at Most Five Slopes. | Balzs Keszegh, Jnos Pach, Dmtr Plvlgyi, Gza Tth |
| 2006 | LATIN | Reconfigurations in Graphs and Grids. | Gruia Calinescu, Adrian Dumitrescu, Jnos Pach |
| 2005 | GD | Crossing Number of Toroidal Graphs. | Jnos Pach, Gza Tth |
| 2005 | SODA | Online conflict-free coloring for intervals. | Amos Fiat, Meital Levy, Jir Matousek, Elchanan Mossel, Jnos Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl |
| 2004 | GD | Long Alternating Paths in Bicolored Point Sets. | Jan Kyncl, Jnos Pach, Gza Tth |
| 2003 | GD | How Many Ways Can One Draw a Graph? | Jnos Pach, Gza Tth |
| 2003 | STOC | Distinct distances in three and higher dimensions. | Boris Aronov, Jnos Pach, Micha Sharir, Gbor Tardos |
| 2002 | GD | Geometric Graphs with No Self-intersecting Path of Length Three. | Jnos Pach, Rom Pinchasi, Gbor Tardos, Gza Tth |
| 2002 | ISAAC | Monotone Drawings of Planar Graphs. | Jnos Pach, Gza Tth |
| 2001 | GD | Untangling a Polygon. | Jnos Pach, Gbor Tardos |
| 2001 | GD | Recognizing String Graphs Is Decidable. | Jnos Pach, Gza Tth |
| 2001 | WADS | Partitioning Colored Point Sets into Monochromatic Parts. | Adrian Dumitrescu, Jnos Pach |
| 2000 | FOCS | On the boundary complexity of the union of fat triangles. | Jnos Pach, Gbor Tardos |
| 2000 | GD | Unavoidable Configurations in Complete Topological Graphs. | Jnos Pach, Gza Tth |
| 1998 | FOCS | Which Crossing Number is it, Anyway? | Jnos Pach, Gza Tth |
| 1998 | GD | Embedding Planar Graphs at Fixed Vertex Locations. | Jnos Pach, Rephael Wenger |
| 1997 | GD | Three-dimensional Grid Drawings of Graphs. | Jnos Pach, Torsten Thiele, Gza Tth |
| 1996 | GD | Graphs Drawn with Few Crossings Per Edge. | Jnos Pach, Gza Tth |
| 1996 | ISAAC | Extremal Problems for Geometric Hypergraphs. | Tamal K. Dey, Jnos Pach |
| 1995 | GD | Quasi-Planar Graphs Have a Linear Number of Edges. | Pankaj K. Agarwal, Boris Aronov, Jnos Pach, Richard Pollack, Micha Sharir |
| 1991 | FOCS | Fat Triangles Determine Linearly Many Holes | Jir Matousek, Nathaly Miller, Jnos Pach, Micha Sharir, Shmuel Sifrony, Emo Welzl |
| 1989 | FOCS | An Upper Bound on the Number of Planar k-Sets | Jnos Pach, William L. Steiger, Endre Szemerdi |
| 1988 | ICALP | Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms. | Herbert Edelsbrunner, Leonidas J. Guibas, Jnos Pach, Richard Pollack, Raimund Seidel, Micha Sharir |
| 1988 | STOC | Small Sets Supporting Fry Embeddings of Planar Graphs | Hubert de Fraysseix, Jnos Pach, Richard Pollack |
| 1987 | FOCS | On the Lower Envelope of Bivariate Functions and its Applications | Herbert Edelsbrunner, Jnos Pach, Jacob T. Schwartz, Micha Sharir |