| 2009 | WADS | On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem. | Wenliang Du, David Eppstein, Michael T. Goodrich, George S. Lueker |
| 2005 | GD | C-Planarity of Extrovert Clustered Graphs. | Michael T. Goodrich, George S. Lueker, Jonathan Z. Sun |
| 2003 | SODA | Improved bounds on the average length of longest common subsequences. | George S. Lueker |
| 2001 | SODA | Approximation algorithms for extensible bin packing. | Edward G. Coffman Jr., George S. Lueker |
| 2000 | LATIN | Average-Case Analysis of Retangle Packings. | Edward G. Coffman Jr., George S. Lueker, Joel Spencer, Peter M. Winkler |
| 1995 | SODA | Average-Case Analysis of Off-Line and On-Line Knapsack Problems. | George S. Lueker |
| 1988 | STOC | More Analysis of Double Hashing | George S. Lueker, Mariko Molodowitch |
| 1986 | STOC | Linear Programming with Two Variables per Inequality in Poly-Log Time (Preliminary Version) | George S. Lueker, Nimrod Megiddo, Vijaya Ramachandran |
| 1984 | PERFORMANCE | Expected Makespans for Largest-First Multiprocessor Scheduling. | Edward G. Coffman Jr., Leopold Flatto, George S. Lueker |
| 1983 | FOCS | Bin Packing with Items Uniformly Distributed over Intervals [a,b] | George S. Lueker |
| 1978 | FOCS | A Data Structure for Orthogonal Range Queries | George S. Lueker |
| 1978 | STOC | Maximization Problems on Graphs with Edge Weights Chosen from a Normal Distribution (Extended Abstract) | George S. Lueker |
| 1975 | STOC | Linear Algorithms to Recognize Interval Graphs and Test for the Consecutive Ones Property | Kellogg S. Booth, George S. Lueker |