Some Problems in Computational Geometry. - Claire Mathieu (Algorithmica, 1987)

Average Efficiency of Data Structures for Binary Image Processing. - Claire Mathieu; Claude Puech; Hossein Yahia (Inf. Process. Lett., 1987)

General Methods for the Analysis of the Maximum Size of Dynamic Data Structures (Extended Abstract). - Claire Kenyon-Mathieu; Jeffrey Scott Vitter (ICALP, 1989)

Verifying Partial Orders - Claire Kenyon-Mathieu; Valerie King (STOC, 1989)

On Evaluating Boolean Functions with Unreliable Tests. - Claire Kenyon; Andrew Chi-Chih Yao (Int. J. Found. Comput. Sci., 1990)

Maximum Queue Size and Hashing with Lazy Deletion. - Claire Kenyon-Mathieu; Jeffrey Scott Vitter (Algorithmica, 1991)

The Maximum Size of Dynamic Data Structures. - Claire Kenyon-Mathieu; Jeffrey Scott Vitter (SIAM J. Comput., 1991)

Tiling a Polygon with Rectangles - Claire Kenyon; Richard W. Kenyon (FOCS, 1992)

How to Take Short Cuts. - Claire Kenyon; Richard W. Kenyon (Discret. Comput. Geom., 1992)

Matchings in lattice graphs. - Claire Kenyon; Dana Randall; Alistair Sinclair (STOC, 1993)

Finding a Target Subnetwork in Sparse Networks with Random Faults. - Pierre Fraigniaud; Claire Kenyon; Andrzej Pelc (Inf. Process. Lett., 1993)

Optimal Randomized Algorithms for Local Sorting and Set-Maxima. - Wayne Goddard; Claire Kenyon; Valerie King; Leonard J. Schulman (SIAM J. Comput., 1993)

Selection in the Presence of Noise: The Design of Playoff Systems. - Micah Adler; Peter Gemmell; Mor Harchol-Balter; Richard M. Karp; Claire Kenyon (SODA, 1994)

Scalable and architecture independent parallel geometric algorithms with high probability optimal time. - Frank Dehne; Claire Kenyon; Andreas Fabri (SPDP, 1994)

On Boolean Decision Trees with Faulty Nodes. - Claire Kenyon; Valerie King (Random Struct. Algorithms, 1994)

Approximate Strip Packing. - Claire Kenyon; Eric Rémila (FOCS, 1996)

Multilayer Neural Networks: One or Two Hidden Layers? - Graham R. Brightwell; Claire Kenyon; Hélène Paugam-Moisy (NIPS, 1996)

Best-Fit Bin-Packing with Random Order. - Claire Kenyon (SODA, 1996)

Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing (Preliminary Version). - Claire Kenyon; Yuval Rabani; Alistair Sinclair (SODA, 1996)

Perfect matchings in the triangular lattice. - Claire Kenyon; Eric Rémila (Discret. Math., 1996)

Planar Cayley Graphs with Regular Dual. - Thomas Chaboud; Claire Kenyon (Int. J. Algebra Comput., 1996)

d-Dimensional Range Search on Multicomputers. - Afonso Ferreira; Claire Kenyon; Andrew Rau-Chaplin; Stéphane Ubéda (IPPS, 1997)

Data Structures' Maxima. - Guy Louchard; Claire Kenyon; René Schott (SIAM J. Comput., 1997)

Multilayer Neural Networks and Polyhedral Dichotomies. - Claire Kenyon; Hélène Paugam-Moisy (Ann. Math. Artif. Intell., 1998)

Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing. - Claire Kenyon; Yuval Rabani; Alistair Sinclair (J. Algorithms, 1998)

A Self Organizing Bin Packing Heuristic. - János Csirik; David S. Johnson 001; Claire Kenyon; Peter W. Shor; Richard R. Weber 003 (ALENEX, 1999)

Approximation 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 001; Maxim Sviridenko (FOCS, 1999)

Scheduling on a Constant Number of Machines. - Foto N. Afrati; Evripidis Bampis; Claire Kenyon; Ioannis Milis (RANDOM-APPROX, 1999)

The Data Broadcast Problem with Non-Uniform Transmission Rimes. - Claire Kenyon; Nicolas Schabanel (SODA, 1999)

d-Dimensional Range Search on Multicomputers. - Afonso Ferreira; Claire Kenyon; Andrew Rau-Chaplin; Stéphane Ubéda (Algorithmica, 1999)

