George S. Lueker

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