| 2025 | ICDE | The SpaceSaving± Family of Algorithms for Data Streams with Bounded Deletions. | Fuheng Zhao, Divyakant Agrawal, Amr El Abbadi, Claire Mathieu, Ahmed Metwally, Michel de Rougemont |
| 2023 | ICALP | A Tight (1.5+ε)-Approximation for Unsplittable Capacitated Vehicle Routing on Trees. | Claire Mathieu, Hang Zhou |
| 2023 | STACS | An Approximation Algorithm for Distance-Constrained Vehicle Routing on Trees. | Marc Dufay, Claire Mathieu, Hang Zhou |
| 2022 | ICALP | A PTAS for Capacitated Vehicle Routing on Trees. | Claire Mathieu, Hang Zhou |
| 2021 | ESA | A Simple Algorithm for Graph Reconstruction. | Claire Mathieu, Hang Zhou |
| 2021 | FCT | Two-Sided Matching Markets with Strongly Correlated Preferences. | Hugo Gimbert, Claire Mathieu, Simon Mauras |
| 2021 | ICALP | Approximating Maximum Integral Multiflows on Bounded Genus Graphs. | Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Jens Vygen |
| 2021 | ISAAC | Probabilistic Analysis of Euclidean Capacitated Vehicle Routing. | Claire Mathieu, Hang Zhou |
| 2021 | SODA | Competitive Data-Structure Dynamization. | Claire Mathieu, Rajmohan Rajaraman, Neal E. Young, Arman Yousefi |
| 2020 | IWOCA | Skyline Computation with Noisy Comparisons. | Benot Groz, Frederik Mallmann-Trenn, Claire Mathieu, Victor Verdugo |
| 2020 | SODA | Instance-Optimality in the Noisy Value-and Comparison-Model. | Vincent Cohen-Addad, Frederik Mallmann-Trenn, Claire Mathieu |
| 2020 | SODA | How to aggregate Top-lists: Approximation algorithms via scores and average ranks. | Claire Mathieu, Simon Mauras |
| 2018 | ISAAC | Covering Clients with Types and Budgets. | Dimitris Fotakis, Laurent Gourvs, Claire Mathieu, Abhinav Srivastav |
| 2018 | SODA | Hierarchical Clustering: Objective Functions and Algorithms. | Vincent Cohen-Addad, Varun Kanade, Frederik Mallmann-Trenn, Claire Mathieu |
| 2017 | ESA | Combinatorics of Local Search: An Optimal 4-Local Hall's Theorem for Planar Graphs. | Daniel Antunes, Claire Mathieu, Nabil H. Mustafa |
| 2017 | ESA | Dynamic Clustering to Minimize the Sum of Radii. | Monika Henzinger, Dariusz Leniowski, Claire Mathieu |
| 2017 | SODA | Optimization of Bootstrapping in Circuits. | Fabrice Benhamouda, Tancrde Lepoint, Claire Mathieu, Hang Zhou |
| 2016 | FOCS | 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 |
| 2016 | ICALP | Carpooling in Social Networks. | Amos Fiat, Anna R. Karlin, Elias Koutsoupias, Claire Mathieu, Rotem Zach |
| 2016 | IPCO | Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines. | Adam Kurpisz, Monaldo Mastrolilli, Claire Mathieu, Tobias Mmke, Victor Verdugo, Andreas Wiese |
| 2016 | SODA | Distance in the Forest Fire Model How far are you from Eve? | Varun Kanade, Reut Levi, Zvi Lotker, Frederik Mallmann-Trenn, Claire Mathieu |
| 2016 | STOC | Approximating connectivity domination in weighted bounded-genus graphs. | Vincent Cohen-Addad, ric Colin de Verdire, Philip N. Klein, Claire Mathieu, David Meierfrankenfeld |
| 2015 | ICALP | Near-Linear Query Complexity for Graph Inference. | Sampath Kannan, Claire Mathieu, Hang Zhou |
| 2015 | STACS | Correlation Clustering and Two-edge-connected Augmentation for Planar Graphs. | Philip N. Klein, Claire Mathieu, Hang Zhou |
| 2014 | ICALP | Facility Location in Evolving Metrics. | David Eisenstat, Claire Mathieu, Nicolas Schabanel |
| 2014 | SODA | Approximating | David Eisenstat, Philip N. Klein, Claire Mathieu |
| 2014 | SODA | First Come First Served for Online Slot Allocation and Huffman Coding. | Monik Khare, Claire Mathieu, Neal E. Young |
| 2014 | WAOA | Energy-Efficient Algorithms for Non-preemptive Speed-Scaling. | Vincent Cohen-Addad, Zhentao Li, Claire Mathieu, Ioannis Milis |
| 2013 | ICALP | Graph Reconstruction via Distance Oracles. | Claire Mathieu, Hang Zhou |
| 2012 | SODA | A polynomial-time approximation scheme for planar multiway cut. | MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Philip N. Klein, Claire Mathieu |
| 2012 | SODA | An efficient polynomial-time approximation scheme for Steiner forest in planar graphs. | David Eisenstat, Philip N. Klein, Claire Mathieu |
| 2011 | IPCO | Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack. | Anna R. Karlin, Claire Mathieu, C. Thach Nguyen |
| 2010 | SODA | A Quasi-polynomial Time Approximation Scheme for Euclidean Capacitated Vehicle Routing. | Aparna Das, Claire Mathieu |
| 2010 | SODA | Correlation Clustering with Noisy Input. | Claire Mathieu, Warren Schudy |
| 2010 | STOC | Recognizing well-parenthesized expressions in the streaming model. | Frdric Magniez, Claire Mathieu, Ashwin Nayak |
| 2010 | STACS | Online Correlation Clustering. | Claire Mathieu, Ocan Sankur, Warren Schudy |
| 2010 | WAOA | The Train Delivery Problem - Vehicle Routing Meets Bin Packing. | Aparna Das, Claire Mathieu, Shay Mozes |
| 2010 | WAOA | Online Ranking for Tournament Graphs. | Claire Mathieu, Adrian Vladu |
| 2009 | STOC | Sherali-adams relaxations of the matching polytope. | Claire Mathieu, Alistair Sinclair |
| 2008 | FOCS | A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest. | Glencora Borradaile, Philip N. Klein, Claire Mathieu |
| 2008 | ICALP | Improved Approximation Algorithms for Budgeted Allocations. | Yossi Azar, Benjamin E. Birnbaum, Anna R. Karlin, Claire Mathieu, C. Thach Nguyen |
| 2008 | SODA | Yet another algorithm for dense max cut: go greedy. | Claire Mathieu, Warren Schudy |
| 2008 | SPAA | Online multicast with egalitarian cost sharing. | Moses Charikar, Howard J. Karloff, Claire Mathieu, Joseph Naor, Michael E. Saks |
| 2007 | WADS | Steiner Tree in Planar Graphs: An | Glencora Borradaile, Philip N. Klein, Claire Mathieu |