Error-resilient DNA computation. - Richard M. Karp; Claire Kenyon; Orli Waarts (Random Struct. Algorithms, 1999)

Scheduling to Minimize the Average Completion Time of Dedicated Tasks. - Foto N. Afrati; Evripidis Bampis; Aleksei V. Fishkin; Klaus Jansen; Claire Kenyon (FSTTCS, 2000)

Polynomial-time approximation scheme for data broadcast. - Claire Kenyon; Nicolas Schabanel; Neal E. Young (STOC, 2000)

A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem. - Claire Kenyon; Eric Rémila (Math. Oper. Res., 2000)

Glauber Dynamics on Trees and Hyperbolic Graphs. - Claire Kenyon; Elchanan Mossel; Yuval Peres (FOCS, 2001)

On the discrete Bak-Sneppen model of self-organized criticality. - Jérémy Barbay; Claire Kenyon (SODA, 2001)

Better approximation algorithms for bin covering. - János Csirik; David S. Johnson 001; Claire Kenyon (SODA, 2001)

Dynamic TCP acknowledgement and other stories about e/(e-1). - Anna R. Karlin; Claire Kenyon; Dana Randall (STOC, 2001)

A Randomized Approximation Scheme for Metric MAX-CUT. - Wenceslas Fernandez de la Vega; Claire Kenyon (J. Comput. Syst. Sci., 2001)

Adaptive intersection and t-threshold problems. - Jérémy Barbay; Claire Kenyon (SODA, 2002)

Huffman coding with unequal letter costs. - Mordecai J. Golin; Claire Kenyon; Neal E. Young (STOC, 2002)

Scheduling Independent Multiprocessor Tasks. - Abdel Krim Amoura; Evripidis Bampis; Claire Kenyon; Yannis Manoussakis (Algorithmica, 2002)

Polynomial Time Approximation Schemes for Metric Min-Sum Clustering - Wenceslas Fernandez de la Vega; Marek Karpinski; Claire Kenyon; Yuval Rabani (Electron. Colloquium Comput. Complex., 2002)

A Polynomial Time Approximation Scheme for Metric MIN-BISECTION - Wenceslas Fernandez de la Vega; Marek Karpinski; Claire Kenyon (Electron. Colloquium Comput. Complex., 2002)

Linear waste of best fit bin packing on skewed distributions. - Claire Kenyon; Michael Mitzenmacher (Random Struct. Algorithms, 2002)

Deterministic Algorithm for the t-Threshold Set Problem. - Jérémy Barbay; Claire Kenyon (ISAAC, 2003)

A Gambling Game Arising in the Analysis of Adaptive Randomized Rounding. - Richard M. Karp; Claire Kenyon (RANDOM-APPROX, 2003)

Approximation schemes for clustering problems. - Wenceslas Fernandez de la Vega; Marek Karpinski; Claire Kenyon; Yuval Rabani (STOC, 2003)

Dynamic TCP Acknowledgment and Other Stories about e/(e-1). - Anna R. Karlin; Claire Kenyon; Dana Randall (Algorithmica, 2003)

The Data Broadcast Problem with Non-Uniform Transmission Times. - Claire Kenyon; Nicolas Schabanel (Algorithmica, 2003)

Approximation schemes for multidimensional packing. - José R. Correa; Claire Kenyon (SODA, 2004)

Approximation schemes for Metric Bisection and partitioning. - Wenceslas Fernandez de la Vega; Marek Karpinski; Claire Kenyon (SODA, 2004)

Approximation Schemes for Metric Clustering Problems. - Claire Kenyon (STACS, 2004)

Sensitivity, block sensitivity, and l-block sensitivity of boolean functions. - Claire Kenyon; Samuel Kutin (Inf. Comput., 2004)

OPT Versus LOAD in Dynamic Storage Allocation. - Adam L. Buchsbaum; Howard J. Karloff; Claire Kenyon; Nick Reingold; Mikkel Thorup (SIAM J. Comput., 2004)

On profit-maximizing envy-free pricing. - Venkatesan Guruswami; Jason D. Hartline; Anna R. Karlin; David Kempe 001; Claire Kenyon; Frank McSherry (SODA, 2005)

The reverse greedy algorithm for the metric k-median problem - Marek Chrobak; Claire Kenyon; Neal E. Young (CoRR, 2005)

On the Worst-case Performance of the Sum-of-Squares Algorithm for Bin Packing - János Csirik; David S. Johnson 001; Claire Kenyon (CoRR, 2005)

