George S. Lueker
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
1976/12/01 by Kellogg S. Booth, George S. Lueker · 20 citations
Computer Science · Mathematics · #1-planar graph #Advanced Graph Theory Research #Algorithm #Algorithms and Data Compression #Chordal graph #Combinatorics #Computer science #Discrete mathematics #Graph #Indifference graph #Interval (graph theory) #Interval graph #Line graph #Mathematics #Pathwidth #Planarity testing #Property (philosophy) #Property testing #Tree (set theory) #semigroups and automata theory
- Algorithmic Aspects of Vertex Elimination on Graphs
1976/06/01 by Donald J. Rose, Robert E. Tarjan, George S. Lueker · 16 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Graph Labeling and Dimension Problems #Graph Theory and Algorithms #Combinatorics #Gaussian elimination #Mathematics #Conjecture #Vertex (graph theory) #Time complexity #Graph #Discrete mathematics #Gaussian
- Bin packing can be solved within 1 + ε in linear time
1981/12/01 by W. Fernandez de la Véga, W. Fernandez de la Vega, George S. Lueker +1 · 4 citations
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Algorithm #Bin #Bin packing problem #Combinatorics #Discrete mathematics #Mathematics #Optimization and Packing Problems #Unit (ring theory) #graph theory and CDMA systems
- A Linear Time Algorithm for Deciding Interval Graph Isomorphism
1979/04/01 by George S. Lueker, Kellogg S. Booth · 3 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Algorithm #Citation #Combinatorics #Complexity and Algorithms in Graphs #Computer science #Constraint Satisfaction and Optimization #Graph #Interval (graph theory) #Isomorphism (crystallography) #Library science #Mathematics #Operations research #Theoretical computer science
- A note on the average-case behavior of a simple differencing method for partitioning
1987/12/01 by George S. Lueker, George S Lueker · 2 citations
Mathematics · #Advanced Combinatorial Mathematics #Limits and Structures in Graph Theory #Markov Chains and Monte Carlo Methods
- Improved bounds on the average length of longest common subsequences
2009/05/01 by George S. Lueker · 1 citation
Chemistry · Computer Science · Mathematics · #Algorithms and Data Compression #Alphabet #Chemistry #Combinatorics #Computer science #Conjecture #Constant (computer programming) #Discrete mathematics #Limits and Structures in Graph Theory #Longest common subsequence problem #Longest increasing subsequence #Mathematics #Sequence (biology) #Statistics #Subsequence #Upper and lower bounds #Value (mathematics) #semigroups and automata theory