Claire Kenyon-Mathieu

12 papers A* 6Journal 6
YearRankTypeTitle / Venue / Authors
2009 J jnl
On Hierarchical Diameter-Clustering and the Supplier Problem.
Theory Comput. Syst.
Aparna Das, Claire Kenyon-Mathieu
2008 J jnl
Commitment under uncertainty: Two-stage stochastic matching problems.
Theor. Comput. Sci.
Irit Katriel, Claire Kenyon-Mathieu, Eli Upfal
2007 A* conf
A polynomial-time approximation scheme for Steiner tree in planar graphs.
SODA
Glencora Borradaile, Claire Kenyon-Mathieu, Philip N. Klein
2007 A* conf
Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems.
ICALP
Irit Katriel, Claire Kenyon-Mathieu, Eli Upfal
2007 A* conf
How to rank with few errors.
STOC
Claire Kenyon-Mathieu, Warren Schudy
2007 A* conf
Linear programming relaxations of maxcut.
SODA
Wenceslas Fernandez de la Vega, Claire Kenyon-Mathieu
2006 J jnl
How to rank with few errors: A PTAS for Weighted Feedback Arc Set on Tournaments.
Electron. Colloquium Comput. Complex.
Claire Kenyon-Mathieu, Warren Schudy
2006 J jnl
SIGACT news online algorithms column 10: competitiveness via doubling.
SIGACT News
Marek Chrobak, Claire Kenyon-Mathieu
1991 J jnl
Maximum Queue Size and Hashing with Lazy Deletion.
Algorithmica
Claire Kenyon-Mathieu, Jeffrey Scott Vitter
1991 J jnl
The Maximum Size of Dynamic Data Structures.
SIAM J. Comput.
Claire Kenyon-Mathieu, Jeffrey Scott Vitter
1989 A* conf
General Methods for the Analysis of the Maximum Size of Dynamic Data Structures (Extended Abstract).
ICALP
Claire Kenyon-Mathieu, Jeffrey Scott Vitter
1989 A* conf
Verifying Partial Orders
STOC
Claire Kenyon-Mathieu, Valerie King