Linear Algorithms to Recognize Interval Graphs and Test for the Consecutive Ones Property - Kellogg S. Booth; George S. Lueker (STOC, 1975)

Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms. - Kellogg S. Booth; George S. Lueker (J. Comput. Syst. Sci., 1976)

Algorithmic Aspects of Vertex Elimination on Graphs. - Donald J. Rose; Robert Endre Tarjan; George S. Lueker (SIAM J. Comput., 1976)

A Data Structure for Orthogonal Range Queries - George S. Lueker (FOCS, 1978)

Maximization Problems on Graphs with Edge Weights Chosen from a Normal Distribution (Extended Abstract) - George S. Lueker (STOC, 1978)

A Linear Time Algorithm for Deciding Interval Graph Isomorphism. - George S. Lueker; Kellogg S. Booth (J. ACM, 1979)

Some Techniques for Solving Recurrences. - George S. Lueker (ACM Comput. Surv., 1980)

That really is a hard problem you've spent six months working on: A tutorial on NP-complete problems. - George S. Lueker; Edward L. Robertson (ACM Annual Conference, 1981)

Bin packing can be solved within 1+epsilon in linear time. - Wenceslas Fernandez de la Vega; George S. Lueker (Comb., 1981)

Surveyor's Forum: Generating Solutions. - George S. Lueker (ACM Comput. Surv., 1981)

Optimization Problems on Graphs with Independent Random Edge Weights. - George S. Lueker (SIAM J. Comput., 1981)

A Data Structure for Dynamic Range Queries. - George S. Lueker; Dan E. Willard (Inf. Process. Lett., 1982)

Bin Packing with Items Uniformly Distributed over Intervals [a,b] - George S. Lueker (FOCS, 1983)

Expected Makespans for Largest-First Multiprocessor Scheduling. - Edward G. Coffman Jr.; Leopold Flatto; George S. Lueker (Performance, 1984)

A Note on Expected Makespans for Largest-First Sequences of Independent Tasks on Two Processors. - Edward G. Coffman Jr.; Greg N. Frederickson; George S. Lueker (Math. Oper. Res., 1984)

Adding Range Restriction Capability to Dynamic Data Structures - Dan E. Willard; George S. Lueker (J. ACM, 1985)

Linear Programming with Two Variables per Inequality in Poly-Log Time (Preliminary Version) - George S. Lueker; Nimrod Megiddo; Vijaya Ramachandran (STOC, 1986)

Linear Programming with Two Variables per Inequality in Poly-Log Time. - George S. Lueker; Nimrod Megiddo; Vijaya Ramachandran (SIAM J. Comput., 1990)

Probabilistic analysis of packing and partitioning algorithms. - Edward G. Coffman Jr.; George S. Lueker (Wiley, 1991)

More analysis of double hashing. - George S. Lueker; Mariko Molodowitch (Comb., 1993)

Average-Case Analysis of Off-Line and On-Line Knapsack Problems. - George S. Lueker (J. Algorithms, 1998)

Exponentially small bounds on the expected optimum of the partition and subset sum problems. - George S. Lueker (Random Struct. Algorithms, 1998)

Average-Case Analysis of Retangle Packings. - Edward G. Coffman Jr.; George S. Lueker; Joel Spencer; Peter M. Winkler (LATIN, 2000)

The minimum expectation selection problem. - David Eppstein; George S. Lueker (Random Struct. Algorithms, 2002)

C-Planarity of Extrovert Clustered Graphs. - Michael T. Goodrich; George S. Lueker; Jonathan Z. Sun (GD, 2005)

Approximation Algorithms for Extensible Bin Packing. - Edward G. Coffman Jr.; George S. Lueker (J. Sched., 2006)

On the Convergence of Upper Bound Techniques for the Average Length of Longest Common Subsequences. - George S. Lueker (ANALCO, 2008)

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 (WADS, 2009)

Improved bounds on the average length of longest common subsequences. - George S. Lueker (J. ACM, 2009)