| An odd kind of BCH code | 0 | 0.34 | 2013 |
| On Rado's boundedness conjecture | 4 | 0.82 | 2006 |
| A Note on Caterpillar-Embeddings with No Two Parallel Edges | 1 | 0.36 | 2005 |
| On a conjecture of Brualdi and Shen on block transitive tournaments | 2 | 0.42 | 2003 |
| On partitions of discrete boxes | 7 | 0.89 | 2002 |
| Six Lonely Runners | 7 | 0.86 | 2001 |
| Convex Sets in the Plane with Three of Every Four Meeting | 12 | 1.69 | 2001 |
| A dictionary-based approach for gene annotation. | 9 | 7.23 | 1999 |
| Finding Convex Sets Among Points in the Plane | 7 | 1.44 | 1998 |
| A purely combinatorial proof of the Hadwiger Debrunner (p, q) Conjecture | 5 | 1.06 | 1997 |
| Forcing disjoint segments in the plane | 7 | 2.09 | 1996 |
| An upper bound for the Ramsey numbers r(K3,G) | 2 | 0.73 | 1994 |
| Even Cycles in Directed Graphs | 4 | 0.75 | 1994 |
| Modification of consecutive-d digraphs. | 1 | 0.41 | 1994 |
| On the Maximum Number of Triangles in Wheel-Free Graphs | 3 | 2.16 | 1994 |
| The Prison Yard Problem | 3 | 0.41 | 1994 |
| Independence and the Havel-Hakimi residue | 14 | 1.13 | 1994 |
| Crossing Families | 5 | 0.79 | 1994 |
| Minimally distant sets of lattice points | 2 | 0.50 | 1993 |
| Packing lines in a hypercube | 7 | 0.82 | 1993 |
| A note on maximal triangle-free graphs | 6 | 0.87 | 1993 |
| Piercing convex sets | 0 | 0.34 | 1992 |
| Sharpening the LYM inequality | 2 | 0.44 | 1992 |
| Sign vectors and unit vectors | 0 | 0.34 | 1992 |
| Partitioning a rectangle into small perimeter rectangles | 2 | 0.50 | 1992 |
| Point Selections and Weak e-Nets for Convex Hulls | 44 | 5.74 | 1992 |
| Spanning trees with many leaves | 75 | 10.34 | 1991 |
| Partitioning a power set into union-free classes | 5 | 0.82 | 1991 |
| Partitioning a Rectangle into Many Sub-rectangles so that a Line can Meet only a Few. | 0 | 0.34 | 1991 |
| Crossing families | 5 | 0.93 | 1991 |
| An almost linear time algorithm for generalized matrix searching | 63 | 5.52 | 1990 |
| Sphere coverings of the hypercube with incomparable centers | 3 | 0.49 | 1990 |
| Representations of families of triples over GF(2) | 2 | 0.51 | 1990 |
| A new basis for trades | 11 | 1.22 | 1990 |
| Spanning trees with many leaves in cubic graphs | 25 | 6.53 | 1989 |
| Applying the Classification Theorem for Finite Simple Groups to Minimize Pin Count in Uniform Permutation Architectures | 4 | 0.87 | 1988 |
| On a dual version of the one-dimensional bin packing problem | 82 | 8.32 | 1984 |
| An algorithm for constructing regions with rectangles: Independence and minimum generating sets for collections of intervals | 20 | 7.15 | 1984 |
| On the asymptotic number of tournament score sequences | 8 | 2.84 | 1983 |
| An asymptotically optimal layout for the shuffle—exchange graph | 9 | 1.78 | 1983 |
| The Number Of Rounds Needed To Exchange Information Within A Graph | 5 | 8.75 | 1983 |
| An Algorithm For Collapsing Sign Alternating Sequences Of Real Numbers | 0 | 0.34 | 1983 |
| On the number of graphs without 4-cycles | 37 | 3.30 | 1982 |
| Forests and score vectors | 7 | 1.36 | 1981 |
| Inherent Complexity Trade-Offs For Range Query Problems | 10 | 2.66 | 1981 |
| Intersections of k-element sets | 8 | 17.00 | 1981 |
| New layouts for the shuffle-exchange graph(Extended Abstract) | 15 | 4.01 | 1981 |
| Ensembles and Largest Sojourns of Random Walks | 0 | 0.34 | 1980 |
| Skew chain orders and sets of rectangles | 3 | 5.31 | 1979 |
| Extremal properties of collections of subsets containing no two sets and their union | 10 | 2.57 | 1976 |
