|
Search the dblp DataBase
Virginia Vassilevska:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Virginia Vassilevska, Ryan Williams, Raphael Yuster
Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems. [Citation Graph (0, 0)][DBLP] ICALP (1), 2006, pp:262-273 [Conf]
- Virginia Vassilevska
Explicit Inapproximability Bounds for the Shortest Superstring Problem. [Citation Graph (0, 0)][DBLP] MFCS, 2005, pp:793-800 [Conf]
- Virginia Vassilevska, Ryan Williams, Shan Leung Maverick Woo
Confronting hardness using a hybrid approach. [Citation Graph (0, 0)][DBLP] SODA, 2006, pp:1-10 [Conf]
- Virginia Vassilevska, Ryan Williams
Finding a maximum weight triangle in n3-Delta time, with applications. [Citation Graph (0, 0)][DBLP] STOC, 2006, pp:225-231 [Conf]
- Virginia Vassilevska, Ryan Williams, Raphael Yuster
All-pairs bottleneck paths for general graphs in truly sub-cubic time. [Citation Graph (0, 0)][DBLP] STOC, 2007, pp:585-589 [Conf]
- Virginia Vassilevska, Ryan Williams, Raphael Yuster
Finding heaviest H-subgraphs in real weighted graphs, with applications [Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal]
A New Combinatorial Approach for Sparse Graph Problems. [Citation Graph (, )][DBLP]
Nondecreasing paths in a weighted graph or: how to optimally read a train schedule. [Citation Graph (, )][DBLP]
Finding, minimizing, and counting weighted subgraphs. [Citation Graph (, )][DBLP]
Uniquely Represented Data Structures for Computational Geometry. [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs
|