BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × United Kingdom
3 × USA
Collaborated with:
A.Bhaskara M.Charikar K.Makarychev Y.Makarychev A.Moitra R.Manokaran E.Chlamtac U.Feige
Talks about:
approxim (3) decomposit (1) algorithm (1) subgraph (1) constant (1) quadrat (1) program (1) problem (1) densiti (1) densest (1)

Person: Aravindan Vijayaraghavan

DBLP DBLP: Vijayaraghavan:Aravindan

Contributed to:

STOC 20142014
ICALP (1) 20122012
STOC 20122012
STOC 20102010

Wrote 5 papers:

STOC-2014-BhaskaraCMV #analysis
Smoothed analysis of tensor decompositions (AB, MC, AM, AV), pp. 594–603.
STOC-2014-MakarychevMV #approximate #constant
Constant factor approximation for balanced cut in the PIE model (KM, YM, AV), pp. 41–49.
ICALP-v1-2012-BhaskaraCMV #on the #polynomial #programming
On Quadratic Programming with a Ratio Objective (AB, MC, RM, AV), pp. 109–120.
STOC-2012-MakarychevMV #algorithm #approximate #clustering #problem
Approximation algorithms for semi-random partitioning problems (KM, YM, AV), pp. 367–384.
STOC-2010-BhaskaraCCFV #approximate #detection
Detecting high log-densities: an O(n1/4) approximation for densest k-subgraph (AB, MC, EC, UF, AV), pp. 201–210.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.