Springer Series in 8 R Bank, RL Graham, J Stoer, R Varga | 15491 | 1993 |

Concrete mathematics: a foundation for computer science RL Graham, DE Knuth, O Patashnik, S Liu Computers in Physics 3 (5), 106-107, 1989 | 8844 | 1989 |

Optimization and approximation in deterministic sequencing and scheduling: a survey RL Graham, EL Lawler, JK Lenstra, AHGR Kan Annals of discrete mathematics 5, 287-326, 1979 | 6920 | 1979 |

Bounds on multiprocessing timing anomalies RL Graham SIAM journal on Applied Mathematics 17 (2), 416-429, 1969 | 2988 | 1969 |

An efficient algorithm for determining the convex hull of a finite planar set RL Graham Info. Pro. Lett. 1, 132-133, 1972 | 2282 | 1972 |

Bounds for certain multiprocessing anomalies RL Graham Bell system technical journal 45 (9), 1563-1581, 1966 | 2162 | 1966 |

Computer and job-shop scheduling theory JL Bruno Wiley, 1976 | 1739 | 1976 |

Ramsey theory RL Graham, BL Rothschild, JH Spencer John Wiley & Sons, 1990 | 1556 | 1990 |

Worst-case performance bounds for simple one-dimensional packing algorithms DS Johnson, A Demers, JD Ullman, MR Garey, RL Graham SIAM Journal on computing 3 (4), 299-325, 1974 | 1142 | 1974 |

On the history of the minimum spanning tree problem RL Graham, P Hell Annals of the History of Computing 7 (1), 43-57, 1985 | 972 | 1985 |

Optimal scheduling for two-processor systems EG Coffman, RL Graham Acta informatica 1 (3), 200-213, 1972 | 883 | 1972 |

Ramsey theory RL Graham, BL Rothschild Interscience series in discrete mathematics, 1980 | 798 | 1980 |

Spearman's footrule as a measure of disarray P Diaconis, RL Graham Journal of the Royal Statistical Society: Series B (Methodological) 39 (2 …, 1977 | 736 | 1977 |

The complexity of computing Steiner minimal trees MR Garey, RL Graham, DS Johnson SIAM journal on applied mathematics 32 (4), 835-859, 1977 | 729 | 1977 |

Handbook of combinatorics RL Graham Elsevier, 1995 | 630 | 1995 |

Quasi-random graphs FRK Chung, RL Graham, RM Wilson Combinatorica 9 (4), 345-362, 1989 | 536 | 1989 |

Old and new problems and results in combinatorial number theory P Erdös, RL Graham L'enseignement mathemathique Universite Genčve, 1980 | 523 | 1980 |

The Steiner problem in phylogeny is NP-complete LR Foulds, RL Graham Advances in Applied mathematics 3 (1), 43-49, 1982 | 520 | 1982 |

On the addressing problem for loop switching RL Graham, HO Pollak The Bell system technical journal 50 (8), 2495-2519, 1971 | 514 | 1971 |

Some NP-complete geometric problems MR Garey, RL Graham, DS Johnson Proceedings of the eighth annual ACM symposium on Theory of computing, 10-22, 1976 | 469 | 1976 |