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:
Collaborative distances:
Timeline
1975
1980
1985
1990
1995
2000
2005
0
1
2
3
4
5
1
1
1
2
1
1
1
1
1
3
1
1
2
1
1
1
1
1
1
1
1
2
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on ics.uci.edu
On csauthors.net:
Bibliography
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
2005
Proceedings of the Graph Drawing, 13th International Symposium, 2005
2002
2000
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
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
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
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
Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983
1982
1981
SIAM J. Comput., 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
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
Proceedings of the 19th Annual Symposium on Foundations of Computer Science, 1978
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