| The Turan number of the square of a path | 1 | 0.37 | 2022 |
| The domination number of the graph defined by two levels of the n-cube, II | 0 | 0.34 | 2021 |
| Adaptive Majority Problems For Restricted Query Graphs And For Weighted Sets | 0 | 0.34 | 2021 |
| Preface: 2nd Russian-Hungarian Combinatorial Workshop. | 0 | 0.34 | 2020 |
| The domination number of the graph defined by two levels of the n-cube | 1 | 0.48 | 2019 |
| Adaptive Majority Problems for Restricted Query Graphs and for Weighted Sets. | 0 | 0.34 | 2019 |
| Results on the Wiener profile | 0 | 0.34 | 2018 |
| Around the Complete Intersection Theorem. | 0 | 0.34 | 2017 |
| Preface: Levon Khachatrian's legacy in extremal combinatorics. | 0 | 0.34 | 2017 |
| Incomparable Copies of a Poset in the Boolean Lattice | 1 | 0.42 | 2015 |
| Union-intersecting set systems | 2 | 0.43 | 2015 |
| Two-colorings with many monochromatic cliques in both colors | 1 | 0.41 | 2013 |
| Color the cycles. | 0 | 0.34 | 2013 |
| Sperner type theorems with excluded subposets | 0 | 0.34 | 2013 |
| Search when the lie depends on the target | 0 | 0.34 | 2013 |
| Minimum average-case queries of q+1-ary search game with small sets | 1 | 0.36 | 2012 |
| On the distance of databases | 0 | 0.34 | 2012 |
| Erdös-Ko-Rado from intersecting shadows. | 0 | 0.34 | 2012 |
| Majority and plurality problems | 0 | 0.34 | 2012 |
| Random databases with correlated data | 0 | 0.34 | 2012 |
| Encoding databases satisfying a given set of dependencies | 0 | 0.34 | 2012 |
| Most probably intersecting families of subsets | 5 | 0.61 | 2012 |
| Random geometric identification | 0 | 0.34 | 2008 |
| Functional dependencies distorted by errors | 5 | 0.48 | 2008 |
| Bounds on Maximal Families of Sets Not Containing Three Sets with A INTERSECTION B SUBSET OF C , A NOT A SUBSET OF B | 0 | 0.34 | 2008 |
| Note: No four subsets forming an N | 8 | 1.11 | 2008 |
| Largest Families Without an -Fork | 24 | 2.73 | 2007 |
| Some contributions to the minimum representation problem of key systems | 8 | 0.41 | 2006 |
| On the security of individual data | 1 | 0.38 | 2006 |
| On the number of independent functional dependencies | 6 | 0.46 | 2006 |
| 2-Bases of Quadruples | 4 | 0.69 | 2006 |
| Largest family without A union B subset of C intersection D | 4 | 1.87 | 2005 |
| Two-Part and k-Sperner Families: New Proofs Using Permutations | 7 | 1.11 | 2005 |
| Largest family without A ∪ B ⊆ C ∩ D | 15 | 2.67 | 2005 |
| Largest family without A∪B⊆C∩DA∪B⊆C∩D | 7 | 1.15 | 2005 |
| New type of coding problem motivated by database theory | 4 | 0.42 | 2004 |
| Semantics in Databases, Second International Workshop, Dagstuhl Castle, Germany, January 7-12, 2001, Revised Papers | 9 | 1.54 | 2003 |
| A coding problem for pairs of subsets | 0 | 0.34 | 2003 |
| Functional Dependencies in Presence of Errors | 4 | 0.62 | 2002 |
| On the average size of sets in intersecting sperner families | 1 | 0.48 | 2002 |
| Intersecting balanced families of sets | 1 | 0.36 | 2001 |
| Pairs of Disjoint q-element Subsets Far from Each Other | 2 | 0.37 | 2001 |
| Semantics in databases | 31 | 1.23 | 2001 |
| Error-Correcting Keys in Relational Databases | 4 | 0.69 | 2000 |
| Low Discrepancy Allocation of Two-Dimensional Data | 3 | 0.54 | 2000 |
| A simple proof of a theorem of Milner | 2 | 0.71 | 1998 |
| The Average Length of Keys and Functional Dependencies in (Random) Databases | 8 | 9.49 | 1995 |
| A Survey of Some Combinatorial Results Concerning Functional Dependencies in Database Relations | 7 | 0.55 | 1993 |
| The largest component in a random subgraph of the n-cycle | 2 | 0.57 | 1993 |
| The characterization of branching dependencies | 16 | 0.88 | 1992 |
