Virginia Vassilevska Williams

Virginia Vassilevska

	2012
c18		Fabrizio Grandoni, Virginia Vassilevska Williams: Improved Distance Sensitivity Oracles via Fast Single-Source Replacement Paths. FOCS 2012: 748-757
c17		Liam Roditty, Virginia Vassilevska Williams: Subquadratic time approximation algorithms for the girth. SODA 2012: 833-845
c16		Virginia Vassilevska Williams: Multiplying matrices faster than coppersmith-winograd. STOC 2012: 887-898
i4		Liam Roditty, Virginia Vassilevska Williams: Approximating the diameter of a graph. CoRR abs/1207.3622 (2012)
	2011
c15		Liam Roditty, Virginia Vassilevska Williams: Minimum Weight Cycles and Triangles: Equivalences and Algorithms. FOCS 2011: 180-189
c14		Isabelle Stanton, Virginia Vassilevska Williams: Rigging Tournament Brackets for Weaker Players. IJCAI 2011: 357-364
c13		Virginia Vassilevska Williams: Faster Replacement Paths. SODA 2011: 1337-1346
c12		Isabelle Stanton, Virginia Vassilevska Williams: Manipulating Stochastically Generated Single-Elimination Tournaments for Nearly All Players. WINE 2011: 326-337
i3		Liam Roditty, Virginia Vassilevska Williams: Minimum Weight Cycles and Triangles: Equivalences and Algorithms. CoRR abs/1104.2882 (2011)
	2010
j4		Virginia Vassilevska, Ryan Williams, Raphael Yuster: Finding heaviest H-subgraphs in real weighted graphs, with applications. ACM Transactions on Algorithms 6(3) (2010)
j3		Virginia Vassilevska Williams: Nondecreasing paths in a weighted graph or: How to optimally read a train schedule. ACM Transactions on Algorithms 6(4) (2010)
c11		Virginia Vassilevska Williams: Fixing a Tournament. AAAI 2010
c10		Virginia Vassilevska Williams, Ryan Williams: Subcubic Equivalences between Path, Matrix and Triangle Problems. FOCS 2010: 645-654
i2		Virginia Vassilevska Williams: Faster Replacement Paths. CoRR abs/1007.2216 (2010)
	2009
j2		Virginia Vassilevska: Efficient algorithms for clique problems. Inf. Process. Lett. 109(4): 254-257 (2009)
j1		Virginia Vassilevska, Ryan Williams, Raphael Yuster: All Pairs Bottleneck Paths and Max-Min Matrix Products in Truly Subcubic Time. Theory of Computing 5(1): 173-189 (2009)
c9		Virginia Vassilevska, Ryan Williams: Finding, minimizing, and counting weighted subgraphs. STOC 2009: 455-464
	2008
c8		Guy E. Blelloch, Virginia Vassilevska, Ryan Williams: A New Combinatorial Approach for Sparse Graph Problems. ICALP (1) 2008: 108-120
c7		Virginia Vassilevska: Nondecreasing paths in a weighted graph or: how to optimally read a train schedule. SODA 2008: 465-472
c6		Guy E. Blelloch, Daniel Golovin, Virginia Vassilevska: Uniquely Represented Data Structures for Computational Geometry. SWAT 2008: 17-28
	2007
c5		Virginia Vassilevska, Ryan Williams, Raphael Yuster: All-pairs bottleneck paths for general graphs in truly sub-cubic time. STOC 2007: 585-589
	2006
c4		Virginia Vassilevska, Ryan Williams, Raphael Yuster: Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems. ICALP (1) 2006: 262-273
c3		Virginia Vassilevska, Ryan Williams, Shan Leung Maverick Woo: Confronting hardness using a hybrid approach. SODA 2006: 1-10
c2		Virginia Vassilevska, Ryan Williams: Finding a maximum weight triangle in n3-Delta time, with applications. STOC 2006: 225-231
i1		Virginia Vassilevska, Ryan Williams, Raphael Yuster: Finding heaviest H-subgraphs in real weighted graphs, with applications. CoRR abs/cs/0609009 (2006)
	2005
c1		Virginia Vassilevska: Explicit Inapproximability Bounds for the Shortest Superstring Problem. MFCS 2005: 793-800

Coauthor Index

Last update Tue May 21 13:23:33 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page