Concepedia

Aravindan Vijayaraghavan

AV

22

Publications

1.1K

Citations

16

H-Index

2006

Active since

Affiliations

Princeton University(Current)

Carnegie Mellon University

Google (United States)

Microsoft (United States)

Microsoft Research (United Kingdom)

Aravindan Vijayaraghavan is an author at Princeton University specializing in engineering, computer science, and combinatorial optimization.

Top concepts

EngineeringComputer ScienceApproximation TheoryCombinatorial OptimizationGraph TheoryDiscrete MathematicsComputational ComplexityData ScienceMathematical ProgrammingData Mining

Publications per year

2006–2019

22

Publications

22

Detecting high log-densities

Aditya Bhaskara, Moses Charikar, Eden Chlamtáč et al. · 2010 · 301 citations

Engineering, Computational Complexity, Parameter K +20

Smoothed analysis of tensor decompositions

Aditya Bhaskara, Moses Charikar, Ankur Moitra et al. · 2014 · 116 citations

Sparse Representation, Engineering, Machine Learning +12

Detecting High Log-Densities -- an O(n^1/4) Approximation for Densest k-Subgraph

Aditya Bhaskara, Moses Charikar, Eden Chlamtáč et al. · arXiv (Cornell University) · 2010 · 115 citations · Full text

Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph

Aditya Bhaskara, Moses Charikar, Aravindan Vijayaraghavan et al. · Symposium on Discrete Algorithms · 2012 · 76 citations

Mathematical Programming, Graph Sparsity, Engineering +16

Polynomial integrality gaps for strong SDP relaxations of Densest <i>k</i>-subgraph

Aditya Bhaskara, Moses Charikar, Venkatesan Guruswami et al. · 2012 · 52 citations

Rows per page

1–5 of 22