Claire Mathieu - Citegraph

Author Info

Name	Affiliation	Papers
CLAIRE MATHIEU	Brown Univ, Dept Comp Sci, 115 Waterman St, Providence, RI 02912 USA	30
Collaborators	Citations	PageRank
46	452	25.78
Referers	Referees	References
739	547	432

Search Limit

100739

Publications (30 rows)

Collaborators (46 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Skyline Computation with Noisy Comparisons	0	0.34	2020
Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines.	0	0.34	2018
Instance-optimality in the noisy value-and comparison-model: accept, accept, strong accept: which papers get in?	0	0.34	2018
Skyline Computation with Noisy Comparisons.	0	0.34	2017
Combinatorics of Local Search: An Optimal 4-Local Hall's Theorem for Planar Graphs.	0	0.34	2017
Local Search Yields Approximation Schemes for k-Means and k-Median in Euclidean and Minor-Free Metrics	4	0.39	2016
Carpooling in Social Networks.	0	0.34	2016
Effectiveness of Local Search for Geometric Optimization.	8	0.51	2015
Convergence of Position Auctions under Myopic Best-Response Dynamics	4	0.44	2014
Lower bounds for testing digraph connectivity with one-pass streaming algorithms.	1	0.35	2014
Energy-Efficient Algorithms for Non-preemptive Speed-Scaling.	12	0.60	2014
Approximating k-center in planar graphs	5	0.43	2014
Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 13421).	3	0.38	2013
An efficient polynomial-time approximation scheme for Steiner forest in planar graphs	7	0.46	2012
A polynomial-time approximation scheme for planar multiway cut	9	0.51	2012
Integrality gaps of linear and semi-definite programming relaxations for Knapsack	25	1.03	2011
Maximum Matching in Semi-Streaming with Few Passes	26	0.86	2011
The train delivery problem: vehicle routing meets bin packing	4	0.43	2010
Correlation clustering with noisy input	30	1.09	2010
Online Correlation Clustering	3	0.41	2010
An O(n log n) approximation scheme for Steiner tree in planar graphs	40	1.21	2009
Sherali-adams relaxations of the matching polytope	25	0.85	2009
Recognizing Well-Parenthesized Expressions in the Streaming Model.	21	0.76	2009
Online multicast with egalitarian cost sharing	32	1.22	2008
A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest	11	0.59	2008
Improved Approximation Algorithms for Budgeted Allocations	20	1.47	2008
On-line bipartite matching made simple	58	3.04	2008
Yet another algorithm for dense max cut: go greedy	12	0.63	2008
Greedy bidding strategies for keyword auctions	74	5.40	2007
Steiner tree in planar graphs: an O(n log n) approximation scheme with singly-exponential dependence on epsilon	18	0.68	2007