Plan B: Uncertainty/Time Trade-Offs for Linear and Integer Programming. - Claire Kenyon; Meinolf Sellmann (CPAIOR, 2006)

Oblivious Medians Via Online Bidding. - Marek Chrobak; Claire Kenyon; John Noga; Neal E. Young (LATIN, 2006)

How to rank with few errors: A PTAS for Weighted Feedback Arc Set on Tournaments. - Claire Kenyon-Mathieu; Warren Schudy (Electron. Colloquium Comput. Complex., 2006)

The reverse greedy algorithm for the metric k-median problem. - Marek Chrobak; Claire Kenyon; Neal E. Young (Inf. Process. Lett., 2006)

On the Sum-of-Squares algorithm for bin packing. - János Csirik; David S. Johnson 001; Claire Kenyon; James B. Orlin; Peter W. Shor; Richard R. Weber 003 (J. ACM, 2006)

Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes. - Nikhil Bansal 001; José R. Correa; Claire Kenyon; Maxim Sviridenko (Math. Oper. Res., 2006)

SIGACT news online algorithms column 10: competitiveness via doubling. - Marek Chrobak; Claire Kenyon-Mathieu (SIGACT News, 2006)

Greedy bidding strategies for keyword auctions. - Matthew Cary; Aparna Das; Benjamin Edelman; Ioannis Giotis 001; Kurtis Heimerl; Anna R. Karlin; Claire Mathieu; Michael Schwarz 002 (EC, 2007)

A polynomial-time approximation scheme for Steiner tree in planar graphs. - Glencora Borradaile; Claire Kenyon-Mathieu; Philip N. Klein (SODA, 2007)

Linear programming relaxations of maxcut. - Wenceslas Fernandez de la Vega; Claire Kenyon-Mathieu (SODA, 2007)

How to rank with few errors. - Claire Kenyon-Mathieu; Warren Schudy (STOC, 2007)

Steiner Tree in Planar Graphs: An O ( n log n ) Approximation Scheme with Singly-Exponential Dependence on Epsilon. - Glencora Borradaile; Philip N. Klein; Claire Mathieu (WADS, 2007)

Improved Approximation Algorithms for Budgeted Allocations. - Yossi Azar; Benjamin E. Birnbaum; Anna R. Karlin; Claire Mathieu; C. Thach Nguyen (ICALP (1), 2008)

Yet another algorithm for dense max cut: go greedy. - Claire Mathieu; Warren Schudy (SODA, 2008)

Online multicast with egalitarian cost sharing. - Moses Charikar; Howard J. Karloff; Claire Mathieu; Joseph Naor; Michael E. Saks (SPAA, 2008)

Incremental Medians via Online Bidding. - Marek Chrobak; Claire Kenyon; John Noga; Neal E. Young (Algorithmica, 2008)

Distortion lower bounds for line embeddings. - Claire Mathieu; Charalampos Papamanthou (Inf. Process. Lett., 2008)

On-line bipartite matching made simple. - Benjamin E. Birnbaum; Claire Mathieu (SIGACT News, 2008)

Alternation and redundancy analysis of the intersection problem. - Jérémy Barbay; Claire Kenyon (ACM Trans. Algorithms, 2008)

Commitment under uncertainty: Two-stage stochastic matching problems. - Irit Katriel; Claire Kenyon-Mathieu; Eli Upfal (Theor. Comput. Sci., 2008)

Sherali-adams relaxations of the matching polytope. - Claire Mathieu; Alistair Sinclair (STOC, 2009)

Maximizing profit using recommender systems - Aparna Das; Claire Mathieu; Daniel Ricketts 001 (CoRR, 2009)

On Hierarchical Diameter-Clustering and the Supplier Problem. - Aparna Das; Claire Kenyon-Mathieu (Theory Comput. Syst., 2009)

Low Distortion Maps Between Point Sets. - Claire Kenyon; Yuval Rabani; Alistair Sinclair (SIAM J. Comput., 2009)

An O(n log n) approximation scheme for Steiner tree in planar graphs. - Glencora Borradaile; Philip N. Klein; Claire Mathieu (ACM Trans. Algorithms, 2009)

A Quasi-polynomial Time Approximation Scheme for Euclidean Capacitated Vehicle Routing. - Aparna Das; Claire Mathieu (SODA, 2010)

Correlation Clustering with Noisy Input. - Claire Mathieu; Warren Schudy (SODA, 2010)

Online Correlation Clustering. - Claire Mathieu; Ocan Sankur; Warren Schudy (STACS, 2010)

