| 2009 |
|---|
| 10 | EE | Virginia Vassilevska:
Efficient algorithms for clique problems.
Inf. Process. Lett. 109(4): 254-257 (2009) |
| 2008 |
|---|
| 9 | EE | Guy E. Blelloch,
Virginia Vassilevska,
Ryan Williams:
A New Combinatorial Approach for Sparse Graph Problems.
ICALP (1) 2008: 108-120 |
| 8 | EE | Virginia Vassilevska:
Nondecreasing paths in a weighted graph or: how to optimally read a train schedule.
SODA 2008: 465-472 |
| 7 | EE | Guy E. Blelloch,
Daniel Golovin,
Virginia Vassilevska:
Uniquely Represented Data Structures for Computational Geometry.
SWAT 2008: 17-28 |
| 2007 |
|---|
| 6 | EE | Virginia Vassilevska,
Ryan Williams,
Raphael Yuster:
All-pairs bottleneck paths for general graphs in truly sub-cubic time.
STOC 2007: 585-589 |
| 2006 |
|---|
| 5 | EE | Virginia Vassilevska,
Ryan Williams,
Raphael Yuster:
Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems.
ICALP (1) 2006: 262-273 |
| 4 | EE | Virginia Vassilevska,
Ryan Williams,
Shan Leung Maverick Woo:
Confronting hardness using a hybrid approach.
SODA 2006: 1-10 |
| 3 | EE | Virginia Vassilevska,
Ryan Williams:
Finding a maximum weight triangle in n3-Delta time, with applications.
STOC 2006: 225-231 |
| 2 | EE | Virginia Vassilevska,
Ryan Williams,
Raphael Yuster:
Finding heaviest H-subgraphs in real weighted graphs, with applications
CoRR abs/cs/0609009: (2006) |
| 2005 |
|---|
| 1 | EE | Virginia Vassilevska:
Explicit Inapproximability Bounds for the Shortest Superstring Problem.
MFCS 2005: 793-800 |
