| 2026 | SODA | On a Clique Game and the Erdős-Hajnal Problem on High-Chromatic High-Girth Subgraphs. | Seth Pettie, Gbor Tardos, Bartosz Walczak |
| 2025 | SODA | A Refutation of the Pach-Tardos Conjecture for 0-1 Matrices. | Seth Pettie, Gbor Tardos |
| 2024 | SODA | On the Extremal Functions of Acyclic Forbidden 0-1 Matrices. | Seth Pettie, Gbor Tardos |
| 2020 | GD | Crossings Between Non-homotopic Edges. | Jnos Pach, Gbor Tardos, Gza Tth |
| 2019 | STOC | Planar point sets determine many pairwise crossing segments. | Jnos Pach, Natan Rubin, Gbor Tardos |
| 2017 | SODA | On Max-Clique for intersection graphs of sets and the Hadwiger-Debrunner numbers. | Chaya Keller, Shakhar Smorodinsky, Gbor Tardos |
| 2016 | SODA | Beyond the Richter-Thomassen Conjecture. | Jnos Pach, Natan Rubin, Gbor Tardos |
| 2015 | SODA | On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves. | Jnos Pach, Natan Rubin, Gbor Tardos |
| 2013 | FOCS | On the Communication Complexity of Sparse Set Disjointness and Exists-Equal Problems. | Mert Saglam, Gbor Tardos |
| 2012 | GD | The Visible Perimeter of an Arrangement of Disks. | Gabriel Nivasch, Jnos Pach, Gbor Tardos |
| 2011 | PODS | Tight bounds for Lp samplers, finding duplicates in streams, and related problems. | Hossein Jowhari, Mert Saglam, Gbor Tardos |
| 2011 | SODA | The Local Lemma is Tight for SAT. | Heidi Gebauer, Tibor Szab, Gbor Tardos |
| 2011 | WADS | Piercing Quasi-Rectangles: On a Problem of Danzer and Rogers. | Jnos Pach, Gbor Tardos |
| 2009 | SODA | High rate fingerprinting codes and the fingerprinting capacity. | Ehsan Amiri, Gbor Tardos |
| 2008 | SODA | Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles. | Xiaomin Chen, Jnos Pach, Mario Szegedy, Gbor Tardos |
| 2004 | GD | Intersection Reverse Sequences and Geometric Applications. | Adam Marcus, Gbor Tardos |
| 2003 | STOC | Distinct distances in three and higher dimensions. | Boris Aronov, Jnos Pach, Micha Sharir, Gbor Tardos |
| 2003 | STOC | Optimal probabilistic fingerprint codes. | Gbor Tardos |
| 2002 | GD | Geometric Graphs with No Self-intersecting Path of Length Three. | Jnos Pach, Rom Pinchasi, Gbor Tardos, Gza Tth |
| 2001 | GD | Untangling a Polygon. | Jnos Pach, Gbor Tardos |
| 2000 | FOCS | On the boundary complexity of the union of fat triangles. | Jnos Pach, Gbor Tardos |
| 1998 | FOCS | Lower Bounds for (MOD p - MOD m) Circuits. | Vince Grolmusz, Gbor Tardos |
| 1997 | STOC | Is Linear Hashing Good? | Noga Alon, Martin Dietzfelbinger, Peter Bro Miltersen, Erez Petrank, Gbor Tardos |
| 1997 | STOC | Probabilistically Checkable Proofs with Zero Knowledge. | Joe Kilian, Erez Petrank, Gbor Tardos |
| 1996 | FOCS | On the Knowledge Complexity of NP. | Erez Petrank, Gbor Tardos |
| 1990 | SODA | A Competitive 3-Server Algorithm. | Piotr Berman, Howard J. Karloff, Gbor Tardos |
| 1990 | STOC | On the Power of Randomization in Online Algorithms (Extended Abstract) | Shai Ben-David, Allan Borodin, Richard M. Karp, Gbor Tardos, Avi Wigderson |
| 1989 | FOCS | Planning and Learning in Permutation Groups | Amos Fiat, Shahar Moses, Adi Shamir, Ilan Shimshoni, Gbor Tardos |
| 1989 | FOCS | Decision Versus Search Problems in Super-Polynomial Time | Russell Impagliazzo, Gbor Tardos |