| 2013 | WAW | Anarchy Is Free in Network Creation. | Ronald L. Graham, Linus Hamilton, Ariel Levavi, Po-Shen Loh |
| 2012 | ASPDAC | Character design and stamp algorithms for Character Projection Electron-Beam Lithography. | Peng Du, Wenbo Zhao, Shih-Hung Weng, Chung-Kuan Cheng, Ronald L. Graham |
| 2009 | ISAAC | Bubblesort and Juggling Sequences. | Ronald L. Graham |
| 2008 | SODA | Analysis of greedy approximations with nonsubmodular potential functions. | Ding-Zhu Du, Ronald L. Graham, Panos M. Pardalos, Peng-Jun Wan, Weili Wu, Wenbo Zhao |
| 2007 | AAIM | How to Play the Majority Game with Liars. | Steve Butler, Jia Mao, Ronald L. Graham |
| 2007 | TAMC | Approximately Optimal Trees for Group Key Management with Batch Updates. | Minming Li, Ze Feng, Ronald L. Graham, Frances F. Yao |
| 2006 | DAC | Communication latency aware low power NoC synthesis. | Yuanfang Hu, Yi Zhu, Hongyu Chen, Ronald L. Graham, Chung-Kuan Cheng |
| 2006 | ICCAD | Timing model reduction for hierarchical timing analysis. | Shuo Zhou, Yi Zhu, Yuanfang Hu, Ronald L. Graham, Mike Hutton, Chung-Kuan Cheng |
| 2005 | ASPDAC | Constructing zero-deficiency parallel prefix adder of minimum depth. | Haikun Zhu, Chung-Kuan Cheng, Ronald L. Graham |
| 2005 | COCOON | Oblivious and Adaptive Strategies for the Majority and Plurality Problems. | Fan R. K. Chung, Ronald L. Graham, Jia Mao, Andrew Chi-Chih Yao |
| 2004 | SPAA | Parallelism versus memory allocation in pipelined router forwarding engines. | Fan R. K. Chung, Ronald L. Graham, George Varghese |
| 2002 | ICCD | Balancing the Interconnect Topology for Arrays of Processors between Cost and Power. | Esther Y. Cheng, Feng Zhou, Bo Yao, Chung-Kuan Cheng, Ronald L. Graham |
| 2002 | SODA | Guessing secrets with inner product questions. | Fan R. K. Chung, Ronald L. Graham, Linyuan Lu |
| 2001 | SODA | Guessing secrets. | Fan R. K. Chung, Ronald L. Graham, Frank Thomson Leighton |
| 1998 | COCOON | Combinatorial Problems Arising in Massive Data Sets (Abstract). | Fan R. K. Chung, Ronald L. Graham |
| 1995 | COCOON | Dense Packings of 3k(k+1)+1 Equal Disks in a Circle for k=1, 2, 3, 4 and 5. | Boris D. Lubachevsky, Ronald L. Graham |
| 1994 | ISAAC | Quasi-Random Combinatorial Structures (Abstract). | Ronald L. Graham |
| 1993 | STOC | Routing permutations on graphs via matchings. | Noga Alon, Fan R. K. Chung, Ronald L. Graham |
| 1989 | STOC | On the Improbability of Reaching Byzantine Agreements (Preliminary Version) | Ronald L. Graham, Andrew Chi-Chih Yao |
| 1976 | STOC | Some NP-Complete Geometric Problems | M. R. Garey, Ronald L. Graham, David S. Johnson |
| 1973 | SOSP | Bounds on Scheduling with Limited Resources. | M. R. Garey, Ronald L. Graham |
| 1972 | STOC | Worst-Case Analysis of Memory Allocation Algorithms | M. R. Garey, Ronald L. Graham, Jeffrey D. Ullman |