Claire Mathieu
#27,155
Most Influential Person Now
French computer scientist and mathematician
Claire Mathieu's AcademicInfluence.com Rankings
Claire Mathieumathematics Degrees
Mathematics
#4093
World Rank
#5888
Historical Rank
Combinatorics
#97
World Rank
#105
Historical Rank
Graph Theory
#111
World Rank
#119
Historical Rank
Measure Theory
#3045
World Rank
#3614
Historical Rank
Download Badge
Computer Science Mathematics
Why Is Claire Mathieu Influential?
(Suggest an Edit or Addition)According to Wikipedia, Claire Mathieu is a French computer scientist and mathematician, known for her research on approximation algorithms, online algorithms, and auction theory. She works as a director of research at the Centre national de la recherche scientifique.
Claire Mathieu's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- On profit-maximizing envy-free pricing (2005) (333)
- How to rank with few errors (2007) (264)
- A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem (2000) (211)
- Approximation schemes for minimizing average weighted completion time with release dates (1999) (201)
- Greedy bidding strategies for keyword auctions (2007) (169)
- Glauber dynamics on trees and hyperbolic graphs (2001) (169)
- Approximation schemes for clustering problems (2003) (167)
- On-line bipartite matching made simple (2008) (161)
- Hierarchical Clustering: Objective Functions and Algorithms (2017) (139)
- Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes (2006) (129)
- Local Search Yields Approximation Schemes for k-Means and k-Median in Euclidean and Minor-Free Metrics (2016) (121)
- Dynamic TCP acknowledgement and other stories about e/(e-1) (2001) (120)
- An O(n log n) approximation scheme for Steiner tree in planar graphs (2009) (95)
- Correlation clustering with noisy input (2010) (93)
- Approximate strip packing (1996) (89)
- Maximum Matching in Semi-streaming with Few Passes (2011) (89)
- The Data Broadcast Problem with Non-Uniform Transmission Times (1999) (88)
- A Randomized Approximation Scheme for Metric MAX-CUT (1998) (77)
- Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack (2010) (74)
- Dynamic TCP Acknowledgment and Other Stories about e/(e - 1) (2003) (73)
- Adaptive intersection and t-threshold problems (2002) (73)
- Polynomial-time approximation scheme for data broadcast (2000) (73)
- A polynomial-time approximation scheme for Steiner tree in planar graphs (2007) (71)
- Tiling a polygon with rectangles (1992) (70)
- Scheduling Independent Multiprocessor Tasks (2002) (68)
- OPT versus LOAD in dynamic storage allocation (2003) (68)
- Homophily and the Glass Ceiling Effect in Social Networks (2015) (62)
- Hierarchical Clustering (2019) (61)
- A Quasipolynomial Time Approximation Scheme for Euclidean Capacitated Vehicle Routing (2008) (59)
- Better approximation algorithms for bin covering (2001) (58)
- Low distortion maps between point sets (2004) (57)
- On the Sum-of-Squares algorithm for bin packing (2002) (57)
- Sensitivity, block sensitivity, and l-block sensitivity of boolean functions (2004) (55)
- Recognizing well-parenthesized expressions in the streaming model (2009) (54)
- Online multicast with egalitarian cost sharing (2008) (53)
- Error-resilient DNA computation (1996) (50)
- The reverse greedy algorithm for the metric k-median problem (2005) (49)
- Sherali-adams relaxations of the matching polytope (2009) (49)
- Scheduling Independent Multiprocessor Tasks (1997) (48)
- Commitment under uncertainty: Two-stage stochastic matching problems (2007) (46)
- SIGACT news online algorithms column 10: competitiveness via doubling (2006) (44)
- Scalable and architecture independent parallel geometric algorithms with high probability optimal time (1994) (44)
- Facility Location in Evolving Metrics (2014) (42)
- Huffman coding with unequal letter costs (2002) (40)
- A Self Organizing Bin Packing Heuristic (1999) (39)
- How to rank with few errors: A PTAS for Weighted Feedback Arc Set on Tournaments (2006) (37)
- Approximation schemes for multidimensional packing (2004) (36)
- Maximizing profit using recommender systems (2009) (36)
- Incremental Medians via Online Bidding (2005) (35)
- Optimal randomized algorithms for local sorting and set-maxima (1990) (35)
- A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest (2008) (35)
- Improved Approximation Algorithms for Budgeted Allocations (2008) (35)
- Yet another algorithm for dense max cut: go greedy (2008) (34)
- Steiner Tree in Planar Graphs: An O ( n log n ) Approximation Scheme with Singly-Exponential Dependence on Epsilon (2007) (33)
- Biased random walks, Lyapunov functions, and stochastic analysis of best fit bin packing (1996) (32)
- Effectiveness of Local Search for Geometric Optimization (2015) (31)
- An efficient polynomial-time approximation scheme for Steiner forest in planar graphs (2011) (30)
- Online Correlation Clustering (2010) (27)
- Alternation and redundancy analysis of the intersection problem (2008) (26)
- Multilayer Neural Networks: One or Two Hidden Layers? (1996) (25)
- Correlation Clustering and Two-edge-connected Augmentation for Planar Graphs (2023) (25)
- Energy-Efficient Algorithms for Non-preemptive Speed-Scaling (2014) (25)
- Selection in the presence of noise: the design of playoff systems (1994) (24)
- Polynomial Time Approximation Schemes for Metric Min-Sum Clustering (2002) (24)
- Scheduling to Minimize the Average Completion Time of Dedicated Tasks (2000) (24)
- A polynomial-time approximation scheme for planar multiway cut (2012) (24)
- On the sum-of-squares algorithm for bin packing (2000) (23)
- Perfect matchings in the triangular lattice (1996) (23)
- Approximating k-center in planar graphs (2014) (23)
- Optimization of Bootstrapping in Circuits (2016) (20)
- A Quasipolynomial Time Approximation Scheme for Euclidean Capacitated Vehicle Routing (2008) (20)
- On Evaluating Boolean Functions with Unreliable Tests (1990) (19)
- Graph Reconstruction and Verification (2018) (19)
- Linear waste of best fit bin packing on skewed distributions (2000) (18)
- Approximation schemes for Metric Bisection and partitioning (2004) (18)
- Oblivious Medians Via Online Bidding (2006) (17)
- Approximating connectivity domination in weighted bounded-genus graphs (2016) (16)
- On the Effects of Competing Advertisements in Keyword Auctions (2008) (16)
- Graph Reconstruction via Distance Oracles (2013) (16)
- On Boolean Decision Trees with Faulty Nodes (1992) (15)
- On the discrete Bak-Sneppen model of self-organized criticality (2001) (14)
- Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme (2002) (13)
- The Train Delivery Problem - Vehicle Routing Meets Bin Packing (2010) (13)
- Average Efficiency of Data Structures for Binary Image Processing (1987) (13)
- Matchings in lattice graphs (1993) (12)
- Convergence of Position Auctions under Myopic Best-Response Dynamics (2014) (12)
- Near-Linear Query Complexity for Graph Inference (2014) (12)
- A PTAS for Capacitated Vehicle Routing on Trees (2021) (11)
- Deterministic Algorithm for the t-Threshold Set Problem (2003) (11)
- Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091) (2011) (11)
- Verifying partial orders (1989) (9)
- The power of local search for clustering (2016) (9)
- Dynamic Clustering to Minimize the Sum of Radii (2017) (9)
- The Maximum Size of Dynamic Data Structures (1991) (8)
- Mixed preferential attachment model: Homophily and minorities in social networks (2020) (8)
- Combinatorics of Local Search: An Optimal 4-Local Hall's Theorem for Planar Graphs (2017) (8)
- Maximum queue size and hashing with lazy deletion (1991) (8)
- Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 13421) (2013) (8)
- Planar Cayley Graphs with Regular Dual (1996) (8)
- How to take short cuts (1991) (8)
- Maximizing Covered Area in the Euclidean Plane with Connectivity Constraint (2019) (8)
- General Methods for the Analysis of the Maximum Size of Dynamic Data Structures (Extended Abstract) (1989) (7)
- An Approximation Algorithm for Fully Planar Edge-Disjoint Paths (2020) (7)
- How to Rank with Fewer Errors (2009) (7)
- d-Dimensional Range Search on Multicomputers (1997) (7)
- Data Structures Maxima (1991) (7)
- On the Number of Indecomposable Permutations with a Given Number of Cycles (2012) (7)
- Semidefinite and linear programming integrality gaps for scheduling identical machines (2016) (7)
- Mitigating COVID-19 outbreaks in workplaces and schools by hybrid telecommuting (2021) (7)
- Data Structures' Maxima (1997) (6)
- A Simple Algorithm for Graph Reconstruction (2021) (6)
- Bigtable Merge Compaction (2014) (6)
- On the Worst-case Performance of the Sum-of-Squares Algorithm for Bin Packing (2005) (5)
- Instance-Optimality in the Noisy Value-and Comparison-Model - Accept, Accept, Strong Accept: Which Papers get in? (2018) (5)
- On Hierarchical Diameter-Clustering and the Supplier Problem (2009) (5)
- A Tight 3/2+ε-Approximation for Unsplittable Capacitated Vehicle Routing on Trees (2022) (5)
- Finding a Target Subnetwork in Sparse Networks with Random Faults (1993) (5)
- A Polynomial Time Approximation Scheme for Metric MIN-BISECTION (2002) (5)
- Skyline Computation with Noisy Comparisons (2017) (5)
- Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 16221) (2016) (5)
- Online constrained optimization with recourse (2013) (5)
- Approximating maximum integral multiflows on bounded genus graphs (2020) (4)
- The Unreasonable Success of Local Search: Geometric Optimization (2014) (4)
- The Min Mean-Weight Cycle in a Random Network (2012) (4)
- Distance in the Forest Fire Model How far are you from Eve? (2016) (4)
- Multilayer neural networks and polyhedral dichotomies (1998) (3)
- Two-sided matching markets with correlated random preferences have few stable pairs (2019) (3)
- Large Very Dense Subgraphs in a Stream of Edges (2020) (3)
- On Hierarchical Diameter-Clustering, and the Supplier Problem (2006) (3)
- Unsplittable Euclidean Capacitated Vehicle Routing: A (2+ε)-Approximation Algorithm (2023) (3)
- Probabilistic Analysis of Euclidean Capacitated Vehicle Routing (2021) (2)
- Linear programming relaxations of maxcut (2007) (2)
- Semidefinite and linear programming integrality gaps for scheduling identical machines (2017) (2)
- An Approximation Algorithm for Distance-Constrained Vehicle Routing on Trees (2022) (2)
- Plan B: Uncertainty/Time Trade-Offs for Linear and Integer Programming (2006) (2)
- K-Slot SSTable Stack Compaction (2014) (2)
- Iterated tour partitioning for Euclidean capacitated vehicle routing (2022) (1)
- D S ] 8 M ar 2 02 1 Two-sided matching markets with correlated random preferences (2021) (1)
- Competitive Data-Structure Dynamization (2020) (1)
- Distortion lower bounds for line embeddings (2008) (1)
- Foreword to special issue SODA 2009 (2010) (1)
- On popularity-based random matching markets (2019) (1)
- Some problems in computational geometry (1987) (1)
- How to aggregate Top-lists: Approximation algorithms via scores and average ranks (2018) (1)
- A Tight $(1.5+\epsilon)$-Approximation for Unsplittable Capacitated Vehicle Routing on Trees (2022) (0)
- Apportionment with Parity Constraints (2021) (0)
- Probabilistic Methods in the Design and Analysis of Algorithms (Dagstuhl Seminar 17141) (2017) (0)
- Constrained School Choice with Incomplete Information (2021) (0)
- Lower bounds for randomized algorithms for online chain partitioning (2012) (0)
- Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009 (2009) (0)
- A Gambling Game Arising in the Analysis of Adaptive Randomized Rounding (2003) (0)
- The Presburger Award 2016 - Call for Nominations (2015) (0)
- Design and analysis of LSM merge-compaction policies (2016) (0)
- Scheduling on a Constant Number of Machines (1999) (0)
- LIPIcs, Volume 60, APPROX/RANDOM'16, Complete Volume (2016) (0)
- Online Bigtable merge compaction (2016) (0)
- Graph Verification and Reconstruction via Distance Oracles (2014) (0)
- K-Slot Merge Compaction (2014) (0)
- Frontmatter, Table of Contents, Preface, Program Commitees, External Reviewers, List of Authors (2015) (0)
- Online Ranking for Tournament Graphs (2010) (0)
- Covering Clients with Types and Budgets (2018) (0)
- Competitive analysis of dynamization policies for storage systems (2020) (0)
- 22 17141 – Probabilistic Methods in the Design and Analysis of Algorithms Participants (2017) (0)
- Unsplittable Euclidean Capacitated Vehicle Routing: A $(2+\epsilon)$-Approximation Algorithm (2022) (0)
- How to aggregate Top-lists: Score based approximation schemes (2018) (0)
- Carpooling in Social Networks (2016) (0)
- Approximation Schemes for Metric Clustering Problems (2004) (0)
- Two-Sided Matching Markets with Strongly Correlated Preferences (2019) (0)
- Best-Fit Bin-Packing with Random Order (1996) (0)
- First Come First Served for Online Slot Allocation and Huffman Coding (2013) (0)
- Algorithm 1 Algorithm Greedy (2010) (0)
This paper list is powered by the following services:
Other Resources About Claire Mathieu
What Schools Are Affiliated With Claire Mathieu?
Claire Mathieu is affiliated with the following schools:
