George S. Lueker

	2009
31		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
30		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)
29		George S. Lueker: Improved bounds on the average length of longest common subsequences. J. ACM 56(3): (2009)
	2006
28		Edward G. Coffman Jr., George S. Lueker: Approximation Algorithms for Extensible Bin Packing. J. Scheduling 9(1): 63-69 (2006)
	2005
27		Michael T. Goodrich, George S. Lueker, Jonathan Z. Sun: C-Planarity of Extrovert Clustered Graphs. Graph Drawing 2005: 211-222
	2003
26		George S. Lueker: Improved bounds on the average length of longest common subsequences. SODA 2003: 130-131
	2002
25		David Eppstein, George S. Lueker: The minimum expectation selection problem. Random Struct. Algorithms 21(3-4): 278-292 (2002)
	2001
24		Edward G. Coffman Jr., George S. Lueker: Approximation algorithms for extensible bin packing. SODA 2001: 586-588
23		David Eppstein, George S. Lueker: The Minimum Expectation Selection Problem CoRR cs.DS/0110011: (2001)
	2000
22		Edward G. Coffman Jr., George S. Lueker, Joel Spencer, Peter M. Winkler: Average-Case Analysis of Retangle Packings. LATIN 2000: 292-297
	1998
21		George S. Lueker: Average-Case Analysis of Off-Line and On-Line Knapsack Problems. J. Algorithms 29(2): 277-305 (1998)
20		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
19		George S. Lueker: Average-Case Analysis of Off-Line and On-Line Knapsack Problems. SODA 1995: 179-188
	1993
18		George S. Lueker, Mariko Molodowitch: More analysis of double hashing. Combinatorica 13(1): 83-96 (1993)
	1990
17		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)
	1988
16		George S. Lueker, Mariko Molodowitch: More Analysis of Double Hashing STOC 1988: 354-359
	1986
15		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
14		Dan E. Willard, George S. Lueker: Adding Range Restriction Capability to Dynamic Data Structures J. ACM 32(3): 597-617 (1985)
	1984
13		Edward G. Coffman Jr., Leopold Flatto, George S. Lueker: Expected Makespans for Largest-First Multiprocessor Scheduling. Performance 1984: 491-506
	1983
12		George S. Lueker: Bin Packing with Items Uniformly Distributed over Intervals [a,b] FOCS 1983: 289-297
	1982
11		George S. Lueker, Dan E. Willard: A Data Structure for Dynamic Range Queries. Inf. Process. Lett. 15(5): 209-213 (1982)
	1981
10		George S. Lueker: Surveyor's Forum: Generating Solutions. ACM Comput. Surv. 13(3): 370 (1981)
9		Wenceslas Fernandez de la Vega, George S. Lueker: Bin packing can be solved within 1+epsilon in linear time. Combinatorica 1(4): 349-355 (1981)
8		George S. Lueker: Optimization Problems on Graphs with Independent Random Edge Weights. SIAM J. Comput. 10(2): 338-351 (1981)
	1980
7		George S. Lueker: Some Techniques for Solving Recurrences. ACM Comput. Surv. 12(4): 419-436 (1980)
	1979
6		George S. Lueker, Kellogg S. Booth: A Linear Time Algorithm for Deciding Interval Graph Isomorphism. J. ACM 26(2): 183-195 (1979)
	1978
5		George S. Lueker: A Data Structure for Orthogonal Range Queries FOCS 1978: 28-34
4		George S. Lueker: Maximization Problems on Graphs with Edge Weights Chosen from a Normal Distribution (Extended Abstract) STOC 1978: 13-18
	1976
3		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)
2		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
1		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

1	Kellogg S. Booth	[1] [3] [6]
2	Edward G. Coffman Jr.	[13] [22] [24] [28]
3	Wenliang Du	[30] [31]
4	David Eppstein	[23] [25] [30] [31]
5	Leopold Flatto	[13]
6	Michael T. Goodrich	[27] [30] [31]
7	Nimrod Megiddo	[15] [17]
8	Mariko Molodowitch	[16] [18]
9	Vijaya Ramachandran	[15] [17]
10	Donald J. Rose	[2]
11	Joel H. Spencer (Joel Spencer)	[22]
12	Jonathan Z. Sun	[27]
13	Robert Endre Tarjan	[2]
14	Wenceslas Fernandez de la Vega	[9]
15	Dan E. Willard	[11] [14]
16	Peter Winkler (Peter M. Winkler)	[22]

Colors in the list of coauthors