Skip to content

Claire Kenyon

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

34

Venues

12

Active years

1991–2006

Best venue rank

A*

Where they publish

Papers

34 indexed papers, newest first.

YearVenueTitleAuthors
2006CPAIORPlan B: Uncertainty/Time Trade-Offs for Linear and Integer Programming.Claire Kenyon, Meinolf Sellmann
2006LATINOblivious Medians Via Online Bidding.Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young
2006WAOAOn Hierarchical Diameter-Clustering, and the Supplier Problem.Aparna Das, Claire Kenyon
2005COCOONThe Reverse Greedy Algorithm for the MetricMarek Chrobak, Claire Kenyon, Neal E. Young
2005SODAOn profit-maximizing envy-free pricing.Venkatesan Guruswami, Jason D. Hartline, Anna R. Karlin, David Kempe, Claire Kenyon, Frank McSherry
2004SODAApproximation schemes for multidimensional packing.Jos R. Correa, Claire Kenyon
2004SODAApproximation schemes for Metric Bisection and partitioning.Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon
2004STOCLow distortion maps between point sets.Claire Kenyon, Yuval Rabani, Alistair Sinclair
2004STACSApproximation Schemes for Metric Clustering Problems.Claire Kenyon
2003ISAACDeterministic Algorithm for the t-Threshold Set Problem.Jrmy Barbay, Claire Kenyon
2003STOCOPT versus LOAD in dynamic storage allocation.Adam L. Buchsbaum, Howard J. Karloff, Claire Kenyon, Nick Reingold, Mikkel Thorup
2003STOCApproximation schemes for clustering problems.Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon, Yuval Rabani
2002SODAAdaptive intersection and t-threshold problems.Jrmy Barbay, Claire Kenyon
2002STOCHuffman coding with unequal letter costs.Mordecai J. Golin, Claire Kenyon, Neal E. Young
2001FOCSGlauber Dynamics on Trees and Hyperbolic Graphs.Claire Kenyon, Elchanan Mossel, Yuval Peres
2001SODAOn the discrete Bak-Sneppen model of self-organized criticality.Jrmy Barbay, Claire Kenyon
2001SODABetter approximation algorithms for bin covering.Jnos Csirik, David S. Johnson, Claire Kenyon
2001STOCDynamic TCP acknowledgement and other stories about e/(e-1).Anna R. Karlin, Claire Kenyon, Dana Randall
2000FOCSLinear Waste of Best Fit Bin Packing on Skewed Distributions.Claire Kenyon, Michael Mitzenmacher
2000STOCOn the sum-of-squares algorithm for bin packing.Jnos Csirik, David S. Johnson, Claire Kenyon, James B. Orlin, Peter W. Shor, Richard R. Weber
2000STOCPolynomial-time approximation scheme for data broadcast.Claire Kenyon, Nicolas Schabanel, Neal E. Young
1999ALENEXA Self Organizing Bin Packing Heuristic.Jnos Csirik, David S. Johnson, Claire Kenyon, Peter W. Shor, Richard R. Weber
1999FOCSApproximation Schemes for Minimizing Average Weighted Completion Time with Release Dates.Foto N. Afrati, Evripidis Bampis, Chandra Chekuri, David R. Karger, Claire Kenyon, Sanjeev Khanna, Ioannis Milis, Maurice Queyranne, Martin Skutella, Clifford Stein, Maxim Sviridenko
1999SODAThe Data Broadcast Problem with Non-Uniform Transmission Rimes.Claire Kenyon, Nicolas Schabanel
1998FOCSA Randomized Approximation Scheme for Metric MAX-CUT.Wenceslas Fernandez de la Vega, Claire Kenyon
1997ESAScheduling Independent Multiprocessor Tasks.Abdel Krim Amoura, Evripidis Bampis, Claire Kenyon, Yannis Manoussakis
1996FOCSApproximate Strip Packing.Claire Kenyon, Eric Rmila
1996SODAError-Resilient DNA Computation.Richard M. Karp, Claire Kenyon, Orli Waarts
1996SODABest-Fit Bin-Packing with Random Order.Claire Kenyon
1996SODABiased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing (Preliminary Version).Claire Kenyon, Yuval Rabani, Alistair Sinclair
1994SODASelection in the Presence of Noise: The Design of Playoff Systems.Micah Adler, Peter Gemmell, Mor Harchol-Balter, Richard M. Karp, Claire Kenyon
1993STOCMatchings in lattice graphs.Claire Kenyon, Dana Randall, Alistair Sinclair
1992FOCSTiling a Polygon with RectanglesClaire Kenyon, Richard W. Kenyon
1991FCTData Structures Maxima.Guy Louchard, Claire Kenyon, Ren Schott