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) - 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]