| Rainbow Erdos-Rothschild Problem For The Fano Plane | 0 | 0.34 | 2021 |
| On The Query Complexity Of Estimating The Distance To Hereditary Graph Properties | 0 | 0.34 | 2021 |
| On the independence number of non-uniform uncrowded hypergraphs. | 0 | 0.34 | 2020 |
| Estimating Parameters Associated With Monotone Properties | 0 | 0.34 | 2020 |
| Stability Results for Two Classes of Hypergraphs | 0 | 0.34 | 2019 |
| Remarks on an Edge-coloring Problem. | 0 | 0.34 | 2019 |
| Edge-colorings avoiding rainbow stars. | 0 | 0.34 | 2018 |
| On graphs with a large number of edge-colorings avoiding a rainbow triangle. | 1 | 0.36 | 2017 |
| Estimating the distance to a hereditary graph property. | 1 | 0.35 | 2017 |
| Stability of extremal hypergraphs with applications to an edge-coloring problem. | 0 | 0.34 | 2017 |
| Estimating Parameters Associated with Monotone Properties. | 2 | 0.41 | 2017 |
| A coloring problem for intersecting vector spaces. | 1 | 0.36 | 2016 |
| Edge-colorings avoiding fixed rainbow stars | 2 | 0.44 | 2015 |
| Edge-colorings avoiding a fixed matching with a prescribed color pattern. | 4 | 0.53 | 2015 |
| Edge-colorings of uniform hypergraphs avoiding monochromatic matchings. | 0 | 0.34 | 2015 |
| A rainbow Erdős-Rothschild problem | 2 | 0.43 | 2015 |
| Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number | 8 | 0.78 | 2014 |
| Some Partition Theorems for Infinite and Finite Matrices. | 0 | 0.34 | 2014 |
| Graphs on Affine and Linear Spaces and Deuber Sets. | 0 | 0.34 | 2013 |
| Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs. | 6 | 0.65 | 2013 |
| An unstable hypergraph problem with a unique optimal solution | 0 | 0.34 | 2013 |
| Edge colourings of graphs avoiding monochromatic matchings of a given size | 9 | 0.82 | 2012 |
| Hypergraphs with many Kneser colorings | 4 | 0.56 | 2012 |
| Edge colorings of graphs avoiding some fixed monochromatic subgraph with linear Turán number. | 0 | 0.34 | 2011 |
| Kneser Colorings of Uniform Hypergraphs | 0 | 0.34 | 2009 |
| Generalizations of Heilbronn's triangle problem | 0 | 0.34 | 2009 |
| On colourings of hypergraphs without monochromatic fano planes | 9 | 0.91 | 2009 |
| No lGrid-Points in Spaces of Small Dimension | 0 | 0.34 | 2008 |
| Distributions of Points in d Dimensions and Large k-Point Simplices | 4 | 0.46 | 2008 |
| Distributions of points in the unit square and large k-gons | 3 | 0.50 | 2008 |
| Convex Hulls of Point-Sets and Non-uniform Hypergraphs | 0 | 0.34 | 2007 |
| Distributions of points and large convex hulls of k points | 0 | 0.34 | 2006 |
| Large Triangles in the d-Dimensional Unit-Cube | 3 | 0.44 | 2006 |
| Sparse Parity-Check Matrices over ${GF(q)}$ | 2 | 0.38 | 2005 |
| Distributions of points in the unit-square and large k-gons | 3 | 0.42 | 2005 |
| Distributions of points and large quadrangles | 2 | 0.42 | 2004 |
| Sparse Parity-Check Matrices over Finite Fields (Extended Abstract) | 2 | 0.39 | 2003 |
| On Heilbronn's problem in higher dimension | 14 | 1.16 | 2003 |
| A Deterministic Polynomial-Time Algorithm for Heilbronn's Problem in Three Dimensions | 8 | 0.59 | 2002 |
| A Deterministic Polynomial Time Algorithm for Heilbronn's Problem in Dimension Three | 0 | 0.34 | 2002 |
| MODp-tests, almost independence and small probability spaces | 4 | 0.47 | 2000 |
| Coloring arcs of convex sets | 3 | 0.64 | 2000 |
| The algorithmic aspects of uncrowded hypergraphs | 15 | 1.17 | 1999 |
| Sparse 0-1-matrices and forbidden hypergraphs | 2 | 0.43 | 1999 |
| On K-Partite Subgraphs | 2 | 0.68 | 1998 |
| Sparse 0-1-Matrices and Forbidden Hypergraphs (Extended Abstract) | 0 | 0.34 | 1998 |
| Approximating Maximum Independent Sets in Uniform Hypergraphs | 12 | 1.73 | 1998 |
| The Algorithmic Aspects Of Uncrowded Hypergraphs (Extended Abstract) | 0 | 0.34 | 1997 |
| On Sparse Parity Check Matrices | 3 | 0.41 | 1997 |
| MODp-tests, Almost Independence and Small Probability Spaces (Extended Abstract) | 0 | 0.34 | 1997 |
