BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Iceland
1 × Italy
3 × USA
Collaborated with:
R.Williams R.Yuster G.E.Blelloch
Talks about:
weight (3) graph (3) find (3) subgraph (2) problem (2) time (2) combinatori (1) bottleneck (1) smallest (1) approach (1)

Person: Virginia Vassilevska

DBLP DBLP: Vassilevska:Virginia

Contributed to:

STOC 20092009
ICALP (1) 20082008
STOC 20072007
ICALP (1) 20062006
STOC 20062006

Wrote 5 papers:

Finding, minimizing, and counting weighted subgraphs (VV, RW), pp. 455–464.
ICALP-A-2008-BlellochVW #approach #combinator #graph #problem
A New Combinatorial Approach for Sparse Graph Problems (GEB, VV, RW), pp. 108–120.
STOC-2007-VassilevskaWY #graph
All-pairs bottleneck paths for general graphs in truly sub-cubic time (VV, RW, RY), pp. 585–589.
ICALP-v1-2006-VassilevskaWY #graph #problem
Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems (VV, RW, RY), pp. 262–273.
STOC-2006-VassilevskaW #3d
Finding a maximum weight triangle in n3-Delta time, with applications (VV, RW), pp. 225–231.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.