The Train Delivery Problem - Vehicle Routing Meets Bin Packing. - Aparna Das; Claire Mathieu; Shay Mozes (WAOA, 2010)

Online Ranking for Tournament Graphs. - Claire Mathieu; Adrian Vladu (WAOA, 2010)

Foreword to special issue SODA 2009. - Claire Mathieu (ACM Trans. Algorithms, 2010)

Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack. - Anna R. Karlin; Claire Mathieu; C. Thach Nguyen (IPCO, 2011)

Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091). - Klaus Jansen; Claire Mathieu; Hadas Shachnai; Neal E. Young (Dagstuhl Reports, 2011)

Maximum Matching in Semi-streaming with Few Passes. - Christian Konrad 001; Frédéric Magniez; Claire Mathieu (APPROX-RANDOM, 2012)

A polynomial-time approximation scheme for planar multiway cut. - MohammadHossein Bateni; MohammadTaghi Hajiaghayi; Philip N. Klein; Claire Mathieu (SODA, 2012)

An efficient polynomial-time approximation scheme for Steiner forest in planar graphs. - David Eisenstat; Philip N. Klein; Claire Mathieu (SODA, 2012)

On the Number of Indecomposable Permutations with a Given Number of Cycles. - Robert Cori; Claire Mathieu; John Michael Robson (Electron. J. Comb., 2012)

Lower bounds for randomized algorithms for online chain partitioning. - Claire Mathieu; Olga Ohrimenko (Inf. Process. Lett., 2012)

Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme. - Mordecai J. Golin; Claire Mathieu; Neal E. Young (SIAM J. Comput., 2012)

Graph Reconstruction via Distance Oracles. - Claire Mathieu; Hang Zhou 001 (ICALP (1), 2013)

The Min Mean-Weight Cycle in a Random Network. - Claire Mathieu; David B. Wilson 002 (Comb. Probab. Comput., 2013)

Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 13421). - Glencora Borradaile; Philip N. Klein; Dániel Marx; Claire Mathieu (Dagstuhl Reports, 2013)

Online constrained optimization with recourse. - Tess Avitabile; Claire Mathieu; Laura H. Parkinson (Inf. Process. Lett., 2013)

Facility Location in Evolving Metrics. - David Eisenstat; Claire Mathieu; Nicolas Schabanel (ICALP (2), 2014)

Approximating k-center in planar graphs. - David Eisenstat; Philip N. Klein; Claire Mathieu (SODA, 2014)

First Come First Served for Online Slot Allocation and Huffman Coding. - Monik Khare; Claire Mathieu; Neal E. Young (SODA, 2014)

Energy-Efficient Algorithms for Non-preemptive Speed-Scaling. - Vincent Cohen-Addad; Zhentao Li; Claire Mathieu; Ioannis Milis (WAOA, 2014)

Lower bounds for testing digraph connectivity with one-pass streaming algorithms. - Glencora Borradaile; Claire Mathieu; Theresa Migler (CoRR, 2014)

The Unreasonable Success of Local Search: Geometric Optimization. - Vincent Cohen-Addad; Claire Mathieu (CoRR, 2014)

Graph Verification and Reconstruction via Distance Oracles. - Sampath Kannan; Claire Mathieu; Hang Zhou 001 (CoRR, 2014)

K-Slot SSTable Stack Compaction. - Claire Mathieu; Carl Staelin; Neal E. Young (CoRR, 2014)

Recognizing Well-Parenthesized Expressions in the Streaming Model. - Frédéric Magniez; Claire Mathieu; Ashwin Nayak 001 (SIAM J. Comput., 2014)

Convergence of Position Auctions under Myopic Best-Response Dynamics. - Matthew Cary; Aparna Das; Benjamin Edelman; Ioannis Giotis 001; Kurtis Heimerl; Anna R. Karlin; Scott Duke Kominers; Claire Mathieu; Michael Schwarz 002 (ACM Trans. Economics and Comput., 2014)

Effectiveness of Local Search for Geometric Optimization. - Vincent Cohen-Addad; Claire Mathieu (SoCG, 2015)

Near-Linear Query Complexity for Graph Inference. - Sampath Kannan; Claire Mathieu; Hang Zhou 001 (ICALP (1), 2015)

Homophily and the Glass Ceiling Effect in Social Networks. - Chen Avin; Barbara Keller; Zvi Lotker; Claire Mathieu; David Peleg; Yvonne-Anne Pignolet (ITCS, 2015)

A Quasipolynomial Time Approximation Scheme for Euclidean Capacitated Vehicle Routing. - Aparna Das; Claire Mathieu (Algorithmica, 2015)

