Search the dblp DataBase
George S. Lueker: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Dan E. Willard, George S. Lueker
Adding Range Restriction Capability to Dynamic Data Structures [Citation Graph (4, 0)][DBLP]
J. ACM, 1985, v:32, n:3, pp:597-617 [Journal] - Kellogg S. Booth, George S. Lueker
Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms. [Citation Graph (2, 0)][DBLP]
J. Comput. Syst. Sci., 1976, v:13, n:3, pp:335-379 [Journal] - George S. Lueker
A Data Structure for Orthogonal Range Queries [Citation Graph (1, 0)][DBLP]
FOCS, 1978, pp:28-34 [Conf] - Kellogg S. Booth, George S. Lueker
Linear Algorithms to Recognize Interval Graphs and Test for the Consecutive Ones Property [Citation Graph (1, 0)][DBLP]
STOC, 1975, pp:255-265 [Conf] - Donald J. Rose, Robert Endre Tarjan, George S. Lueker
Algorithmic Aspects of Vertex Elimination on Graphs. [Citation Graph (1, 0)][DBLP]
SIAM J. Comput., 1976, v:5, n:2, pp:266-283 [Journal] - George S. Lueker
Bin Packing with Items Uniformly Distributed over Intervals [a,b] [Citation Graph (0, 0)][DBLP]
FOCS, 1983, pp:289-297 [Conf] - Michael T. Goodrich, George S. Lueker, Jonathan Z. Sun
C-Planarity of Extrovert Clustered Graphs. [Citation Graph (0, 0)][DBLP]
Graph Drawing, 2005, pp:211-222 [Conf] - Edward G. Coffman Jr., George S. Lueker, Joel Spencer, Peter M. Winkler
Average-Case Analysis of Retangle Packings. [Citation Graph (0, 0)][DBLP]
LATIN, 2000, pp:292-297 [Conf] - Edward G. Coffman Jr., Leopold Flatto, George S. Lueker
Expected Makespans for Largest-First Multiprocessor Scheduling. [Citation Graph (0, 0)][DBLP]
Performance, 1984, pp:491-506 [Conf] - Edward G. Coffman Jr., George S. Lueker
Approximation algorithms for extensible bin packing. [Citation Graph (0, 0)][DBLP]
SODA, 2001, pp:586-588 [Conf] - George S. Lueker
Improved bounds on the average length of longest common subsequences. [Citation Graph (0, 0)][DBLP]
SODA, 2003, pp:130-131 [Conf] - George S. Lueker
Average-Case Analysis of Off-Line and On-Line Knapsack Problems. [Citation Graph (0, 0)][DBLP]
SODA, 1995, pp:179-188 [Conf] - George S. Lueker
Maximization Problems on Graphs with Edge Weights Chosen from a Normal Distribution (Extended Abstract) [Citation Graph (0, 0)][DBLP]
STOC, 1978, pp:13-18 [Conf] - George S. Lueker, Mariko Molodowitch
More Analysis of Double Hashing [Citation Graph (0, 0)][DBLP]
STOC, 1988, pp:354-359 [Conf] - George S. Lueker, Nimrod Megiddo, Vijaya Ramachandran
Linear Programming with Two Variables per Inequality in Poly-Log Time (Preliminary Version) [Citation Graph (0, 0)][DBLP]
STOC, 1986, pp:196-205 [Conf] - George S. Lueker, Mariko Molodowitch
More analysis of double hashing. [Citation Graph (0, 0)][DBLP]
Combinatorica, 1993, v:13, n:1, pp:83-96 [Journal] - Wenceslas Fernandez de la Vega, George S. Lueker
Bin packing can be solved within 1+epsilon in linear time. [Citation Graph (0, 0)][DBLP]
Combinatorica, 1981, v:1, n:4, pp:349-355 [Journal] - David Eppstein, George S. Lueker
The Minimum Expectation Selection Problem [Citation Graph (0, 0)][DBLP]
CoRR, 2001, v:0, n:, pp:- [Journal] - George S. Lueker
Some Techniques for Solving Recurrences. [Citation Graph (0, 0)][DBLP]
ACM Comput. Surv., 1980, v:12, n:4, pp:419-436 [Journal] - George S. Lueker
Surveyor's Forum: Generating Solutions. [Citation Graph (0, 0)][DBLP]
ACM Comput. Surv., 1981, v:13, n:3, pp:370- [Journal] - George S. Lueker, Dan E. Willard
A Data Structure for Dynamic Range Queries. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1982, v:15, n:5, pp:209-213 [Journal] - George S. Lueker, Kellogg S. Booth
A Linear Time Algorithm for Deciding Interval Graph Isomorphism. [Citation Graph (0, 0)][DBLP]
J. ACM, 1979, v:26, n:2, pp:183-195 [Journal] - George S. Lueker
Average-Case Analysis of Off-Line and On-Line Knapsack Problems. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1998, v:29, n:2, pp:277-305 [Journal] - David Eppstein, George S. Lueker
The minimum expectation selection problem. [Citation Graph (0, 0)][DBLP]
Random Struct. Algorithms, 2002, v:21, n:3-4, pp:278-292 [Journal] - George S. Lueker
Exponentially small bounds on the expected optimum of the partition and subset sum problems. [Citation Graph (0, 0)][DBLP]
Random Struct. Algorithms, 1998, v:12, n:1, pp:51-62 [Journal] - Edward G. Coffman Jr., George S. Lueker
Approximation Algorithms for Extensible Bin Packing. [Citation Graph (0, 0)][DBLP]
J. Scheduling, 2006, v:9, n:1, pp:63-69 [Journal] - George S. Lueker
Optimization Problems on Graphs with Independent Random Edge Weights. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 1981, v:10, n:2, pp:338-351 [Journal] - George S. Lueker, Nimrod Megiddo, Vijaya Ramachandran
Linear Programming with Two Variables per Inequality in Poly-Log Time. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 1990, v:19, n:6, pp:1000-1010 [Journal]
On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem. [Citation Graph (, )][DBLP]
On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem [Citation Graph (, )][DBLP]
Search in 0.006secs, Finished in 0.007secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002