| Crossings between non-homotopic edges | 0 | 0.34 | 2022 |
| Disjointness Graphs of Short Polygonal Chains | 0 | 0.34 | 2022 |
| Disjointness graphs of segments in the space | 0 | 0.34 | 2021 |
| Unlabeled compression schemes exceeding the VC-dimension | 0 | 0.34 | 2020 |
| Crossings between non-homotopic edges | 0 | 0.34 | 2020 |
| On the Turán number of ordered forests. | 0 | 0.34 | 2019 |
| Tilings of the plane with unit area triangles of bounded diameter. | 0 | 0.34 | 2018 |
| Conflict-free coloring of graphs | 0 | 0.34 | 2018 |
| Tilings with noncongruent triangles. | 0 | 0.34 | 2018 |
| Regular families of forests, antichains and duality pairs of relational structures | 1 | 0.36 | 2017 |
| A Crossing Lemma for Jordan Curves. | 0 | 0.34 | 2017 |
| On Max-Clique for intersection graphs of sets and the Hadwiger-Debrunner numbers. | 1 | 0.41 | 2017 |
| Controlling Lipschitz functions. | 0 | 0.34 | 2017 |
| Disjointness Graphs of Segments. | 0 | 0.34 | 2017 |
| Improved bounds for the randomized decision tree Complexity of recursive majority. | 0 | 0.34 | 2016 |
| The Local Lemma Is Asymptotically Tight for SAT. | 2 | 0.36 | 2016 |
| Separation with restricted families of sets | 0 | 0.34 | 2016 |
| Erdős-Pyber theorem for hypergraphs and secret sharing. | 3 | 0.57 | 2015 |
| Relations between the local chromatic number and its directed version | 1 | 0.35 | 2015 |
| Conflict-Free Colouring of Graphs. | 3 | 0.41 | 2014 |
| The visible perimeter of an arrangement of disks | 1 | 0.39 | 2014 |
| On the Communication Complexity of Sparse Set Disjointness and Exists-Equal Problems | 12 | 0.59 | 2013 |
| The Range of a Random Walk on a Comb. | 0 | 0.34 | 2013 |
| On Infinite–finite Duality Pairs of Directed Graphs | 1 | 0.37 | 2013 |
| Optimal Information Rate of Secret Sharing Schemes on Trees | 3 | 0.40 | 2013 |
| Cross-intersecting families of vectors | 0 | 0.34 | 2013 |
| Local chromatic number of quadrangulations of surfaces | 1 | 0.37 | 2013 |
| Piercing quasi-rectangles-On a problem of Danzer and Rogers | 3 | 0.44 | 2012 |
| Remarks on a Ramsey theory for trees. | 2 | 0.44 | 2012 |
| On-line secret sharing | 1 | 0.36 | 2012 |
| On List Coloring and List Homomorphism of Permutation and Interval Graphs. | 3 | 0.38 | 2012 |
| On infinite-finite tree-duality pairs of relational structures | 1 | 0.40 | 2012 |
| Caterpillar dualities and regular languages | 1 | 0.40 | 2012 |
| Tight bounds for Lp samplers, finding duplicates in streams, and related problems | 51 | 1.36 | 2011 |
| Tight lower bounds for the size of epsilon-nets | 13 | 0.70 | 2011 |
| On directed local chromatic number, shift graphs, and Borsuk-like graphs | 5 | 0.77 | 2011 |
| Capacity of Collusion Secure Fingerprinting - A Tradeoff between Rate and Efficiency - (Extended Abstract of Invited Talk) | 0 | 0.34 | 2010 |
| Coloring axis-parallel rectangles | 7 | 0.73 | 2010 |
| Crossing numbers of imbalanced graphs | 1 | 0.37 | 2010 |
| Notes: Coloring axis-parallel rectangles | 9 | 0.72 | 2010 |
| Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles | 18 | 1.11 | 2009 |
| A constructive proof of the general lovász local lemma | 137 | 5.51 | 2009 |
| High rate fingerprinting codes and the fingerprinting capacity | 48 | 1.79 | 2009 |
| Secret sharing on trees: problem solved. | 5 | 0.45 | 2009 |
| Conflict-free colourings of graphs and hypergraphs | 20 | 1.78 | 2009 |
| Optimal probabilistic fingerprint codes | 40 | 1.59 | 2008 |
| Note: On the maximum number of edges in quasi-planar graphs | 22 | 1.48 | 2007 |
| On the maximum number of edges in quasi-planar graphs | 29 | 1.48 | 2007 |
| Crossing Stars in Topological Graphs | 6 | 0.94 | 2007 |
| On the number of k-rich transformations | 1 | 0.38 | 2007 |
