Travelled to:1 × Canada
3 × USA
Collaborated with:S.Khot L.Orecchia M.Singh P.Popat S.Sachdeva L.J.Schulman U.V.Vazirani N.R.Devanur R.Saket S.Arora A.Kolla D.Steurer M.Tulsiani
Talks about:problem (2) graph (2) preprocess (1) constraint (1) exponenti (1) algorithm (1) spectral (1) sparsest (1) approxim (1) abstract (1)
Person: Nisheeth K. Vishnoi
DBLP: Vishnoi:Nisheeth_K=
Contributed to:
2014201220082006Wrote 6 papers:
- STOC-2014-SinghV #optimisation
- Entropy, optimization and counting (MS, NKV), pp. 50–59.
- STOC-2012-KhotPV #preprocessor #problem
- 2log1-ε n hardness for the closest vector problem with preprocessing (SK, PP, NKV), pp. 277–288.
- STOC-2012-OrecchiaSV #algorithm #approximate #exponential
- Approximating the exponential, the lanczos method and an Õ(m)-time spectral algorithm for balanced separator (LO, SS, NKV), pp. 1141–1160.
- STOC-2008-AroraKKSTV #constraints #game studies #graph
- Unique games on expanding constraint graphs are easy: extended abstract (SA, SK, AK, DS, MT, NKV), pp. 21–28.
- STOC-2008-OrecchiaSVV #clustering #graph #on the
- On partitioning graphs via single commodity flows (LO, LJS, UVV, NKV), pp. 461–470.
- STOC-2006-DevanurKSV #linear #problem
- Integrality gaps for sparsest cut and minimum linear arrangement problems (NRD, SK, RS, NKV), pp. 537–546.