George S. Lueker

Affiliations:
  • University of California, Irvine, USA


According to our database1, George S. Lueker authored at least 29 papers between 1975 and 2009.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2009
Improved bounds on the average length of longest common subsequences.
J. ACM, 2009

On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

2008
On the Convergence of Upper Bound Techniques for the Average Length of Longest Common Subsequences.
Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics, 2008

2006
Approximation Algorithms for Extensible Bin Packing.
J. Sched., 2006

2005
C-Planarity of Extrovert Clustered Graphs.
Proceedings of the Graph Drawing, 13th International Symposium, 2005

2002
The minimum expectation selection problem.
Random Struct. Algorithms, 2002

2000
Average-Case Analysis of Retangle Packings.
Proceedings of the LATIN 2000: Theoretical Informatics, 2000

1998
Exponentially small bounds on the expected optimum of the partition and subset sum problems.
Random Struct. Algorithms, 1998

Average-Case Analysis of Off-Line and On-Line Knapsack Problems.
J. Algorithms, 1998

1993
More analysis of double hashing.
Comb., 1993

1991
Probabilistic analysis of packing and partitioning algorithms.
Wiley-Interscience series in discrete mathematics and optimization, Wiley, ISBN: 978-0-471-53272-9, 1991

1990
Linear Programming with Two Variables per Inequality in Poly-Log Time.
SIAM J. Comput., 1990

1986
Linear Programming with Two Variables per Inequality in Poly-Log Time (Preliminary Version)
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

1985
Adding Range Restriction Capability to Dynamic Data Structures
J. ACM, July, 1985

1984
A Note on Expected Makespans for Largest-First Sequences of Independent Tasks on Two Processors.
Math. Oper. Res., 1984

Expected Makespans for Largest-First Multiprocessor Scheduling.
Proceedings of the Performance '84, 1984

1983
Bin Packing with Items Uniformly Distributed over Intervals [a,b]
Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

1982
A Data Structure for Dynamic Range Queries.
Inf. Process. Lett., 1982

1981
Optimization Problems on Graphs with Independent Random Edge Weights.
SIAM J. Comput., 1981

Surveyor's Forum: Generating Solutions.
ACM Comput. Surv., 1981

Bin packing can be solved within 1+epsilon in linear time.
Comb., 1981

That really is a hard problem you've spent six months working on: A tutorial on NP-complete problems.
Proceedings of the ACM 1981 Annual Conference, Los Angeles, CA, USA, November 9-11, 1981., 1981

1980
Some Techniques for Solving Recurrences.
ACM Comput. Surv., 1980

1979
A Linear Time Algorithm for Deciding Interval Graph Isomorphism.
J. ACM, 1979

1978
Maximization Problems on Graphs with Edge Weights Chosen from a Normal Distribution (Extended Abstract)
Proceedings of the 10th Annual ACM Symposium on Theory of Computing, 1978

A Data Structure for Orthogonal Range Queries
Proceedings of the 19th Annual Symposium on Foundations of Computer Science, 1978

1976
Algorithmic Aspects of Vertex Elimination on Graphs.
SIAM J. Comput., 1976

Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms.
J. Comput. Syst. Sci., 1976

1975
Linear Algorithms to Recognize Interval Graphs and Test for the Consecutive Ones Property
Proceedings of the 7th Annual ACM Symposium on Theory of Computing, 1975


  Loading...