% csauthors.net - beta - BibTeX bibliography of Claire Mathieu
@article{journals/algorithmica/Mathieu87,
title = {Some Problems in Computational Geometry.},
year = {1987},
journal = {Algorithmica},
author = {{Claire Mathieu}}
}
@article{journals/ipl/MathieuPY87,
title = {Average Efficiency of Data Structures for Binary Image Processing.},
year = {1987},
journal = {Inf. Process. Lett.},
author = {{Claire Mathieu} and {Claude Puech} and {Hossein Yahia}}
}
@inproceedings{conf/icalp/Kenyon-MathieuV89,
title = {General Methods for the Analysis of the Maximum Size of Dynamic Data Structures (Extended Abstract).},
year = {1989},
booktitle = {ICALP},
author = {{Claire Kenyon-Mathieu} and {Jeffrey Scott Vitter}},
publisher = {Springer},
booktitle = {Automata, Languages and Programming, 16th International Colloquium, ICALP89, Stresa, Italy, July 11-15, 1989, Proceedings}
}
@inproceedings{conf/stoc/Kenyon-MathieuK89,
title = {Verifying Partial Orders},
year = {1989},
booktitle = {STOC},
author = {{Claire Kenyon-Mathieu} and {Valerie King}},
publisher = {ACM},
booktitle = {Proceedings of the 21st Annual ACM Symposium on Theory of Computing, May 14-17, 1989, Seattle, Washington, USA}
}
@article{journals/ijfcs/KenyonY90,
title = {On Evaluating Boolean Functions with Unreliable Tests.},
year = {1990},
journal = {Int. J. Found. Comput. Sci.},
author = {{Claire Kenyon} and {Andrew Chi-Chih Yao}}
}
@article{journals/algorithmica/KenyonV91,
title = {Maximum Queue Size and Hashing with Lazy Deletion.},
year = {1991},
journal = {Algorithmica},
author = {{Claire Kenyon-Mathieu} and {Jeffrey Scott Vitter}}
}
@article{journals/siamcomp/Kenyon-MathieuV91,
title = {The Maximum Size of Dynamic Data Structures.},
year = {1991},
journal = {SIAM J. Comput.},
author = {{Claire Kenyon-Mathieu} and {Jeffrey Scott Vitter}}
}
@inproceedings{conf/focs/KenyonK92,
title = {Tiling a Polygon with Rectangles},
year = {1992},
booktitle = {FOCS},
author = {{Claire Kenyon} and {Richard W. Kenyon}},
publisher = {IEEE Computer Society},
booktitle = {33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992}
}
@article{journals/dcg/KenyonK92,
title = {How to Take Short Cuts.},
year = {1992},
journal = {Discret. Comput. Geom.},
author = {{Claire Kenyon} and {Richard W. Kenyon}}
}
@inproceedings{conf/stoc/KenyonRS93,
title = {Matchings in lattice graphs.},
year = {1993},
booktitle = {STOC},
author = {{Claire Kenyon} and {Dana Randall} and {Alistair Sinclair}},
publisher = {ACM},
booktitle = {Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, May 16-18, 1993, San Diego, CA, USA}
}
@article{journals/ipl/FraigniaudKP93,
title = {Finding a Target Subnetwork in Sparse Networks with Random Faults.},
year = {1993},
journal = {Inf. Process. Lett.},
author = {{Pierre Fraigniaud} and {Claire Kenyon} and {Andrzej Pelc}}
}
@article{journals/siamcomp/GoddardKKS93,
title = {Optimal Randomized Algorithms for Local Sorting and Set-Maxima.},
year = {1993},
journal = {SIAM J. Comput.},
author = {{Wayne Goddard} and {Claire Kenyon} and {Valerie King} and {Leonard J. Schulman}}
}
@inproceedings{conf/soda/AdlerGHKK94,
title = {Selection in the Presence of Noise: The Design of Playoff Systems.},
year = {1994},
booktitle = {SODA},
author = {{Micah Adler} and {Peter Gemmell} and {Mor Harchol-Balter} and {Richard M. Karp} and {Claire Kenyon}},
publisher = {ACM/SIAM},
booktitle = {Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, Arlington, Virginia, USA.}
}
@inproceedings{conf/spdp/DehneKF94,
title = {Scalable and architecture independent parallel geometric algorithms with high probability optimal time.},
year = {1994},
booktitle = {SPDP},
author = {{Frank Dehne} and {Claire Kenyon} and {Andreas Fabri}},
publisher = {IEEE Computer Society},
booktitle = {Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, SPDP 1994, Dallas, Texas, USA , October 26-29, 1994}
}
@article{journals/rsa/KenyonK94,
title = {On Boolean Decision Trees with Faulty Nodes.},
year = {1994},
journal = {Random Struct. Algorithms},
author = {{Claire Kenyon} and {Valerie King}}
}
@inproceedings{conf/focs/KenyonR96,
title = {Approximate Strip Packing.},
year = {1996},
booktitle = {FOCS},
author = {{Claire Kenyon} and {Eric Rémila}},
publisher = {IEEE Computer Society},
booktitle = {37th Annual Symposium on Foundations of Computer Science, FOCS '96, Burlington, Vermont, USA, 14-16 October, 1996}
}
@inproceedings{conf/nips/BrightwellKP96,
title = {Multilayer Neural Networks: One or Two Hidden Layers?},
year = {1996},
booktitle = {NIPS},
author = {{Graham R. Brightwell} and {Claire Kenyon} and {Hélène Paugam-Moisy}},
publisher = {MIT Press},
booktitle = {Advances in Neural Information Processing Systems 9, NIPS, Denver, CO, USA, December 2-5, 1996}
}
@inproceedings{conf/soda/Kenyon96,
title = {Best-Fit Bin-Packing with Random Order.},
year = {1996},
booktitle = {SODA},
author = {{Claire Kenyon}},
publisher = {ACM/SIAM},
booktitle = {Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 28-30 January 1996, Atlanta, Georgia, USA.}
}
@inproceedings{conf/soda/KenyonRS96,
title = {Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing (Preliminary Version).},
year = {1996},
booktitle = {SODA},
author = {{Claire Kenyon} and {Yuval Rabani} and {Alistair Sinclair}},
publisher = {ACM/SIAM},
booktitle = {Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 28-30 January 1996, Atlanta, Georgia, USA.}
}
@article{journals/dm/KenyonR96,
title = {Perfect matchings in the triangular lattice.},
year = {1996},
journal = {Discret. Math.},
author = {{Claire Kenyon} and {Eric Rémila}}
}
@article{journals/ijac/ChaboudK96,
title = {Planar Cayley Graphs with Regular Dual.},
year = {1996},
journal = {Int. J. Algebra Comput.},
author = {{Thomas Chaboud} and {Claire Kenyon}}
}
@inproceedings{conf/ipps/FerreiraKRU97,
title = {d-Dimensional Range Search on Multicomputers.},
year = {1997},
booktitle = {IPPS},
author = {{Afonso Ferreira} and {Claire Kenyon} and {Andrew Rau-Chaplin} and {Stéphane Ubéda}},
publisher = {IEEE Computer Society},
booktitle = {11th International Parallel Processing Symposium (IPPS '97), 1-5 April 1997, Geneva, Switzerland, Proceedings}
}
@article{journals/siamcomp/LouchardKS97,
title = {Data Structures' Maxima.},
year = {1997},
journal = {SIAM J. Comput.},
author = {{Guy Louchard} and {Claire Kenyon} and {René Schott}}
}
@article{journals/amai/KenyonP98,
title = {Multilayer Neural Networks and Polyhedral Dichotomies.},
year = {1998},
journal = {Ann. Math. Artif. Intell.},
author = {{Claire Kenyon} and {Hélène Paugam-Moisy}}
}
@article{journals/jal/KenyonRS98,
title = {Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing.},
year = {1998},
journal = {J. Algorithms},
author = {{Claire Kenyon} and {Yuval Rabani} and {Alistair Sinclair}}
}
@inproceedings{conf/alenex/CsirikJKSW99,
title = {A Self Organizing Bin Packing Heuristic.},
year = {1999},
booktitle = {ALENEX},
author = {{János Csirik} and {David S. Johnson} and {Claire Kenyon} and {Peter W. Shor} and {Richard R. Weber}},
publisher = {Springer},
booktitle = {Algorithm Engineering and Experimentation, International Workshop ALENEX '99, Baltimore, MD, USA, January 15-16, 1999, Selected Papers}
}
@inproceedings{conf/focs/AfratiBCKKKMQSSS99,
title = {Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates.},
year = {1999},
booktitle = {FOCS},
author = {{Foto N. Afrati} and {Evripidis Bampis} and {Chandra Chekuri} and {David R. Karger} and {Claire Kenyon} and {Sanjeev Khanna} and {Ioannis Milis} and {Maurice Queyranne} and {Martin Skutella} and {Clifford Stein 001} and {Maxim Sviridenko}},
publisher = {IEEE Computer Society},
booktitle = {40th Annual Symposium on Foundations of Computer Science, FOCS '99, 17-18 October, 1999, New York, NY, USA}
}
@inproceedings{conf/random/AfratiBKM99,
title = {Scheduling on a Constant Number of Machines.},
year = {1999},
booktitle = {RANDOM-APPROX},
author = {{Foto N. Afrati} and {Evripidis Bampis} and {Claire Kenyon} and {Ioannis Milis}},
publisher = {Springer},
booktitle = {Randomization, Approximation, and Combinatorial Algorithms and Techniques, Third International Workshop on Randomization and Approximation Techniques in Computer Science, and Second International Workshop on Approximation Algorithms for Combinatorial Optimization Problems RANDOM-APPROX'99, Berkeley, CA, USA, August 8-11, 1999, Proceedings}
}
@inproceedings{conf/soda/KenyonS99,
title = {The Data Broadcast Problem with Non-Uniform Transmission Rimes.},
year = {1999},
booktitle = {SODA},
author = {{Claire Kenyon} and {Nicolas Schabanel}},
publisher = {ACM/SIAM},
booktitle = {Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 17-19 January 1999, Baltimore, Maryland, USA.}
}
@article{journals/algorithmica/FerreiraKRU99,
title = {d-Dimensional Range Search on Multicomputers.},
year = {1999},
journal = {Algorithmica},
author = {{Afonso Ferreira} and {Claire Kenyon} and {Andrew Rau-Chaplin} and {Stéphane Ubéda}}
}
@article{journals/rsa/KarpKW99,
title = {Error-resilient DNA computation.},
year = {1999},
journal = {Random Struct. Algorithms},
author = {{Richard M. Karp} and {Claire Kenyon} and {Orli Waarts}}
}
@inproceedings{conf/fsttcs/AfratiBFJK00,
title = {Scheduling to Minimize the Average Completion Time of Dedicated Tasks.},
year = {2000},
booktitle = {FSTTCS},
author = {{Foto N. Afrati} and {Evripidis Bampis} and {Aleksei V. Fishkin} and {Klaus Jansen} and {Claire Kenyon}},
publisher = {Springer},
booktitle = {Foundations of Software Technology and Theoretical Computer Science, 20th Conference, FST TCS 2000 New Delhi, India, December 13-15, 2000, Proceedings.}
}
@inproceedings{conf/stoc/KenyonSY00,
title = {Polynomial-time approximation scheme for data broadcast.},
year = {2000},
booktitle = {STOC},
author = {{Claire Kenyon} and {Nicolas Schabanel} and {Neal E. Young}},
publisher = {ACM},
booktitle = {Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, May 21-23, 2000, Portland, OR, USA}
}
@article{journals/mor/KenyonR00,
title = {A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem.},
year = {2000},
journal = {Math. Oper. Res.},
author = {{Claire Kenyon} and {Eric Rémila}}
}
@inproceedings{conf/focs/KenyonMP01,
title = {Glauber Dynamics on Trees and Hyperbolic Graphs.},
year = {2001},
booktitle = {FOCS},
author = {{Claire Kenyon} and {Elchanan Mossel} and {Yuval Peres}},
publisher = {IEEE Computer Society},
booktitle = {42nd Annual Symposium on Foundations of Computer Science, FOCS 2001, 14-17 October 2001, Las Vegas, Nevada, USA}
}
@inproceedings{conf/soda/BarbayK01,
title = {On the discrete Bak-Sneppen model of self-organized criticality.},
year = {2001},
booktitle = {SODA},
author = {{Jérémy Barbay} and {Claire Kenyon}},
publisher = {ACM/SIAM},
booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, USA.}
}
@inproceedings{conf/soda/CsirikJK01,
title = {Better approximation algorithms for bin covering.},
year = {2001},
booktitle = {SODA},
author = {{János Csirik} and {David S. Johnson} and {Claire Kenyon}},
publisher = {ACM/SIAM},
booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, USA.}
}
@inproceedings{conf/stoc/KarlinKR01,
title = {Dynamic TCP acknowledgement and other stories about e/(e-1).},
year = {2001},
booktitle = {STOC},
author = {{Anna R. Karlin} and {Claire Kenyon} and {Dana Randall}},
publisher = {ACM},
booktitle = {Proceedings on 33rd Annual ACM Symposium on Theory of Computing, July 6-8, 2001, Heraklion, Crete, Greece}
}
@article{journals/jcss/VegaK01,
title = {A Randomized Approximation Scheme for Metric MAX-CUT.},
year = {2001},
journal = {J. Comput. Syst. Sci.},
author = {{Wenceslas Fernandez de la Vega} and {Claire Kenyon}}
}
@inproceedings{conf/soda/BarbayK02,
title = {Adaptive intersection and t-threshold problems.},
year = {2002},
booktitle = {SODA},
author = {{Jérémy Barbay} and {Claire Kenyon}},
publisher = {ACM/SIAM},
booktitle = {Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, USA.}
}
@inproceedings{conf/stoc/GolinKY02,
title = {Huffman coding with unequal letter costs.},
year = {2002},
booktitle = {STOC},
author = {{Mordecai J. Golin} and {Claire Kenyon} and {Neal E. Young}},
publisher = {ACM},
booktitle = {Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada}
}
@article{journals/algorithmica/AmouraBKM02,
title = {Scheduling Independent Multiprocessor Tasks.},
year = {2002},
journal = {Algorithmica},
author = {{Abdel Krim Amoura} and {Evripidis Bampis} and {Claire Kenyon} and {Yannis Manoussakis}}
}
@article{journals/eccc/ECCC-TR02-025,
title = {Polynomial Time Approximation Schemes for Metric Min-Sum Clustering},
year = {2002},
journal = {Electron. Colloquium Comput. Complex.},
author = {{Wenceslas Fernandez de la Vega} and {Marek Karpinski} and {Claire Kenyon} and {Yuval Rabani}}
}
@article{journals/eccc/ECCC-TR02-041,
title = {A Polynomial Time Approximation Scheme for Metric MIN-BISECTION},
year = {2002},
journal = {Electron. Colloquium Comput. Complex.},
author = {{Wenceslas Fernandez de la Vega} and {Marek Karpinski} and {Claire Kenyon}}
}
@article{journals/rsa/KenyonM02,
title = {Linear waste of best fit bin packing on skewed distributions.},
year = {2002},
journal = {Random Struct. Algorithms},
author = {{Claire Kenyon} and {Michael Mitzenmacher}}
}
@inproceedings{conf/isaac/BarbayK03,
title = {Deterministic Algorithm for the t-Threshold Set Problem.},
year = {2003},
booktitle = {ISAAC},
author = {{Jérémy Barbay} and {Claire Kenyon}},
publisher = {Springer},
booktitle = {Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings}
}
@inproceedings{conf/random/KarpK03,
title = {A Gambling Game Arising in the Analysis of Adaptive Randomized Rounding.},
year = {2003},
booktitle = {RANDOM-APPROX},
author = {{Richard M. Karp} and {Claire Kenyon}},
publisher = {Springer},
booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings}
}
@inproceedings{conf/stoc/VegaKKR03,
title = {Approximation schemes for clustering problems.},
year = {2003},
booktitle = {STOC},
author = {{Wenceslas Fernandez de la Vega} and {Marek Karpinski} and {Claire Kenyon} and {Yuval Rabani}},
publisher = {ACM},
booktitle = {Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA}
}
@article{journals/algorithmica/KarlinKR03,
title = {Dynamic TCP Acknowledgment and Other Stories about e/(e-1).},
year = {2003},
journal = {Algorithmica},
author = {{Anna R. Karlin} and {Claire Kenyon} and {Dana Randall}}
}
@article{journals/algorithmica/KenyonS03,
title = {The Data Broadcast Problem with Non-Uniform Transmission Times.},
year = {2003},
journal = {Algorithmica},
author = {{Claire Kenyon} and {Nicolas Schabanel}}
}
@inproceedings{conf/soda/CorreaK04,
title = {Approximation schemes for multidimensional packing.},
year = {2004},
booktitle = {SODA},
author = {{José R. Correa} and {Claire Kenyon}},
publisher = {SIAM},
booktitle = {Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004}
}
@inproceedings{conf/soda/VegaKK04,
title = {Approximation schemes for Metric Bisection and partitioning.},
year = {2004},
booktitle = {SODA},
author = {{Wenceslas Fernandez de la Vega} and {Marek Karpinski} and {Claire Kenyon}},
publisher = {SIAM},
booktitle = {Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004}
}
@inproceedings{conf/stacs/Kenyon04,
title = {Approximation Schemes for Metric Clustering Problems.},
year = {2004},
booktitle = {STACS},
author = {{Claire Kenyon}},
publisher = {Springer},
booktitle = {STACS 2004, 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings}
}
@article{journals/iandc/KenyonK04,
title = {Sensitivity, block sensitivity, and l-block sensitivity of boolean functions.},
year = {2004},
journal = {Inf. Comput.},
author = {{Claire Kenyon} and {Samuel Kutin}}
}
@article{journals/siamcomp/BuchsbaumKKRT04,
title = {OPT Versus LOAD in Dynamic Storage Allocation.},
year = {2004},
journal = {SIAM J. Comput.},
author = {{Adam L. Buchsbaum} and {Howard J. Karloff} and {Claire Kenyon} and {Nick Reingold} and {Mikkel Thorup}}
}
@inproceedings{conf/soda/GuruswamiHKKKM05,
title = {On profit-maximizing envy-free pricing.},
year = {2005},
booktitle = {SODA},
author = {{Venkatesan Guruswami} and {Jason D. Hartline} and {Anna R. Karlin} and {David Kempe 001} and {Claire Kenyon} and {Frank McSherry}},
publisher = {SIAM},
booktitle = {Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005}
}
@article{journals/corr/abs-cs-0504104,
title = {The reverse greedy algorithm for the metric k-median problem},
year = {2005},
journal = {CoRR},
author = {{Marek Chrobak} and {Claire Kenyon} and {Neal E. Young}}
}
@article{journals/corr/abs-cs-0509031,
title = {On the Worst-case Performance of the Sum-of-Squares Algorithm for Bin Packing},
year = {2005},
journal = {CoRR},
author = {{János Csirik} and {David S. Johnson} and {Claire Kenyon}}
}
@inproceedings{conf/cpaior/KenyonS06,
title = {Plan B: Uncertainty/Time Trade-Offs for Linear and Integer Programming.},
year = {2006},
booktitle = {CPAIOR},
author = {{Claire Kenyon} and {Meinolf Sellmann}},
publisher = {Springer},
booktitle = {Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Third International Conference, CPAIOR 2006, Cork, Ireland, May 31 - June 2, 2006, Proceedings}
}
@inproceedings{conf/latin/ChrobakKNY06,
title = {Oblivious Medians Via Online Bidding.},
year = {2006},
booktitle = {LATIN},
author = {{Marek Chrobak} and {Claire Kenyon} and {John Noga} and {Neal E. Young}},
publisher = {Springer},
booktitle = {LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings}
}
@article{journals/eccc/Kenyon-MathieuS06,
title = {How to rank with few errors: A PTAS for Weighted Feedback Arc Set on Tournaments.},
year = {2006},
journal = {Electron. Colloquium Comput. Complex.},
author = {{Claire Kenyon-Mathieu} and {Warren Schudy}}
}
@article{journals/ipl/ChrobakKY06,
title = {The reverse greedy algorithm for the metric k-median problem.},
year = {2006},
journal = {Inf. Process. Lett.},
author = {{Marek Chrobak} and {Claire Kenyon} and {Neal E. Young}}
}
@article{journals/jacm/CsirikJKOSW06,
title = {On the Sum-of-Squares algorithm for bin packing.},
year = {2006},
journal = {J. ACM},
author = {{János Csirik} and {David S. Johnson} and {Claire Kenyon} and {James B. Orlin} and {Peter W. Shor} and {Richard R. Weber}}
}
@article{journals/mor/BansalCKS06,
title = {Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes.},
year = {2006},
journal = {Math. Oper. Res.},
author = {{Nikhil Bansal 001} and {José R. Correa} and {Claire Kenyon} and {Maxim Sviridenko}}
}
@article{journals/sigact/ChrobakK06,
title = {SIGACT news online algorithms column 10: competitiveness via doubling.},
year = {2006},
journal = {SIGACT News},
author = {{Marek Chrobak} and {Claire Kenyon-Mathieu}}
}
@inproceedings{conf/sigecom/CaryDEGHKMS07,
title = {Greedy bidding strategies for keyword auctions.},
year = {2007},
booktitle = {EC},
author = {{Matthew Cary} and {Aparna Das} and {Benjamin Edelman} and {Ioannis Giotis 001} and {Kurtis Heimerl} and {Anna R. Karlin} and {Claire Mathieu} and {Michael Schwarz 002}},
publisher = {ACM},
booktitle = {Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), San Diego, California, USA, June 11-15, 2007}
}
@inproceedings{conf/soda/BorradaileKK07,
title = {A polynomial-time approximation scheme for Steiner tree in planar graphs.},
year = {2007},
booktitle = {SODA},
author = {{Glencora Borradaile} and {Claire Kenyon-Mathieu} and {Philip N. Klein}},
publisher = {SIAM},
booktitle = {Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007}
}
@inproceedings{conf/soda/VegaK07,
title = {Linear programming relaxations of maxcut.},
year = {2007},
booktitle = {SODA},
author = {{Wenceslas Fernandez de la Vega} and {Claire Kenyon-Mathieu}},
publisher = {SIAM},
booktitle = {Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007}
}
@inproceedings{conf/stoc/Kenyon-MathieuS07,
title = {How to rank with few errors.},
year = {2007},
booktitle = {STOC},
author = {{Claire Kenyon-Mathieu} and {Warren Schudy}},
publisher = {ACM},
booktitle = {Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007}
}
@inproceedings{conf/wads/BorradaileKM07,
title = {Steiner Tree in Planar Graphs: An O ( n log n ) Approximation Scheme with Singly-Exponential Dependence on Epsilon.},
year = {2007},
booktitle = {WADS},
author = {{Glencora Borradaile} and {Philip N. Klein} and {Claire Mathieu}},
publisher = {Springer},
booktitle = {Algorithms and Data Structures, 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings}
}
@inproceedings{conf/icalp/AzarBKMN08,
title = {Improved Approximation Algorithms for Budgeted Allocations.},
year = {2008},
booktitle = {ICALP (1)},
author = {{Yossi Azar} and {Benjamin E. Birnbaum} and {Anna R. Karlin} and {Claire Mathieu} and {C. Thach Nguyen}},
publisher = {Springer},
booktitle = {Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games}
}
@inproceedings{conf/soda/MathieuS08,
title = {Yet another algorithm for dense max cut: go greedy.},
year = {2008},
booktitle = {SODA},
author = {{Claire Mathieu} and {Warren Schudy}},
publisher = {SIAM},
booktitle = {Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008}
}
@inproceedings{conf/spaa/CharikarKMNS08,
title = {Online multicast with egalitarian cost sharing.},
year = {2008},
booktitle = {SPAA},
author = {{Moses Charikar} and {Howard J. Karloff} and {Claire Mathieu} and {Joseph Naor} and {Michael E. Saks}},
publisher = {ACM},
booktitle = {SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Munich, Germany, June 14-16, 2008}
}
@article{journals/algorithmica/ChrobakKNY08,
title = {Incremental Medians via Online Bidding.},
year = {2008},
journal = {Algorithmica},
author = {{Marek Chrobak} and {Claire Kenyon} and {John Noga} and {Neal E. Young}}
}
@article{journals/ipl/MathieuP08,
title = {Distortion lower bounds for line embeddings.},
year = {2008},
journal = {Inf. Process. Lett.},
author = {{Claire Mathieu} and {Charalampos Papamanthou}}
}
@article{journals/sigact/BirnbaumM08,
title = {On-line bipartite matching made simple.},
year = {2008},
journal = {SIGACT News},
author = {{Benjamin E. Birnbaum} and {Claire Mathieu}}
}
@article{journals/talg/BarbayK08,
title = {Alternation and redundancy analysis of the intersection problem.},
year = {2008},
journal = {ACM Trans. Algorithms},
author = {{Jérémy Barbay} and {Claire Kenyon}}
}
@article{journals/tcs/KatrielKU08,
title = {Commitment under uncertainty: Two-stage stochastic matching problems.},
year = {2008},
journal = {Theor. Comput. Sci.},
author = {{Irit Katriel} and {Claire Kenyon-Mathieu} and {Eli Upfal}}
}
@inproceedings{conf/stoc/MathieuS09,
title = {Sherali-adams relaxations of the matching polytope.},
year = {2009},
booktitle = {STOC},
author = {{Claire Mathieu} and {Alistair Sinclair}},
publisher = {ACM},
booktitle = {Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009}
}
@article{journals/corr/abs-0908-3633,
title = {Maximizing profit using recommender systems},
year = {2009},
journal = {CoRR},
author = {{Aparna Das} and {Claire Mathieu} and {Daniel Ricketts 001}}
}
@article{journals/eccc/MagniezMN09,
title = {Recognizing well-parenthesized expressions in the streaming model.},
year = {2009},
journal = {Electron. Colloquium Comput. Complex.},
author = {{Frédéric Magniez} and {Claire Mathieu} and {Ashwin Nayak 001}}
}
@article{journals/mst/DasK09,
title = {On Hierarchical Diameter-Clustering and the Supplier Problem.},
year = {2009},
journal = {Theory Comput. Syst.},
author = {{Aparna Das} and {Claire Kenyon-Mathieu}}
}
@article{journals/siamcomp/KenyonRS09,
title = {Low Distortion Maps Between Point Sets.},
year = {2009},
journal = {SIAM J. Comput.},
author = {{Claire Kenyon} and {Yuval Rabani} and {Alistair Sinclair}}
}
@article{journals/talg/BorradaileKM09,
title = {An O(n log n) approximation scheme for Steiner tree in planar graphs.},
year = {2009},
journal = {ACM Trans. Algorithms},
author = {{Glencora Borradaile} and {Philip N. Klein} and {Claire Mathieu}}
}
@inproceedings{conf/soda/DasM10,
title = {A Quasi-polynomial Time Approximation Scheme for Euclidean Capacitated Vehicle Routing.},
year = {2010},
booktitle = {SODA},
author = {{Aparna Das} and {Claire Mathieu}},
publisher = {SIAM},
booktitle = {Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010}
}
@inproceedings{conf/soda/MathieuS10,
title = {Correlation Clustering with Noisy Input.},
year = {2010},
booktitle = {SODA},
author = {{Claire Mathieu} and {Warren Schudy}},
publisher = {SIAM},
booktitle = {Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010}
}
@inproceedings{conf/stacs/MathieuSS10,
title = {Online Correlation Clustering.},
year = {2010},
booktitle = {STACS},
author = {{Claire Mathieu} and {Ocan Sankur} and {Warren Schudy}},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, March 4-6, 2010, Nancy, France}
}
@inproceedings{conf/waoa/DasMM10,
title = {The Train Delivery Problem - Vehicle Routing Meets Bin Packing.},
year = {2010},
booktitle = {WAOA},
author = {{Aparna Das} and {Claire Mathieu} and {Shay Mozes}},
publisher = {Springer},
booktitle = {Approximation and Online Algorithms - 8th International Workshop, WAOA 2010, Liverpool, UK, September 9-10, 2010. Revised Papers}
}
@inproceedings{conf/waoa/MathieuV10,
title = {Online Ranking for Tournament Graphs.},
year = {2010},
booktitle = {WAOA},
author = {{Claire Mathieu} and {Adrian Vladu}},
publisher = {Springer},
booktitle = {Approximation and Online Algorithms - 8th International Workshop, WAOA 2010, Liverpool, UK, September 9-10, 2010. Revised Papers}
}
@article{journals/talg/Mathieu10,
title = {Foreword to special issue SODA 2009.},
year = {2010},
journal = {ACM Trans. Algorithms},
author = {{Claire Mathieu}}
}
@inproceedings{conf/ipco/KarlinMN11,
title = {Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack.},
year = {2011},
booktitle = {IPCO},
author = {{Anna R. Karlin} and {Claire Mathieu} and {C. Thach Nguyen}},
publisher = {Springer},
booktitle = {Integer Programming and Combinatoral Optimization - 15th International Conference, IPCO 2011, New York, NY, USA, June 15-17, 2011. Proceedings}
}
@article{journals/dagstuhl-reports/JansenMSY11,
title = {Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091).},
year = {2011},
journal = {Dagstuhl Reports},
author = {{Klaus Jansen} and {Claire Mathieu} and {Hadas Shachnai} and {Neal E. Young}}
}
@inproceedings{conf/approx/KonradMM12,
title = {Maximum Matching in Semi-streaming with Few Passes.},
year = {2012},
booktitle = {APPROX-RANDOM},
author = {{Christian Konrad 001} and {Frédéric Magniez} and {Claire Mathieu}},
publisher = {Springer},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012, Cambridge, MA, USA, August 15-17, 2012. Proceedings}
}
@inproceedings{conf/soda/BateniHKM12,
title = {A polynomial-time approximation scheme for planar multiway cut.},
year = {2012},
booktitle = {SODA},
author = {{MohammadHossein Bateni} and {MohammadTaghi Hajiaghayi} and {Philip N. Klein} and {Claire Mathieu}},
publisher = {SIAM},
booktitle = {Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, January 17-19, 2012}
}
@inproceedings{conf/soda/EisenstatKM12,
title = {An efficient polynomial-time approximation scheme for Steiner forest in planar graphs.},
year = {2012},
booktitle = {SODA},
author = {{David Eisenstat} and {Philip N. Klein} and {Claire Mathieu}},
publisher = {SIAM},
booktitle = {Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, January 17-19, 2012}
}
@article{journals/combinatorics/CoriMR12,
title = {On the Number of Indecomposable Permutations with a Given Number of Cycles.},
year = {2012},
journal = {Electron. J. Comb.},
author = {{Robert Cori} and {Claire Mathieu} and {John Michael Robson}}
}
@article{journals/ipl/MathieuO12,
title = {Lower bounds for randomized algorithms for online chain partitioning.},
year = {2012},
journal = {Inf. Process. Lett.},
author = {{Claire Mathieu} and {Olga Ohrimenko}}
}
@article{journals/siamcomp/GolinMY12,
title = {Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme.},
year = {2012},
journal = {SIAM J. Comput.},
author = {{Mordecai J. Golin} and {Claire Mathieu} and {Neal E. Young}}
}
@inproceedings{conf/icalp/MathieuZ13,
title = {Graph Reconstruction via Distance Oracles.},
year = {2013},
booktitle = {ICALP (1)},
author = {{Claire Mathieu} and {Hang Zhou 001}},
publisher = {Springer},
booktitle = {Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I}
}
@article{journals/cpc/MathieuW13,
title = {The Min Mean-Weight Cycle in a Random Network.},
year = {2013},
journal = {Comb. Probab. Comput.},
author = {{Claire Mathieu} and {David B. Wilson 002}}
}
@article{journals/dagstuhl-reports/BorradaileKMM13,
title = {Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 13421).},
year = {2013},
journal = {Dagstuhl Reports},
author = {{Glencora Borradaile} and {Philip N. Klein} and {Dániel Marx} and {Claire Mathieu}}
}
@article{journals/ipl/AvitabileMP13,
title = {Online constrained optimization with recourse.},
year = {2013},
journal = {Inf. Process. Lett.},
author = {{Tess Avitabile} and {Claire Mathieu} and {Laura H. Parkinson}}
}
@inproceedings{conf/icalp/EisenstatMS14,
title = {Facility Location in Evolving Metrics.},
year = {2014},
booktitle = {ICALP (2)},
author = {{David Eisenstat} and {Claire Mathieu} and {Nicolas Schabanel}},
publisher = {Springer},
booktitle = {Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II}
}
@inproceedings{conf/soda/EisenstatKM14,
title = {Approximating k-center in planar graphs.},
year = {2014},
booktitle = {SODA},
author = {{David Eisenstat} and {Philip N. Klein} and {Claire Mathieu}},
publisher = {SIAM},
booktitle = {Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, 2014}
}
@inproceedings{conf/soda/KhareMY14,
title = {First Come First Served for Online Slot Allocation and Huffman Coding.},
year = {2014},
booktitle = {SODA},
author = {{Monik Khare} and {Claire Mathieu} and {Neal E. Young}},
publisher = {SIAM},
booktitle = {Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, 2014}
}
@inproceedings{conf/waoa/Cohen-AddadLMM14,
title = {Energy-Efficient Algorithms for Non-preemptive Speed-Scaling.},
year = {2014},
booktitle = {WAOA},
author = {{Vincent Cohen-Addad} and {Zhentao Li} and {Claire Mathieu} and {Ioannis Milis}},
publisher = {Springer},
booktitle = {Approximation and Online Algorithms - 12th International Workshop, WAOA 2014, Wrocław, Poland, September 11-12, 2014, Revised Selected Papers}
}
@article{journals/corr/BorradaileMM14,
title = {Lower bounds for testing digraph connectivity with one-pass streaming algorithms.},
year = {2014},
journal = {CoRR},
author = {{Glencora Borradaile} and {Claire Mathieu} and {Theresa Migler}}
}
@article{journals/corr/Cohen-AddadM14,
title = {The Unreasonable Success of Local Search: Geometric Optimization.},
year = {2014},
journal = {CoRR},
author = {{Vincent Cohen-Addad} and {Claire Mathieu}}
}
@article{journals/corr/KannanMZ14,
title = {Graph Verification and Reconstruction via Distance Oracles.},
year = {2014},
journal = {CoRR},
author = {{Sampath Kannan} and {Claire Mathieu} and {Hang Zhou 001}}
}
@article{journals/corr/MathieuSY14,
title = {K-Slot SSTable Stack Compaction.},
year = {2014},
journal = {CoRR},
author = {{Claire Mathieu} and {Carl Staelin} and {Neal E. Young}}
}
@article{journals/teco/CaryDE0HKKMS14,
title = {Convergence of Position Auctions under Myopic Best-Response Dynamics.},
year = {2014},
journal = {ACM Trans. Economics and Comput.},
author = {{Matthew Cary} and {Aparna Das} and {Benjamin Edelman} and {Ioannis Giotis 001} and {Kurtis Heimerl} and {Anna R. Karlin} and {Scott Duke Kominers} and {Claire Mathieu} and {Michael Schwarz 002}}
}
@inproceedings{conf/compgeom/Cohen-AddadM15,
title = {Effectiveness of Local Search for Geometric Optimization.},
year = {2015},
booktitle = {SoCG},
author = {{Vincent Cohen-Addad} and {Claire Mathieu}},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
booktitle = {31st International Symposium on Computational Geometry, SoCG 2015, June 22-25, 2015, Eindhoven, The Netherlands}
}
@inproceedings{conf/icalp/KannanM015,
title = {Near-Linear Query Complexity for Graph Inference.},
year = {2015},
booktitle = {ICALP (1)},
author = {{Sampath Kannan} and {Claire Mathieu} and {Hang Zhou 001}},
publisher = {Springer},
booktitle = {Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I}
}
@inproceedings{conf/innovations/AvinKLMPP15,
title = {Homophily and the Glass Ceiling Effect in Social Networks.},
year = {2015},
booktitle = {ITCS},
author = {{Chen Avin} and {Barbara Keller} and {Zvi Lotker} and {Claire Mathieu} and {David Peleg} and {Yvonne-Anne Pignolet}},
publisher = {ACM},
booktitle = {Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, ITCS 2015, Rehovot, Israel, January 11-13, 2015}
}
@article{journals/algorithmica/DasM15,
title = {A Quasipolynomial Time Approximation Scheme for Euclidean Capacitated Vehicle Routing.},
year = {2015},
journal = {Algorithmica},
author = {{Aparna Das} and {Claire Mathieu}}
}
@article{journals/eatcs/Mathieu15,
title = {The Presburger Award 2016 - Call for Nominations.},
year = {2015},
journal = {Bull. EATCS},
author = {{Claire Mathieu}}
}
@article{journals/talg/BorradaileKM15,
title = {A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest.},
year = {2015},
journal = {ACM Trans. Algorithms},
author = {{Glencora Borradaile} and {Philip N. Klein} and {Claire Mathieu}}
}
@inproceedings{conf/icalp/FiatKKMZ16,
title = {Carpooling in Social Networks.},
year = {2016},
booktitle = {ICALP},
author = {{Amos Fiat} and {Anna R. Karlin} and {Elias Koutsoupias} and {Claire Mathieu} and {Rotem Zach}},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy}
}
@inproceedings{conf/soda/KanadeLLMM16,
title = {Distance in the Forest Fire Model How far are you from Eve?},
year = {2016},
booktitle = {SODA},
author = {{Varun Kanade} and {Reut Levi} and {Zvi Lotker} and {Frederik Mallmann-Trenn} and {Claire Mathieu}},
publisher = {SIAM},
booktitle = {Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016}
}
@inproceedings{conf/stoc/Cohen-AddadVKMM16,
title = {Approximating connectivity domination in weighted bounded-genus graphs.},
year = {2016},
booktitle = {STOC},
author = {{Vincent Cohen-Addad} and {Éric Colin de Verdière} and {Philip N. Klein} and {Claire Mathieu} and {David Meierfrankenfeld}},
publisher = {ACM},
booktitle = {Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016}
}
@article{journals/corr/Cohen-AddadKM16,
title = {The power of local search for clustering.},
year = {2016},
journal = {CoRR},
author = {{Vincent Cohen-Addad} and {Philip N. Klein} and {Claire Mathieu}}
}
@article{journals/dagstuhl-reports/EricksonKMM16,
title = {Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 16221).},
year = {2016},
journal = {Dagstuhl Reports},
author = {{Jeff Erickson 001} and {Philip N. Klein} and {Dániel Marx} and {Claire Mathieu}}
}
@article{journals/iacr/BenhamoudaLM016,
title = {Optimization of Bootstrapping in Circuits.},
year = {2016},
journal = {IACR Cryptol. ePrint Arch.},
author = {{Fabrice Benhamouda} and {Tancrède Lepoint} and {Claire Mathieu} and {Hang Zhou 001}}
}
@inproceedings{conf/esa/AntunesMM17,
title = {Combinatorics of Local Search: An Optimal 4-Local Hall's Theorem for Planar Graphs.},
year = {2017},
booktitle = {ESA},
author = {{Daniel Antunes} and {Claire Mathieu} and {Nabil H. Mustafa}},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
booktitle = {25th Annual European Symposium on Algorithms, ESA 2017, September 4-6, 2017, Vienna, Austria}
}
@article{journals/corr/abs-1710-02058,
title = {Skyline Computation with Noisy Comparisons.},
year = {2017},
journal = {CoRR},
author = {{Frederik Mallmann-Trenn} and {Claire Mathieu} and {Victor Verdugo}}
}
@article{journals/dagstuhl-reports/MantheyMRU17,
title = {Probabilistic Methods in the Design and Analysis of Algorithms (Dagstuhl Seminar 17141).},
year = {2017},
journal = {Dagstuhl Reports},
author = {{Bodo Manthey} and {Claire Mathieu} and {Heiko Röglin} and {Eli Upfal}}
}
@inproceedings{conf/isaac/FotakisGMS18,
title = {Covering Clients with Types and Budgets.},
year = {2018},
booktitle = {ISAAC},
author = {{Dimitris Fotakis 001} and {Laurent Gourvès} and {Claire Mathieu} and {Abhinav Srivastav}},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
booktitle = {29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}
}
@article{journals/corr/abs-1806-08182,
title = {Instance-Optimality in the Noisy Value-and Comparison-Model - Accept, Accept, Strong Accept: Which Papers get in?},
year = {2018},
journal = {CoRR},
author = {{Vincent Cohen-Addad} and {Frederik Mallmann-Trenn} and {Claire Mathieu}}
}
@article{journals/corr/abs-1811-01537,
title = {How to aggregate Top-lists: Score based approximation schemes.},
year = {2018},
journal = {CoRR},
author = {{Claire Mathieu} and {Simon Mauras}}
}
@article{journals/mp/KurpiszMMMVW18,
title = {Semidefinite and linear programming integrality gaps for scheduling identical machines.},
year = {2018},
journal = {Math. Program.},
author = {{Adam Kurpisz} and {Monaldo Mastrolilli} and {Claire Mathieu} and {Tobias Mömke} and {Victor Verdugo} and {Andreas Wiese}}
}
@article{journals/talg/KannanMZ18,
title = {Graph Reconstruction and Verification.},
year = {2018},
journal = {ACM Trans. Algorithms},
author = {{Sampath Kannan} and {Claire Mathieu} and {Hang Zhou 001}}
}
@inproceedings{conf/approx/HuangMMMM19,
title = {Maximizing Covered Area in the Euclidean Plane with Connectivity Constraint.},
year = {2019},
booktitle = {APPROX-RANDOM},
author = {{Chien-Chung Huang} and {Mathieu Mari} and {Claire Mathieu} and {Joseph S. B. Mitchell} and {Nabil H. Mustafa}},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA.}
}
@article{journals/corr/abs-1904-03890,
title = {On popularity-based random matching markets.},
year = {2019},
journal = {CoRR},
author = {{Hugo Gimbert} and {Claire Mathieu} and {Simon Mauras}}
}
@article{journals/jacm/Cohen-AddadKMM19,
title = {Hierarchical Clustering: Objective Functions and Algorithms.},
year = {2019},
journal = {J. ACM},
author = {{Vincent Cohen-Addad} and {Varun Kanade} and {Frederik Mallmann-Trenn} and {Claire Mathieu}}
}
@article{journals/siamcomp/Cohen-AddadKM19,
title = {Local Search Yields Approximation Schemes for k-Means and k-Median in Euclidean and Minor-Free Metrics.},
year = {2019},
journal = {SIAM J. Comput.},
author = {{Vincent Cohen-Addad} and {Philip N. Klein} and {Claire Mathieu}}
}
@inproceedings{conf/iwoca/GrozMMV20,
title = {Skyline Computation with Noisy Comparisons.},
year = {2020},
booktitle = {IWOCA},
author = {{Benoît Groz} and {Frederik Mallmann-Trenn} and {Claire Mathieu} and {Victor Verdugo}},
publisher = {Springer},
booktitle = {Combinatorial Algorithms - 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8-10, 2020, Proceedings}
}
@inproceedings{conf/soda/Cohen-AddadMM20,
title = {Instance-Optimality in the Noisy Value-and Comparison-Model.},
year = {2020},
booktitle = {SODA},
author = {{Vincent Cohen-Addad} and {Frederik Mallmann-Trenn} and {Claire Mathieu}},
publisher = {SIAM},
booktitle = {Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020.}
}
@inproceedings{conf/soda/MathieuM20,
title = {How to aggregate Top-lists: Approximation algorithms via scores and average ranks.},
year = {2020},
booktitle = {SODA},
author = {{Claire Mathieu} and {Simon Mauras}},
publisher = {SIAM},
booktitle = {Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020.}
}
@article{journals/algorithmica/HenzingerLM20,
title = {Dynamic Clustering to Minimize the Sum of Radii.},
year = {2020},
journal = {Algorithmica},
author = {{Monika Henzinger} and {Dariusz Leniowski} and {Claire Mathieu}}
}
@inproceedings{conf/fct/GimbertMM21,
title = {Two-Sided Matching Markets with Strongly Correlated Preferences.},
year = {2021},
booktitle = {FCT},
author = {{Hugo Gimbert} and {Claire Mathieu} and {Simon Mauras}},
publisher = {Springer},
booktitle = {Fundamentals of Computation Theory - 23rd International Symposium, FCT 2021, Athens, Greece, September 12-15, 2021, Proceedings}
}
@inproceedings{conf/isaac/Mathieu021,
title = {Probabilistic Analysis of Euclidean Capacitated Vehicle Routing.},
year = {2021},
booktitle = {ISAAC},
author = {{Claire Mathieu} and {Hang Zhou 001}},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
booktitle = {32nd International Symposium on Algorithms and Computation, ISAAC 2021, December 6-8, 2021, Fukuoka, Japan.}
}
@inproceedings{conf/soda/MathieuRYY21,
title = {Competitive Data-Structure Dynamization.},
year = {2021},
booktitle = {SODA},
author = {{Claire Mathieu} and {Rajmohan Rajaraman} and {Neal E. Young} and {Arman Yousefi}},
publisher = {SIAM},
booktitle = {Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021}
}
@article{journals/corr/abs-2109-09089,
title = {Constrained School Choice with Incomplete Information.},
year = {2021},
journal = {CoRR},
author = {{Hugo Gimbert} and {Claire Mathieu} and {Simon Mauras}}
}
@article{journals/netsci/MathieuR21,
title = {Large very dense subgraphs in a stream of edges.},
year = {2021},
journal = {Netw. Sci.},
author = {{Claire Mathieu} and {Michel de Rougemont}}
}
@article{journals/ploscb/MaurasCDTFMOV21,
title = {Mitigating COVID-19 outbreaks in workplaces and schools by hybrid telecommuting.},
year = {2021},
journal = {PLoS Comput. Biol.},
author = {{Simon Mauras} and {Vincent Cohen-Addad} and {Guillaume Duboc} and {Max Dupré la Tour} and {Paolo Frasca} and {Claire Mathieu} and {Lulla Opatowski} and {Laurent Viennot}}
}
@article{journals/siamdm/HuangMMSV21,
title = {An Approximation Algorithm for Fully Planar Edge-Disjoint Paths.},
year = {2021},
journal = {SIAM J. Discret. Math.},
author = {{Chien-Chung Huang} and {Mathieu Mari} and {Claire Mathieu} and {Kevin Schewior} and {Jens Vygen}}
}
@article{journals/corr/abs-2202-05691,
title = {A Tight 3/2+ε-Approximation for Unsplittable Capacitated Vehicle Routing on Trees.},
year = {2022},
journal = {CoRR},
author = {{Claire Mathieu} and {Hang Zhou 001}}
}
@inproceedings{conf/icalp/Mathieu023,
title = {A Tight (1.5+ε)-Approximation for Unsplittable Capacitated Vehicle Routing on Trees.},
year = {2023},
booktitle = {ICALP},
author = {{Claire Mathieu} and {Hang Zhou 001}},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
booktitle = {50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, July 10-14, 2023, Paderborn, Germany}
}
@inproceedings{conf/innovations/0001M023,
title = {Unsplittable Euclidean Capacitated Vehicle Routing: A (2+ε)-Approximation Algorithm.},
year = {2023},
booktitle = {ITCS},
author = {{Fabrizio Grandoni 001} and {Claire Mathieu} and {Hang Zhou 001}},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
booktitle = {14th Innovations in Theoretical Computer Science Conference, ITCS 2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, USA.}
}
@inproceedings{conf/stacs/DufayM023,
title = {An Approximation Algorithm for Distance-Constrained Vehicle Routing on Trees.},
year = {2023},
booktitle = {STACS},
author = {{Marc Dufay} and {Claire Mathieu} and {Hang Zhou 001}},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
booktitle = {40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany.}
}
@article{journals/corr/abs-2309-11175,
title = {Testing frequency distributions in a stream.},
year = {2023},
journal = {CoRR},
author = {{Claire Mathieu} and {Michel de Rougemont}}
}
@article{journals/corr/abs-2309-12623,
title = {A Detailed Analysis of the SpaceSaving± Family of Algorithms with Bounded Deletions.},
year = {2023},
journal = {CoRR},
author = {{Fuheng Zhao} and {Divyakant Agrawal} and {Amr El Abbadi} and {Claire Mathieu} and {Ahmed Metwally 001} and {Michel de Rougemont}}
}
@article{journals/talg/MathieuZ23,
title = {A PTAS for Capacitated Vehicle Routing on Trees.},
year = {2023},
month = {April},
journal = {ACM Trans. Algorithms},
author = {{Claire Mathieu} and {Hang Zhou 001}}
}
@article{journals/rsa/MathieuZ23,
title = {A simple algorithm for graph reconstruction.},
year = {2023},
month = {September},
journal = {Random Struct. Algorithms},
author = {{Claire Mathieu} and {Hang Zhou 001}}
}
@article{journals/algorithmica/KleinMZ23,
title = {Correlation Clustering and Two-Edge-Connected Augmentation for Planar Graphs.},
year = {2023},
month = {October},
journal = {Algorithmica},
author = {{Philip N. Klein} and {Claire Mathieu} and {Hang Zhou 001}}
}
@article{journals/dcg/HuangMMV23,
title = {Approximating Maximum Integral Multiflows on Bounded Genus Graphs.},
year = {2023},
month = {December},
journal = {Discret. Comput. Geom.},
author = {{Chien-Chung Huang} and {Mathieu Mari} and {Claire Mathieu} and {Jens Vygen}}
}
@article{journals/pvldb/ZhaoAAMMR23,
title = {Errata for \\.},
year = {2023},
month = {December},
journal = {Proc. VLDB Endow.},
author = {{Fuheng Zhao} and {Divyakant Agrawal} and {Amr El Abbadi} and {Ahmed Metwally 001} and {Claire Mathieu} and {Michel de Rougemont}}
}
@article{journals/mp/MathieuV24,
title = {Apportionment with parity constraints.},
year = {2024},
month = {January},
journal = {Math. Program.},
author = {{Claire Mathieu} and {Victor Verdugo}}
}