The following pages link to George S. Lueker (Q221781):
Displayed 34 items.
- Approximation algorithms for extensible bin packing (Q880529) (← links)
- A note on the average-case behavior of a simple differencing method for partitioning (Q1095035) (← links)
- Item:Q221781 (redirect page) (← links)
- Bin packing can be solved within 1+epsilon in linear time (Q1164429) (← links)
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms (Q1242450) (← links)
- A data structure for dynamic range queries (Q1838844) (← links)
- More analysis of double hashing (Q2367445) (← links)
- (Q2768352) (← links)
- On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem (Q3183459) (← links)
- A Note on Expected Makespans for Largest-First Sequences of Independent Tasks on Two Processors (Q3325433) (← links)
- Improved bounds on the average length of longest common subsequences (Q3452214) (← links)
- Linear Programming with Two Variables Per Inequality in Poly-Log Time (Q3495656) (← links)
- Probabilistic analysis of optimum partitioning (Q3750704) (← links)
- Adding range restriction capability to dynamic data structures (Q3766892) (← links)
- Asymptotic Methods in the Probabilistic Analysis of Sequencing and Packing Heuristics (Q3779988) (← links)
- (Q3792481) (← links)
- (Q3875975) (← links)
- Optimization Problems on Graphs with Independent Random Edge Weights (Q3910569) (← links)
- (Q3919074) (← links)
- (Q3949968) (← links)
- (Q4002885) (← links)
- (Q4035170) (← links)
- Algorithmic Aspects of Vertex Elimination on Graphs (Q4124209) (← links)
- A Linear Time Algorithm for Deciding Interval Graph Isomorphism (Q4187325) (← links)
- Average-Case Analysis of Off-Line and On-Line Knapsack Problems (Q4225866) (← links)
- (Q4379728) (← links)
- (Q4471286) (← links)
- (Q4508386) (← links)
- The minimum expectation selection problem (Q4798168) (← links)
- (Q4886047) (← links)
- On the Convergence of Upper Bound Techniques for the Average Length of Longest Common Subsequences (Q5194642) (← links)
- Maximization problems on graphs with edge weights chosen from a normal distribution (Extended Abstract) (Q5402536) (← links)
- Graph Drawing (Q5897632) (← links)
- Packing random rectangles (Q5952007) (← links)