default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDClaire Mathieu
Claire Kenyon – Claire Kenyon-Mathieu
Person information
- affiliation: CNRS, Paris, France
- affiliation: Brown University, Providence, RI, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j64]Vincent Cohen-Addad, Surya Teja Gavva, Karthik C. S., Claire Mathieu, Namrata:
Fairness of linear regression in decision making. Int. J. Data Sci. Anal. 18(3): 337-347 (2024)- [j63]Claire Mathieu, Victor Verdugo
:
Apportionment with parity constraints. Math. Program. 203(1): 135-168 (2024) - [j62]Claire Mathieu, Rajmohan Rajaraman, Neal E. Young, Arman Yousefi:
Competitive Data-Structure Dynamization. ACM Trans. Algorithms 20(4): 37:1-37:28 (2024) - [i55]Claire Mathieu, William Thurston:
Rotation distance using flows. CoRR abs/2409.17905 (2024) - 2023
- [j61]Philip N. Klein, Claire Mathieu, Hang Zhou:
Correlation Clustering and Two-Edge-Connected Augmentation for Planar Graphs. Algorithmica 85(10): 3024-3057 (2023) - [j60]Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Jens Vygen:
Approximating Maximum Integral Multiflows on Bounded Genus Graphs. Discret. Comput. Geom. 70(4): 1266-1291 (2023) - [j59]Fuheng Zhao, Divyakant Agrawal, Amr El Abbadi, Ahmed Metwally, Claire Mathieu, Michel de Rougemont:
Errata for "SpaceSaving±: An Optimal Algorithm for Frequency Estimation and Frequent Items in the Bounded-Deletion Model". Proc. VLDB Endow. 17(4): 643 (2023) - [j58]Claire Mathieu, Hang Zhou:
Iterated tour partitioning for Euclidean capacitated vehicle routing. Random Struct. Algorithms 62(4): 1056-1075 (2023) - [j57]Claire Mathieu, Hang Zhou:
A simple algorithm for graph reconstruction. Random Struct. Algorithms 63(2): 512-532 (2023) - [j56]Claire Mathieu, Hang Zhou:
A PTAS for Capacitated Vehicle Routing on Trees. ACM Trans. Algorithms 19(2): 17:1-17:28 (2023) - [c98]Claire Mathieu, Hang Zhou:
A Tight (1.5+ε)-Approximation for Unsplittable Capacitated Vehicle Routing on Trees. ICALP 2023: 91:1-91:16 - [c97]Fabrizio Grandoni, Claire Mathieu, Hang Zhou:
Unsplittable Euclidean Capacitated Vehicle Routing: A (2+ε)-Approximation Algorithm. ITCS 2023: 63:1-63:13 - [c96]Marc Dufay, Claire Mathieu, Hang Zhou:
An Approximation Algorithm for Distance-Constrained Vehicle Routing on Trees. STACS 2023: 27:1-27:16 - [i54]Claire Mathieu, Michel de Rougemont:
Testing frequency distributions in a stream. CoRR abs/2309.11175 (2023) - [i53]Fuheng Zhao, Divyakant Agrawal, Amr El Abbadi, Claire Mathieu, Ahmed Metwally, Michel de Rougemont:
A Detailed Analysis of the SpaceSaving± Family of Algorithms with Bounded Deletions. CoRR abs/2309.12623 (2023) - 2022
- [c95]Claire Mathieu, Hang Zhou:
A PTAS for Capacitated Vehicle Routing on Trees. ICALP 2022: 95:1-95:20 - [i52]Claire Mathieu, Hang Zhou:
A Tight 3/2+ε-Approximation for Unsplittable Capacitated Vehicle Routing on Trees. CoRR abs/2202.05691 (2022) - [i51]Fabrizio Grandoni, Claire Mathieu, Hang Zhou:
Unsplittable Euclidean Capacitated Vehicle Routing: A (2+ε)-Approximation Algorithm. CoRR abs/2209.05520 (2022) - [i50]Marc Dufay, Claire Mathieu, Hang Zhou:
An Approximation Algorithm for Distance-Constrained Vehicle Routing on Trees. CoRR abs/2210.03811 (2022) - 2021
- [j55]Claire Mathieu, Michel de Rougemont:
Large very dense subgraphs in a stream of edges. Netw. Sci. 9(4): 403-424 (2021) - [j54]Simon Mauras, Vincent Cohen-Addad, Guillaume Duboc, Max Dupré la Tour, Paolo Frasca, Claire Mathieu, Lulla Opatowski, Laurent Viennot:
Mitigating COVID-19 outbreaks in workplaces and schools by hybrid telecommuting. PLoS Comput. Biol. 17(8) (2021) - [j53]Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Kevin Schewior, Jens Vygen:
An Approximation Algorithm for Fully Planar Edge-Disjoint Paths. SIAM J. Discret. Math. 35(2): 752-769 (2021) - [c94]Claire Mathieu, Hang Zhou:
A Simple Algorithm for Graph Reconstruction. ESA 2021: 68:1-68:18 - [c93]Hugo Gimbert, Claire Mathieu, Simon Mauras:
Two-Sided Matching Markets with Strongly Correlated Preferences. FCT 2021: 3-17 - [c92]Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Jens Vygen:
Approximating Maximum Integral Multiflows on Bounded Genus Graphs. ICALP 2021: 80:1-80:18 - [c91]Claire Mathieu, Hang Zhou:
Probabilistic Analysis of Euclidean Capacitated Vehicle Routing. ISAAC 2021: 43:1-43:16 - [c90]Claire Mathieu, Rajmohan Rajaraman, Neal E. Young, Arman Yousefi:
Competitive Data-Structure Dynamization. SODA 2021: 2269-2287 - [i49]Claire Mathieu, Victor Verdugo:
Apportionment with Parity Constraints. CoRR abs/2108.04137 (2021) - [i48]Claire Mathieu, Hang Zhou:
Probabilistic Analysis of Euclidean Capacitated Vehicle Routing. CoRR abs/2109.06958 (2021) - [i47]Hugo Gimbert, Claire Mathieu, Simon Mauras:
Constrained School Choice with Incomplete Information. CoRR abs/2109.09089 (2021) - [i46]Claire Mathieu, Hang Zhou:
A PTAS for Capacitated Vehicle Routing on Trees. CoRR abs/2111.03735 (2021) - [i45]Claire Mathieu, Hang Zhou:
A Simple Algorithm for Graph Reconstruction. CoRR abs/2112.04549 (2021) - 2020
- [j52]Monika Henzinger, Dariusz Leniowski, Claire Mathieu:
Dynamic Clustering to Minimize the Sum of Radii. Algorithmica 82(11): 3183-3194 (2020) - [c89]Claire Mathieu, Michel de Rougemont:
Large Very Dense Subgraphs in a Stream of Edges. FODS 2020: 107-117 - [c88]Benoît Groz, Frederik Mallmann-Trenn, Claire Mathieu, Victor Verdugo:
Skyline Computation with Noisy Comparisons. IWOCA 2020: 289-303 - [c87]Vincent Cohen-Addad, Frederik Mallmann-Trenn, Claire Mathieu:
Instance-Optimality in the Noisy Value-and Comparison-Model. SODA 2020: 2124-2143 - [c86]Claire Mathieu, Simon Mauras:
How to aggregate Top-lists: Approximation algorithms via scores and average ranks. SODA 2020: 2810-2822 - [i44]Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Kevin Schewior, Jens Vygen:
An Approximation Algorithm for Fully Planar Edge-Disjoint Paths. CoRR abs/2001.01715 (2020) - [i43]Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Jens Vygen:
Approximating maximum integral multiflows on bounded genus graphs. CoRR abs/2005.00575 (2020) - [i42]Claire Mathieu, Michel de Rougemont:
Large Very Dense Subgraphs in a Stream of Edges. CoRR abs/2010.07794 (2020) - [i41]Claire Mathieu, Rajmohan Rajaraman, Neal E. Young, Arman Yousefi:
Competitive Data-Structure Dynamization. CoRR abs/2011.02615 (2020)
2010 – 2019
- 2019
- [j51]Vincent Cohen-Addad, Varun Kanade, Frederik Mallmann-Trenn, Claire Mathieu:
Hierarchical Clustering: Objective Functions and Algorithms. J. ACM 66(4): 26:1-26:42 (2019) - [j50]Vincent Cohen-Addad, Philip N. Klein, Claire Mathieu:
Local Search Yields Approximation Schemes for k-Means and k-Median in Euclidean and Minor-Free Metrics. SIAM J. Comput. 48(2): 644-667 (2019) - [c85]Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Joseph S. B. Mitchell, Nabil H. Mustafa:
Maximizing Covered Area in the Euclidean Plane with Connectivity Constraint. APPROX-RANDOM 2019: 32:1-32:21 - [i40]Hugo Gimbert, Claire Mathieu, Simon Mauras:
On popularity-based random matching markets. CoRR abs/1904.03890 (2019) - 2018
- [j49]Adam Kurpisz, Monaldo Mastrolilli, Claire Mathieu, Tobias Mömke, Victor Verdugo, Andreas Wiese:
Semidefinite and linear programming integrality gaps for scheduling identical machines. Math. Program. 172(1-2): 231-248 (2018) - [j48]Sampath Kannan, Claire Mathieu, Hang Zhou:
Graph Reconstruction and Verification. ACM Trans. Algorithms 14(4): 40:1-40:30 (2018) - [c84]Dimitris Fotakis, Laurent Gourvès, Claire Mathieu, Abhinav Srivastav:
Covering Clients with Types and Budgets. ISAAC 2018: 73:1-73:12 - [c83]Vincent Cohen-Addad, Varun Kanade, Frederik Mallmann-Trenn, Claire Mathieu:
Hierarchical Clustering: Objective Functions and Algorithms. SODA 2018: 378-397 - [i39]Vincent Cohen-Addad, Frederik Mallmann-Trenn, Claire Mathieu:
Instance-Optimality in the Noisy Value-and Comparison-Model - Accept, Accept, Strong Accept: Which Papers get in? CoRR abs/1806.08182 (2018) - [i38]Claire Mathieu, Simon Mauras:
How to aggregate Top-lists: Score based approximation schemes. CoRR abs/1811.01537 (2018) - 2017
- [c82]Daniel Antunes, Claire Mathieu, Nabil H. Mustafa:
Combinatorics of Local Search: An Optimal 4-Local Hall's Theorem for Planar Graphs. ESA 2017: 8:1-8:13 - [c81]Monika Henzinger, Dariusz Leniowski, Claire Mathieu:
Dynamic Clustering to Minimize the Sum of Radii. ESA 2017: 48:1-48:10 - [c80]Fabrice Benhamouda, Tancrède Lepoint, Claire Mathieu, Hang Zhou:
Optimization of Bootstrapping in Circuits. SODA 2017: 2423-2433 - [i37]Vincent Cohen-Addad, Varun Kanade, Frederik Mallmann-Trenn, Claire Mathieu:
Hierarchical Clustering: Objective Functions and Algorithms. CoRR abs/1704.02147 (2017) - [i36]Monika Henzinger, Dariusz Leniowski, Claire Mathieu:
Dynamic clustering to minimize the sum of radii. CoRR abs/1707.02577 (2017) - [i35]Frederik Mallmann-Trenn, Claire Mathieu, Victor Verdugo:
Skyline Computation with Noisy Comparisons. CoRR abs/1710.02058 (2017) - [i34]Bodo Manthey, Claire Mathieu, Heiko Röglin, Eli Upfal:
Probabilistic Methods in the Design and Analysis of Algorithms (Dagstuhl Seminar 17141). Dagstuhl Reports 7(4): 1-22 (2017) - 2016
- [c79]Vincent Cohen-Addad, Philip N. Klein, Claire Mathieu:
Local Search Yields Approximation Schemes for k-Means and k-Median in Euclidean and Minor-Free Metrics. FOCS 2016: 353-364 - [c78]Amos Fiat, Anna R. Karlin, Elias Koutsoupias, Claire Mathieu, Rotem Zach:
Carpooling in Social Networks. ICALP 2016: 43:1-43:13 - [c77]Adam Kurpisz, Monaldo Mastrolilli, Claire Mathieu, Tobias Mömke, Victor Verdugo, Andreas Wiese:
Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines. IPCO 2016: 152-163 - [c76]Varun Kanade, Reut Levi, Zvi Lotker, Frederik Mallmann-Trenn, Claire Mathieu:
Distance in the Forest Fire Model How far are you from Eve? SODA 2016: 1602-1620 - [c75]Vincent Cohen-Addad, Éric Colin de Verdière, Philip N. Klein, Claire Mathieu, David Meierfrankenfeld:
Approximating connectivity domination in weighted bounded-genus graphs. STOC 2016: 584-597 - [e3]Klaus Jansen, Claire Mathieu, José D. P. Rolim, Chris Umans:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France. LIPIcs 60, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2016, ISBN 978-3-95977-018-7 [contents] - [i33]Vincent Cohen-Addad, Philip N. Klein, Claire Mathieu:
The power of local search for clustering. CoRR abs/1603.09535 (2016) - [i32]Fabrice Benhamouda, Tancrède Lepoint, Claire Mathieu, Hang Zhou:
Optimization of Bootstrapping in Circuits. CoRR abs/1608.04535 (2016) - [i31]Jeff Erickson, Philip N. Klein, Dániel Marx, Claire Mathieu:
Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 16221). Dagstuhl Reports 6(5): 94-116 (2016) - [i30]Fabrice Benhamouda, Tancrède Lepoint, Claire Mathieu, Hang Zhou:
Optimization of Bootstrapping in Circuits. IACR Cryptol. ePrint Arch. 2016: 785 (2016) - 2015
- [j47]Aparna Das, Claire Mathieu:
A Quasipolynomial Time Approximation Scheme for Euclidean Capacitated Vehicle Routing. Algorithmica 73(1): 115-142 (2015) - [j46]Claire Mathieu:
The Presburger Award 2016 - Call for Nominations. Bull. EATCS 117 (2015) - [j45]Glencora Borradaile, Philip N. Klein, Claire Mathieu:
A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest. ACM Trans. Algorithms 11(3): 19:1-19:20 (2015) - [c74]Vincent Cohen-Addad, Claire Mathieu:
Effectiveness of Local Search for Geometric Optimization. SoCG 2015: 329-343 - [c73]Sampath Kannan, Claire Mathieu, Hang Zhou:
Near-Linear Query Complexity for Graph Inference. ICALP (1) 2015: 773-784 - [c72]Chen Avin, Barbara Keller, Zvi Lotker, Claire Mathieu, David Peleg, Yvonne-Anne Pignolet:
Homophily and the Glass Ceiling Effect in Social Networks. ITCS 2015: 41-50 - [c71]Philip N. Klein, Claire Mathieu, Hang Zhou:
Correlation Clustering and Two-edge-connected Augmentation for Planar Graphs. STACS 2015: 554-567 - 2014
- [j44]Frédéric Magniez, Claire Mathieu, Ashwin Nayak:
Recognizing Well-Parenthesized Expressions in the Streaming Model. SIAM J. Comput. 43(6): 1880-1905 (2014) - [j43]Matthew Cary, Aparna Das, Benjamin Edelman, Ioannis Giotis, Kurtis Heimerl, Anna R. Karlin, Scott Duke Kominers, Claire Mathieu, Michael Schwarz:
Convergence of Position Auctions under Myopic Best-Response Dynamics. ACM Trans. Economics and Comput. 2(3): 9:1-9:20 (2014) - [c70]David Eisenstat, Claire Mathieu, Nicolas Schabanel:
Facility Location in Evolving Metrics. ICALP (2) 2014: 459-470 - [c69]Monik Khare, Claire Mathieu, Neal E. Young:
First Come First Served for Online Slot Allocation and Huffman Coding. SODA 2014: 445-454 - [c68]David Eisenstat, Philip N. Klein, Claire Mathieu:
Approximating k-center in planar graphs. SODA 2014: 617-627 - [c67]Vincent Cohen-Addad, Zhentao Li, Claire Mathieu, Ioannis Milis:
Energy-Efficient Algorithms for Non-preemptive Speed-Scaling. WAOA 2014: 107-118 - [i29]Sampath Kannan, Claire Mathieu, Hang Zhou:
Graph Verification and Reconstruction via Distance Oracles. CoRR abs/1402.4037 (2014) - [i28]Vincent Cohen-Addad, Zhentao Li, Claire Mathieu, Ioannis Milis:
Energy-efficient algorithms for non-preemptive speed-scaling. CoRR abs/1402.4111 (2014) - [i27]David Eisenstat, Claire Mathieu, Nicolas Schabanel:
Facility Location in Evolving Metrics. CoRR abs/1403.6758 (2014) - [i26]Glencora Borradaile, Claire Mathieu, Theresa Migler:
Lower bounds for testing digraph connectivity with one-pass streaming algorithms. CoRR abs/1404.1323 (2014) - [i25]Claire Mathieu, Carl Staelin, Neal E. Young:
K-Slot SSTable Stack Compaction. CoRR abs/1407.3008 (2014) - [i24]Vincent Cohen-Addad, Claire Mathieu:
The Unreasonable Success of Local Search: Geometric Optimization. CoRR abs/1410.0553 (2014) - 2013
- [j42]Claire Mathieu, David B. Wilson:
The Min Mean-Weight Cycle in a Random Network. Comb. Probab. Comput. 22(5): 763-782 (2013) - [j41]Tess Avitabile, Claire Mathieu, Laura H. Parkinson:
Online constrained optimization with recourse. Inf. Process. Lett. 113(3): 81-86 (2013) - [c66]Claire Mathieu, Hang Zhou:
Graph Reconstruction via Distance Oracles. ICALP (1) 2013: 733-744 - [i23]Glencora Borradaile, Philip N. Klein, Claire Mathieu:
A polynomial-time approximation scheme for Euclidean Steiner forest. CoRR abs/1302.7270 (2013) - [i22]Claire Mathieu, Hang Zhou:
Graph Reconstruction via Distance Oracles. CoRR abs/1304.6588 (2013) - [i21]Monik Khare, Claire Mathieu, Neal E. Young:
First-Come-First-Served for Online Slot Allocation and Huffman Coding. CoRR abs/1307.5296 (2013) - [i20]Glencora Borradaile, Philip N. Klein, Dániel Marx, Claire Mathieu:
Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 13421). Dagstuhl Reports 3(10): 36-57 (2013) - 2012
- [j40]Robert Cori, Claire Mathieu, John Michael Robson:
On the Number of Indecomposable Permutations with a Given Number of Cycles. Electron. J. Comb. 19(1): 49 (2012) - [j39]Claire Mathieu, Olga Ohrimenko:
Lower bounds for randomized algorithms for online chain partitioning. Inf. Process. Lett. 112(17-18): 663-666 (2012) - [j38]Mordecai J. Golin, Claire Mathieu, Neal E. Young:
Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme. SIAM J. Comput. 41(3): 684-713 (2012) - [c65]Christian Konrad, Frédéric Magniez, Claire Mathieu:
Maximum Matching in Semi-streaming with Few Passes. APPROX-RANDOM 2012: 231-242 - [c64]David Eisenstat, Philip N. Klein, Claire Mathieu:
An efficient polynomial-time approximation scheme for Steiner forest in planar graphs. SODA 2012: 626-638 - [c63]MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Philip N. Klein, Claire Mathieu:
A polynomial-time approximation scheme for planar multiway cut. SODA 2012: 639-655 - [i19]Claire Mathieu, David B. Wilson:
The min mean-weight cycle in a random network. CoRR abs/1201.3955 (2012) - 2011
- [c62]Anna R. Karlin, Claire Mathieu, C. Thach Nguyen:
Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack. IPCO 2011: 301-314 - [i18]David Eisenstat, Philip N. Klein, Claire Mathieu:
An efficient polynomial-time approximation scheme for Steiner forest in planar graphs. CoRR abs/1110.1320 (2011) - [i17]Christian Konrad, Frédéric Magniez, Claire Mathieu:
Maximum Matching in Semi-Streaming with Few Passes. CoRR abs/1112.0184 (2011) - [i16]Klaus Jansen, Claire Mathieu, Hadas Shachnai, Neal E. Young:
Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091). Dagstuhl Reports 1(2): 67-93 (2011) - 2010
- [j37]Claire Mathieu:
Foreword to special issue SODA 2009. ACM Trans. Algorithms 6(2): 23:1 (2010) - [c61]Aparna Das, Claire Mathieu:
A Quasi-polynomial Time Approximation Scheme for Euclidean Capacitated Vehicle Routing. SODA 2010: 390-403 - [c60]Claire Mathieu, Warren Schudy:
Correlation Clustering with Noisy Input. SODA 2010: 712-728 - [c59]Claire Mathieu, Ocan Sankur, Warren Schudy:
Online Correlation Clustering. STACS 2010: 573-584 - [c58]Frédéric Magniez, Claire Mathieu, Ashwin Nayak:
Recognizing well-parenthesized expressions in the streaming model. STOC 2010: 261-270 - [c57]Aparna Das, Claire Mathieu, Shay Mozes:
The Train Delivery Problem - Vehicle Routing Meets Bin Packing. WAOA 2010: 94-105 - [c56]Claire Mathieu, Adrian Vladu:
Online Ranking for Tournament Graphs. WAOA 2010: 201-212 - [i15]Claire Mathieu, Ocan Sankur, Warren Schudy:
Online Correlation Clustering. CoRR abs/1001.0920 (2010) - [i14]Anna R. Karlin, Claire Mathieu, C. Thach Nguyen:
Integrality Gaps of Linear and Semi-definite Programming Relaxations for Knapsack. CoRR abs/1007.1283 (2010)
2000 – 2009
- 2009
- [j36]Aparna Das, Claire Kenyon-Mathieu:
On Hierarchical Diameter-Clustering and the Supplier Problem. Theory Comput. Syst. 45(3): 497-511 (2009) - [j35]Claire Kenyon, Yuval Rabani, Alistair Sinclair:
Low Distortion Maps Between Point Sets. SIAM J. Comput. 39(4): 1617-1636 (2009) - [j34]Glencora Borradaile, Philip N. Klein, Claire Mathieu:
An O(n log n) approximation scheme for Steiner tree in planar graphs. ACM Trans. Algorithms 5(3): 31:1-31:31 (2009) - [c55]Claire Mathieu, Alistair Sinclair:
Sherali-adams relaxations of the matching polytope. STOC 2009: 293-302 - [e2]Claire Mathieu:
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009. SIAM 2009, ISBN 978-0-89871-680-1 [contents] - [i13]Aparna Das, Claire Mathieu, Daniel Ricketts:
Maximizing profit using recommender systems. CoRR abs/0908.3633 (2009) - [i12]Frédéric Magniez, Claire Mathieu, Ashwin Nayak:
Recognizing well-parenthesized expressions in the streaming model. CoRR abs/0911.3291 (2009) - [i11]Frédéric Magniez, Claire Mathieu, Ashwin Nayak:
Recognizing well-parenthesized expressions in the streaming model. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j33]Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young:
Incremental Medians via Online Bidding. Algorithmica 50(4): 455-478 (2008) - [j32]Claire Mathieu, Charalampos Papamanthou:
Distortion lower bounds for line embeddings. Inf. Process. Lett. 108(4): 175-178 (2008) - [j31]Benjamin E. Birnbaum, Claire Mathieu:
On-line bipartite matching made simple. SIGACT News 39(1): 80-87 (2008) - [j30]Jérémy Barbay, Claire Kenyon:
Alternation and redundancy analysis of the intersection problem. ACM Trans. Algorithms 4(1): 4:1-4:18 (2008) - [j29]Irit Katriel, Claire Kenyon-Mathieu, Eli Upfal:
Commitment under uncertainty: Two-stage stochastic matching problems. Theor. Comput. Sci. 408(2-3): 213-223 (2008) - [c54]Glencora Borradaile, Philip N. Klein, Claire Mathieu:
A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest. FOCS 2008: 115-124 - [c53]Yossi Azar, Benjamin E. Birnbaum, Anna R. Karlin, Claire Mathieu, C. Thach Nguyen:
Improved Approximation Algorithms for Budgeted Allocations. ICALP (1) 2008: 186-197 - [c52]Claire Mathieu, Warren Schudy:
Yet another algorithm for dense max cut: go greedy. SODA 2008: 176-182 - [c51]Moses Charikar, Howard J. Karloff, Claire Mathieu, Joseph Naor, Michael E. Saks:
Online multicast with egalitarian cost sharing. SPAA 2008: 70-76 - [i10]Aparna Das, Claire Mathieu:
A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing. CoRR abs/0812.1595 (2008) - 2007
- [c50]Irit Katriel, Claire Kenyon-Mathieu, Eli Upfal:
Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems. ICALP 2007: 171-182 - [c49]Matthew Cary, Aparna Das, Benjamin Edelman, Ioannis Giotis, Kurtis Heimerl, Anna R. Karlin, Claire Mathieu, Michael Schwarz:
Greedy bidding strategies for keyword auctions. EC 2007: 262-271 - [c48]Wenceslas Fernandez de la Vega, Claire Kenyon-Mathieu:
Linear programming relaxations of maxcut. SODA 2007: 53-61 - [c47]Glencora Borradaile, Claire Kenyon-Mathieu, Philip N. Klein:
A polynomial-time approximation scheme for Steiner tree in planar graphs. SODA 2007: 1285-1294 - [c46]Claire Kenyon-Mathieu, Warren Schudy:
How to rank with few errors. STOC 2007: 95-103 - [c45]Glencora Borradaile, Philip N. Klein, Claire Mathieu:
Steiner Tree in Planar Graphs: An O ( n log n ) Approximation Scheme with Singly-Exponential Dependence on Epsilon. WADS 2007: 275-286 - 2006
- [j28]Marek Chrobak, Claire Kenyon, Neal E. Young:
The reverse greedy algorithm for the metric k-median problem. Inf. Process. Lett. 97(2): 68-72 (2006) - [j27]János Csirik, David S. Johnson, Claire Kenyon, James B. Orlin, Peter W. Shor, Richard R. Weber:
On the Sum-of-Squares algorithm for bin packing. J. ACM 53(1): 1-65 (2006) - [j26]Nikhil Bansal, José R. Correa, Claire Kenyon, Maxim Sviridenko:
Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes. Math. Oper. Res. 31(1): 31-49 (2006) - [j25]Marek Chrobak, Claire Kenyon-Mathieu:
SIGACT news online algorithms column 10: competitiveness via doubling. SIGACT News 37(4): 115-126 (2006) - [c44]Claire Kenyon, Meinolf Sellmann:
Plan B: Uncertainty/Time Trade-Offs for Linear and Integer Programming. CPAIOR 2006: 126-138 - [c43]Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young:
Oblivious Medians Via Online Bidding. LATIN 2006: 311-322 - [c42]Aparna Das, Claire Kenyon:
On Hierarchical Diameter-Clustering, and the Supplier Problem. WAOA 2006: 132-145 - [e1]Evripidis Bampis, Klaus Jansen, Claire Kenyon:
Efficient Approximation and Online Algorithms - Recent Progress on Classical Combinatorial Optimization Problems and New Applications. Lecture Notes in Computer Science 3484, Springer 2006, ISBN 978-3-540-32212-2 [contents] - [i9]Claire Kenyon-Mathieu, Warren Schudy:
How to rank with few errors: A PTAS for Weighted Feedback Arc Set on Tournaments. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [c41]Marek Chrobak, Claire Kenyon, Neal E. Young:
The Reverse Greedy Algorithm for the Metric K-Median Problem. COCOON 2005: 654-660 - [c40]Venkatesan Guruswami, Jason D. Hartline, Anna R. Karlin, David Kempe, Claire Kenyon, Frank McSherry:
On profit-maximizing envy-free pricing. SODA 2005: 1164-1173 - [i8]Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young:
Oblivious Medians via Online Bidding. CoRR abs/cs/0504103 (2005) - [i7]Marek Chrobak, Claire Kenyon, Neal E. Young:
The reverse greedy algorithm for the metric k-median problem. CoRR abs/cs/0504104 (2005) - [i6]János Csirik, David S. Johnson, Claire Kenyon:
On the Worst-case Performance of the Sum-of-Squares Algorithm for Bin Packing. CoRR abs/cs/0509031 (2005) - 2004
- [j24]Claire Kenyon, Samuel Kutin:
Sensitivity, block sensitivity, and l-block sensitivity of boolean functions. Inf. Comput. 189(1): 43-53 (2004) - [j23]Adam L. Buchsbaum, Howard J. Karloff, Claire Kenyon, Nick Reingold, Mikkel Thorup:
OPT Versus LOAD in Dynamic Storage Allocation. SIAM J. Comput. 33(3): 632-646 (2004) - [c39]José R. Correa, Claire Kenyon:
Approximation schemes for multidimensional packing. SODA 2004: 186-195 - [c38]Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon:
Approximation schemes for Metric Bisection and partitioning. SODA 2004: 506-515 - [c37]Claire Kenyon:
Approximation Schemes for Metric Clustering Problems. STACS 2004: 1-3 - [c36]Claire Kenyon, Yuval Rabani, Alistair Sinclair:
Low distortion maps between point sets. STOC 2004: 272-280 - 2003
- [j22]Claire Kenyon, Nicolas Schabanel:
The Data Broadcast Problem with Non-Uniform Transmission Times. Algorithmica 35(2): 146-175 (2003) - [j21]Anna R. Karlin, Claire Kenyon, Dana Randall:
Dynamic TCP Acknowledgment and Other Stories about e/(e-1). Algorithmica 36(3): 209-224 (2003) - [c35]Jérémy Barbay, Claire Kenyon:
Deterministic Algorithm for the t-Threshold Set Problem. ISAAC 2003: 575-584 - [c34]Richard M. Karp, Claire Kenyon:
A Gambling Game Arising in the Analysis of Adaptive Randomized Rounding. RANDOM-APPROX 2003: 329-340 - [c33]Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon, Yuval Rabani:
Approximation schemes for clustering problems. STOC 2003: 50-58 - [c32]Adam L. Buchsbaum, Howard J. Karloff, Claire Kenyon, Nick Reingold, Mikkel Thorup:
OPT versus LOAD in dynamic storage allocation. STOC 2003: 556-564 - 2002
- [j20]Abdel Krim Amoura, Evripidis Bampis, Claire Kenyon, Yannis Manoussakis:
Scheduling Independent Multiprocessor Tasks. Algorithmica 32(2): 247-261 (2002) - [j19]Claire Kenyon, Michael Mitzenmacher:
Linear waste of best fit bin packing on skewed distributions. Random Struct. Algorithms 20(3): 441-464 (2002) - [c31]Jérémy Barbay, Claire Kenyon:
Adaptive intersection and t-threshold problems. SODA 2002: 390-399 - [c30]Mordecai J. Golin, Claire Kenyon, Neal E. Young:
Huffman coding with unequal letter costs. STOC 2002: 785-791 - [i5]Claire Kenyon, Nicolas Schabanel, Neal E. Young:
Polynomial-Time Approximation Scheme for Data Broadcast. CoRR cs.DS/0205012 (2002) - [i4]Mordecai J. Golin, Claire Kenyon, Neal E. Young:
Huffman Coding with Unequal Letter Costs. CoRR cs.DS/0205048 (2002) - [i3]János Csirik, David S. Johnson, Claire Kenyon, James B. Orlin, Peter W. Shor, Richard R. Weber:
On the Sum-of-Squares Algorithm for Bin Packing. CoRR cs.DS/0210013 (2002) - [i2]Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon, Yuval Rabani:
Polynomial Time Approximation Schemes for Metric Min-Sum Clustering. Electron. Colloquium Comput. Complex. TR02 (2002) - [i1]Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon:
A Polynomial Time Approximation Scheme for Metric MIN-BISECTION. Electron. Colloquium Comput. Complex. TR02 (2002) - 2001
- [j18]Wenceslas Fernandez de la Vega, Claire Kenyon:
A Randomized Approximation Scheme for Metric MAX-CUT. J. Comput. Syst. Sci. 63(4): 531-541 (2001) - [c29]Claire Kenyon, Elchanan Mossel, Yuval Peres:
Glauber Dynamics on Trees and Hyperbolic Graphs. FOCS 2001: 568-578 - [c28]János Csirik, David S. Johnson, Claire Kenyon:
Better approximation algorithms for bin covering. SODA 2001: 557-566 - [c27]Jérémy Barbay, Claire Kenyon:
On the discrete Bak-Sneppen model of self-organized criticality. SODA 2001: 928-933 - [c26]Anna R. Karlin, Claire Kenyon, Dana Randall:
Dynamic TCP acknowledgement and other stories about e/(e-1). STOC 2001: 502-509 - 2000
- [j17]Claire Kenyon, Eric Rémila:
A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem. Math. Oper. Res. 25(4): 645-656 (2000) - [c25]Claire Kenyon, Michael Mitzenmacher:
Linear Waste of Best Fit Bin Packing on Skewed Distributions. FOCS 2000: 582-589 - [c24]Foto N. Afrati, Evripidis Bampis, Aleksei V. Fishkin, Klaus Jansen, Claire Kenyon:
Scheduling to Minimize the Average Completion Time of Dedicated Tasks. FSTTCS 2000: 454-464 - [c23]János Csirik, David S. Johnson, Claire Kenyon, James B. Orlin, Peter W. Shor, Richard R. Weber:
On the sum-of-squares algorithm for bin packing. STOC 2000: 208-217 - [c22]Claire Kenyon, Nicolas Schabanel, Neal E. Young:
Polynomial-time approximation scheme for data broadcast. STOC 2000: 659-666
1990 – 1999
- 1999
- [j16]Afonso Ferreira, Claire Kenyon, Andrew Rau-Chaplin, Stéphane Ubéda:
d-Dimensional Range Search on Multicomputers. Algorithmica 24(3-4): 195-208 (1999) - [j15]Richard M. Karp, Claire Kenyon, Orli Waarts:
Error-resilient DNA computation. Random Struct. Algorithms 15(3-4): 450-466 (1999) - [c21]János Csirik, David S. Johnson, Claire Kenyon, Peter W. Shor, Richard R. Weber:
A Self Organizing Bin Packing Heuristic. ALENEX 1999: 246-265 - [c20]Foto N. Afrati, Evripidis Bampis, Chandra Chekuri, David R. Karger, Claire Kenyon, Sanjeev Khanna, Ioannis Milis, Maurice Queyranne, Martin Skutella, Clifford Stein, Maxim Sviridenko:
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates. FOCS 1999: 32-44 - [c19]Foto N. Afrati, Evripidis Bampis, Claire Kenyon, Ioannis Milis:
Scheduling on a Constant Number of Machines. RANDOM-APPROX 1999: 281-287 - [c18]Claire Kenyon, Nicolas Schabanel:
The Data Broadcast Problem with Non-Uniform Transmission Rimes. SODA 1999: 547-556 - 1998
- [j14]Claire Kenyon, Hélène Paugam-Moisy:
Multilayer Neural Networks and Polyhedral Dichotomies. Ann. Math. Artif. Intell. 24(1-4): 115-128 (1998) - [j13]Claire Kenyon, Yuval Rabani, Alistair Sinclair:
Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing. J. Algorithms 27(2): 218-235 (1998) - [c17]Wenceslas Fernandez de la Vega, Claire Kenyon:
A Randomized Approximation Scheme for Metric MAX-CUT. FOCS 1998: 468-471 - 1997
- [j12]Guy Louchard, Claire Kenyon, René Schott:
Data Structures' Maxima. SIAM J. Comput. 26(4): 1006-1042 (1997) - [c16]Abdel Krim Amoura, Evripidis Bampis, Claire Kenyon, Yannis Manoussakis:
Scheduling Independent Multiprocessor Tasks. ESA 1997: 1-12 - [c15]Afonso Ferreira, Claire Kenyon, Andrew Rau-Chaplin, Stéphane Ubéda:
d-Dimensional Range Search on Multicomputers. IPPS 1997: 616-620 - 1996
- [j11]Claire Kenyon, Eric Rémila:
Perfect matchings in the triangular lattice. Discret. Math. 152(1-3): 191-210 (1996) - [j10]Thomas Chaboud, Claire Kenyon:
Planar Cayley Graphs with Regular Dual. Int. J. Algebra Comput. 6(5): 553-562 (1996) - [c14]Claire Kenyon, Eric Rémila:
Approximate Strip Packing. FOCS 1996: 31-36 - [c13]Graham R. Brightwell, Claire Kenyon, Hélène Paugam-Moisy:
Multilayer Neural Networks: One or Two Hidden Layers? NIPS 1996: 148-154 - [c12]Claire Kenyon, Yuval Rabani, Alistair Sinclair:
Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing (Preliminary Version). SODA 1996: 351-358 - [c11]Claire Kenyon:
Best-Fit Bin-Packing with Random Order. SODA 1996: 359-364 - [c10]Richard M. Karp, Claire Kenyon, Orli Waarts:
Error-Resilient DNA Computation. SODA 1996: 458-467 - 1994
- [j9]Claire Kenyon, Valerie King:
On Boolean Decision Trees with Faulty Nodes. Random Struct. Algorithms 5(3): 453-464 (1994) - [c9]Micah Adler, Peter Gemmell, Mor Harchol-Balter, Richard M. Karp, Claire Kenyon:
Selection in the Presence of Noise: The Design of Playoff Systems. SODA 1994: 564-572 - [c8]Frank Dehne, Claire Kenyon, Andreas Fabri:
Scalable and architecture independent parallel geometric algorithms with high probability optimal time. SPDP 1994: 586-593 - 1993
- [j8]Pierre Fraigniaud, Claire Kenyon, Andrzej Pelc:
Finding a Target Subnetwork in Sparse Networks with Random Faults. Inf. Process. Lett. 48(6): 297-303 (1993) - [j7]Wayne Goddard, Claire Kenyon, Valerie King, Leonard J. Schulman:
Optimal Randomized Algorithms for Local Sorting and Set-Maxima. SIAM J. Comput. 22(2): 272-283 (1993) - [c7]Claire Kenyon, Dana Randall, Alistair Sinclair:
Matchings in lattice graphs. STOC 1993: 738-746 - 1992
- [j6]Claire Kenyon, Richard W. Kenyon:
How to Take Short Cuts. Discret. Comput. Geom. 8: 251-264 (1992) - [c6]Claire Kenyon, Richard W. Kenyon:
Tiling a Polygon with Rectangles. FOCS 1992: 610-619 - [c5]Claire Kenyon, Valerie King:
On Boolean Decision Trees with Faulty Nodes. ISTCS 1992: 24-31 - 1991
- [j5]Claire Kenyon-Mathieu, Jeffrey Scott Vitter:
Maximum Queue Size and Hashing with Lazy Deletion. Algorithmica 6(4): 597-619 (1991) - [j4]Claire Kenyon-Mathieu, Jeffrey Scott Vitter:
The Maximum Size of Dynamic Data Structures. SIAM J. Comput. 20(5): 807-823 (1991) - [c4]Claire Kenyon, Richard W. Kenyon:
How to Take Short Cuts. SCG 1991: 250-255 - [c3]Guy Louchard, Claire Kenyon, René Schott:
Data Structures Maxima. FCT 1991: 339-349 - 1990
- [j3]Claire Kenyon, Andrew Chi-Chih Yao:
On Evaluating Boolean Functions with Unreliable Tests. Int. J. Found. Comput. Sci. 1(1): 1-10 (1990)
1980 – 1989
- 1989
- [c2]Claire Kenyon-Mathieu, Jeffrey Scott Vitter:
General Methods for the Analysis of the Maximum Size of Dynamic Data Structures (Extended Abstract). ICALP 1989: 473-487 - [c1]Claire Kenyon-Mathieu, Valerie King:
Verifying Partial Orders. STOC 1989: 367-374 - 1987
- [j2]Claire Mathieu:
Some Problems in Computational Geometry. Algorithmica 2: 131-134 (1987) - [j1]Claire Mathieu, Claude Puech, Hossein Yahia:
Average Efficiency of Data Structures for Binary Image Processing. Inf. Process. Lett. 26(2): 89-93 (1987)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-02 22:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
