Gábor Tardos

ORCID

Publication Activity (10 Years)

Years Active: 1988-2024
Publications (10 Years): 35

Top Venues

CoRR

SODA

Comb. Probab. Comput.

J. Comb. Theory, Ser. A

Publications

János Pach, Gábor Tardos
Where Have All the Grasshoppers Gone? Am. Math. Mon. 131 (3) (2024)
Seth Pettie, Gábor Tardos
On the Extremal Functions of Acyclic Forbidden 0-1 Matrices. SODA (2024)
János Pach, Gábor Tardos, Géza Tóth
Disjointness graphs of short polygonal chains. J. Comb. Theory, Ser. B 164 (2024)
Seth Pettie, Gábor Tardos
A Refutation of the Pach-Tardos Conjecture for 0-1 Matrices. CoRR (2024)
Noga Alon, Dor Elboim, János Pach, Gábor Tardos
Random Necklaces Require Fewer Cuts. SIAM J. Discret. Math. 38 (2) (2024)
Gaurav Kucheriya, Gábor Tardos
A Characterization of Edge-Ordered Graphs with Almost Linear Extremal Functions. Comb. 43 (6) (2023)
Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy, Dömötör Pálvölgyi, Gábor Tardos, Máté Vizer
Turán problems for edge-ordered graphs. J. Comb. Theory, Ser. B 160 (2023)
Seth Pettie, Gábor Tardos
On the Extremal Functions of Acyclic Forbidden 0-1 Matrices. CoRR (2023)
Lixing Fang, Hao Huang, János Pach, Gábor Tardos, Junchi Zuo
Successive vertex orderings of fully regular graphs. J. Comb. Theory, Ser. A 199 (2023)
János Pach, Gábor Tardos, Géza Tóth
Crossings between non-homotopic edges. J. Comb. Theory, Ser. B 156 (2022)
János Pach, Gábor Tardos, Géza Tóth
Disjointness Graphs of Short Polygonal Chains. SoCG (2022)
Gábor Elek, Gábor Tardos
Convergence and Limits of Finite Trees. Comb. 42 (6) (2022)
János Pach, Gábor Tardos, Géza Tóth
Disjointness graphs of segments in the space. Comb. Probab. Comput. 30 (4) (2021)
Attila Sali, Gábor Simonyi, Gábor Tardos
Partitioning Transitive Tournaments into Isomorphic Digraphs. Order 38 (2) (2021)
János Pach, Gábor Tardos, Géza Tóth
Crossings Between Non-homotopic Edges. Graph Drawing (2020)
Dömötör Pálvölgyi, Gábor Tardos
Unlabeled compression schemes exceeding the VC-dimension. Discret. Appl. Math. 276 (2020)
Dániel Korándi, Gábor Tardos, István Tomon, Craig Weidert
On the Turán number of ordered forests. J. Comb. Theory, Ser. A 165 (2019)
Gábor Tardos
Extremal theory of vertex or edge ordered graphs. BCC (2019)
János Pach, Natan Rubin, Gábor Tardos
Planar Point Sets Determine Many Pairwise Crossing Segments. CoRR (2019)
János Pach, Natan Rubin, Gábor Tardos
Planar point sets determine many pairwise crossing segments. STOC (2019)
Andrey Kupavskii, János Pach, Gábor Tardos
Tilings with noncongruent triangles. Eur. J. Comb. 73 (2018)
Dömötör Pálvölgyi, Gábor Tardos
Unlabeled Compression Schemes Exceeding the VC-dimension. CoRR (2018)
János Pach, Gábor Tardos, Géza Tóth
Disjointness Graphs of Segments. SoCG (2017)
János Pach, Natan Rubin, Gábor Tardos
A Crossing Lemma for Jordan Curves. CoRR (2017)
Andrey Kupavskii, János Pach, Gábor Tardos
Tilings of the plane with unit area triangles of bounded diameter. CoRR (2017)
Chaya Keller, Shakhar Smorodinsky, Gábor Tardos
On Max-Clique for intersection graphs of sets and the Hadwiger-Debrunner numbers. SODA (2017)
Dániel Korándi, Gábor Tardos, István Tomon, Craig Weidert
On the Turán number of ordered forests. Electron. Notes Discret. Math. 61 (2017)
Péter L. Erdös, Dömötör Pálvölgyi, Claude Tardif, Gábor Tardos
Regular families of forests, antichains and duality pairs of relational structures. Comb. 37 (4) (2017)
Andrey Kupavskii, János Pach, Gábor Tardos
Tilings with noncongruent triangles. CoRR (2017)
Andrey Kupavskii, János Pach, Gábor Tardos
Controlling Lipschitz functions. CoRR (2017)
Zsolt Lángi, Márton Naszódi, János Pach, Gábor Tardos, Géza Tóth
Separation with restricted families of sets. J. Comb. Theory, Ser. A 144 (2016)
Heidi Gebauer, Tibor Szabó, Gábor Tardos
The Local Lemma Is Asymptotically Tight for SAT. J. ACM 63 (5) (2016)
Frédéric Magniez, Ashwin Nayak, Miklos Santha, Jonah Sherman, Gábor Tardos, David Xiao
Improved bounds for the randomized decision tree Complexity of recursive majority. Random Struct. Algorithms 48 (3) (2016)
János Pach, Natan Rubin, Gábor Tardos
Beyond the Richter-Thomassen Conjecture. SODA (2016)
János Pach, Natan Rubin, Gábor Tardos
On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves. Comb. Probab. Comput. 25 (6) (2016)
János Pach, Gábor Tardos
Cross-Intersecting Families of Vectors. Graphs Comb. 31 (2) (2015)
János Pach, Natan Rubin, Gábor Tardos
On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves. SODA (2015)
János Pach, Natan Rubin, Gábor Tardos
Beyond the Richter-Thomassen Conjecture. CoRR (2015)
Gábor Simonyi, Gábor Tardos, Ambrus Zsbán
Relations between the Local Chromatic Number and Its Directed Version. J. Graph Theory 79 (4) (2015)
László Csirmaz, Péter Ligeti, Gábor Tardos
Erdős-Pyber Theorem for Hypergraphs and Secret Sharing. Graphs Comb. 31 (5) (2015)
László Csirmaz, Gábor Tardos
On-line secret sharing. CoRR (2014)
Roman Glebov, Tibor Szabó, Gábor Tardos
Conflict-Free Colouring of Graphs. Comb. Probab. Comput. 23 (3) (2014)
János Pach, Natan Rubin, Gábor Tardos
On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves. CoRR (2014)
Gabriel Nivasch, János Pach, Gábor Tardos
The visible perimeter of an arrangement of disks. Comput. Geom. 47 (1) (2014)
Jessica A. Enright, Lorna Stewart, Gábor Tardos
On List Coloring and List Homomorphism of Permutation and Interval Graphs. SIAM J. Discret. Math. 28 (4) (2014)
Mert Saglam, Gábor Tardos
On the Communication Complexity of Sparse Set Disjointness and Exists-Equal Problems. FOCS (2013)
Péter L. Erdös, Claude Tardif, Gábor Tardos
On Infinite-finite Duality Pairs of Directed Graphs. Order 30 (3) (2013)
Bojan Mohar, Gábor Simonyi, Gábor Tardos
Local chromatic number of quadrangulations of surfaces. Comb. 33 (4) (2013)
Péter L. Erdös, Claude Tardif, Gábor Tardos
Caterpillar Dualities and Regular Languages. SIAM J. Discret. Math. 27 (3) (2013)
László Csirmaz, Gábor Tardos
Optimal Information Rate of Secret Sharing Schemes on Trees. IEEE Trans. Inf. Theory 59 (4) (2013)
László Csirmaz, Péter Ligeti, Gábor Tardos
Erdős-Pyber theorem for hypergraphs and secret sharing. CoRR (2013)
János Pach, Gábor Tardos
Cross-Intersecting Families of Vectors. JCDCGG (2013)
Frédéric Magniez, Ashwin Nayak, Miklos Santha, Jonah Sherman, Gábor Tardos, David Xiao
Improved bounds for the randomized decision tree complexity of recursive majority. CoRR (2013)
János Pach, Gábor Tardos
The Range of a Random Walk on a Comb. Electron. J. Comb. 20 (3) (2013)
Mert Saglam, Gábor Tardos
On the communication complexity of sparse set disjointness and exists-equal problems CoRR (2013)
László Csirmaz, Gábor Tardos
Optimal information rate of secret sharing schemes on trees CoRR (2013)
Péter L. Erdös, Dömötör Pálvölgyi, Claude Tardif, Gábor Tardos
On infinite-finite tree-duality pairs of relational structures CoRR (2012)
Péter L. Erdös, Claude Tardif, Gábor Tardos
On infinite-finite duality pairs of directed graphs CoRR (2012)
László Csirmaz, Gábor Tardos
On-line secret sharing. Des. Codes Cryptogr. 63 (1) (2012)
János Pach, Gábor Tardos, József Solymosi
Remarks on a Ramsey theory for trees. Comb. 32 (4) (2012)
Gabriel Nivasch, János Pach, Gábor Tardos
The visible perimeter of an arrangement of disks CoRR (2012)
János Pach, Gábor Tardos
Piercing quasi-rectangles - On a problem of Danzer and Rogers. J. Comb. Theory, Ser. A 119 (7) (2012)
Gabriel Nivasch, János Pach, Gábor Tardos
The Visible Perimeter of an Arrangement of Disks. Graph Drawing (2012)
Jessica A. Enright, Lorna Stewart, Gábor Tardos
On List Colouring and List Homomorphism of Permutation and Interval Graphs CoRR (2012)
Péter L. Erdös, Claude Tardif, Gábor Tardos
Caterpillar dualities and regular languages CoRR (2012)
Gábor Simonyi, Gábor Tardos
On directed local chromatic number, shift graphs, and Borsuk-like graphs. J. Graph Theory 66 (1) (2011)
János Pach, Gábor Tardos
Tight lower bounds for the size of epsilon-nets. SCG (2011)
László Csirmaz, Gábor Tardos
On-line secret sharing. IACR Cryptol. ePrint Arch. 2011 (2011)
Heidi Gebauer, Tibor Szabó, Gábor Tardos
The Local Lemma is Tight for SAT. SODA (2011)
Hossein Jowhari, Mert Saglam, Gábor Tardos
Tight bounds for Lp samplers, finding duplicates in streams, and related problems. PODS (2011)
János Pach, Gábor Tardos
Piercing Quasi-Rectangles: On a Problem of Danzer and Rogers. WADS (2011)
János Pach, Gábor Tardos
Tight lower bounds for the size of epsilon-nets CoRR (2010)
Gábor Tardos
Capacity of Collusion Secure Fingerprinting - A Tradeoff between Rate and Efficiency - (Extended Abstract of Invited Talk). Information Hiding (2010)
János Pach, József Solymosi, Gábor Tardos
Crossing numbers of imbalanced graphs. J. Graph Theory 64 (1) (2010)
Hossein Jowhari, Mert Saglam, Gábor Tardos
Tight Bounds for Lp Samplers, Finding Duplicates in Streams, and Related Problems CoRR (2010)
Heidi Gebauer, Tibor Szabó, Gábor Tardos
The Local Lemma Is Tight for SAT CoRR (2010)
Robin A. Moser, Gábor Tardos
A constructive proof of the general lovász local lemma. J. ACM 57 (2) (2010)
János Pach, Gábor Tardos
Coloring axis-parallel rectangles. J. Comb. Theory, Ser. A 117 (6) (2010)
János Pach, Gábor Tardos
Conflict-Free Colourings of Graphs and Hypergraphs. Comb. Probab. Comput. 18 (5) (2009)
László Csirmaz, Gábor Tardos
Secret sharing on trees: problem solved. IACR Cryptol. ePrint Arch. 2009 (2009)
Xiaomin Chen, János Pach, Mario Szegedy, Gábor Tardos
Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles. Random Struct. Algorithms 34 (1) (2009)
Robin A. Moser, Gábor Tardos
A constructive proof of the general Lovasz Local Lemma CoRR (2009)
Ehsan Amiri, Gábor Tardos
High rate fingerprinting codes and the fingerprinting capacity. SODA (2009)
Gábor Tardos
Optimal probabilistic fingerprint codes. J. ACM 55 (2) (2008)
Nathan Linial, Jirí Matousek, Or Sheffet, Gábor Tardos
Graph Colouring with No Large Monochromatic Components. Comb. Probab. Comput. 17 (4) (2008)
Xiaomin Chen, János Pach, Mario Szegedy, Gábor Tardos
Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles. SODA (2008)
Gábor Tardos, Géza Tóth
Crossing Stars in Topological Graphs. SIAM J. Discret. Math. 21 (3) (2007)
Nathan Linial, Jirí Matousek, Or Sheffet, Gábor Tardos
Graph coloring with no large monochromatic components. Electron. Notes Discret. Math. 29 (2007)
Noga Alon, Ilan Newman, Alexander Shen, Gábor Tardos, Nikolai K. Vereshchagin
Partitioning multi-dimensional sets in a small number of "uniform" parts. Eur. J. Comb. 28 (1) (2007)
Gábor Tardos, Géza Tóth
Multiple Coverings of the Plane with Triangles. Discret. Comput. Geom. 38 (2) (2007)
Joshua N. Cooper, Benjamin Doerr, Joel H. Spencer, Gábor Tardos
Deterministic random walks on the integers. Eur. J. Comb. 28 (8) (2007)
József Solymosi, Gábor Tardos
On the number of k-rich transformations. SCG (2007)
Eyal Ackerman, Gábor Tardos
On the maximum number of edges in quasi-planar graphs. J. Comb. Theory, Ser. A 114 (3) (2007)
János Pach, Gábor Tardos
Coloring Axis-Parallel Rectangles. KyotoCGGT (2007)
Gábor Simonyi, Gábor Tardos
Colorful subgraphs in Kneser-like graphs. Eur. J. Comb. 28 (8) (2007)
Itai Benjamini, Gady Kozma, László Lovász, Dan Romik, Gábor Tardos
Waiting for a Bat to Fly By (in Polynomial Time). Comb. Probab. Comput. 15 (5) (2006)
Adam Marcus, Gábor Tardos
Intersection reverse sequences and geometric applications. J. Comb. Theory, Ser. A 113 (4) (2006)
Joshua N. Cooper, Benjamin Doerr, Joel Spencer, Gábor Tardos
Deterministic Random Walks. ANALCO (2006)
Gábor Simonyi, Gábor Tardos
Local Chromatic Number, KY Fan's Theorem, And Circular Colorings. Comb. 26 (5) (2006)
Tibor Szabó, Gábor Tardos
Extremal Problems For Transversals In Graphs With Bounded Degree. Comb. 26 (3) (2006)

Gábor Tardos.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Gábor Tardos