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 × Italy
2 × USA
Collaborated with:
G.Kortsarz Y.Dinitz
Talks about:
algorithm (2) approxim (2) minimum (2) connect (2) graph (2) increment (1) subgraph (1) problem (1) mainten (1) augment (1)

Person: Zeev Nutov

DBLP DBLP: Nutov:Zeev

Contributed to:

ICALP (1) 20062006
STOC 20042004
STOC 19951995

Wrote 3 papers:

ICALP-v1-2006-KortsarzN #algorithm #approximate #problem
Tight Approximation Algorithm for Connectivity Augmentation Problems (GK, ZN), pp. 443–452.
STOC-2004-KortsarzN #algorithm #approximate #graph
Approximation algorithm for k-node connected subgraphs via critical graphs (GK, ZN), pp. 138–145.
STOC-1995-DinitzN #graph #incremental #maintenance
A 2-level cactus model for the system of minimum and minimum+1 edge-cuts in a graph and its incremental maintenance (YD, ZN), pp. 509–518.

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.