The Presburger Award 2016 - Call for Nominations. - Claire Mathieu (Bull. EATCS, 2015)

A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest. - Glencora Borradaile; Philip N. Klein; Claire Mathieu (ACM Trans. Algorithms, 2015)

Carpooling in Social Networks. - Amos Fiat; Anna R. Karlin; Elias Koutsoupias; Claire Mathieu; Rotem Zach (ICALP, 2016)

Distance in the Forest Fire Model How far are you from Eve? - Varun Kanade; Reut Levi; Zvi Lotker; Frederik Mallmann-Trenn; Claire Mathieu (SODA, 2016)

Approximating connectivity domination in weighted bounded-genus graphs. - Vincent Cohen-Addad; Éric Colin de Verdière; Philip N. Klein; Claire Mathieu; David Meierfrankenfeld (STOC, 2016)

The power of local search for clustering. - Vincent Cohen-Addad; Philip N. Klein; Claire Mathieu (CoRR, 2016)

Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 16221). - Jeff Erickson 001; Philip N. Klein; Dániel Marx; Claire Mathieu (Dagstuhl Reports, 2016)

Optimization of Bootstrapping in Circuits. - Fabrice Benhamouda; Tancrède Lepoint; Claire Mathieu; Hang Zhou 001 (IACR Cryptol. ePrint Arch., 2016)

Combinatorics of Local Search: An Optimal 4-Local Hall's Theorem for Planar Graphs. - Daniel Antunes; Claire Mathieu; Nabil H. Mustafa (ESA, 2017)

Skyline Computation with Noisy Comparisons. - Frederik Mallmann-Trenn; Claire Mathieu; Victor Verdugo (CoRR, 2017)

Probabilistic Methods in the Design and Analysis of Algorithms (Dagstuhl Seminar 17141). - Bodo Manthey; Claire Mathieu; Heiko Röglin; Eli Upfal (Dagstuhl Reports, 2017)

Covering Clients with Types and Budgets. - Dimitris Fotakis 001; Laurent Gourvès; Claire Mathieu; Abhinav Srivastav (ISAAC, 2018)

Instance-Optimality in the Noisy Value-and Comparison-Model - Accept, Accept, Strong Accept: Which Papers get in? - Vincent Cohen-Addad; Frederik Mallmann-Trenn; Claire Mathieu (CoRR, 2018)

How to aggregate Top-lists: Score based approximation schemes. - Claire Mathieu; Simon Mauras (CoRR, 2018)

Semidefinite and linear programming integrality gaps for scheduling identical machines. - Adam Kurpisz; Monaldo Mastrolilli; Claire Mathieu; Tobias Mömke; Victor Verdugo; Andreas Wiese (Math. Program., 2018)

Graph Reconstruction and Verification. - Sampath Kannan; Claire Mathieu; Hang Zhou 001 (ACM Trans. Algorithms, 2018)

Maximizing Covered Area in the Euclidean Plane with Connectivity Constraint. - Chien-Chung Huang 001; Mathieu Mari; Claire Mathieu; Joseph S. B. Mitchell; Nabil H. Mustafa (APPROX-RANDOM, 2019)

On popularity-based random matching markets. - Hugo Gimbert; Claire Mathieu; Simon Mauras (CoRR, 2019)

Hierarchical Clustering: Objective Functions and Algorithms. - Vincent Cohen-Addad; Varun Kanade; Frederik Mallmann-Trenn; Claire Mathieu (J. ACM, 2019)

Local Search Yields Approximation Schemes for k-Means and k-Median in Euclidean and Minor-Free Metrics. - Vincent Cohen-Addad; Philip N. Klein; Claire Mathieu (SIAM J. Comput., 2019)

Skyline Computation with Noisy Comparisons. - Benoît Groz; Frederik Mallmann-Trenn; Claire Mathieu; Victor Verdugo (IWOCA, 2020)

Instance-Optimality in the Noisy Value-and Comparison-Model. - Vincent Cohen-Addad; Frederik Mallmann-Trenn; Claire Mathieu (SODA, 2020)

How to aggregate Top-lists: Approximation algorithms via scores and average ranks. - Claire Mathieu; Simon Mauras (SODA, 2020)

Dynamic Clustering to Minimize the Sum of Radii. - Monika Henzinger; Dariusz Leniowski; Claire Mathieu (Algorithmica, 2020)

