Virginia Vassilevska's Publications

---

Under Submission:

• Fixing a tournament, V. Vassilevska.
  
  

Manuscripts:

• Ordered Subsets with Applications, Guy Blelloch, V. Vassilevska, 2007.
  
  
• Traceable Data Structures, Umut Acar, Guy Blelloch, Srinath Sridhar, V. Vassilevska, 2006.

Published Articles by Year:

2009:

All Pairs Bottleneck Paths and Max-Min Matrix Products in Truly Subcubic Time, V. Vassilevska, Ryan Williams and Raphael Yuster, Theory of Computing, 2009.

[ToC]
Finding, Minimizing and Counting Weighted Subgraphs, V. Vassilevska and Ryan Williams, STOC 2009.

[ACM] [ps] [pdf]

2008:

Efficient Algorithms for Clique Problems, V. Vassilevska,
Information Processing Letters, 2008.

[IPL] [ps] [pdf]
Finding Heaviest H-Subgraphs in Real Weighted Graphs, with Applications, V. Vassilevska, Ryan Williams, Raphael Yuster, ACM Transactions on Algorithms, 2008.

[ACM] [ps] [pdf]
A New Combinatorial Approach to Sparse Graph Problems, Guy Blelloch, V. Vassilevska, Ryan Williams, ICALP 2008.

[Springer] [ps] [pdf]
Uniquely Represented Data Structures for Computational Geometry, Guy Blelloch, Daniel Golovin, V. Vassilevska, SWAT 2008.

[Springer] [ps] [pdf]
Uniquely Represented Data Structures for Computational Geometry, Guy Blelloch, Daniel Golovin, V. Vassilevska, Carnegie Mellon University Technical Report CMU-CS-08-115.

[pdf]
Nondecreasing Paths in a Weighted Graph or: How to Optimally Read a Train Schedule,
V. Vassilevska, SODA 2008, invited to SODA Special Issue.

[ACM] [pdf]

2007:

All Pairs Bottleneck Paths in General Graphs in Truly Subcubic Time, V. Vassilevska, Ryan Williams, Raphael Yuster, STOC 2007.

[ACM] [ps] [pdf]


A Two Player Game to Combat WebSpam, Michelle Goodstein, V. Vassilevska, Carnegie Mellon University Technical Report CMU-CS-07-134.

[pdf]

2006:

Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems, V. Vassilevska, Ryan Williams, Raphael Yuster, ICALP 2006.

[Springer] [pdf]


Finding a Maximum Weight Triangle in Sub-Cubic Time, With Applications, V. Vassilevska, Ryan Williams, STOC 2006.

[ACM] [ps] [pdf]


Finding Heaviest H-Subgraphs in Real Weighted Graphs, with Applications, V. Vassilevska, Ryan Williams, Raphael Yuster, arXiv Technical Report: http://www.citebase.org/abstract?id=oai:arXiv.org:cs/0609009.


Confronting Hardness Using A Hybrid Approach, V. Vassilevska, Ryan Williams, Shan Leung Maverick Woo, SODA 2006. [ACM] [pdf]

2005:

Explicit Inapproximability Bounds for the Shortest Superstring Problem, V. Vassilevska, MFCS 2005. [Springer] [ps]


Confronting Hardness Using a Hybrid Approach, V. Vassilevska, Ryan Williams, Shan Leung Maverick Woo, Carnegie Mellon University Technical Report CMU-CS-05-125.

[pdf] [ps]
Finding Nonoverlapping Dense Blocks of a Sparse Matrix, Ali Pinar, V. Vassilevska, the special issue of ETNA on Combinatorial Scientific Computing, 2005. [ETNA]