default search action
George S. Lueker
Person information
- affiliation: University of California, Irvine, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
- [j17]George S. Lueker:
Improved bounds on the average length of longest common subsequences. J. ACM 56(3): 17:1-17:38 (2009) - [c15]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: 242-253 - [i2]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 abs/0904.3756 (2009) - 2008
- [c14]George S. Lueker:
On the Convergence of Upper Bound Techniques for the Average Length of Longest Common Subsequences. ANALCO 2008: 169-182 - 2006
- [j16]Edward G. Coffman Jr., George S. Lueker:
Approximation Algorithms for Extensible Bin Packing. J. Sched. 9(1): 63-69 (2006) - 2005
- [c13]Michael T. Goodrich, George S. Lueker, Jonathan Z. Sun:
C-Planarity of Extrovert Clustered Graphs. GD 2005: 211-222 - 2003
- [c12]George S. Lueker:
Improved bounds on the average length of longest common subsequences. SODA 2003: 130-131 - 2002
- [j15]David Eppstein, George S. Lueker:
The minimum expectation selection problem. Random Struct. Algorithms 21(3-4): 278-292 (2002) - 2001
- [c11]Edward G. Coffman Jr., George S. Lueker:
Approximation algorithms for extensible bin packing. SODA 2001: 586-588 - [i1]David Eppstein, George S. Lueker:
The Minimum Expectation Selection Problem. CoRR cs.DS/0110011 (2001) - 2000
- [c10]Edward G. Coffman Jr., George S. Lueker, Joel Spencer, Peter M. Winkler
:
Average-Case Analysis of Retangle Packings. LATIN 2000: 292-297
1990 – 1999
- 1998
- [j14]George S. Lueker:
Average-Case Analysis of Off-Line and On-Line Knapsack Problems. J. Algorithms 29(2): 277-305 (1998) - [j13]George S. Lueker:
Exponentially small bounds on the expected optimum of the partition and subset sum problems. Random Struct. Algorithms 12(1): 51-62 (1998) - 1995
- [c9]George S. Lueker:
Average-Case Analysis of Off-Line and On-Line Knapsack Problems. SODA 1995: 179-188 - 1993
- [j12]George S. Lueker, Mariko Molodowitch:
More analysis of double hashing. Comb. 13(1): 83-96 (1993) - 1991
- [b1]Edward G. Coffman Jr., George S. Lueker:
Probabilistic analysis of packing and partitioning algorithms. Wiley-Interscience series in discrete mathematics and optimization, Wiley 1991, ISBN 978-0-471-53272-9, pp. I-XIV, 1-192 - 1990
- [j11]George S. Lueker, Nimrod Megiddo, Vijaya Ramachandran:
Linear Programming with Two Variables per Inequality in Poly-Log Time. SIAM J. Comput. 19(6): 1000-1010 (1990)
1980 – 1989
- 1988
- [c8]George S. Lueker, Mariko Molodowitch:
More Analysis of Double Hashing. STOC 1988: 354-359 - 1986
- [c7]George S. Lueker, Nimrod Megiddo, Vijaya Ramachandran:
Linear Programming with Two Variables per Inequality in Poly-Log Time (Preliminary Version). STOC 1986: 196-205 - 1985
- [j10]Dan E. Willard, George S. Lueker:
Adding Range Restriction Capability to Dynamic Data Structures. J. ACM 32(3): 597-617 (1985) - 1984
- [j9]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): 260-266 (1984) - [c6]Edward G. Coffman Jr., Leopold Flatto, George S. Lueker:
Expected Makespans for Largest-First Multiprocessor Scheduling. Performance 1984: 491-506 - 1983
- [c5]George S. Lueker:
Bin Packing with Items Uniformly Distributed over Intervals [a,b]. FOCS 1983: 289-297 - 1982
- [j8]George S. Lueker, Dan E. Willard:
A Data Structure for Dynamic Range Queries. Inf. Process. Lett. 15(5): 209-213 (1982) - 1981
- [j7]Wenceslas Fernandez de la Vega, George S. Lueker:
Bin packing can be solved within 1+epsilon in linear time. Comb. 1(4): 349-355 (1981) - [j6]George S. Lueker:
Surveyor's Forum: Generating Solutions. ACM Comput. Surv. 13(3): 370 (1981) - [j5]George S. Lueker:
Optimization Problems on Graphs with Independent Random Edge Weights. SIAM J. Comput. 10(2): 338-351 (1981) - [c4]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: 293-294 - 1980
- [j4]George S. Lueker:
Some Techniques for Solving Recurrences. ACM Comput. Surv. 12(4): 419-436 (1980)
1970 – 1979
- 1979
- [j3]George S. Lueker, Kellogg S. Booth:
A Linear Time Algorithm for Deciding Interval Graph Isomorphism. J. ACM 26(2): 183-195 (1979) - 1978
- [c3]George S. Lueker:
A Data Structure for Orthogonal Range Queries. FOCS 1978: 28-34 - [c2]George S. Lueker:
Maximization Problems on Graphs with Edge Weights Chosen from a Normal Distribution (Extended Abstract). STOC 1978: 13-18 - 1976
- [j2]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): 335-379 (1976) - [j1]Donald J. Rose, Robert Endre Tarjan, George S. Lueker:
Algorithmic Aspects of Vertex Elimination on Graphs. SIAM J. Comput. 5(2): 266-283 (1976) - 1975
- [c1]Kellogg S. Booth, George S. Lueker:
Linear Algorithms to Recognize Interval Graphs and Test for the Consecutive Ones Property. STOC 1975: 255-265
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: