
Selected Talks by Virginia Vassilevska
2008:
 Nondecreasing Paths in a Weighted Graph
or: How to Optimally Read a Train Schedule,
SODA 2008, San Francisco, CA.

[ppt]

2007:
 Thesis Proposal: Efficient Algorithms for Path Problems in Weighted Graphs, CMU.

[pdf]

 All Pairs Bottleneck Paths in General Graphs in Truly Subcubic Time, STOC 2007, San Diego, CA.

[pdf]

 A Matrix Product Approach to Weighted Graph Problems, Caltech CS Lunch Seminar, Pasadena, CA.

[pdf]

 Nondecreasing Paths in a Weighted Graph
or: How to Optimally Read a Train Schedule,
CMU CS Theory Lunch, Speaking Skills Talk.

[ppt]

2006:
 Finding a Maximum Weight Triangle in SubCubic Time, With Applications, STOC 2006,
Seattle, WA.

[pdf]

 Confronting Hardness Using A Hybrid Approach, SODA 2006, Miami, FL.

[pdf]

 A Dominance Approach to Weighted Graph Problems, CMU CS Theory Lunch.

[pdf]

2005:
 Explicit Inapproximability Bounds for the Shortest Superstring Problem, MFCS 2005,
Gdansk, Poland.

[pdf]

 Hybrid Algorithms for Graph Problems: Defying Hardness Using Graph Minors and Separators,
CMU CS Theory Lunch.

[pdf]

 Towards a Theory of Greedy Algorithms: A Survey, CMU CS Theory Lunch.

[pdf]

