George S. Lueker

Publication Activity (10 Years)

Years Active: 1975-2009
Publications (10 Years): 0

Publications

George S. Lueker
Improved bounds on the average length of longest common subsequences. J. ACM 56 (3) (2009)
Wenliang Du, David Eppstein, Michael T. Goodrich, George S. Lueker
On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem. WADS (2009)
Wenliang Du, David Eppstein, Michael T. Goodrich, George S. Lueker
On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem CoRR (2009)
George S. Lueker
On the Convergence of Upper Bound Techniques for the Average Length of Longest Common Subsequences. ANALCO (2008)
Edward G. Coffman Jr., George S. Lueker
Approximation Algorithms for Extensible Bin Packing. J. Sched. 9 (1) (2006)
Michael T. Goodrich, George S. Lueker, Jonathan Z. Sun
C-Planarity of Extrovert Clustered Graphs. Graph Drawing (2005)
George S. Lueker
Improved bounds on the average length of longest common subsequences. SODA (2003)
David Eppstein, George S. Lueker
The minimum expectation selection problem. Random Struct. Algorithms 21 (3-4) (2002)
David Eppstein, George S. Lueker
The Minimum Expectation Selection Problem CoRR (2001)
Edward G. Coffman Jr., George S. Lueker
Approximation algorithms for extensible bin packing. SODA (2001)
Edward G. Coffman Jr., George S. Lueker, Joel Spencer, Peter M. Winkler
Average-Case Analysis of Retangle Packings. LATIN (2000)
George S. Lueker
Average-Case Analysis of Off-Line and On-Line Knapsack Problems. J. Algorithms 29 (2) (1998)
George S. Lueker
Exponentially small bounds on the expected optimum of the partition and subset sum problems. Random Struct. Algorithms 12 (1) (1998)
George S. Lueker
Average-Case Analysis of Off-Line and On-Line Knapsack Problems. SODA (1995)
George S. Lueker, Mariko Molodowitch
More analysis of double hashing. Comb. 13 (1) (1993)
George S. Lueker, Nimrod Megiddo, Vijaya Ramachandran
Linear Programming with Two Variables per Inequality in Poly-Log Time. SIAM J. Comput. 19 (6) (1990)
George S. Lueker, Mariko Molodowitch
More Analysis of Double Hashing STOC (1988)
George S. Lueker, Nimrod Megiddo, Vijaya Ramachandran
Linear Programming with Two Variables per Inequality in Poly-Log Time (Preliminary Version) STOC (1986)
Dan E. Willard, George S. Lueker
Adding Range Restriction Capability to Dynamic Data Structures J. ACM 32 (3) (1985)
Edward G. Coffman Jr., Greg N. Frederickson, George S. Lueker
A Note on Expected Makespans for Largest-First Sequences of Independent Tasks on Two Processors. Math. Oper. Res. 9 (2) (1984)
Edward G. Coffman Jr., Leopold Flatto, George S. Lueker
Expected Makespans for Largest-First Multiprocessor Scheduling. Performance (1984)
George S. Lueker
Bin Packing with Items Uniformly Distributed over Intervals [a,b] FOCS (1983)
George S. Lueker, Dan E. Willard
A Data Structure for Dynamic Range Queries. Inf. Process. Lett. 15 (5) (1982)
George S. Lueker
Surveyor's Forum: Generating Solutions. ACM Comput. Surv. 13 (3) (1981)
George S. Lueker, Edward L. Robertson
That really is a hard problem you've spent six months working on: A tutorial on NP-complete problems. ACM Annual Conference (1981)
George S. Lueker
Optimization Problems on Graphs with Independent Random Edge Weights. SIAM J. Comput. 10 (2) (1981)
Wenceslas Fernandez de la Vega, George S. Lueker
Bin packing can be solved within 1+epsilon in linear time. Comb. 1 (4) (1981)
George S. Lueker
Some Techniques for Solving Recurrences. ACM Comput. Surv. 12 (4) (1980)
George S. Lueker, Kellogg S. Booth
A Linear Time Algorithm for Deciding Interval Graph Isomorphism. J. ACM 26 (2) (1979)
George S. Lueker
A Data Structure for Orthogonal Range Queries FOCS (1978)
George S. Lueker
Maximization Problems on Graphs with Edge Weights Chosen from a Normal Distribution (Extended Abstract) STOC (1978)
Donald J. Rose, Robert Endre Tarjan, George S. Lueker
Algorithmic Aspects of Vertex Elimination on Graphs. SIAM J. Comput. 5 (2) (1976)
Kellogg S. Booth, George S. Lueker
Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms. J. Comput. Syst. Sci. 13 (3) (1976)
Kellogg S. Booth, George S. Lueker
Linear Algorithms to Recognize Interval Graphs and Test for the Consecutive Ones Property STOC (1975)