• Publications
  • Influence
Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms
TLDR
A data structure called a PQ-tree is introduced to represent the permutations of a set U in which various subsets of U occur consecutively. Expand
  • 1,530
  • 141
Algorithmic Aspects of Vertex Elimination on Graphs
TLDR
We consider a graph-theoretic elimination process which is related to performing Gaussian elimination on sparse symmetric positive definite systems of linear equations. Expand
  • 1,169
  • 116
  • PDF
Bin packing can be solved within 1 + ε in linear time
For any listL ofn numbers in (0, 1) letL* denote the minimum number of unit capacity bins needed to pack the elements ofL. We prove that, for every positive ε, there exists anO(n)-time algorithmSExpand
  • 523
  • 52
Adding range restriction capability to dynamic data structures
TLDR
A database is said to allow range restrictions if one may request that only records with some specified field in a specified range be considered when answering a given query. Expand
  • 190
  • 11
A data structure for orthogonal range queries
  • G. S. Lueker
  • Computer Science
  • 19th Annual Symposium on Foundations of Computer…
  • 16 October 1978
TLDR
We present a data structure and algorithm which enable one to insert and delete points and to perform orthogonal range queries in a d-dimensional space. Expand
  • 225
  • 10
A Linear Time Algorithm for Deciding Interval Graph Isomorphism
TLDR
An efficient algorithm for testing isomorphism of interval graphs is implemented using a data structure called a PQ-tree. Expand
  • 197
  • 10
Average-case analysis of off-line and on-line knapsack problems
  • G. S. Lueker
  • Mathematics, Computer Science
  • SODA '95
  • 22 January 1995
TLDR
We consider the average-case behavior of the Zero?One Knapsack problem, as well as an on-line version studied by Marchetti-Spaccamela and Vercellis. Expand
  • 94
  • 9
Bin packing with items uniformly distributed over intervals [a,b]
  • G. S. Lueker
  • Mathematics, Computer Science
  • 24th Annual Symposium on Foundations of Computer…
  • 7 November 1983
TLDR
We consider the problem of packing n items which are drawn uniformly from intervals of the form [a,b], where 0 ≪ a ≪ b ≪ 1. Expand
  • 68
  • 6
Linear algorithms to recognize interval graphs and test for the consecutive ones property
TLDR
A matrix of zeroes and ones is said to have the consecutive ones property if there is a permutation of its rows such that the ones in each column appear consecutively. Expand
  • 59
  • 6
Improved bounds on the average length of longest common subsequences
  • G. S. Lueker
  • Mathematics, Computer Science
  • JACM
  • 12 January 2003
TLDR
We show that the average length of the longest common subsequence of two random strings of length <i>n</i> over an alphabet is asymptotic to γ<sub><i>k</i></sub> for some constant γ <sub>2</sub> depending on <i>. Expand
  • 45
  • 6
  • PDF
...
1
2
3
4
5
...