Claire Mathieu

ORCID

Publication Activity (10 Years)

Years Active: 1987-2024
Publications (10 Years): 72

Top Venues

Publications

Claire Mathieu, Victor Verdugo
Apportionment with parity constraints. Math. Program. 203 (1) (2024)
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) (2024)
Claire Mathieu, Hang Zhou
Iterated tour partitioning for Euclidean capacitated vehicle routing. Random Struct. Algorithms 62 (4) (2023)
Claire Mathieu, Hang Zhou
A simple algorithm for graph reconstruction. Random Struct. Algorithms 63 (2) (2023)
Fabrizio Grandoni, Claire Mathieu, Hang Zhou
Unsplittable Euclidean Capacitated Vehicle Routing: A (2+ε)-Approximation Algorithm. ITCS (2023)
Marc Dufay, Claire Mathieu, Hang Zhou
An Approximation Algorithm for Distance-Constrained Vehicle Routing on Trees. STACS (2023)
Philip N. Klein, Claire Mathieu, Hang Zhou
Correlation Clustering and Two-Edge-Connected Augmentation for Planar Graphs. Algorithmica 85 (10) (2023)
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 (2023)
Claire Mathieu, Hang Zhou
A PTAS for Capacitated Vehicle Routing on Trees. ACM Trans. Algorithms 19 (2) (2023)
Claire Mathieu, Hang Zhou
A Tight (1.5+ε)-Approximation for Unsplittable Capacitated Vehicle Routing on Trees. ICALP (2023)
Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Jens Vygen
Approximating Maximum Integral Multiflows on Bounded Genus Graphs. Discret. Comput. Geom. 70 (4) (2023)
Claire Mathieu, Michel de Rougemont
Testing frequency distributions in a stream. CoRR (2023)
Fuheng Zhao, Divyakant Agrawal, Amr El Abbadi, Ahmed Metwally, Claire Mathieu, Michel de Rougemont
Errata for \. Proc. VLDB Endow. 17 (4) (2023)
Marc Dufay, Claire Mathieu, Hang Zhou
An Approximation Algorithm for Distance-Constrained Vehicle Routing on Trees. CoRR (2022)
Claire Mathieu, Hang Zhou
A Tight 3/2+ε-Approximation for Unsplittable Capacitated Vehicle Routing on Trees. CoRR (2022)
Claire Mathieu, Hang Zhou
A PTAS for Capacitated Vehicle Routing on Trees. ICALP (2022)
Fabrizio Grandoni, Claire Mathieu, Hang Zhou
Unsplittable Euclidean Capacitated Vehicle Routing: A (2+ε)-Approximation Algorithm. CoRR (2022)
Claire Mathieu, Hang Zhou
Probabilistic Analysis of Euclidean Capacitated Vehicle Routing. ISAAC (2021)
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)
Hugo Gimbert, Claire Mathieu, Simon Mauras
Constrained School Choice with Incomplete Information. CoRR (2021)
Hugo Gimbert, Claire Mathieu, Simon Mauras
Two-Sided Matching Markets with Strongly Correlated Preferences. FCT (2021)
Claire Mathieu, Hang Zhou
A Simple Algorithm for Graph Reconstruction. ESA (2021)
Claire Mathieu, Rajmohan Rajaraman, Neal E. Young, Arman Yousefi
Competitive Data-Structure Dynamization. SODA (2021)
Claire Mathieu, Michel de Rougemont
Large very dense subgraphs in a stream of edges. Netw. Sci. 9 (4) (2021)
Claire Mathieu, Hang Zhou
A PTAS for Capacitated Vehicle Routing on Trees. CoRR (2021)
Claire Mathieu, Victor Verdugo
Apportionment with Parity Constraints. CoRR (2021)
Claire Mathieu, Hang Zhou
Probabilistic Analysis of Euclidean Capacitated Vehicle Routing. CoRR (2021)
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) (2021)
Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Jens Vygen
Approximating Maximum Integral Multiflows on Bounded Genus Graphs. ICALP (2021)
Claire Mathieu, Hang Zhou
A Simple Algorithm for Graph Reconstruction. CoRR (2021)
Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Kevin Schewior, Jens Vygen
An Approximation Algorithm for Fully Planar Edge-Disjoint Paths. CoRR (2020)
Vincent Cohen-Addad, Frederik Mallmann-Trenn, Claire Mathieu
Instance-Optimality in the Noisy Value-and Comparison-Model. SODA (2020)
Claire Mathieu, Michel de Rougemont
Large Very Dense Subgraphs in a Stream of Edges. CoRR (2020)
Benoît Groz, Frederik Mallmann-Trenn, Claire Mathieu, Victor Verdugo
Skyline Computation with Noisy Comparisons. IWOCA (2020)
Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Jens Vygen
Approximating maximum integral multiflows on bounded genus graphs. CoRR (2020)
Claire Mathieu, Michel de Rougemont
Large Very Dense Subgraphs in a Stream of Edges. FODS (2020)
Claire Mathieu, Simon Mauras
How to aggregate Top-lists: Approximation algorithms via scores and average ranks. SODA (2020)
Claire Mathieu, Rajmohan Rajaraman, Neal E. Young, Arman Yousefi
Competitive Data-Structure Dynamization. CoRR (2020)
Monika Henzinger, Dariusz Leniowski, Claire Mathieu
Dynamic Clustering to Minimize the Sum of Radii. Algorithmica 82 (11) (2020)
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)
Hugo Gimbert, Claire Mathieu, Simon Mauras
On popularity-based random matching markets. CoRR (2019)
Vincent Cohen-Addad, Varun Kanade, Frederik Mallmann-Trenn, Claire Mathieu
Hierarchical Clustering: Objective Functions and Algorithms. J. ACM 66 (4) (2019)
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) (2019)
Claire Mathieu, Simon Mauras
How to aggregate Top-lists: Score based approximation schemes. CoRR (2018)
Sampath Kannan, Claire Mathieu, Hang Zhou
Graph Reconstruction and Verification. ACM Trans. Algorithms 14 (4) (2018)
Vincent Cohen-Addad, Varun Kanade, Frederik Mallmann-Trenn, Claire Mathieu
Hierarchical Clustering: Objective Functions and Algorithms. SODA (2018)
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 (2018)
Dimitris Fotakis, Laurent Gourvès, Claire Mathieu, Abhinav Srivastav
Covering Clients with Types and Budgets. ISAAC (2018)
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) (2018)
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) (2017)
Frederik Mallmann-Trenn, Claire Mathieu, Victor Verdugo
Skyline Computation with Noisy Comparisons. CoRR (2017)
Monika Henzinger, Dariusz Leniowski, Claire Mathieu
Dynamic clustering to minimize the sum of radii. CoRR (2017)
Fabrice Benhamouda, Tancrède Lepoint, Claire Mathieu, Hang Zhou
Optimization of Bootstrapping in Circuits. SODA (2017)
Monika Henzinger, Dariusz Leniowski, Claire Mathieu
Dynamic Clustering to Minimize the Sum of Radii. ESA (2017)
Daniel Antunes, Claire Mathieu, Nabil H. Mustafa
Combinatorics of Local Search: An Optimal 4-Local Hall's Theorem for Planar Graphs. ESA (2017)
Vincent Cohen-Addad, Varun Kanade, Frederik Mallmann-Trenn, Claire Mathieu
Hierarchical Clustering: Objective Functions and Algorithms. CoRR (2017)
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)
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)
Fabrice Benhamouda, Tancrède Lepoint, Claire Mathieu, Hang Zhou
Optimization of Bootstrapping in Circuits. CoRR (2016)
Amos Fiat, Anna R. Karlin, Elias Koutsoupias, Claire Mathieu, Rotem Zach
Carpooling in Social Networks. ICALP (2016)
Vincent Cohen-Addad, Philip N. Klein, Claire Mathieu
The power of local search for clustering. CoRR (2016)
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)
Jeff Erickson, Philip N. Klein, Dániel Marx, Claire Mathieu
Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 16221). Dagstuhl Reports 6 (5) (2016)
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)
Fabrice Benhamouda, Tancrède Lepoint, Claire Mathieu, Hang Zhou
Optimization of Bootstrapping in Circuits. IACR Cryptol. ePrint Arch. 2016 (2016)
Sampath Kannan, Claire Mathieu, Hang Zhou
Near-Linear Query Complexity for Graph Inference. ICALP (1) (2015)
Claire Mathieu
The Presburger Award 2016 - Call for Nominations. Bull. EATCS 117 (2015)
Vincent Cohen-Addad, Claire Mathieu
Effectiveness of Local Search for Geometric Optimization. SoCG (2015)
Glencora Borradaile, Philip N. Klein, Claire Mathieu
A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest. ACM Trans. Algorithms 11 (3) (2015)
Aparna Das, Claire Mathieu
A Quasipolynomial Time Approximation Scheme for Euclidean Capacitated Vehicle Routing. Algorithmica 73 (1) (2015)
Chen Avin, Barbara Keller, Zvi Lotker, Claire Mathieu, David Peleg, Yvonne-Anne Pignolet
Homophily and the Glass Ceiling Effect in Social Networks. ITCS (2015)
Philip N. Klein, Claire Mathieu, Hang Zhou
Correlation Clustering and Two-edge-connected Augmentation for Planar Graphs. STACS (2015)
Vincent Cohen-Addad, Zhentao Li, Claire Mathieu, Ioannis Milis
Energy-Efficient Algorithms for Non-preemptive Speed-Scaling. WAOA (2014)
David Eisenstat, Philip N. Klein, Claire Mathieu
-center in planar graphs. SODA (2014)
Monik Khare, Claire Mathieu, Neal E. Young
First Come First Served for Online Slot Allocation and Huffman Coding. SODA (2014)
Glencora Borradaile, Claire Mathieu, Theresa Migler
Lower bounds for testing digraph connectivity with one-pass streaming algorithms. CoRR (2014)
David Eisenstat, Claire Mathieu, Nicolas Schabanel
Facility Location in Evolving Metrics. ICALP (2) (2014)
Claire Mathieu, Carl Staelin, Neal E. Young
K-Slot SSTable Stack Compaction. CoRR (2014)
Sampath Kannan, Claire Mathieu, Hang Zhou
Graph Verification and Reconstruction via Distance Oracles. CoRR (2014)
Vincent Cohen-Addad, Claire Mathieu
The Unreasonable Success of Local Search: Geometric Optimization. CoRR (2014)
Frédéric Magniez, Claire Mathieu, Ashwin Nayak
Recognizing Well-Parenthesized Expressions in the Streaming Model. SIAM J. Comput. 43 (6) (2014)
Vincent Cohen-Addad, Zhentao Li, Claire Mathieu, Ioannis Milis
Energy-efficient algorithms for non-preemptive speed-scaling. CoRR (2014)
David Eisenstat, Claire Mathieu, Nicolas Schabanel
Facility Location in Evolving Metrics. CoRR (2014)
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) (2014)
Claire Mathieu, David B. Wilson
The Min Mean-Weight Cycle in a Random Network. Comb. Probab. Comput. 22 (5) (2013)
Claire Mathieu, Hang Zhou
Graph Reconstruction via Distance Oracles. ICALP (1) (2013)
Claire Mathieu, Hang Zhou
Graph Reconstruction via Distance Oracles CoRR (2013)
Monik Khare, Claire Mathieu, Neal E. Young
First-Come-First-Served for Online Slot Allocation and Huffman Coding. CoRR (2013)
Glencora Borradaile, Philip N. Klein, Claire Mathieu
A polynomial-time approximation scheme for Euclidean Steiner forest CoRR (2013)
Tess Avitabile, Claire Mathieu, Laura H. Parkinson
Online constrained optimization with recourse. Inf. Process. Lett. 113 (3) (2013)
Glencora Borradaile, Philip N. Klein, Dániel Marx, Claire Mathieu
Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 13421). Dagstuhl Reports 3 (10) (2013)
Robert Cori, Claire Mathieu, John Michael Robson
On the Number of Indecomposable Permutations with a Given Number of Cycles. Electron. J. Comb. 19 (1) (2012)
MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Philip N. Klein, Claire Mathieu
A polynomial-time approximation scheme for planar multiway cut. SODA (2012)
David Eisenstat, Philip N. Klein, Claire Mathieu
An efficient polynomial-time approximation scheme for Steiner forest in planar graphs. SODA (2012)
Claire Mathieu, Olga Ohrimenko
Lower bounds for randomized algorithms for online chain partitioning. Inf. Process. Lett. 112 (17-18) (2012)
Mordecai J. Golin, Claire Mathieu, Neal E. Young
Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme. SIAM J. Comput. 41 (3) (2012)
Christian Konrad, Frédéric Magniez, Claire Mathieu
Maximum Matching in Semi-streaming with Few Passes. APPROX-RANDOM (2012)
Claire Mathieu, David B. Wilson
The min mean-weight cycle in a random network CoRR (2012)
Christian Konrad, Frédéric Magniez, Claire Mathieu
Maximum Matching in Semi-Streaming with Few Passes CoRR (2011)
David Eisenstat, Philip N. Klein, Claire Mathieu
An efficient polynomial-time approximation scheme for Steiner forest in planar graphs CoRR (2011)

Claire Mathieu.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Claire Mathieu