George S. Lueker

Available identifiers

zbMath Open lueker.george-sMaRDI QIDQ221781

List of research outcomes

Publication	Date of Publication	Type
On the Convergence of Upper Bound Techniques for the Average Length of Longest Common Subsequences	2019-09-16	Paper
Improved bounds on the average length of longest common subsequences	2015-11-11	Paper
Maximization problems on graphs with edge weights chosen from a normal distribution (Extended Abstract)	2014-03-14	Paper
On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem	2009-10-20	Paper
Approximation algorithms for extensible bin packing	2007-05-15	Paper
Graph Drawing	2006-11-13	Paper
https://portal.mardi4nfdi.de/entity/Q4471286	2004-07-28	Paper
https://portal.mardi4nfdi.de/entity/Q2768352	2003-06-19	Paper
The minimum expectation selection problem	2003-03-19	Paper
Packing random rectangles	2002-05-02	Paper
https://portal.mardi4nfdi.de/entity/Q4508386	2000-10-03	Paper
Average-Case Analysis of Off-Line and On-Line Knapsack Problems	1999-01-17	Paper
Exponentially small bounds on the expected optimum of the partition and subset sum problems	1998-03-31	Paper
https://portal.mardi4nfdi.de/entity/Q4886047	1996-10-13	Paper
More analysis of double hashing	1993-08-16	Paper
https://portal.mardi4nfdi.de/entity/Q4035170	1993-05-18	Paper
https://portal.mardi4nfdi.de/entity/Q4002885	1992-09-18	Paper
Linear Programming with Two Variables Per Inequality in Poly-Log Time	1990-01-01	Paper
Asymptotic Methods in the Probabilistic Analysis of Sequencing and Packing Heuristics	1988-01-01	Paper
A note on the average-case behavior of a simple differencing method for partitioning	1987-01-01	Paper
Probabilistic analysis of optimum partitioning	1986-01-01	Paper
Adding range restriction capability to dynamic data structures	1985-01-01	Paper
A Note on Expected Makespans for Largest-First Sequences of Independent Tasks on Two Processors	1984-01-01	Paper
A data structure for dynamic range queries	1982-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3792481	1982-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3949968	1982-01-01	Paper
Bin packing can be solved within 1+epsilon in linear time	1981-01-01	Paper
Optimization Problems on Graphs with Independent Random Edge Weights	1981-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3919074	1980-01-01	Paper
A Linear Time Algorithm for Deciding Interval Graph Isomorphism	1979-01-01	Paper
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms	1976-01-01	Paper
Algorithmic Aspects of Vertex Elimination on Graphs	1976-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3875975	1975-01-01	Paper

Research outcomes over time

This page was built for person: George S. Lueker