Travelled to:
1 × Denmark
1 × Iceland
1 × Japan
1 × Latvia
2 × USA
Collaborated with:
H.Zhou A.Sinclair S.Kannan D.Eisenstat N.Schabanel F.Magniez A.Nayak Y.Azar B.E.Birnbaum A.R.Karlin C.T.Nguyen
Talks about:
graph (2) reconstruct (1) parenthes (1) algorithm (1) approxim (1) sherali (1) polytop (1) express (1) distanc (1) complex (1)
Person: Claire Mathieu
DBLP: Mathieu:Claire
Contributed to:
Wrote 6 papers:
- ICALP-v1-2015-KannanM0 #complexity #graph #query
- Near-Linear Query Complexity for Graph Inference (SK, CM, HZ), pp. 773–784.
- ICALP-v2-2014-EisenstatMS #evolution #metric
- Facility Location in Evolving Metrics (DE, CM, NS), pp. 459–470.
- ICALP-v1-2013-MathieuZ #distance #graph #re-engineering
- Graph Reconstruction via Distance Oracles (CM, HZ), pp. 733–744.
- STOC-2010-MagniezMN #streaming
- Recognizing well-parenthesized expressions in the streaming model (FM, CM, AN), pp. 261–270.
- STOC-2009-MathieuS
- Sherali-adams relaxations of the matching polytope (CM, AS), pp. 293–302.
- ICALP-A-2008-AzarBKMN #algorithm #approximate
- Improved Approximation Algorithms for Budgeted Allocations (YA, BEB, ARK, CM, CTN), pp. 186–197.