Travelled to:1 × United Kingdom
6 × USA
Collaborated with:D.L.Malec A.Blum J.D.Hartline B.Sivan N.Immorlica B.Lucier K.Makarychev T.Schramm G.Yaroslavtsev S.Barman S.Umboh N.Bansal A.Meyerson
Talks about:mechan (3) algorithm (2) complet (2) design (2) graph (2) secretari (1) sequenti (1) independ (1) approxim (1) unlabel (1)
Person: Shuchi Chawla
DBLP: Chawla:Shuchi
Contributed to:
20152013
2012201220102004
2001Wrote 7 papers:
- STOC-2015-ChawlaMSY #algorithm #clustering #graph
- Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs (SC, KM, TS, GY), pp. 219–228.
- STOC-2013-ChawlaHMS #independence #scheduling
- Prior-independent mechanisms for scheduling (SC, JDH, DLM, BS), pp. 51–60.
- ICALP-v1-2012-BarmanUCM #problem
- Secretary Problems with Convex Costs (SB, SU, SC, DLM), pp. 75–87.
- STOC-2012-ChawlaIL #black box #design #on the #reduction
- On the limits of black-box reductions in mechanism design (SC, NI, BL), pp. 435–448.
- STOC-2010-ChawlaHMS #design #multi
- Multi-parameter mechanism design and sequential posted pricing (SC, JDH, DLM, BS), pp. 311–320.
- STOC-2004-BansalBCM #algorithm #approximate
- Approximation algorithms for deadline-TSP and vehicle routing with time-windows (NB, AB, SC, AM), pp. 166–174.
- ICML-2001-BlumC #graph #learning #using
- Learning from Labeled and Unlabeled Data using Graph Mincuts (AB, SC), pp. 19–26.