B. Ames. Robust convex relaxation for the planted clique and densest k-subgraph problems.
Submitted for publication 2013.
B. Ames. Guaranteed clustering and biclustering via semidefinite programming.
Submitted for publication 2012.
B. Ames and S. Vavasis. Convex optimization for the planted k-disjoint-clique problem.
To appear in Mathematical Programming.
B. Ames and H. Sendov. A New derivation of a formula by Kato.
Linear Algebra and Its Applications. 436 (2012), pp. 722-730, 2012
B. Ames and S. Vavasis. Nuclear norm minimization for the planted clique and biclique problems.
Mathematical Programming. 129(1): 69-89, 2011.
B. Ames and H. Sendov. Asymptotic expansions of the ordered spectrum of symmetric operators.
Nonlinear Analysis, Series A: Theory, Methods and Applications. 72(11): 4288-4297, 2010.
Convex relaxation for the planted clique, biclique, and clustering problems.
Completed under the supervision of Dr. Stephen Vavasis, Department of Combinatorics and
Optimization, University of Waterloo, 2011.
M.Sc. Taylor expansions of the spectrum of a symmetric matrix.
Completed under the supervision of Dr. Hristo Sendov,
Department of Mathematics and Statistics, University of Guelph, 2007.