Two-Sided Matching Markets with Strongly Correlated Preferences. - Hugo Gimbert; Claire Mathieu; Simon Mauras (FCT, 2021)

Probabilistic Analysis of Euclidean Capacitated Vehicle Routing. - Claire Mathieu; Hang Zhou 001 (ISAAC, 2021)

Constrained School Choice with Incomplete Information. - Hugo Gimbert; Claire Mathieu; Simon Mauras (CoRR, 2021)

Large very dense subgraphs in a stream of edges. - Claire Mathieu; Michel de Rougemont (Netw. Sci., 2021)

Mitigating COVID-19 outbreaks in workplaces and schools by hybrid telecommuting. - Simon Mauras; Vincent Cohen-Addad; Guillaume Duboc; Max Dupré la Tour; Paolo Frasca; Claire Mathieu; Lulla Opatowski; Laurent Viennot (PLoS Comput. Biol., 2021)

An Approximation Algorithm for Fully Planar Edge-Disjoint Paths. - Chien-Chung Huang 001; Mathieu Mari; Claire Mathieu; Kevin Schewior; Jens Vygen (SIAM J. Discret. Math., 2021)

A Tight 3/2+ε-Approximation for Unsplittable Capacitated Vehicle Routing on Trees. - Claire Mathieu; Hang Zhou 001 (CoRR, 2022)

Unsplittable Euclidean Capacitated Vehicle Routing: A (2+ε)-Approximation Algorithm. - Fabrizio Grandoni 001; Claire Mathieu; Hang Zhou 001 (ITCS, 2023)

An Approximation Algorithm for Distance-Constrained Vehicle Routing on Trees. - Marc Dufay; Claire Mathieu; Hang Zhou 001 (STACS, 2023)

Testing frequency distributions in a stream. - Claire Mathieu; Michel de Rougemont (CoRR, 2023)

A Detailed Analysis of the SpaceSaving± Family of Algorithms with Bounded Deletions. - Fuheng Zhao; Divyakant Agrawal; Amr El Abbadi; Claire Mathieu; Ahmed Metwally 001; Michel de Rougemont (CoRR, 2023)

A PTAS for Capacitated Vehicle Routing on Trees. - Claire Mathieu; Hang Zhou 001 (ACM Trans. Algorithms, 2023)

Iterated tour partitioning for Euclidean capacitated vehicle routing. - Claire Mathieu; Hang Zhou 001 (Random Struct. Algorithms, 2023)

A simple algorithm for graph reconstruction. - Claire Mathieu; Hang Zhou 001 (Random Struct. Algorithms, 2023)

Correlation Clustering and Two-Edge-Connected Augmentation for Planar Graphs. - Philip N. Klein; Claire Mathieu; Hang Zhou 001 (Algorithmica, 2023)

Approximating Maximum Integral Multiflows on Bounded Genus Graphs. - Chien-Chung Huang 001; Mathieu Mari; Claire Mathieu; Jens Vygen (Discret. Comput. Geom., 2023)

Errata for "SpaceSaving±: An Optimal Algorithm for Frequency Estimation and Frequent Items in the Bounded-Deletion Model". - Fuheng Zhao; Divyakant Agrawal; Amr El Abbadi; Ahmed Metwally 001; Claire Mathieu; Michel de Rougemont (Proc. VLDB Endow., 2023)

Rotation distance using flows. - Claire Mathieu; William Thurston (CoRR, 2024)

Apportionment with parity constraints. - Claire Mathieu; Victor Verdugo (Math. Program., 2024)

Fairness of linear regression in decision making. - Vincent Cohen-Addad; Surya Teja Gavva; Karthik C. S. 001; Claire Mathieu; Namrata (Int. J. Data Sci. Anal., 2024)

Competitive Data-Structure Dynamization. - Claire Mathieu; Rajmohan Rajaraman; Neal E. Young; Arman Yousefi (ACM Trans. Algorithms, 2024)

Estimating the Electoral Consequences of Legislative Redistricting in France. - Evripidis Bampis; Thomas Ehrhard; Bruno Escoffier; Claire Mathieu; Fanny Pascual; David Saulpic (FAccT, 2025)

The SpaceSaving± Family of Algorithms for Data Streams with Bounded Deletions. - Fuheng Zhao; Divyakant Agrawal; Amr El Abbadi; Claire Mathieu; Ahmed Metwally 001; Michel de Rougemont (ICDE, 2025)

A tight (1.5+ε )-approximation for unsplittable capacitated vehicle routing on trees. - Claire Mathieu; Hang Zhou 001 (Math. Program., 2025)