Finding
heaviest H-subgraphs in real weighted graphs, with
applications.
Virginia Vassilevska,
Ryan Williams, Raphael Yuster
ACM Transactions on Algorithms
6(3): (2010)
Subcubic Equivalences between Path, Matrix and Triangle
Problems.
Virginia Vassilevska
Williams, Ryan Williams
FOCS 2010: 645-654
Finding, minimizing, and counting
weighted subgraphs.
Virginia Vassilevska,
Ryan Williams
STOC 2009: 455-464
All Pairs Bottleneck
Paths and Max-Min Matrix Products in Truly Subcubic
Time.
Virginia Vassilevska,
Ryan Williams, Raphael Yuster
Theory of Computing 5(1): 173-189
(2009)
Finding a
maximum weight triangle in n3-Delta time, with applications.
Virginia Vassilevska,
Ryan Williams
STOC 2006: 225-231
Finding a Heaviest
Vertex-Weighted Triangle Is not Harder than Matrix Multiplication.
Artur Czumaj, Andrzej Lingas
SIAM J. Comput. 39(2): 431-444 (2009)
All-Pairs Bottleneck Paths in
Vertex Weighted Graphs.
Asaf Shapira, Raphael
Yuster, Uri Zwick
Algorithmica 59(4): 621-633 (2011)