Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "George S. Lueker" ( http://dblp.L3S.de/Authors/George_S._Lueker )

URL (Homepage):  http://www.ics.uci.edu/~lueker/  Author page on DBLP  Author page in RDF  Community of George S. Lueker in ASPL-2

Publication years (Num. hits)
1975-1986 (15) 1988-2009 (17)
Publication types (Num. hits)
article(18) book(1) inproceedings(13)
Venues (Conferences, Journals, ...)
STOC(4) J. ACM(3) SIAM J. Comput.(3) SODA(3) ACM Comput. Surv.(2) Combinatorica(2) CoRR(2) FOCS(2) Random Struct. Algorithms(2) Graph Drawing(1) Inf. Process. Lett.(1) J. Algorithms(1) J. Comput. Syst. Sci.(1) J. Scheduling(1) LATIN(1) Performance(1) More (+10 of total 17)
Authors
George S. Lueker(32) Edward G. Coffman Jr.(5) David Eppstein(4) Kellogg S. Booth(3) Michael T. Goodrich(3) Dan E. Willard(2) Mariko Molodowitch(2) Nimrod Megiddo(2) Vijaya Ramachandran(2) Wenliang Du(2) Donald J. Rose(1) Joel Spencer(1) Jonathan Z. Sun(1) Leopold Flatto(1) Peter M. Winkler(1) Robert Endre Tarjan(1) More (+10 of total 17)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 3 occurrences of 3 keywords
Results
Found 32 publication records. Showing 32 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1George S. Lueker Improved bounds on the average length of longest common subsequences. Search on Bibsonomy J. ACM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Arratia-Steele conjecture, dynamic programming, average-case analysis, Longest common subsequences
1Wenliang Du, David Eppstein, Michael T. Goodrich, George S. Lueker On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Wenliang Du, David Eppstein, Michael T. Goodrich, George S. Lueker On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Edward G. Coffman Jr., George S. Lueker Approximation Algorithms for Extensible Bin Packing. Search on Bibsonomy J. Scheduling The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Michael T. Goodrich, George S. Lueker, Jonathan Z. Sun C-Planarity of Extrovert Clustered Graphs. Search on Bibsonomy Graph Drawing The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1George S. Lueker Improved bounds on the average length of longest common subsequences. Search on Bibsonomy SODA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1David Eppstein, George S. Lueker The minimum expectation selection problem. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1David Eppstein, George S. Lueker The Minimum Expectation Selection Problem Search on Bibsonomy CoRR The full citation details ... 2001 DBLP  BibTeX  RDF
1Edward G. Coffman Jr., George S. Lueker Approximation algorithms for extensible bin packing. Search on Bibsonomy SODA The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Edward G. Coffman Jr., George S. Lueker, Joel Spencer, Peter M. Winkler Average-Case Analysis of Retangle Packings. Search on Bibsonomy LATIN The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1George S. Lueker Exponentially small bounds on the expected optimum of the partition and subset sum problems. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1George S. Lueker Average-Case Analysis of Off-Line and On-Line Knapsack Problems. Search on Bibsonomy J. Algorithms The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1George S. Lueker Average-Case Analysis of Off-Line and On-Line Knapsack Problems. Search on Bibsonomy SODA The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1George S. Lueker, Mariko Molodowitch More analysis of double hashing. Search on Bibsonomy Combinatorica The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
1Edward G. Coffman Jr., George S. Lueker Probabilistic analysis of packing and partitioning algorithms. Search on Bibsonomy 1991   RDF
1George S. Lueker, Nimrod Megiddo, Vijaya Ramachandran Linear Programming with Two Variables per Inequality in Poly-Log Time. Search on Bibsonomy SIAM J. Comput. The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
1George S. Lueker, Mariko Molodowitch More Analysis of Double Hashing Search on Bibsonomy STOC The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
1George S. Lueker, Nimrod Megiddo, Vijaya Ramachandran Linear Programming with Two Variables per Inequality in Poly-Log Time (Preliminary Version) Search on Bibsonomy STOC The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
1Dan E. Willard, George S. Lueker Adding Range Restriction Capability to Dynamic Data Structures Search on Bibsonomy J. ACM The full citation details ... 1985 DBLP  DOI  BibTeX  RDF
1Edward G. Coffman Jr., Leopold Flatto, George S. Lueker Expected Makespans for Largest-First Multiprocessor Scheduling. Search on Bibsonomy Performance The full citation details ... 1984 DBLP  BibTeX  RDF
1George S. Lueker Bin Packing with Items Uniformly Distributed over Intervals [a,b] Search on Bibsonomy FOCS The full citation details ... 1983 DBLP  DOI  BibTeX  RDF
1George S. Lueker, Dan E. Willard A Data Structure for Dynamic Range Queries. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1982 DBLP  DOI  BibTeX  RDF
1Wenceslas Fernandez de la Vega, George S. Lueker Bin packing can be solved within 1+epsilon in linear time. Search on Bibsonomy Combinatorica The full citation details ... 1981 DBLP  DOI  BibTeX  RDF
1George S. Lueker Surveyor's Forum: Generating Solutions. Search on Bibsonomy ACM Comput. Surv. The full citation details ... 1981 DBLP  DOI  BibTeX  RDF
1George S. Lueker Optimization Problems on Graphs with Independent Random Edge Weights. Search on Bibsonomy SIAM J. Comput. The full citation details ... 1981 DBLP  DOI  BibTeX  RDF
1George S. Lueker Some Techniques for Solving Recurrences. Search on Bibsonomy ACM Comput. Surv. The full citation details ... 1980 DBLP  DOI  BibTeX  RDF
1George S. Lueker, Kellogg S. Booth A Linear Time Algorithm for Deciding Interval Graph Isomorphism. Search on Bibsonomy J. ACM The full citation details ... 1979 DBLP  DOI  BibTeX  RDF
1George S. Lueker A Data Structure for Orthogonal Range Queries Search on Bibsonomy FOCS The full citation details ... 1978 DBLP  DOI  BibTeX  RDF
1George S. Lueker Maximization Problems on Graphs with Edge Weights Chosen from a Normal Distribution (Extended Abstract) Search on Bibsonomy STOC The full citation details ... 1978 DBLP  DOI  BibTeX  RDF
1Kellogg S. Booth, George S. Lueker Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1976 DBLP  DOI  BibTeX  RDF
1Donald J. Rose, Robert Endre Tarjan, George S. Lueker Algorithmic Aspects of Vertex Elimination on Graphs. Search on Bibsonomy SIAM J. Comput. The full citation details ... 1976 DBLP  DOI  BibTeX  RDF
1Kellogg S. Booth, George S. Lueker Linear Algorithms to Recognize Interval Graphs and Test for the Consecutive Ones Property Search on Bibsonomy STOC The full citation details ... 1975 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #32 of 32 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.