Convex relaxation for finding planted influential nodes in a social network

Computers and Intractability: A Guide to the Theory of NP–completeness

M. R. Garey and D. S. Johnson · 1979

Earlier work this paper cites.

Talk of the network: a complex systems look at the underlying process of word-of-mouth

J. Goldenberg, B. Libai, and E. Muller · 2001

Earlier work this paper cites.

Maximizing the spread of influence through a social network

D. Kempe, J. Kleinberg, and E. Tardos · 2003

Earlier work this paper cites.

Decoding by linear programming

E. Candes and T. Tao · 2005

Earlier work this paper cites.

Graphs over time: densification laws, shrinking diameters and possible explanations

J. Leskovec, J. Kleinberg, and C. Faloutsos · 2005

Earlier work this paper cites.

For most large underdetermined systems of linear equations the minimal ℓ 1 \ell_{1} -norm solution is also the sparsest solution

D. Donoho · 2006

Cited alongside, same era.

The spread of obesity over a large social network over 32 years

N. Christakis and J. Fowler · 2007

Cited alongside, same era.

Graph implementations for nonsmooth convex programs

M. Grant and S. Boyd · 2008

Cited alongside, same era.

Convex optimization for the planted k-disjoint-clique problem

Brendan P.W. Ames and Stephen A. Vavasis · 2010

Cited alongside, same era.

Finding approximately rank-one submatrices with the nuclear norm and ℓ 1 \ell_{1} norm

Original

X. V. Doan and S. Vavasis · 2010

Later among the works it cites.

Sedumi user’s guide

Original

I. Pólik · 2010

Later among the works it cites.

Everyone’s an influencer: quantifying influence on Twitter

E. Bakshy, J. Hofman, W. Mason, and D. Watts · 2011

Later among the works it cites.

Guaranteed clustering and biclustering via semidefinite programming

Original

B. Ames · 2012

Later among the works it cites.