Virginia Vassilevska

13 papers A* 5B 1Journal 4Unranked 3
YearRankTypeTitle / Venue / Authors
2010 J jnl
Finding heaviest
ACM Trans. Algorithms
Virginia Vassilevska, Ryan Williams, Raphael Yuster
2009 J jnl
All Pairs Bottleneck Paths and Max-Min Matrix Products in Truly Subcubic Time.
Theory Comput.
Virginia Vassilevska, Ryan Williams, Raphael Yuster
2009 J jnl
Efficient algorithms for clique problems.
Inf. Process. Lett.
Virginia Vassilevska
2009 A* conf
Finding, minimizing, and counting weighted subgraphs.
STOC
Virginia Vassilevska, Ryan Williams
2008 — conf
A New Combinatorial Approach for Sparse Graph Problems.
ICALP (1)
Guy E. Blelloch, Virginia Vassilevska, Ryan Williams
2008 A* conf
Nondecreasing paths in a weighted graph or: how to optimally read a train schedule.
SODA
Virginia Vassilevska
2008 — conf
Uniquely Represented Data Structures for Computational Geometry.
SWAT
Guy E. Blelloch, Daniel Golovin, Virginia Vassilevska
2007 A* conf
All-pairs bottleneck paths for general graphs in truly sub-cubic time.
STOC
Virginia Vassilevska, Ryan Williams, Raphael Yuster
2006 A* conf
Confronting hardness using a hybrid approach.
SODA
Virginia Vassilevska, Ryan Williams, Shan Leung Maverick Woo
2006 A* conf
Finding a maximum weight triangle in n
STOC
Virginia Vassilevska, Ryan Williams
2006 J jnl
Finding heaviest H-subgraphs in real weighted graphs, with applications
CoRR
Virginia Vassilevska, Ryan Williams, Raphael Yuster
2006 — conf
Finding the Smallest
ICALP (1)
Virginia Vassilevska, Ryan Williams, Raphael Yuster
2005 B conf
Explicit Inapproximability Bounds for the Shortest Superstring Problem.
MFCS
Virginia Vassilevska